{"meta":{"query_hash":"f2d3e0a26263","filters":{"topic":"Error Correcting Code Techniques"},"cohort_total":812,"direct_labels_cover":0,"predictions_cover":812,"exported":812,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f2d3e0a26263","api":"https://metacan.xera.ac/api/v1/cohort?topic=Error+Correcting+Code+Techniques"},"results":[{"id":"W146728779","doi":"","title":"Low-Density Parity-Check Codes for the Gilbert-Elliott Channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Channel (broadcasting); Decoding methods; Algorithm; Mathematics; Degree (music); Channel code; Theoretical computer science; Computer science; Telecommunications; Physics","score_opus":0.02899227462934664,"score_gpt":0.273193556823993,"score_spread":0.24420128219464635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146728779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051102325,0.019056218,0.9029132,0.0013690015,0.00029224213,0.00009969509,0.00015541835,0.0002079642,0.024803923],"genre_scores_gemma":[0.72215396,0.040481817,0.22827366,0.00056465826,0.000697084,0.00019055072,0.00023923129,0.00008918064,0.0073099183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996983,0.000095994175,0.0000169317,0.000032864777,0.000119365206,0.000036607682],"domain_scores_gemma":[0.99807054,0.0014593642,0.00010934293,0.00012481248,0.0002089219,0.000027099115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064045674,0.00042536343,0.00042667822,0.00084092823,0.00047089017,0.0011036105,0.00044892306,0.000740633,0.0010179194],"category_scores_gemma":[0.0036481856,0.0002008555,0.00028026334,0.00074286666,0.0011045729,0.0012613438,0.0005307179,0.0010202981,0.0003836482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050599803,0.000016346088,0.0004798439,0.0004197016,0.00001648902,0.0003494308,0.0001727821,0.054912783,0.006222764,0.89348954,0.0012789883,0.042590685],"study_design_scores_gemma":[0.000021818021,0.00009974267,0.0005145757,0.00021162961,0.00005020502,0.0010970319,0.00008283995,0.37430382,0.013740297,0.5714772,0.038322702,0.000078127894],"about_ca_topic_score_codex":0.0009482074,"about_ca_topic_score_gemma":0.00092911714,"teacher_disagreement_score":0.0011036105,"about_ca_system_score_codex":0.00076668605,"about_ca_system_score_gemma":0.00063718186,"threshold_uncertainty_score":0.005562663},"labels":[],"label_agreement":null},{"id":"W1480136036","doi":"10.1109/iccs.2004.1359417","title":"Performance evaluation of DC-free error-control block codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Decoding methods; Computer science; Error detection and correction; List decoding; Algorithm; BCJR algorithm; Sequential decoding; Block (permutation group theory); Concatenated error correction code; Encoding (memory); Mathematics; Artificial intelligence","score_opus":0.030575626428077013,"score_gpt":0.2898417959622986,"score_spread":0.25926616953422155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480136036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83945155,0.0020709473,0.13801774,0.0003418368,0.00012815103,0.00018220693,0.00073645083,0.0019584945,0.017112633],"genre_scores_gemma":[0.983451,0.0003286076,0.012713485,0.000055748143,0.000019522762,0.000049081675,0.0005682708,0.000095551404,0.0027186882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711335,0.0007321077,0.00017143638,0.00024815009,0.0013388883,0.00039612508],"domain_scores_gemma":[0.98785144,0.0061230944,0.0007200972,0.0010263518,0.004009742,0.0002692402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019684304,0.0008702107,0.0006198029,0.001021801,0.0005721385,0.00079087034,0.0007935049,0.0008844003,0.002719239],"category_scores_gemma":[0.01020468,0.00018431105,0.00024038351,0.0010086889,0.00056012184,0.0011057304,0.00071023096,0.00040952198,0.0006035923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004392437,0.0002924691,0.004805213,0.00038843037,0.00020029684,0.00024361933,0.000132609,0.8347562,0.044678204,0.011993366,0.001904956,0.09621219],"study_design_scores_gemma":[0.00009321263,0.0009102736,0.0012716214,0.000024174,0.0000554316,0.00015256059,0.000030091083,0.92921,0.06534425,0.0013167032,0.0015426535,0.000048898906],"about_ca_topic_score_codex":0.0079642255,"about_ca_topic_score_gemma":0.0047773686,"teacher_disagreement_score":0.0079642255,"about_ca_system_score_codex":0.0015181669,"about_ca_system_score_gemma":0.0012459055,"threshold_uncertainty_score":0.015835762},"labels":[],"label_agreement":null},{"id":"W1488026446","doi":"10.1007/11814948_31","title":"Characterizing Propagation Methods for Boolean Satisfiability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Belief propagation; Satisfiability; Equivalence (formal languages); Local consistency; Convergence (economics); Theoretical computer science; Algorithm; Mathematical optimization; Maximization; Boolean satisfiability problem; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.026466820804997796,"score_gpt":0.3191663136039671,"score_spread":0.2926994927989693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488026446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010319746,0.0006499799,0.9806294,0.000535401,0.00008569236,0.00017221906,0.00021525208,0.00093290146,0.006459407],"genre_scores_gemma":[0.2026831,0.0016022589,0.7798618,0.00044770128,0.00041219342,0.00061326305,0.0014453533,0.0015235748,0.011410701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99082446,0.0022201615,0.0007743558,0.0011734151,0.004428879,0.0005787427],"domain_scores_gemma":[0.9511798,0.038238917,0.0017113978,0.0045879707,0.0038735578,0.00040832628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071695973,0.0014980629,0.0010139279,0.003730276,0.0013978187,0.00493911,0.004357338,0.0026636906,0.0067854705],"category_scores_gemma":[0.0428046,0.001788702,0.0024518732,0.004864746,0.0030690576,0.011793449,0.0034006273,0.005698148,0.0016911976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019151549,0.0002586849,0.0020616204,0.00088542607,0.00013027804,0.00012509458,0.00095122895,0.032716855,0.008745896,0.6330213,0.010284227,0.31062794],"study_design_scores_gemma":[0.000033412474,0.00004761877,0.0002574659,0.00013906977,0.00007111007,0.0002031489,0.00013156868,0.16513415,0.007453224,0.8193866,0.007100425,0.000042159576],"about_ca_topic_score_codex":0.0016571364,"about_ca_topic_score_gemma":0.002432206,"teacher_disagreement_score":0.0071695973,"about_ca_system_score_codex":0.0022315958,"about_ca_system_score_gemma":0.0024803423,"threshold_uncertainty_score":0.03791696},"labels":[],"label_agreement":null},{"id":"W1489359393","doi":"10.1109/cwit.2015.7255157","title":"Overlapped fountain coding for delay-constrained priority-based broadcast applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Yarmouk University","keywords":"Fountain; Fountain code; Computer science; Coding (social sciences); Computer network; Real-time computing; Telecommunications; Decoding methods; Mathematics; Geography; Block code","score_opus":0.0448337108526196,"score_gpt":0.3117894447893264,"score_spread":0.2669557339367068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489359393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07292114,0.0010606876,0.9221098,0.00022115365,0.00009112589,0.00006253256,0.00006617762,0.00044437122,0.0030229837],"genre_scores_gemma":[0.8369839,0.00049675576,0.15880927,0.00016203364,0.000063962114,0.00008819166,0.0001051103,0.000055881294,0.0032348558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954706,0.000101985424,0.000020897043,0.000057750887,0.00018000665,0.00009226823],"domain_scores_gemma":[0.9989221,0.00036163186,0.00013098588,0.00023930598,0.00027660799,0.00006940332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049367675,0.00040001346,0.0004167314,0.0006146986,0.00074596854,0.0005456013,0.0010595941,0.000525966,0.0009012609],"category_scores_gemma":[0.0022035534,0.0001484105,0.00022447009,0.0006245411,0.00057284813,0.001079324,0.0008157864,0.0007617627,0.0002293573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013824987,0.00019699664,0.0015958593,0.00037294833,0.00007296666,0.0008383459,0.00090131664,0.19016002,0.13879015,0.20815378,0.0044479226,0.45308715],"study_design_scores_gemma":[0.00005530697,0.0002538195,0.00041021607,0.00005863303,0.0000366949,0.00056611653,0.00010589383,0.9098531,0.04257956,0.035383962,0.010640257,0.00005645678],"about_ca_topic_score_codex":0.0029087937,"about_ca_topic_score_gemma":0.0031805993,"teacher_disagreement_score":0.0029087937,"about_ca_system_score_codex":0.00091635034,"about_ca_system_score_gemma":0.0011414803,"threshold_uncertainty_score":0.0066486},"labels":[],"label_agreement":null},{"id":"W1489752037","doi":"10.1109/ismict.2015.7107531","title":"The sensitivity of joint source-channel coding based on double protograph LDPC codes to source statistics","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Low-density parity-check code; Computer science; Entropy (arrow of time); Transmitter; Decoding methods; Algorithm; Forward error correction; Coding (social sciences); Wireless; Theoretical computer science; Entropy encoding; Source code; Channel (broadcasting); Electronic engineering; Statistics; Telecommunications; Mathematics; Engineering; Physics","score_opus":0.05632117803647734,"score_gpt":0.28541490062107117,"score_spread":0.22909372258459382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489752037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36455294,0.0014010574,0.6188368,0.00068561884,0.000103143626,0.00009368917,0.00035717848,0.00093515415,0.013034375],"genre_scores_gemma":[0.97735643,0.00056618545,0.02091793,0.00007401538,0.000017512873,0.0000401211,0.00013100579,0.000047996786,0.0008489005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981523,0.0006287128,0.000060244027,0.00025657497,0.00066889374,0.00023332317],"domain_scores_gemma":[0.97914416,0.016681464,0.0013578475,0.0011037032,0.0015496194,0.00016319915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018852727,0.00075677567,0.00067255023,0.0008318991,0.00048697085,0.0009185479,0.00066872657,0.0009015005,0.0009442964],"category_scores_gemma":[0.017244538,0.00038546105,0.00033252154,0.0010608005,0.0013255426,0.0014629631,0.0010777946,0.0011589669,0.00023249522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003232774,0.000032121334,0.0030230677,0.00018116536,0.00009163318,0.00020482125,0.00019424698,0.91222525,0.026621707,0.03603662,0.00051425607,0.02055189],"study_design_scores_gemma":[0.0000059658,0.000062929284,0.00074432394,0.000019875004,0.000021135756,0.00013701255,0.0000267829,0.97401947,0.017010633,0.0075550224,0.00036054273,0.000036358728],"about_ca_topic_score_codex":0.0040204306,"about_ca_topic_score_gemma":0.0029025204,"teacher_disagreement_score":0.0040204306,"about_ca_system_score_codex":0.0015124255,"about_ca_system_score_gemma":0.0012327073,"threshold_uncertainty_score":0.0109734535},"labels":[],"label_agreement":null},{"id":"W1499632699","doi":"10.1109/glocom.2004.1377995","title":"Improved progressive-edge-growth (PEG) construction of irregular LDPC codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Enhanced Data Rates for GSM Evolution; PEG ratio; Computer science; Algorithm; Construct (python library); Block (permutation group theory); Block code; Turbo code; Simple (philosophy); Error floor; Mathematics; Decoding methods; Telecommunications; Combinatorics; Computer network","score_opus":0.00879195537200569,"score_gpt":0.24762187670209732,"score_spread":0.23882992133009162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499632699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074892536,0.00024004334,0.91713023,0.00020115428,0.000066782784,0.00010592961,0.00021487878,0.00092190976,0.006226548],"genre_scores_gemma":[0.41184232,0.00037189948,0.582451,0.00011392584,0.000030680272,0.00015666327,0.00054921524,0.00014743801,0.004336843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999706,0.00006742013,0.000015465761,0.000043219963,0.00012629766,0.000041604046],"domain_scores_gemma":[0.99920756,0.0002526123,0.000072712384,0.00027701157,0.00014256884,0.00004762115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036572263,0.0004284665,0.00046612992,0.00056486874,0.00036817542,0.0003380237,0.0006680564,0.00052706053,0.0010482345],"category_scores_gemma":[0.0019866196,0.00019261261,0.00034156523,0.0006843924,0.0006105138,0.000693497,0.0013281248,0.001088264,0.0004376593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047632706,0.0001519512,0.0019270836,0.00027252678,0.000046576108,0.00058491,0.00032899712,0.3669403,0.094054215,0.18853876,0.0057783294,0.3409001],"study_design_scores_gemma":[0.00007695897,0.00013477665,0.00048665502,0.00002082444,0.000020222082,0.00042827564,0.000024441435,0.9001151,0.04678105,0.040511288,0.011357898,0.00004243084],"about_ca_topic_score_codex":0.0007883842,"about_ca_topic_score_gemma":0.00086488633,"teacher_disagreement_score":0.0010482345,"about_ca_system_score_codex":0.00029528662,"about_ca_system_score_gemma":0.000513378,"threshold_uncertainty_score":0.00350672},"labels":[],"label_agreement":null},{"id":"W1502974062","doi":"10.5281/zenodo.37225","title":"Effect Of Interleaving On A Gilbert Channel","year":2015,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Interleaving; Computer science; Burst error; Forward error correction; Error detection and correction; Channel (broadcasting); Markov model; Markov chain; Code (set theory); Algorithm; Electronic engineering; Telecommunications; Decoding methods; Engineering; Machine learning","score_opus":0.04094179787362521,"score_gpt":0.2771622710083368,"score_spread":0.2362204731347116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502974062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86965007,0.00056256953,0.107024536,0.0007172942,0.0003750671,0.00006618825,0.00019672822,0.0021250476,0.019282434],"genre_scores_gemma":[0.9936504,0.00012655581,0.0041492907,0.000037417067,0.00004258932,0.000012263595,0.000032883585,0.00010050687,0.0018480358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878913,0.0004543289,0.000035518216,0.00010018111,0.0002412918,0.0003795166],"domain_scores_gemma":[0.9859045,0.0112858545,0.00053955364,0.0010440327,0.000662159,0.0005638497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015262942,0.00096426695,0.0010539953,0.0013815113,0.0015109414,0.0016323857,0.0007079334,0.0010044293,0.0065564555],"category_scores_gemma":[0.0077682985,0.0005396391,0.00043349364,0.0010756791,0.0016720243,0.0016494894,0.0014513425,0.0013011819,0.00054270925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0115583185,0.0010442851,0.007636574,0.00043804606,0.00031196018,0.003904822,0.0010433112,0.4762888,0.16083899,0.26670647,0.0050658286,0.06516266],"study_design_scores_gemma":[0.00019139299,0.0005794408,0.0009896802,0.000057026515,0.00027868635,0.0006498468,0.00012648037,0.8252124,0.12540074,0.044268828,0.0021239559,0.00012139786],"about_ca_topic_score_codex":0.0015691387,"about_ca_topic_score_gemma":0.0015237312,"teacher_disagreement_score":0.0065564555,"about_ca_system_score_codex":0.0007438737,"about_ca_system_score_gemma":0.0010533625,"threshold_uncertainty_score":0.021933496},"labels":[],"label_agreement":null},{"id":"W1506510405","doi":"10.1109/iscas.2004.1328395","title":"A 0.8V CMOS analog decoder for an (8,4,4) extended Hamming code","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Subthreshold conduction; Hamming code; CMOS; Computer science; Electronic engineering; Error detection and correction; Hamming distance; Voltage; Transistor; Algorithm; Electrical engineering; Block code; Engineering","score_opus":0.04199628590092824,"score_gpt":0.32769319958394955,"score_spread":0.2856969136830213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506510405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32110256,0.0013690448,0.642619,0.00092678826,0.0004376621,0.00026611818,0.00067334063,0.004276273,0.028329134],"genre_scores_gemma":[0.7533814,0.000439294,0.22030933,0.00030988664,0.00007077537,0.000071830844,0.00031470993,0.00010993898,0.024992831],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998754,0.000013602147,0.000007559682,0.000020506237,0.00006753214,0.000015411135],"domain_scores_gemma":[0.99978954,0.000040719846,0.000031435444,0.000020915155,0.00010520325,0.000012138425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102084974,0.00019525852,0.00013676051,0.00024685412,0.00027388483,0.00044238142,0.0004757967,0.0003018179,0.0036558793],"category_scores_gemma":[0.0005722847,0.000117189906,0.00011081304,0.00023854853,0.00018013499,0.0003400641,0.00024270585,0.00026625517,0.0009965997],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035723302,0.00006314196,0.0016687358,0.0002430073,0.000053916734,0.0005857595,0.00017989529,0.009221317,0.7003979,0.021369802,0.00511934,0.26073986],"study_design_scores_gemma":[0.000059429363,0.00078189414,0.0020662835,0.00007169588,0.000090193214,0.0021265645,0.00007042821,0.09305606,0.8112643,0.006299979,0.08405185,0.00006129644],"about_ca_topic_score_codex":0.0008222919,"about_ca_topic_score_gemma":0.002597678,"teacher_disagreement_score":0.0036558793,"about_ca_system_score_codex":0.0004141181,"about_ca_system_score_gemma":0.00045954064,"threshold_uncertainty_score":0.012230158},"labels":[],"label_agreement":null},{"id":"W1514479068","doi":"10.1109/ccece.2004.1349667","title":"Iterative decoding algorithm of lattices","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Sequence (biology); Computational complexity theory; Computer science; Mathematics; Serial concatenated convolutional codes; Theoretical computer science; Discrete mathematics; Concatenated error correction code; Error floor; Block code","score_opus":0.01949282010571371,"score_gpt":0.2854545085488495,"score_spread":0.26596168844313584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514479068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009426988,0.00019082069,0.98129094,0.00017895678,0.00006653862,0.000064757565,0.00014636676,0.0005497672,0.008084904],"genre_scores_gemma":[0.18797474,0.00046811864,0.79779994,0.00024494363,0.00009195483,0.00032501915,0.00059045886,0.00037253663,0.012132391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862385,0.00041689954,0.00008708696,0.00018029373,0.00052821694,0.0001636546],"domain_scores_gemma":[0.9980178,0.00075828395,0.000094579475,0.00037529113,0.0006709501,0.000083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091916654,0.00057833537,0.0008335487,0.0008037672,0.0008106383,0.0012824289,0.0010143355,0.0010008175,0.0034687747],"category_scores_gemma":[0.005247484,0.0003767126,0.0007989697,0.0009789934,0.0009294518,0.0011316484,0.0019250921,0.0015607034,0.0023176947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026230045,0.000054777538,0.0007495343,0.00020955606,0.00006916531,0.0003202156,0.0006135756,0.21479292,0.023966223,0.46895924,0.008751065,0.28125137],"study_design_scores_gemma":[0.000053003852,0.00006267719,0.00015164215,0.000043529817,0.000015816053,0.00031501002,0.000042980108,0.7932047,0.022300448,0.16984048,0.013929182,0.000040481333],"about_ca_topic_score_codex":0.0013351415,"about_ca_topic_score_gemma":0.0013034914,"teacher_disagreement_score":0.0034687747,"about_ca_system_score_codex":0.0009003412,"about_ca_system_score_gemma":0.0018440096,"threshold_uncertainty_score":0.0116042495},"labels":[],"label_agreement":null},{"id":"W1522016733","doi":"10.1002/0470018860.s00029","title":"<scp>B</scp>ayesian Belief Networks","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Cognitive Science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bayesian network; Joint probability distribution; Mathematics; Graphical model; Directed acyclic graph; Markov chain; Conditional probability distribution; Random graph; Graph; Node (physics); Combinatorics; Computer science; Discrete mathematics; Statistics","score_opus":0.007558138685215802,"score_gpt":0.2594830931896934,"score_spread":0.2519249545044776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522016733","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035445455,0.0047282786,0.767245,0.010059299,0.00093928765,0.00017325881,0.0031527886,0.0016288885,0.20852867],"genre_scores_gemma":[0.2850899,0.016072063,0.48195335,0.0025901846,0.0019714239,0.0009103874,0.0072726253,0.0008789243,0.20326117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.00028142205,0.00007282396,0.00020073235,0.00034750384,0.000048545553],"domain_scores_gemma":[0.99652976,0.0018397063,0.0002308051,0.00044046168,0.000815333,0.00014394612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013559046,0.0007074198,0.0006758638,0.002622239,0.0010629244,0.004709452,0.0013478076,0.0018731866,0.05226158],"category_scores_gemma":[0.008721437,0.00044529885,0.0006865832,0.0048400713,0.0014060945,0.0027847718,0.0013597886,0.0021590127,0.013977119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005920464,0.000038205126,0.00044157373,0.00026831988,0.00005147017,0.00020771819,0.00014650426,0.03427525,0.00044291912,0.65826344,0.104047015,0.20175844],"study_design_scores_gemma":[0.000023456301,0.000011249863,0.0003344157,0.00034515135,0.000035216613,0.00014444235,0.00005755951,0.15261608,0.0008501238,0.65956837,0.18597052,0.000043436266],"about_ca_topic_score_codex":0.019984016,"about_ca_topic_score_gemma":0.014306195,"teacher_disagreement_score":0.05226158,"about_ca_system_score_codex":0.0028505616,"about_ca_system_score_gemma":0.0014304625,"threshold_uncertainty_score":0.1748324},"labels":[],"label_agreement":null},{"id":"W1529684121","doi":"10.1109/pacrim.2003.1235828","title":"LDPC coded systems with D-BLAST structure","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Low-density parity-check code; Rayleigh fading; Computer science; Space–time code; Algorithm; Single antenna interference cancellation; Decoding methods; Convolutional code; Block code; Fading; Telecommunications; Channel (broadcasting)","score_opus":0.0074094593779592145,"score_gpt":0.21463204722450432,"score_spread":0.2072225878465451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529684121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16441579,0.0013198178,0.81250125,0.0007223338,0.00010386775,0.00021853045,0.00046828965,0.0012330415,0.019017074],"genre_scores_gemma":[0.8054976,0.00061488757,0.18724261,0.00028690987,0.000041682466,0.0002306903,0.00033488954,0.000029918714,0.0057208245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938416,0.0001886522,0.00003356599,0.000074554606,0.00023758796,0.00008140089],"domain_scores_gemma":[0.99814343,0.00071054586,0.0002716165,0.0004043556,0.00041882024,0.000051161493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457329,0.00046345632,0.00045099584,0.000477544,0.00045425424,0.000751639,0.00052696833,0.0011386313,0.0014163501],"category_scores_gemma":[0.00305253,0.00020422456,0.00016616247,0.0011303492,0.00079331093,0.0008239158,0.0007102377,0.00077499315,0.00069524074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007366011,0.00019085601,0.002814207,0.00033907834,0.0000989472,0.000775916,0.00038998132,0.64435947,0.05096228,0.17678727,0.003799685,0.11874567],"study_design_scores_gemma":[0.00009875211,0.00020043172,0.00043524004,0.000033394525,0.000022652523,0.0003170249,0.000029671352,0.9470436,0.018488145,0.028153438,0.0051395274,0.000038060964],"about_ca_topic_score_codex":0.0038066092,"about_ca_topic_score_gemma":0.0035564292,"teacher_disagreement_score":0.0038066092,"about_ca_system_score_codex":0.0008683056,"about_ca_system_score_gemma":0.0010169036,"threshold_uncertainty_score":0.0075689554},"labels":[],"label_agreement":null},{"id":"W153733639","doi":"10.1007/978-3-540-85958-1_52","title":"Probabilistically Estimating Backbones and Variable Bias: Experimental Overview","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Variable (mathematics); Econometrics; Computer science; Statistics; Mathematics; Mathematical analysis","score_opus":0.04623804926044622,"score_gpt":0.2855706726050892,"score_spread":0.239332623344643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153733639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1332265,0.00344206,0.84710425,0.0006860519,0.00027969462,0.00029365928,0.0015560576,0.0036240718,0.009787798],"genre_scores_gemma":[0.41380876,0.002093652,0.57024103,0.00037928481,0.0001596184,0.00030158652,0.0041492954,0.0027486584,0.006117973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964792,0.0012022542,0.00013497347,0.0011005509,0.00090496347,0.00017814443],"domain_scores_gemma":[0.9774154,0.014927415,0.0011207092,0.0041234964,0.0020959494,0.00031707538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057800435,0.0015125804,0.0012486933,0.0011678427,0.001370189,0.002087271,0.0029690585,0.0028851703,0.010497667],"category_scores_gemma":[0.034566335,0.0011546798,0.00076883484,0.0024276713,0.0017328878,0.0048224847,0.0022529552,0.0032267512,0.0033529084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053444346,0.0017436657,0.010850613,0.0022363109,0.00088156684,0.0001866794,0.00066375814,0.16692697,0.19162637,0.07664392,0.015121513,0.5277742],"study_design_scores_gemma":[0.0004841417,0.00148751,0.004847215,0.0002616918,0.0004809301,0.0008156077,0.00025198897,0.6492762,0.21694604,0.110942535,0.013955679,0.00025044454],"about_ca_topic_score_codex":0.0033968494,"about_ca_topic_score_gemma":0.002991492,"teacher_disagreement_score":0.010497667,"about_ca_system_score_codex":0.0011346592,"about_ca_system_score_gemma":0.0012056952,"threshold_uncertainty_score":0.035118163},"labels":[],"label_agreement":null},{"id":"W1574567957","doi":"10.1049/el.2014.4432","title":"237 Gbit/s unrolled hardware polar decoder","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Polar code; Polar; Soft-decision decoder; Throughput; Code (set theory)","score_opus":0.017339873929500836,"score_gpt":0.24859702263385802,"score_spread":0.23125714870435718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574567957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3352131,0.0006171695,0.62689495,0.00037962277,0.00024836036,0.00011876128,0.00072544196,0.0072261584,0.028576536],"genre_scores_gemma":[0.70435256,0.00030776075,0.2721552,0.00015495732,0.000054546872,0.000053442687,0.000844112,0.00013573395,0.021941654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991417,0.000005405695,0.0000036390268,0.000017119306,0.00004555893,0.0000140248085],"domain_scores_gemma":[0.99988437,0.000025391017,0.0000129557675,0.000023097717,0.000043418182,0.000010703641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008211047,0.00023309363,0.0001895536,0.00020290201,0.00021979678,0.0004068844,0.00048811507,0.00021424534,0.0053887344],"category_scores_gemma":[0.00020076399,0.00013722922,0.0001028735,0.00015995052,0.00023218109,0.0004015599,0.00027439345,0.00041586746,0.0012312862],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038019227,0.00006349026,0.00066203397,0.00013715177,0.000018111657,0.0002652706,0.00010234975,0.01453296,0.80448884,0.014358512,0.0034145052,0.1615766],"study_design_scores_gemma":[0.00009036395,0.00046403168,0.001263806,0.000026646272,0.000029888548,0.00057979353,0.000037009366,0.19348878,0.76132345,0.0035053939,0.03914101,0.000049932794],"about_ca_topic_score_codex":0.0014333936,"about_ca_topic_score_gemma":0.003169564,"teacher_disagreement_score":0.0053887344,"about_ca_system_score_codex":0.00039248398,"about_ca_system_score_gemma":0.0009567919,"threshold_uncertainty_score":0.018027127},"labels":[],"label_agreement":null},{"id":"W1576747764","doi":"10.1109/glocom.2002.1188418","title":"On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Quantization (signal processing); Computer science; Parity-check matrix; List decoding; Berlekamp–Welch algorithm; Mathematics; Block code; Error floor; Concatenated error correction code","score_opus":0.023138791956923244,"score_gpt":0.32398580610727606,"score_spread":0.3008470141503528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576747764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01479785,0.0005163755,0.9801419,0.000109023764,0.00006344398,0.00005686263,0.000033682474,0.00082170375,0.0034591935],"genre_scores_gemma":[0.17391089,0.00089052226,0.8205638,0.00017461154,0.0000902157,0.00013730393,0.0002783417,0.00017373751,0.0037806202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855894,0.0004952943,0.000085466825,0.00012798268,0.0006380913,0.000094323346],"domain_scores_gemma":[0.99819416,0.00091309036,0.00010828309,0.0002666236,0.00047780888,0.000040107374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014100207,0.000972853,0.0007126949,0.0007108766,0.0007895826,0.0012680383,0.0012543101,0.000705498,0.0026842311],"category_scores_gemma":[0.0038999207,0.00035821204,0.0003955284,0.001071026,0.00060265703,0.0015356255,0.00095015997,0.0012306694,0.0014370093],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086327584,0.00016157141,0.001887572,0.00046538067,0.00016288228,0.00022786393,0.0003180453,0.13203469,0.08169813,0.08092644,0.0040353104,0.6972189],"study_design_scores_gemma":[0.000068471774,0.00041169708,0.00041425152,0.000057984245,0.00005807678,0.0005532086,0.00005790942,0.83129936,0.1340559,0.022280179,0.010692214,0.000050724306],"about_ca_topic_score_codex":0.0010437602,"about_ca_topic_score_gemma":0.0014571984,"teacher_disagreement_score":0.0026842311,"about_ca_system_score_codex":0.0005879794,"about_ca_system_score_gemma":0.001002035,"threshold_uncertainty_score":0.008979678},"labels":[],"label_agreement":null},{"id":"W1579162379","doi":"10.1109/isssta.2004.1371751","title":"Analog decoding: state of the art","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; CMOS; Computer science; Micropower; Electronic engineering; Analogue electronics; BiCMOS; Throughput; Analog device; Transistor; Analog signal; Computer hardware; Power (physics); Electrical engineering; Electronic circuit; Engineering; Digital signal processing; Telecommunications; Voltage","score_opus":0.013335062338229663,"score_gpt":0.2502448376774957,"score_spread":0.23690977533926605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579162379","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066749887,0.50340366,0.3149068,0.003923556,0.00231199,0.00017201113,0.0003621769,0.0026593741,0.16558543],"genre_scores_gemma":[0.1776052,0.5330498,0.17456281,0.0052422513,0.0062097143,0.0002741339,0.0014119395,0.00073506124,0.10090907],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988859,0.00016285559,0.00007111886,0.00018766549,0.0006060816,0.00008640498],"domain_scores_gemma":[0.99756074,0.0010868626,0.000107953805,0.00030112747,0.00081738236,0.00012595156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013135086,0.0010211947,0.00078992697,0.0018512558,0.0006413538,0.0040058144,0.0020159562,0.0024997888,0.02109828],"category_scores_gemma":[0.003553196,0.00062894734,0.00045667862,0.0025205836,0.0016009667,0.0043740766,0.0018010092,0.0021571745,0.011337198],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019407627,0.00007173246,0.00039707872,0.0011930519,0.000036044003,0.000093355615,0.00008319532,0.003561788,0.0049817706,0.03715207,0.0140295485,0.9382063],"study_design_scores_gemma":[0.000044341094,0.00032891837,0.0004592394,0.0013638613,0.00011061097,0.0014856629,0.00011940307,0.033571947,0.028964637,0.057548765,0.87587905,0.00012357527],"about_ca_topic_score_codex":0.0012275068,"about_ca_topic_score_gemma":0.000817255,"teacher_disagreement_score":0.02109828,"about_ca_system_score_codex":0.00086313277,"about_ca_system_score_gemma":0.0011836513,"threshold_uncertainty_score":0.07058078},"labels":[],"label_agreement":null},{"id":"W1587943761","doi":"10.48550/arxiv.1304.1790","title":"Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Alphabet; Channel (broadcasting); Polar; Binary number; Prime (order theory); Code (set theory); Algorithm; Computer science; Polar code; Mathematics; Arithmetic; Combinatorics; Telecommunications; Set (abstract data type); Decoding methods; Physics; Programming language","score_opus":0.05864664668401657,"score_gpt":0.20790171129748344,"score_spread":0.14925506461346688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587943761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037940864,0.0001184889,0.9559164,0.00014591795,0.000074863325,0.000052759802,0.0001461186,0.0010744247,0.00453021],"genre_scores_gemma":[0.37289906,0.00025370356,0.62149626,0.00012439286,0.0000677531,0.00017224756,0.0004421195,0.00027016702,0.0042742435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887997,0.00028072685,0.000055011446,0.00014272367,0.00046843104,0.00017310608],"domain_scores_gemma":[0.9975048,0.0010425778,0.000115349845,0.0009194462,0.0003167872,0.00010104339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008062099,0.00059519283,0.0006877886,0.00068405434,0.00047438242,0.0010319336,0.00093915703,0.00066680304,0.0036910607],"category_scores_gemma":[0.0051437626,0.00031933663,0.00048614043,0.0008912108,0.0008760744,0.0013113293,0.0028438156,0.0017968144,0.0014108724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016258013,0.00020384243,0.0025893238,0.00037654449,0.000046659323,0.0006901203,0.0005080959,0.23984405,0.0729255,0.2938328,0.007187348,0.38016996],"study_design_scores_gemma":[0.000066373614,0.00017520522,0.00047103013,0.00005450776,0.000027837317,0.0005707907,0.00008585961,0.8066104,0.0519224,0.13059945,0.009369801,0.000046321584],"about_ca_topic_score_codex":0.00066218857,"about_ca_topic_score_gemma":0.000695297,"teacher_disagreement_score":0.0036910607,"about_ca_system_score_codex":0.00079826766,"about_ca_system_score_gemma":0.00079855946,"threshold_uncertainty_score":0.012347758},"labels":[],"label_agreement":null},{"id":"W1594723388","doi":"10.1109/cwit.2015.7255170","title":"A new reliability-based incremental redundancy hybrid ARQ scheme using LDPC codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Retransmission; Computer science; Low-density parity-check code; Puncturing; Code word; Automatic repeat request; Decoding methods; Algorithm; Redundancy (engineering); Error detection and correction; Computer network; Network packet; Telecommunications","score_opus":0.05729146488939926,"score_gpt":0.30730618329638054,"score_spread":0.2500147184069813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594723388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048703823,0.0011472659,0.9443028,0.00027763675,0.00019055363,0.00013588196,0.00013245644,0.0016066439,0.003502933],"genre_scores_gemma":[0.60616654,0.0005448504,0.3865866,0.0003134102,0.00021004556,0.00016809975,0.00023330729,0.000074576106,0.005702436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991743,0.00019825254,0.00004956234,0.0001427551,0.0003443321,0.000090801266],"domain_scores_gemma":[0.99861383,0.00032088632,0.00015062101,0.0004079244,0.00041205646,0.000094771436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680951,0.0006002111,0.00084750314,0.0007463636,0.000753417,0.00078549376,0.0021305375,0.00069531956,0.0012238311],"category_scores_gemma":[0.0015646121,0.00025563323,0.0003622254,0.0007246341,0.0006635721,0.0012877402,0.0015040239,0.0009962554,0.0006005418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007425237,0.00025438168,0.0014667694,0.00049131137,0.00022551374,0.0010500557,0.0005800402,0.12230562,0.29419518,0.06526912,0.0075005577,0.505919],"study_design_scores_gemma":[0.00015830506,0.0007115102,0.0006571388,0.00003639402,0.00014106138,0.0013824011,0.00006278316,0.9212305,0.047799412,0.011577429,0.01607216,0.00017092505],"about_ca_topic_score_codex":0.0008275215,"about_ca_topic_score_gemma":0.0010912493,"teacher_disagreement_score":0.0021305375,"about_ca_system_score_codex":0.0004794236,"about_ca_system_score_gemma":0.0006827309,"threshold_uncertainty_score":0.004590988},"labels":[],"label_agreement":null},{"id":"W1595640491","doi":"10.1007/978-1-4613-0165-3_5","title":"On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles","year":2001,"lang":"en","type":"book-chapter","venue":"˜The œIMA volumes in mathematics and its applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary Golay code; Mathematics; Code word; Decoding methods; Minimum weight; Additive white Gaussian noise; Hamming code; List decoding; Combinatorics; Tree (set theory); Discrete mathematics; Algorithm; Concatenated error correction code; Block code; Statistics","score_opus":0.016055324373531844,"score_gpt":0.2547285427574361,"score_spread":0.23867321838390426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595640491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3641227,0.005451873,0.44816795,0.0018648774,0.0014573712,0.00020023141,0.0006605523,0.00053904584,0.17753533],"genre_scores_gemma":[0.84533197,0.0052575115,0.08610441,0.0008479503,0.0015662215,0.0005163587,0.0008698061,0.00115922,0.058346592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869746,0.0003031101,0.00007846748,0.00018318016,0.0005509526,0.00018681979],"domain_scores_gemma":[0.9955629,0.0026438532,0.00034238843,0.0004082733,0.0007439263,0.00029867096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173945,0.0017163255,0.0011294025,0.005214451,0.00172245,0.0035958074,0.0017725191,0.0017216164,0.0062105437],"category_scores_gemma":[0.008209196,0.0009311785,0.00078364334,0.003105825,0.0029993155,0.0062757405,0.0021145027,0.0027419443,0.0011160233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002301947,0.000013000755,0.00012102035,0.000051715924,0.000007369571,0.000034967023,0.0001566387,0.002169104,0.0011772191,0.98393375,0.0012170548,0.011095104],"study_design_scores_gemma":[0.000007192245,0.0000129301,0.0001278667,0.000040603903,0.000008726744,0.00007932046,0.00004653405,0.00954962,0.0011398518,0.9855451,0.0034237776,0.000018483644],"about_ca_topic_score_codex":0.0009277725,"about_ca_topic_score_gemma":0.0014421304,"teacher_disagreement_score":0.0062105437,"about_ca_system_score_codex":0.0016908676,"about_ca_system_score_gemma":0.0007710011,"threshold_uncertainty_score":0.020776331},"labels":[],"label_agreement":null},{"id":"W1634867344","doi":"10.1109/isit.2015.7282693","title":"Scaling Rules for the Energy of Decoder Circuits","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Electronic circuit; Decoding methods; Energy (signal processing); Block (permutation group theory); Computer science; Scaling; Very-large-scale integration; Upper and lower bounds; Function (biology); Topology (electrical circuits); Algorithm; Discrete mathematics; Mathematics; Combinatorics; Physics; Geometry; Statistics","score_opus":0.06340925754363652,"score_gpt":0.29607698954620826,"score_spread":0.23266773200257174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634867344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050547507,0.005430175,0.8647013,0.0020185094,0.00050736655,0.00017647473,0.00050543237,0.0016103206,0.07450292],"genre_scores_gemma":[0.7252277,0.0076951412,0.23464562,0.0015752885,0.0008287024,0.0010695893,0.001054972,0.0017156774,0.02618728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697816,0.00039397186,0.00019928903,0.0006760178,0.0013925898,0.00035995088],"domain_scores_gemma":[0.9904084,0.0063377055,0.00037717776,0.0018128572,0.00090411276,0.00015967824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018408631,0.0018115599,0.00093611196,0.0021004784,0.00094742497,0.0028070668,0.0020225488,0.0018221992,0.0106339725],"category_scores_gemma":[0.018487258,0.0008613803,0.0012124844,0.0016059154,0.0017689352,0.006230302,0.002271829,0.0042153355,0.0024541435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023361482,0.0001573505,0.0011005634,0.0004418255,0.00006007626,0.00036401016,0.0001757519,0.20379189,0.0286434,0.6445028,0.007827323,0.1127014],"study_design_scores_gemma":[0.000027825952,0.000113857604,0.00062209123,0.00013489756,0.000039986156,0.00042747878,0.000049770737,0.66754824,0.01692786,0.30215275,0.011896082,0.00005916805],"about_ca_topic_score_codex":0.000991258,"about_ca_topic_score_gemma":0.0013456143,"teacher_disagreement_score":0.0106339725,"about_ca_system_score_codex":0.0025701786,"about_ca_system_score_gemma":0.0008772923,"threshold_uncertainty_score":0.035574198},"labels":[],"label_agreement":null},{"id":"W1655740804","doi":"10.1109/iscas.2006.1693711","title":"Parallel encoders for low-density parity-check convolutional codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Convolutional code; Computer science; Turbo code; Parity bit; Serial concatenated convolutional codes; Low-density parity-check code; Parallel computing; ENCODE; Throughput; Code rate; Algorithm; Linear code; Block code; Decoding methods; Telecommunications","score_opus":0.01652755211804572,"score_gpt":0.25695635663776056,"score_spread":0.24042880451971485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655740804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102545865,0.00090726133,0.88271433,0.0003876985,0.00019421351,0.00018668729,0.00027853728,0.0019711219,0.0108143175],"genre_scores_gemma":[0.61291105,0.00070569536,0.37638804,0.00018244472,0.000103237,0.00021128221,0.00042353192,0.00011166627,0.008963016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995919,0.000055913417,0.00002722184,0.000058613863,0.00022044846,0.00004602669],"domain_scores_gemma":[0.99875176,0.00044409643,0.00015804255,0.00028122106,0.00032317577,0.000041807874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522542,0.00039312954,0.00037990263,0.00053403835,0.0004582845,0.0005908008,0.00070572767,0.00041435144,0.0025193095],"category_scores_gemma":[0.0024170259,0.00032280682,0.00030009175,0.00064432237,0.00041423278,0.0011248501,0.0005904785,0.0007298044,0.0007664721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080582756,0.00036523672,0.0032862152,0.0004545236,0.00012325909,0.00069909065,0.00017615686,0.19952519,0.16258875,0.1513565,0.007442527,0.4731767],"study_design_scores_gemma":[0.0001537911,0.00027958245,0.0013822237,0.000054508157,0.00011192971,0.0006742581,0.000034929693,0.7700943,0.15548013,0.054131858,0.01754875,0.00005380319],"about_ca_topic_score_codex":0.0013698407,"about_ca_topic_score_gemma":0.003063555,"teacher_disagreement_score":0.0025193095,"about_ca_system_score_codex":0.0007571309,"about_ca_system_score_gemma":0.0008954459,"threshold_uncertainty_score":0.008427918},"labels":[],"label_agreement":null},{"id":"W1678216932","doi":"10.1109/isit.1993.748423","title":"Bidirectional Decoding of Convolutional Codes Over Rayleigh Fading Channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Rayleigh fading; Viterbi decoder; Algorithm; Sequential decoding; Computer science; Viterbi algorithm; Binary symmetric channel; Fading; Iterative Viterbi decoding; Serial concatenated convolutional codes; Concatenated error correction code; Theoretical computer science; Block code; Low-density parity-check code","score_opus":0.024334931696665358,"score_gpt":0.2812361492869715,"score_spread":0.25690121759030615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678216932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5311455,0.00037810486,0.46004096,0.00015468117,0.000026102623,0.00003249314,0.00013085273,0.0006622439,0.007429081],"genre_scores_gemma":[0.95719093,0.00014382364,0.041367043,0.000017661894,0.0000030591682,0.00001718905,0.000055987763,0.000022374172,0.0011819631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997075,0.000103255355,0.0000130413455,0.00002400611,0.00009532726,0.000056827586],"domain_scores_gemma":[0.998926,0.0005832473,0.000108650784,0.00010359109,0.00025669133,0.000021782775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046036075,0.00029151898,0.00029060157,0.00017004937,0.00023708738,0.0003194718,0.00024449002,0.00034911427,0.0008248503],"category_scores_gemma":[0.0027213062,0.00012334516,0.0001134063,0.0002889889,0.00037834293,0.0004641666,0.00029785594,0.0002524263,0.00027055733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000268929,0.000027867696,0.0022742013,0.0000725993,0.000022494934,0.00012375636,0.00008358025,0.8952499,0.024847189,0.029382747,0.0005118544,0.04713481],"study_design_scores_gemma":[0.000010591991,0.000041710475,0.00017438154,0.0000044971894,0.0000038721605,0.000030872303,0.000009249598,0.982235,0.013474956,0.0036144964,0.0003957325,0.0000045814077],"about_ca_topic_score_codex":0.0040095923,"about_ca_topic_score_gemma":0.0055368347,"teacher_disagreement_score":0.0040095923,"about_ca_system_score_codex":0.00054678984,"about_ca_system_score_gemma":0.0007885792,"threshold_uncertainty_score":0.0079725385},"labels":[],"label_agreement":null},{"id":"W1813544306","doi":"10.1109/icc.2001.936269","title":"A heuristic search for good low-density parity-check codes at short block lengths","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Tanner graph; Heuristic; Computer science; Block code; Algorithm; Degree distribution; Block size; Block (permutation group theory); Degree (music); Mathematics; Theoretical computer science; Decoding methods; Combinatorics; Error floor","score_opus":0.042625601893530596,"score_gpt":0.28620790652609873,"score_spread":0.24358230463256814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813544306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47379512,0.00060489355,0.5194435,0.0003557085,0.000053266307,0.00015712662,0.00023024842,0.00078928407,0.004570845],"genre_scores_gemma":[0.695947,0.00021947558,0.30150804,0.00014683932,0.00002766124,0.00023921886,0.0005027254,0.00010349937,0.0013056505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975353,0.000082982355,0.0000121840185,0.00005390534,0.0000609018,0.00003655685],"domain_scores_gemma":[0.9986766,0.00080962526,0.00013244616,0.00014789605,0.00015097983,0.000082413004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048904045,0.000443859,0.000632434,0.0010179078,0.0005484505,0.00042782124,0.0005831459,0.00064023735,0.0012124088],"category_scores_gemma":[0.0031716137,0.00033614217,0.00033478122,0.0006828441,0.0005959498,0.0005772345,0.000503654,0.0004171072,0.00034296126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008135086,0.00028788648,0.009341419,0.0004288179,0.0001480923,0.0006036164,0.0004104644,0.685012,0.075732775,0.035558257,0.0049880724,0.18667512],"study_design_scores_gemma":[0.00020771088,0.00041464064,0.0011105225,0.000035742465,0.00007070162,0.0003253234,0.00014716467,0.94864017,0.016390484,0.030254701,0.0023699654,0.00003275771],"about_ca_topic_score_codex":0.00067658693,"about_ca_topic_score_gemma":0.0020774207,"teacher_disagreement_score":0.0012124088,"about_ca_system_score_codex":0.00035695347,"about_ca_system_score_gemma":0.0009549205,"threshold_uncertainty_score":0.0040559173},"labels":[],"label_agreement":null},{"id":"W183355784","doi":"10.1007/978-3-319-10569-7_3","title":"Implementation of Polar Decoders","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Binary symmetric channel; Polar; Channel (broadcasting); Binary number; Channel capacity; Mathematics; Probability of error; Decoding methods; Algorithm; Binary erasure channel; Discrete mathematics; Topology (electrical circuits); Combinatorics; Computer science; Arithmetic; Physics; Telecommunications; Channel code; Quantum mechanics","score_opus":0.019553878114127943,"score_gpt":0.2911236876165253,"score_spread":0.27156980950239734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183355784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006610693,0.0010414396,0.88054574,0.00034505606,0.00045438157,0.000108179505,0.0002671515,0.0021700994,0.108457185],"genre_scores_gemma":[0.19044137,0.0038681342,0.6915947,0.00059659965,0.00023856988,0.00026290357,0.0012320292,0.0008487282,0.110916965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955684,0.00009705485,0.000024632158,0.000053891705,0.00020636669,0.000061188446],"domain_scores_gemma":[0.9995523,0.00009599755,0.00001794027,0.0001089354,0.00020585135,0.000018857592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000397154,0.0008397684,0.00045413256,0.00072616286,0.00060773554,0.0021106547,0.0009834048,0.00082713994,0.018008426],"category_scores_gemma":[0.0012848777,0.00043877464,0.00035658255,0.0007211249,0.0005089685,0.0013706713,0.001140897,0.0011783896,0.012981612],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002553467,0.00007987701,0.0003091263,0.00040668042,0.000033244956,0.0002218989,0.00022753757,0.02012495,0.03782682,0.5258555,0.018811474,0.39584762],"study_design_scores_gemma":[0.00011004081,0.00021299302,0.000359579,0.00039684307,0.00007398056,0.0014048641,0.00022128664,0.17858605,0.2428025,0.22976895,0.34595388,0.00010900345],"about_ca_topic_score_codex":0.00047012256,"about_ca_topic_score_gemma":0.0008217284,"teacher_disagreement_score":0.018008426,"about_ca_system_score_codex":0.00055815,"about_ca_system_score_gemma":0.0009248891,"threshold_uncertainty_score":0.060244262},"labels":[],"label_agreement":null},{"id":"W1855425039","doi":"10.1109/wcl.2014.020314.130839","title":"A Generalized Water-Filling Algorithm with Linear Complexity and Finite Convergence Time","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Convergence (economics); Computational complexity theory; Mathematical optimization; Rate of convergence; Generalization; Time complexity; Mathematics; Power (physics); Computer science","score_opus":0.030960405567136935,"score_gpt":0.25858336912456137,"score_spread":0.22762296355742442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855425039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016730111,0.0000720691,0.99735767,0.000056527944,0.000021015028,0.000029680603,0.000014644156,0.000202904,0.0005724811],"genre_scores_gemma":[0.05256783,0.00014207982,0.94576657,0.00008087833,0.000027372647,0.00017223907,0.00007742395,0.000088921464,0.0010767052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993773,0.0001732757,0.000041165924,0.000118841264,0.0001980802,0.000091300295],"domain_scores_gemma":[0.999114,0.000530557,0.000062058636,0.00010931797,0.00014868379,0.000035478337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081222726,0.0011578392,0.0011911568,0.0007281129,0.0006011271,0.00093370525,0.0013179253,0.0012127536,0.0029133],"category_scores_gemma":[0.0033991847,0.00046741022,0.00078112935,0.0011915297,0.0010936565,0.0017277827,0.0016049012,0.0015026897,0.00069331337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001844178,0.000067015586,0.00024439546,0.00021556493,0.000047385947,0.00014516426,0.00018053032,0.6114306,0.0072837723,0.059595905,0.0053589293,0.3152464],"study_design_scores_gemma":[0.000034823734,0.00003518238,0.000025384963,0.000011368882,0.0000055189544,0.000058524085,0.000015531152,0.9800577,0.0017156297,0.016133856,0.0018931322,0.000013324046],"about_ca_topic_score_codex":0.0038740365,"about_ca_topic_score_gemma":0.0033435884,"teacher_disagreement_score":0.0038740365,"about_ca_system_score_codex":0.0006756703,"about_ca_system_score_gemma":0.0024572613,"threshold_uncertainty_score":0.0097459555},"labels":[],"label_agreement":null},{"id":"W1873287391","doi":"10.1109/vetecs.2006.1683307","title":"A Parallel Processing Approach for Fast Iterative Decoding of Orthogonal Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convolutional code; Decoding methods; Sequential decoding; Computer science; List decoding; Algorithm; Serial concatenated convolutional codes; Concatenated error correction code; Block code","score_opus":0.0253854921430207,"score_gpt":0.2773025791671927,"score_spread":0.251917087024172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873287391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030880799,0.00015739242,0.99445456,0.000060797433,0.000044618595,0.000045055556,0.000025381025,0.00043288432,0.0016912754],"genre_scores_gemma":[0.103799924,0.00043249418,0.89170605,0.00010228041,0.00009040722,0.00021825502,0.00015811615,0.0000925367,0.0033999134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993807,0.0001407656,0.000040236853,0.000083507584,0.00029102265,0.000063697014],"domain_scores_gemma":[0.9992906,0.00022568332,0.00004723299,0.00014485141,0.00026773682,0.000023733233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611823,0.0008053884,0.0005181375,0.00068918685,0.0006025517,0.00082003645,0.0010191508,0.00065734505,0.0021036963],"category_scores_gemma":[0.0014447495,0.00034223977,0.000547394,0.00083244825,0.00057883386,0.00092575443,0.0007117175,0.001098752,0.0009978642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036958518,0.00017480075,0.00059595396,0.0003174484,0.0001324565,0.0005272624,0.00021875634,0.17591041,0.110970825,0.13536267,0.006587613,0.5688323],"study_design_scores_gemma":[0.000057180852,0.00018803996,0.00019247038,0.000032860855,0.00004750642,0.0004619199,0.000018777197,0.88955796,0.062196974,0.03333273,0.013859063,0.000054535038],"about_ca_topic_score_codex":0.0011234344,"about_ca_topic_score_gemma":0.0017371535,"teacher_disagreement_score":0.0021036963,"about_ca_system_score_codex":0.0005831692,"about_ca_system_score_gemma":0.0011691577,"threshold_uncertainty_score":0.0070375204},"labels":[],"label_agreement":null},{"id":"W1899877335","doi":"","title":"Unrolled Polar Decoders, Part I: Hardware Architectures.","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar; Decoding methods; Computer science; Throughput; Field-programmable gate array; Computer hardware; Resource (disambiguation); Series (stratigraphy); Computer architecture; Parallel computing; Embedded system; Algorithm; Telecommunications; Computer network; Physics","score_opus":0.08685298321017411,"score_gpt":0.20816182288236412,"score_spread":0.12130883967219001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899877335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051687207,0.0036710897,0.9194226,0.00035148932,0.0004943278,0.00016808923,0.0003206955,0.0027130558,0.021171369],"genre_scores_gemma":[0.340833,0.0031749909,0.62434685,0.00047725393,0.000249523,0.0001328688,0.00096051046,0.0002836097,0.029541407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997955,0.00003231547,0.000013762645,0.000045229634,0.00009084689,0.000022460912],"domain_scores_gemma":[0.99960774,0.00011348824,0.00004670951,0.00010525648,0.00010542797,0.000021353215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018470407,0.00042933392,0.00024973086,0.00036389488,0.00024650557,0.00072321016,0.00053788227,0.00039142166,0.0054312483],"category_scores_gemma":[0.0007789035,0.0002451609,0.00018284857,0.0003589761,0.00042491866,0.0008909468,0.0004873289,0.0008093779,0.0016662445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057929003,0.00011618341,0.0006912133,0.00060355716,0.00006440479,0.00030922497,0.00024407414,0.029350609,0.34158638,0.067326844,0.008426462,0.55070174],"study_design_scores_gemma":[0.00011613153,0.00070191204,0.0011456361,0.00013997666,0.000063195395,0.0015071244,0.00009890784,0.24795863,0.55880386,0.029452745,0.1599143,0.00009750043],"about_ca_topic_score_codex":0.00059181836,"about_ca_topic_score_gemma":0.0016225822,"teacher_disagreement_score":0.0054312483,"about_ca_system_score_codex":0.00039707625,"about_ca_system_score_gemma":0.00062344887,"threshold_uncertainty_score":0.018169284},"labels":[],"label_agreement":null},{"id":"W1931709921","doi":"","title":"High-throughput LDPC decoding using the RHS algorithm","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Decoding methods; Throughput; Algorithm; Application-specific integrated circuit; Code word; CMOS; Clock rate; Bit error rate; Latency (audio); Soft-decision decoder; Parallel computing; Computer engineering; Computer hardware; Wireless; Electronic engineering; Chip; Telecommunications; Engineering","score_opus":0.021386243875287314,"score_gpt":0.26376285477623207,"score_spread":0.24237661090094476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931709921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03311774,0.0001741051,0.9494284,0.00019047337,0.000029565686,0.000072664516,0.0002604021,0.0042384793,0.012488167],"genre_scores_gemma":[0.4589582,0.00021714918,0.5306222,0.00009395312,0.00002976148,0.000127006,0.00056671846,0.00019102167,0.009194043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925846,0.00014452114,0.00003565212,0.00008115224,0.00041666228,0.00006356065],"domain_scores_gemma":[0.999286,0.0002471761,0.000048813083,0.00019613768,0.00020357879,0.000018339539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043781288,0.00041025365,0.00043566877,0.00058996154,0.00038234293,0.00068888406,0.0005449737,0.00049468974,0.0028937387],"category_scores_gemma":[0.001690771,0.00020792375,0.00022721465,0.0007622801,0.0004129847,0.00061318604,0.0005930094,0.00050222635,0.0016288984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036307,0.00012336962,0.0012479788,0.00021706647,0.00006760956,0.00036792964,0.00024407488,0.43659723,0.13049993,0.072358705,0.007459452,0.35045364],"study_design_scores_gemma":[0.000035899386,0.000032512507,0.00022408036,0.000013724424,0.0000072821367,0.00010166426,0.000008290882,0.9461379,0.042755812,0.0066127954,0.0040543666,0.000015708383],"about_ca_topic_score_codex":0.0038317388,"about_ca_topic_score_gemma":0.0049585337,"teacher_disagreement_score":0.0038317388,"about_ca_system_score_codex":0.0006670201,"about_ca_system_score_gemma":0.0013323601,"threshold_uncertainty_score":0.009680569},"labels":[],"label_agreement":null},{"id":"W1965505523","doi":"10.1109/cwit.2013.6621582","title":"Energy of decoding algorithms","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Decoding methods; Algorithm; Computer science; Code word; Energy (signal processing); Binary number; Sequential decoding; Block (permutation group theory); List decoding; Mathematics; Arithmetic; Block code; Concatenated error correction code; Statistics; Combinatorics","score_opus":0.016213509644407115,"score_gpt":0.2463406251035552,"score_spread":0.23012711545914807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965505523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03996483,0.001081485,0.9152782,0.00095413736,0.00025802042,0.000110269335,0.0002895148,0.00031666248,0.041746847],"genre_scores_gemma":[0.77717406,0.0026246675,0.16528027,0.0006990457,0.0003622063,0.00056744716,0.00058454764,0.00080383057,0.051903956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981097,0.0003761624,0.000103687635,0.0003098069,0.00081536506,0.0002853343],"domain_scores_gemma":[0.996139,0.0021866383,0.0001444067,0.00090912025,0.00052622287,0.00009468797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011164466,0.00082736183,0.00094539154,0.0012371087,0.0007793312,0.00254811,0.0020576662,0.0019085556,0.0123607],"category_scores_gemma":[0.010347071,0.0004540531,0.00066013215,0.0013222598,0.0018318928,0.0047586495,0.0016784238,0.0016877113,0.0023874764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012747374,0.000048429043,0.0004621831,0.000171688,0.000030930216,0.000103664584,0.00010657108,0.1151099,0.006032817,0.84070647,0.0021073043,0.034992628],"study_design_scores_gemma":[0.000021180202,0.00007167178,0.00038075185,0.00005570605,0.000018535253,0.0002505949,0.000051799307,0.44451854,0.0060849283,0.53952944,0.008987355,0.000029458311],"about_ca_topic_score_codex":0.0005048886,"about_ca_topic_score_gemma":0.00038419134,"teacher_disagreement_score":0.0123607,"about_ca_system_score_codex":0.0013477883,"about_ca_system_score_gemma":0.0008246684,"threshold_uncertainty_score":0.041350663},"labels":[],"label_agreement":null},{"id":"W1965825135","doi":"10.1155/2010/263210","title":"Design of Packet-Based Block Codes with Shift Operators","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"King Fahd University of Petroleum and Minerals","keywords":"Vandermonde matrix; Network packet; Computer science; Algorithm; Decoding methods; Computer network","score_opus":0.03397119707355155,"score_gpt":0.2781404145417422,"score_spread":0.24416921746819065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965825135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021794742,0.00024675854,0.9752304,0.00007117389,0.000046917663,0.00010434532,0.00006155776,0.00023505525,0.0022090897],"genre_scores_gemma":[0.42310667,0.00063884753,0.5720783,0.00012037867,0.00004258766,0.00039315003,0.0002022343,0.00007532422,0.0033426469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994797,0.00017228333,0.000031870914,0.00005696394,0.00020094495,0.00005820302],"domain_scores_gemma":[0.99920267,0.00022729783,0.00012158142,0.00007947101,0.00033088456,0.000038091497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080025,0.00051418506,0.00033197575,0.00048982323,0.00031102094,0.0004624541,0.0006340832,0.00047452532,0.0010137019],"category_scores_gemma":[0.0014934487,0.0002263599,0.00023498341,0.0004514397,0.0003288375,0.00043786084,0.00045352,0.00041607444,0.00046138544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006192212,0.000106618674,0.001608707,0.0004124592,0.000106180836,0.0003343203,0.0003111083,0.3857182,0.14597975,0.17862032,0.0026498784,0.28353322],"study_design_scores_gemma":[0.00009076484,0.00041276225,0.00028297267,0.00004688242,0.000043082815,0.00028264712,0.000029405326,0.91297024,0.055670206,0.017445402,0.012684054,0.000041640382],"about_ca_topic_score_codex":0.00094399916,"about_ca_topic_score_gemma":0.0010028612,"teacher_disagreement_score":0.0010137019,"about_ca_system_score_codex":0.00047220808,"about_ca_system_score_gemma":0.0012760796,"threshold_uncertainty_score":0.003426075},"labels":[],"label_agreement":null},{"id":"W1965940067","doi":"10.1109/asscc.2013.6691012","title":"750Mb/s 17pJ/b 90nm CMOS (120,75) TS-LDPC Min-Sum based analog decoder","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"CMOS; Throughput; Computer science; Chip; Dissipation; Low-density parity-check code; Turbo; Decoding methods; Electronic engineering; Algorithm; Physics; Engineering; Telecommunications; Wireless","score_opus":0.012648259398110526,"score_gpt":0.238072538423542,"score_spread":0.2254242790254315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965940067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6499242,0.0011611696,0.27475506,0.00095254957,0.00033462406,0.0004600888,0.0030920543,0.017966261,0.05135398],"genre_scores_gemma":[0.8648711,0.00040604535,0.10918563,0.00031393697,0.00005048694,0.00009645757,0.0009120856,0.00014058685,0.024023656],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984753,0.000014161146,0.000008307761,0.000022222146,0.00009068714,0.000017019813],"domain_scores_gemma":[0.9997954,0.00005572611,0.0000288942,0.000025579271,0.00007755169,0.00001687214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012325864,0.00025893474,0.00022983977,0.00026489343,0.00034053452,0.0004421369,0.0009474931,0.00034564958,0.007608141],"category_scores_gemma":[0.00038959086,0.00012073113,0.00011056857,0.0003383958,0.00016906945,0.0004268041,0.00016841477,0.00023550379,0.0015904648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005980955,0.0001791865,0.0024797022,0.00046842193,0.000111668574,0.0004908542,0.0002122894,0.014347407,0.842129,0.0062208874,0.009659596,0.12310282],"study_design_scores_gemma":[0.000068532536,0.0010556229,0.003505971,0.000045548793,0.00010032071,0.0009691916,0.00007645569,0.07779878,0.879842,0.0006725249,0.035819806,0.00004529772],"about_ca_topic_score_codex":0.0024707443,"about_ca_topic_score_gemma":0.0053722574,"teacher_disagreement_score":0.007608141,"about_ca_system_score_codex":0.0007184148,"about_ca_system_score_gemma":0.00071643107,"threshold_uncertainty_score":0.02545178},"labels":[],"label_agreement":null},{"id":"W1966874787","doi":"10.1109/tcomm.2010.05.080299","title":"On the design of LDPC code ensembles for BIAWGN channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Node (physics); Algorithm; Computer science; Code (set theory); Variable (mathematics); Upper and lower bounds; Channel (broadcasting); Mathematics; Decoding methods; Theoretical computer science; Engineering","score_opus":0.09466371076810175,"score_gpt":0.31983875124568273,"score_spread":0.22517504047758097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966874787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049412876,0.00016346606,0.9479495,0.00010238102,0.000016954482,0.000039570936,0.000039857456,0.00012417804,0.0021511032],"genre_scores_gemma":[0.62387276,0.00046773764,0.37357223,0.00009703489,0.000037552047,0.00018877108,0.000116920244,0.000069533206,0.001577513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933606,0.0003276193,0.000027786835,0.00007574914,0.00018613802,0.000046691333],"domain_scores_gemma":[0.9985196,0.0008748612,0.00016117522,0.00018014672,0.00021252237,0.000051780673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082051044,0.0005563725,0.0005186398,0.00042523837,0.0003599804,0.00033585101,0.0003058524,0.0004363633,0.00047677942],"category_scores_gemma":[0.0027920485,0.00024314452,0.00026403615,0.00040584122,0.00068851357,0.0005023587,0.0006808216,0.00055090035,0.00021630221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007678538,0.000028689288,0.0005261243,0.00006949509,0.000029336545,0.000058961996,0.00007244617,0.92104864,0.01690101,0.027889727,0.00038234692,0.032916408],"study_design_scores_gemma":[0.0000075628122,0.000046953224,0.00010613675,0.000007834049,0.000005781189,0.00003779449,0.0000059055833,0.98362136,0.0069878884,0.008480631,0.00068298855,0.000009145088],"about_ca_topic_score_codex":0.00048678403,"about_ca_topic_score_gemma":0.00083178544,"teacher_disagreement_score":0.00082051044,"about_ca_system_score_codex":0.00036009535,"about_ca_system_score_gemma":0.0005579226,"threshold_uncertainty_score":0.0043393373},"labels":[],"label_agreement":null},{"id":"W1966991522","doi":"10.1109/tit.2015.2393351","title":"Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Computer science; Property (philosophy); Low-density parity-check code; Variable (mathematics); Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Decoding methods; Physics","score_opus":0.016401537047910378,"score_gpt":0.24703862467599147,"score_spread":0.2306370876280811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966991522","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030737796,0.006352661,0.068782784,0.07734572,0.7715093,0.00039240706,0.0074000945,0.008946207,0.056197073],"genre_scores_gemma":[0.096239604,0.01648285,0.100599155,0.11913755,0.13773972,0.0013099941,0.019676477,0.010670323,0.49814427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937318,0.0011984285,0.0007524268,0.0007888336,0.0031073843,0.00042105324],"domain_scores_gemma":[0.9837801,0.0030733831,0.0010542794,0.0017658467,0.009869342,0.00045702438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029316593,0.0022394795,0.0019444366,0.00448327,0.0035573656,0.0028005661,0.004680534,0.0046100426,0.0521393],"category_scores_gemma":[0.029001595,0.0014104156,0.0026342322,0.00327767,0.0026225196,0.003786434,0.0026725065,0.009545387,0.02362019],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010065647,0.000029543206,0.000117837575,0.00019148609,0.000034121713,0.00023071896,0.000057077057,0.00041843238,0.0008675232,0.010528608,0.975921,0.011502969],"study_design_scores_gemma":[0.00006521549,0.000100286496,0.0019048812,0.00034491016,0.00007575771,0.0005490106,0.00010129017,0.0050007533,0.005757237,0.030923624,0.95495963,0.0002173999],"about_ca_topic_score_codex":0.013164371,"about_ca_topic_score_gemma":0.016024973,"teacher_disagreement_score":0.0521393,"about_ca_system_score_codex":0.0049100816,"about_ca_system_score_gemma":0.0031460375,"threshold_uncertainty_score":0.17442334},"labels":[],"label_agreement":null},{"id":"W1968974808","doi":"10.1109/jstsp.2014.2388191","title":"Streaming Codes With Partial Recovery Over Channels With Burst and Isolated Erasures","year":2015,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hewlett-Packard Development Company","keywords":"Erasure; Computer science; Erasure code; Online codes; Decoding methods; Fountain code; Encoder; Tornado code; Network packet; Algorithm; Luby transform code; Forward error correction; Binary erasure channel; Error detection and correction; Coding (social sciences); Concatenated error correction code; Channel (broadcasting); Burst error; Block code; Computer network; Channel capacity; Mathematics","score_opus":0.022684937308261547,"score_gpt":0.2639393366796964,"score_spread":0.24125439937143484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968974808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3196447,0.0005605652,0.6753489,0.00036605023,0.000051091884,0.0000669819,0.000097776385,0.00022574616,0.0036381832],"genre_scores_gemma":[0.9552125,0.0004944492,0.042746942,0.0000500881,0.000040788305,0.000052920128,0.000050483886,0.000024013198,0.0013277951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996012,0.00013756355,0.000013491666,0.00004221302,0.000117728996,0.00008789881],"domain_scores_gemma":[0.9974191,0.0016672963,0.00031445205,0.0002594958,0.000262589,0.000076997705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006822619,0.0005795736,0.00041391898,0.00040277847,0.0003557493,0.000476701,0.0005949439,0.0006430133,0.0007087046],"category_scores_gemma":[0.00393946,0.00021702607,0.00036282054,0.0005271238,0.0011560384,0.0013117277,0.0007593771,0.00091837475,0.00012745972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117795775,0.000046301288,0.0007127294,0.00010324285,0.000024377017,0.00021377223,0.00011500408,0.82357,0.011197736,0.14794663,0.00045572565,0.015496712],"study_design_scores_gemma":[0.000008079951,0.00004039972,0.00007102194,0.000008241891,0.0000047236263,0.000050104696,0.000014008743,0.98377854,0.0027713382,0.012943441,0.00030233574,0.000007656096],"about_ca_topic_score_codex":0.00189679,"about_ca_topic_score_gemma":0.0011848345,"teacher_disagreement_score":0.00189679,"about_ca_system_score_codex":0.0006398177,"about_ca_system_score_gemma":0.0009344839,"threshold_uncertainty_score":0.0046421885},"labels":[],"label_agreement":null},{"id":"W1969410400","doi":"10.1049/iet-com.2014.0236","title":"Structured quasi‐cyclic low‐density parity‐check codes based on cyclotomic cosets","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Coset; Mathematics; Parity (physics); Low-density parity-check code; Computer science; Discrete mathematics; Algorithm; Decoding methods; Physics; Particle physics","score_opus":0.05266364806103158,"score_gpt":0.32064494345586936,"score_spread":0.2679812953948378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969410400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40172595,0.0012553203,0.57189184,0.00029980077,0.00016805755,0.00016897166,0.00024711603,0.00034706428,0.023895899],"genre_scores_gemma":[0.9240228,0.00067571003,0.07152309,0.000101751495,0.00004557627,0.00009775795,0.00021892639,0.000032130156,0.0032821505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997125,0.000070087575,0.000011303333,0.000043129658,0.00012634414,0.000036574635],"domain_scores_gemma":[0.99958605,0.00016118742,0.00006625801,0.00009797119,0.00006731927,0.000021270092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017795271,0.00032579128,0.00022193359,0.00037451417,0.0002760713,0.00052808813,0.000332767,0.0003023285,0.0014210484],"category_scores_gemma":[0.00080663455,0.00015468238,0.00022088397,0.00050010154,0.0005979249,0.0005117569,0.00040361116,0.0004609538,0.0003598066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034660375,0.00012964444,0.0018855395,0.00043253243,0.000058471513,0.0005051382,0.0002623778,0.29232872,0.15133058,0.45939356,0.0021821938,0.09114468],"study_design_scores_gemma":[0.00006857943,0.00055047055,0.0013887441,0.000078689416,0.00003339013,0.00080386683,0.0000829876,0.82518524,0.09719856,0.060381122,0.014165217,0.00006307653],"about_ca_topic_score_codex":0.000878591,"about_ca_topic_score_gemma":0.0010986797,"teacher_disagreement_score":0.0014210484,"about_ca_system_score_codex":0.00042784325,"about_ca_system_score_gemma":0.0007040526,"threshold_uncertainty_score":0.004753828},"labels":[],"label_agreement":null},{"id":"W1971729087","doi":"10.1109/bmsb.2011.5954932","title":"Selective bit mapping for Chinese DTMB LDPC coded QAM modulation scheme","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Low-density parity-check code; Computer science; Decoding methods; Quadrature amplitude modulation; QAM; Algorithm; Code word; Encoder; Orthogonal frequency-division multiplexing; Binary number; Modulation (music); Bit error rate; Theoretical computer science; Mathematics; Arithmetic; Telecommunications; Channel (broadcasting)","score_opus":0.051096761077875454,"score_gpt":0.278959128926977,"score_spread":0.22786236784910155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971729087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2531702,0.0007279887,0.73855543,0.00023754411,0.000041731993,0.000055799024,0.000049852053,0.00032176546,0.0068396814],"genre_scores_gemma":[0.87367475,0.00044246673,0.12382143,0.00005734902,0.000014145039,0.000035924946,0.000041420244,0.00002172679,0.001890747],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998933,0.000024282208,0.000004073955,0.00001320358,0.000052618252,0.0000126223595],"domain_scores_gemma":[0.9998876,0.00003708871,0.000018944089,0.000020791947,0.000029523173,0.000005988081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001208047,0.00025792868,0.00015210509,0.00020107125,0.00018640145,0.00017138236,0.0002312038,0.00021232867,0.00075379584],"category_scores_gemma":[0.0005071781,0.00007308438,0.00011642648,0.00026922568,0.00026623686,0.00032182044,0.00022165761,0.00020401768,0.00017733293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027061495,0.00004554567,0.0028871102,0.0002751986,0.0000353751,0.00037318232,0.0003622185,0.26439857,0.44588223,0.09667943,0.0011515683,0.18763901],"study_design_scores_gemma":[0.000022032735,0.0000942875,0.0008824263,0.0000156019,0.000017201775,0.000338518,0.00001932005,0.91614693,0.07334987,0.005271025,0.003825932,0.000016710403],"about_ca_topic_score_codex":0.0012043569,"about_ca_topic_score_gemma":0.0015769191,"teacher_disagreement_score":0.0012043569,"about_ca_system_score_codex":0.00034275354,"about_ca_system_score_gemma":0.00041355807,"threshold_uncertainty_score":0.0025216937},"labels":[],"label_agreement":null},{"id":"W1973949727","doi":"10.1109/sips.2009.5336257","title":"Bidirectional interleavers for LDPC decoders using transmission gates","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Datapath; Computer science; WiMAX; Throughput; IEEE 802.11g-2003; Forward error correction; Decoding methods; Transmission (telecommunications); Computer architecture; Electronic engineering; Computer network; Algorithm; Wireless; Embedded system; IEEE 802.11; Telecommunications; Engineering","score_opus":0.03248787339327801,"score_gpt":0.31117160220051066,"score_spread":0.27868372880723263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973949727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10002652,0.00056062,0.883596,0.00019929485,0.000119353885,0.00013261044,0.00012807269,0.001937108,0.013300314],"genre_scores_gemma":[0.7001102,0.0007564038,0.28635153,0.00015916441,0.000046061,0.00013998162,0.00019416978,0.000139883,0.012102657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998204,0.000035078618,0.000014450638,0.000024250281,0.00008091704,0.000024953371],"domain_scores_gemma":[0.99964535,0.00012617528,0.00005390511,0.00008584808,0.00007162185,0.000017149128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023369669,0.00029231524,0.00016590775,0.00033536612,0.00032916744,0.0004921394,0.00046158166,0.00030454708,0.001843655],"category_scores_gemma":[0.0008457627,0.00017124729,0.00015182166,0.00035804405,0.00031298262,0.0006726467,0.00039697936,0.00053122325,0.00067623035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005863025,0.00019307983,0.0015252184,0.0003637884,0.000069860354,0.00052007707,0.00030020459,0.050911162,0.35591036,0.22951397,0.0037800437,0.35632592],"study_design_scores_gemma":[0.000115620576,0.00042825827,0.0005704438,0.00009899385,0.000103188635,0.0006085582,0.000053088042,0.3783058,0.5441011,0.03496654,0.040595945,0.000052437328],"about_ca_topic_score_codex":0.00063377083,"about_ca_topic_score_gemma":0.00238572,"teacher_disagreement_score":0.001843655,"about_ca_system_score_codex":0.00041991522,"about_ca_system_score_gemma":0.000658224,"threshold_uncertainty_score":0.00616765},"labels":[],"label_agreement":null},{"id":"W1975337470","doi":"10.1109/ipcon.2012.6358728","title":"A 45 GS/s optical soft-decision front-end","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Front and back ends; Decoding methods; Coding (social sciences); Computer science; Low-density parity-check code; End-to-end principle; Physics; Algorithm; Mathematics; Artificial intelligence; Statistics; Operating system","score_opus":0.022589985592347546,"score_gpt":0.28727198264892934,"score_spread":0.2646819970565818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975337470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56803364,0.00079411984,0.33570692,0.0019931337,0.0008046815,0.0006650558,0.0017447119,0.009320481,0.08093733],"genre_scores_gemma":[0.8460714,0.00017707197,0.11258409,0.00092785194,0.00013142504,0.00014337974,0.00046100956,0.0001079365,0.0393957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949646,0.000033945427,0.000015458247,0.00008264995,0.0002726711,0.000098806384],"domain_scores_gemma":[0.9996263,0.00012078647,0.00003730534,0.00003325777,0.00013206345,0.00005031548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023539556,0.00040322816,0.00035795398,0.0004592669,0.0006061849,0.0009984509,0.0007818517,0.00084477,0.011903272],"category_scores_gemma":[0.00045344952,0.0002370017,0.0001785852,0.00026162373,0.00036842295,0.00050027174,0.00042723314,0.0005901018,0.005180622],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010582616,0.00025508946,0.001865278,0.00019684622,0.00003404811,0.0004663535,0.00017807231,0.0041194665,0.8883681,0.011638887,0.005187852,0.086631626],"study_design_scores_gemma":[0.00013947651,0.00090386777,0.0039839675,0.00006560604,0.000051844676,0.0006748926,0.00007848211,0.07644732,0.859736,0.0023443182,0.055456687,0.00011740822],"about_ca_topic_score_codex":0.0012934844,"about_ca_topic_score_gemma":0.00248856,"teacher_disagreement_score":0.011903272,"about_ca_system_score_codex":0.0007871422,"about_ca_system_score_gemma":0.00093548425,"threshold_uncertainty_score":0.039820433},"labels":[],"label_agreement":null},{"id":"W1975483602","doi":"10.1364/cleo.2010.cthdd1","title":"Forward Error Correction (FEC) in Optical Communication","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Forward error correction; Computer science; Error detection and correction; Coding (social sciences); Optical communication; Spectral efficiency; Modulation (music); Electronic engineering; Telecommunications; Decoding methods; Algorithm; Engineering; Mathematics","score_opus":0.015342885167585092,"score_gpt":0.287791115637615,"score_spread":0.2724482304700299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975483602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035163667,0.39636558,0.4492905,0.004989115,0.0027992527,0.00016867611,0.00018849078,0.00086982554,0.110164836],"genre_scores_gemma":[0.368538,0.3811644,0.20539173,0.0012015242,0.0024090225,0.00020989636,0.00024744915,0.0001341234,0.04070398],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923825,0.00012939365,0.000028227709,0.00008969403,0.00044166725,0.0000726948],"domain_scores_gemma":[0.9993316,0.00042926532,0.000041066174,0.000053233005,0.00013309058,0.000011788434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080759166,0.00080444384,0.0008486183,0.0010358583,0.00089542114,0.0014879459,0.0010883014,0.0020014532,0.003039164],"category_scores_gemma":[0.001673154,0.0003683785,0.00019646794,0.0013298582,0.0014272552,0.0022709267,0.00067564734,0.0016124441,0.0012786321],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008987196,0.000083374565,0.00039467597,0.00158651,0.000032704294,0.00040150684,0.0002704228,0.022880986,0.04781443,0.43077633,0.012167654,0.4835015],"study_design_scores_gemma":[0.00004700819,0.0005463256,0.0011208003,0.0018351616,0.00007414635,0.003292296,0.00022608043,0.09247497,0.12461052,0.39358,0.38194323,0.00024943548],"about_ca_topic_score_codex":0.00067230064,"about_ca_topic_score_gemma":0.00081772194,"teacher_disagreement_score":0.003039164,"about_ca_system_score_codex":0.00085029704,"about_ca_system_score_gemma":0.00063887413,"threshold_uncertainty_score":0.010167003},"labels":[],"label_agreement":null},{"id":"W1975528831","doi":"10.1007/s11265-013-0854-z","title":"Clockless Stochastic Decoding of Low-Density Parity-Check Codes: Architecture and Simulation Model","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Decoding methods; Computer science; Computation; Low-density parity-check code; Stochastic computing; Synchronization (alternating current); Algorithm; CMOS; Parallel computing; Theoretical computer science; Computer engineering; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.02056301322011973,"score_gpt":0.27142063693992463,"score_spread":0.2508576237198049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975528831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7143665,0.00092531525,0.25724036,0.0018293788,0.00017086267,0.0001524877,0.0006868412,0.0005647674,0.024063503],"genre_scores_gemma":[0.98934525,0.00024712086,0.0062268157,0.00008744372,0.00003131849,0.00006922132,0.00015239943,0.000044150227,0.0037962582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00019041638,0.000023809731,0.00007023476,0.00014058873,0.00013922738],"domain_scores_gemma":[0.9967932,0.0020614048,0.0002900757,0.00021249874,0.00052433705,0.00011846911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033213,0.0005437474,0.0012473667,0.0009733207,0.0007773494,0.0013965878,0.0015475869,0.0022308666,0.002772298],"category_scores_gemma":[0.0064176894,0.00061286706,0.000842762,0.0009608096,0.0015142132,0.0017005606,0.0008114007,0.0011930435,0.00038969153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004683225,0.00003111025,0.000724717,0.000023686713,0.000018286173,0.00005853261,0.000037041318,0.964669,0.00082501915,0.032458868,0.00022494256,0.0008819456],"study_design_scores_gemma":[0.000007771395,0.0000053507297,0.000078115605,0.0000019740105,0.000004785708,0.0000072958305,0.00000383181,0.9970114,0.00015209624,0.0026813194,0.00004202775,0.0000040388272],"about_ca_topic_score_codex":0.013306879,"about_ca_topic_score_gemma":0.008025045,"teacher_disagreement_score":0.013306879,"about_ca_system_score_codex":0.0019776423,"about_ca_system_score_gemma":0.0019478654,"threshold_uncertainty_score":0.02645886},"labels":[],"label_agreement":null},{"id":"W1976433357","doi":"10.1109/sips.2006.352586","title":"On the Effects of Colored Noise on the Performance of LDPC Codes","year":2006,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Low-density parity-check code; Additive white Gaussian noise; Colors of noise; Computer science; Colored; Noise (video); Gaussian noise; Turbo code; Algorithm; Electronic engineering; Mathematics; Decoding methods; Telecommunications; White noise; Engineering; Artificial intelligence","score_opus":0.025265528738688214,"score_gpt":0.28693741796996075,"score_spread":0.26167188923127255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976433357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85109514,0.0039139898,0.12768261,0.00066404825,0.00017445075,0.00006805189,0.0003174799,0.00063307723,0.015451213],"genre_scores_gemma":[0.99300355,0.00086973293,0.0053263884,0.0000652375,0.000042597167,0.000011428651,0.00006789917,0.000045738852,0.0005675307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716705,0.0011149952,0.0000934396,0.00023273968,0.0009954029,0.0003962915],"domain_scores_gemma":[0.9729346,0.022157775,0.0012418787,0.0012288339,0.0022616885,0.00017533859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019804914,0.0008835496,0.00055785826,0.0008113269,0.0005204436,0.0007556169,0.00041314753,0.0009076963,0.0012280359],"category_scores_gemma":[0.019714529,0.00029562038,0.00028589138,0.00079312915,0.0010853006,0.0014387572,0.0005181948,0.0005512775,0.00037396027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096528785,0.000105097286,0.0063464246,0.00027504744,0.00015142425,0.00063926296,0.00022496638,0.88177973,0.0637609,0.011870429,0.00077323685,0.033108093],"study_design_scores_gemma":[0.00003628782,0.0006965886,0.0041979854,0.00011202215,0.00012086795,0.0005488264,0.000084095685,0.897254,0.09034051,0.005320407,0.0011929262,0.0000954619],"about_ca_topic_score_codex":0.0034551453,"about_ca_topic_score_gemma":0.0024791486,"teacher_disagreement_score":0.0034551453,"about_ca_system_score_codex":0.0010494246,"about_ca_system_score_gemma":0.00059168244,"threshold_uncertainty_score":0.010474026},"labels":[],"label_agreement":null},{"id":"W1976677770","doi":"10.1109/istc.2014.6955089","title":"Laterally connected spatially coupled code chains for transmission over unstable parallel channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Binary erasure channel; Erasure; Erasure code; Coupling (piping); Algorithm; Binary number; Coding (social sciences); Channel (broadcasting); Transmission (telecommunications); Code (set theory); Topology (electrical circuits); Theoretical computer science; Channel capacity; Mathematics; Telecommunications; Engineering; Combinatorics","score_opus":0.01751976257920919,"score_gpt":0.2621069792720119,"score_spread":0.2445872166928027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976677770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47746214,0.00034539276,0.5157189,0.00025737318,0.000060192342,0.000061529805,0.000049361763,0.00020246932,0.005842684],"genre_scores_gemma":[0.9548816,0.0001470219,0.043002464,0.000040986142,0.00001724256,0.000054327444,0.00002504162,0.000017766415,0.0018136154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979156,0.00005895687,0.000008870793,0.000021821577,0.00009456711,0.000024359264],"domain_scores_gemma":[0.9993273,0.00024442328,0.000120713725,0.00013289152,0.00012486111,0.00004993794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032865067,0.00025138707,0.00025008802,0.0002757748,0.00049699814,0.00038323735,0.00053063774,0.00041249426,0.0011033335],"category_scores_gemma":[0.0013918503,0.0001580305,0.00015611404,0.0002793286,0.00081461074,0.00071628357,0.0009219219,0.0004941075,0.00017440526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002781867,0.000102828606,0.0017937177,0.0000995493,0.00005120026,0.00028379733,0.00030971845,0.6548402,0.11434801,0.18489419,0.0006989698,0.042299677],"study_design_scores_gemma":[0.000009904946,0.00005169696,0.000092638445,0.0000049224477,0.000006805596,0.000035782363,0.000010507171,0.98392004,0.007117463,0.008218599,0.0005217758,0.000009883998],"about_ca_topic_score_codex":0.0010986128,"about_ca_topic_score_gemma":0.0016629297,"teacher_disagreement_score":0.0011033335,"about_ca_system_score_codex":0.00043406867,"about_ca_system_score_gemma":0.0005179595,"threshold_uncertainty_score":0.0036910176},"labels":[],"label_agreement":null},{"id":"W1976751132","doi":"10.1109/sips.2012.50","title":"Power Characterization of a Gbit/s FPGA Convolutional LDPC Decoder","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Field-programmable gate array; Encoder; Decoding methods; Algorithm; Code (set theory); Low-density parity-check code; Computer hardware; Programming language; Operating system","score_opus":0.014773247050225915,"score_gpt":0.25418341036206915,"score_spread":0.23941016331184323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976751132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9741634,0.0001700793,0.019947572,0.000077101395,0.00002048659,0.000040188526,0.00038658216,0.0004633687,0.0047312514],"genre_scores_gemma":[0.9924494,0.00007355897,0.004666959,0.000029620003,0.0000036921851,0.000016701691,0.00023511678,0.000041966072,0.0024830154],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988174,0.000016216707,0.0000069130265,0.000021191316,0.000052751093,0.00002114075],"domain_scores_gemma":[0.9996995,0.0001421876,0.000035043715,0.000033026496,0.00007934956,0.000010978014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008759558,0.00025070275,0.00016926399,0.00034881054,0.00014319978,0.00022601117,0.00032794333,0.00018524536,0.0030010627],"category_scores_gemma":[0.0006417102,0.00009435225,0.00006688425,0.0002644279,0.00012866914,0.0003073519,0.00008192222,0.000105867606,0.00034151506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014445747,0.00021493596,0.015451271,0.00035114062,0.00007019967,0.0010297259,0.00030016323,0.05527875,0.8249297,0.0021311787,0.0019110504,0.09688723],"study_design_scores_gemma":[0.00009448117,0.0015737788,0.022625206,0.00002469479,0.000063525185,0.00057748053,0.00011491216,0.19254777,0.7758814,0.0003892414,0.006081524,0.000025927373],"about_ca_topic_score_codex":0.0019508759,"about_ca_topic_score_gemma":0.002279978,"teacher_disagreement_score":0.0030010627,"about_ca_system_score_codex":0.0004747848,"about_ca_system_score_gemma":0.00021365397,"threshold_uncertainty_score":0.010039568},"labels":[],"label_agreement":null},{"id":"W1976872807","doi":"10.1109/isit.2012.6283652","title":"Relaxed Gaussian Belief Propagation","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Belief propagation; Gaussian; Algorithm; Relaxation (psychology); Heuristic; Computer science; Computational complexity theory; Markov chain; Reduction (mathematics); Mathematical optimization; Covariance; Gaussian process; A priori and a posteriori; Covariance matrix; Mathematics; Decoding methods; Machine learning; Statistics","score_opus":0.018368364092680355,"score_gpt":0.2616246558059783,"score_spread":0.24325629171329796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976872807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040274253,0.00015749568,0.99375546,0.00015783579,0.00004113758,0.000046768342,0.000069808935,0.0005627956,0.0011813821],"genre_scores_gemma":[0.18870528,0.0004356236,0.8052278,0.0003369246,0.00011721223,0.00025409396,0.000535402,0.00021311121,0.0041745887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669504,0.0012468784,0.00015649079,0.0005595424,0.00097183045,0.00037026178],"domain_scores_gemma":[0.990321,0.005351324,0.00059967063,0.0014708523,0.0020246424,0.0002324908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038533295,0.0014500279,0.0018999658,0.0014725064,0.00087323826,0.002388695,0.0038226526,0.0023981598,0.0034899786],"category_scores_gemma":[0.01924042,0.0009889511,0.001268481,0.0019420682,0.0016010185,0.0033338764,0.0027538626,0.0035486019,0.0014787524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041564563,0.00010409241,0.0009922765,0.00022986904,0.00016227241,0.00016625294,0.00022438871,0.6812163,0.0033974822,0.06782951,0.0071622226,0.23809963],"study_design_scores_gemma":[0.000026747051,0.000024436336,0.00007303953,0.000014539998,0.000016627668,0.000034591973,0.000016884396,0.9814693,0.001413331,0.015646184,0.0012512942,0.000013058117],"about_ca_topic_score_codex":0.008813958,"about_ca_topic_score_gemma":0.008543236,"teacher_disagreement_score":0.008813958,"about_ca_system_score_codex":0.0014787532,"about_ca_system_score_gemma":0.0030139019,"threshold_uncertainty_score":0.02037865},"labels":[],"label_agreement":null},{"id":"W1976979609","doi":"10.1007/s11265-011-0577-y","title":"Switching Activity Minimization in Iterative LDPC Decoders","year":2011,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Alberta","keywords":"Low-density parity-check code; Computer science; Decoding methods; Interconnection; Soft-decision decoder; Implementation; Process (computing); Code (set theory); Power (physics); Computer engineering; Parallel computing; Algorithm; Computer network","score_opus":0.042433211508636166,"score_gpt":0.27496765735215223,"score_spread":0.23253444584351607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976979609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0938341,0.0003890568,0.89816946,0.00022879259,0.000025517145,0.000044537166,0.00008049479,0.00031150316,0.0069165197],"genre_scores_gemma":[0.82160896,0.00048720764,0.16967839,0.00008472013,0.000047491158,0.00014025439,0.00021439132,0.00016695475,0.0075716507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994479,0.00022760895,0.000032948607,0.00005160086,0.0001810555,0.000058832487],"domain_scores_gemma":[0.99845743,0.001070529,0.00009125663,0.00013283575,0.00020586349,0.000042021766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060140213,0.0004650379,0.0005285381,0.00047540886,0.00030275685,0.0008285843,0.0007787688,0.000626193,0.001254457],"category_scores_gemma":[0.0030405773,0.00034196122,0.0002835628,0.0006849598,0.00046691435,0.0006142044,0.00064519286,0.00059129624,0.00035747516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031917435,0.00011170893,0.0010181525,0.0001610501,0.00004889462,0.00010462824,0.00023085275,0.7240493,0.029833555,0.07308441,0.0013684038,0.16966988],"study_design_scores_gemma":[0.00000938279,0.000037555405,0.00015164836,0.000010323315,0.000008189609,0.000035087105,0.000010240135,0.98060054,0.0077301436,0.010983031,0.0004179719,0.000005871108],"about_ca_topic_score_codex":0.0015181366,"about_ca_topic_score_gemma":0.002328375,"teacher_disagreement_score":0.0015181366,"about_ca_system_score_codex":0.0006998025,"about_ca_system_score_gemma":0.0010113771,"threshold_uncertainty_score":0.0050774813},"labels":[],"label_agreement":null},{"id":"W1978932396","doi":"10.1109/wcnc.2010.5506378","title":"Efficient Implementation of Interior Point Decoding Based on Barrier Function for LDPC Codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Linear programming; Constraint (computer-aided design); Algorithm; List decoding; Concatenated error correction code; Code (set theory); Function (biology); Theoretical computer science; Mathematics; Block code","score_opus":0.014871022900524099,"score_gpt":0.3084261264729842,"score_spread":0.29355510357246006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978932396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007911929,0.000077368924,0.99004436,0.0000338838,0.000018124898,0.000024804483,0.000013828121,0.0007203391,0.0011554618],"genre_scores_gemma":[0.1901621,0.00018274992,0.80747294,0.000048640977,0.000017109978,0.00012927779,0.00013466796,0.00021082323,0.0016417075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946254,0.00016816115,0.000024819481,0.00004184481,0.0002392476,0.000063429135],"domain_scores_gemma":[0.9993358,0.00035277687,0.00003351738,0.000110066336,0.00014017614,0.000027561284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057219935,0.0006228268,0.0010983412,0.0005252037,0.00042022634,0.00080451166,0.0011047408,0.0006837767,0.002254049],"category_scores_gemma":[0.0022706306,0.00027410765,0.00045554727,0.0005729721,0.0005109181,0.00091436104,0.0008987491,0.0016670456,0.0012840525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055264507,0.0001988237,0.00086333667,0.00029208264,0.00008164733,0.00031522554,0.00026949428,0.48303,0.054780286,0.110002756,0.002711623,0.346902],"study_design_scores_gemma":[0.000021011547,0.000040253373,0.00004168714,0.000009483009,0.0000048505844,0.00004415158,0.000009614936,0.9807357,0.012150298,0.005517669,0.0014161534,0.000009058749],"about_ca_topic_score_codex":0.0012821429,"about_ca_topic_score_gemma":0.0012236107,"teacher_disagreement_score":0.002254049,"about_ca_system_score_codex":0.0005272185,"about_ca_system_score_gemma":0.0010140056,"threshold_uncertainty_score":0.007540524},"labels":[],"label_agreement":null},{"id":"W1979510651","doi":"10.1049/iet-com.2014.0101","title":"New secure channel coding scheme based on randomly punctured quasi‐cyclic‐low density parity check codes","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Mathematics; Algorithm; Theoretical computer science; Decoding methods; Statistics","score_opus":0.02798032762434987,"score_gpt":0.2854081206070522,"score_spread":0.2574277929827023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979510651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06362746,0.0011194956,0.92434627,0.0004940174,0.00048819112,0.00027151572,0.00017989476,0.0007596937,0.008713404],"genre_scores_gemma":[0.7810555,0.00087372964,0.2103295,0.00021056783,0.00018117821,0.00024809674,0.00017291425,0.00004076193,0.006887776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992052,0.00014055429,0.00003388531,0.00009757475,0.0004102452,0.00011265144],"domain_scores_gemma":[0.99900717,0.00025735886,0.00016789901,0.0002530851,0.00023123465,0.000083189945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328748,0.0004928699,0.0006271713,0.00078700646,0.0007199891,0.0008048621,0.0008469958,0.0007461644,0.0018655191],"category_scores_gemma":[0.0012977022,0.00026640852,0.0003710282,0.00065421977,0.0011589024,0.00092044956,0.0014591694,0.0010510035,0.00050583226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008488684,0.00025556146,0.0012982901,0.00060746307,0.00015354312,0.0011916473,0.00040601272,0.07284923,0.29111898,0.374988,0.0061758705,0.25010654],"study_design_scores_gemma":[0.00033087522,0.00096416805,0.0010214316,0.00012909342,0.0001760536,0.0023692104,0.0000705689,0.7614233,0.15013677,0.046327118,0.03677517,0.0002763161],"about_ca_topic_score_codex":0.00058210664,"about_ca_topic_score_gemma":0.00072339486,"teacher_disagreement_score":0.0018655191,"about_ca_system_score_codex":0.00061882933,"about_ca_system_score_gemma":0.0011605319,"threshold_uncertainty_score":0.0062407255},"labels":[],"label_agreement":null},{"id":"W1979802120","doi":"10.1109/tcomm.2012.122112.110805","title":"Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Advanced Micro Devices (Canada)","funders":"","keywords":"Algorithm; Computer science; Low-density parity-check code; Turbo code; Decoding methods; Mathematics","score_opus":0.03332396291760937,"score_gpt":0.3172709810086092,"score_spread":0.2839470180909998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979802120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08107505,0.00015573009,0.91662055,0.000051768657,0.0000091376405,0.000035758287,0.00007070803,0.0002704296,0.0017108751],"genre_scores_gemma":[0.7418323,0.00019569742,0.25692973,0.00003217264,0.0000087371145,0.000088408844,0.00016762226,0.00007675967,0.0006685269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.00076752255,0.00007980156,0.00013114211,0.0006712693,0.000064249434],"domain_scores_gemma":[0.99472827,0.00376395,0.00041504714,0.00047003516,0.00057146867,0.000051290914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016355125,0.0006569383,0.00080246426,0.0011991834,0.00031020626,0.0011769583,0.0010313482,0.00062157796,0.0006792471],"category_scores_gemma":[0.013820702,0.0003349868,0.00034443935,0.00071780983,0.00090890954,0.0013011631,0.0008175919,0.00069550116,0.00027046216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012117273,0.000030803792,0.0014566177,0.00006616949,0.000023672885,0.000063220774,0.00005918207,0.9438025,0.007744361,0.021763213,0.00014157992,0.024727587],"study_design_scores_gemma":[0.000004923655,0.000015049368,0.0001827502,0.0000070182964,0.000002853229,0.000021029455,0.00000512028,0.9909575,0.005253683,0.0034649875,0.00007608541,0.000009037146],"about_ca_topic_score_codex":0.0013247776,"about_ca_topic_score_gemma":0.0010705425,"teacher_disagreement_score":0.0016355125,"about_ca_system_score_codex":0.0009577821,"about_ca_system_score_gemma":0.00078824034,"threshold_uncertainty_score":0.008649468},"labels":[],"label_agreement":null},{"id":"W1982408478","doi":"10.1109/isit.2007.4557204","title":"Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Channel (broadcasting); Noise power; Noise (video); Mathematics; Decoding methods; Bit error rate; Algorithm; Channel state information; Transmission (telecommunications); Fading distribution; Power (physics); Statistics; Computer science; Control theory (sociology); Telecommunications; Rayleigh fading; Physics; Wireless","score_opus":0.07289412940617145,"score_gpt":0.3642338397936453,"score_spread":0.29133971038747386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982408478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009314393,0.00026902452,0.987414,0.000086846354,0.000009978052,0.000022551774,0.000033253797,0.00042921293,0.002420694],"genre_scores_gemma":[0.29746723,0.00075514155,0.6979515,0.00011125589,0.0000538411,0.00019255954,0.00020390816,0.00033916894,0.00292537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976332,0.00104874,0.00013055465,0.00020335919,0.00078895077,0.00019513008],"domain_scores_gemma":[0.99616396,0.0027367817,0.00028702363,0.00035390505,0.00040304696,0.00005526891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021972093,0.0010310689,0.0012342182,0.0010752785,0.0004015706,0.0015239423,0.00087889744,0.0009297467,0.0027516806],"category_scores_gemma":[0.013479844,0.0005799068,0.00063232996,0.0010194208,0.0010218249,0.001706235,0.0013276619,0.001072738,0.0014470263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024474997,0.000046000187,0.0006271171,0.00026055364,0.00006751724,0.00014584573,0.00023145562,0.8140238,0.010596002,0.06019677,0.0017185729,0.11184151],"study_design_scores_gemma":[0.000009801111,0.000026057178,0.00009789412,0.000024634732,0.000009593299,0.00006276042,0.00001329692,0.97388047,0.0051955837,0.020162448,0.00050235057,0.00001520914],"about_ca_topic_score_codex":0.0011283761,"about_ca_topic_score_gemma":0.0016635561,"teacher_disagreement_score":0.0027516806,"about_ca_system_score_codex":0.0012211918,"about_ca_system_score_gemma":0.0013203394,"threshold_uncertainty_score":0.011620104},"labels":[],"label_agreement":null},{"id":"W1983868572","doi":"10.1109/icc.2010.5502379","title":"Hybrid Decoding of LDPC Codes Based on Interior Point Method","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; List decoding; Berlekamp–Welch algorithm; Sequential decoding; Computer science; Interior point method; Bit error rate; Concatenated error correction code; Mathematics; Block code; Error floor","score_opus":0.01703814915059567,"score_gpt":0.31110988664322237,"score_spread":0.2940717374926267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983868572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009510478,0.00009597033,0.98915696,0.000020421301,0.00001266989,0.000015701651,0.000012098009,0.00024059227,0.0009349883],"genre_scores_gemma":[0.17247735,0.00020571244,0.82459587,0.000037797054,0.000018000686,0.0001024588,0.00012309005,0.00010179505,0.0023380003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00014278905,0.000029889794,0.00006631979,0.0002619449,0.000041316256],"domain_scores_gemma":[0.9993636,0.00032874852,0.0000429829,0.00008612841,0.00015820861,0.000020348969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005496277,0.00055566954,0.000825604,0.00075059576,0.00040057403,0.0006390069,0.00084092503,0.0006452045,0.00097279635],"category_scores_gemma":[0.001383904,0.0002681426,0.00056554785,0.00061257475,0.00054491893,0.0008819876,0.00071997056,0.00088247564,0.0005465009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026530935,0.00007003239,0.0010665887,0.00017913047,0.00007896422,0.00016473135,0.00025779638,0.530419,0.042331837,0.0837456,0.0011566486,0.34026438],"study_design_scores_gemma":[0.00001539869,0.000034567907,0.000083495055,0.000008369935,0.000005443336,0.00006221428,0.0000071045956,0.9840423,0.008558316,0.005993226,0.0011770519,0.000012525769],"about_ca_topic_score_codex":0.0012812482,"about_ca_topic_score_gemma":0.0010422723,"teacher_disagreement_score":0.0012812482,"about_ca_system_score_codex":0.00048626837,"about_ca_system_score_gemma":0.0006944514,"threshold_uncertainty_score":0.0035281777},"labels":[],"label_agreement":null},{"id":"W1983975287","doi":"10.1109/qbsc.2014.6841213","title":"Left degree distribution shaping for LT codes over the binary erasure channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Yarmouk University","keywords":"Fountain code; Luby transform code; Binary erasure channel; Raptor code; Degree distribution; Tornado code; Decoding methods; Computer science; Online codes; Degree (music); Binary number; Erasure code; Algorithm; Coding theory; Binary code; Discrete mathematics; Theoretical computer science; Concatenated error correction code; Mathematics; Block code; Channel (broadcasting); Channel capacity; Computer network; Arithmetic; Physics","score_opus":0.05246085720956857,"score_gpt":0.28341264101099023,"score_spread":0.23095178380142167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983975287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12919037,0.0006241627,0.85721374,0.00069872016,0.00007630791,0.00007371223,0.0001637645,0.0010679204,0.010891298],"genre_scores_gemma":[0.95221525,0.00039429788,0.044914305,0.00021900893,0.000050149694,0.00007125289,0.000089428955,0.00009831352,0.0019479265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.00017997014,0.000028300306,0.00007770848,0.0002801773,0.0001513942],"domain_scores_gemma":[0.9973341,0.0011976666,0.00046775024,0.00052305916,0.0003231414,0.00015436376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006170801,0.00038168667,0.00036099317,0.0005616487,0.0006918708,0.0006690415,0.00046854798,0.0005074527,0.0014997707],"category_scores_gemma":[0.004566946,0.0001632208,0.00023831597,0.0006142228,0.0014216676,0.0010767351,0.001211172,0.0010180349,0.00047453234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006788121,0.00010356686,0.0019256013,0.00024396344,0.000028832526,0.00037475873,0.00067297317,0.28320634,0.10329314,0.46122307,0.003648299,0.14460061],"study_design_scores_gemma":[0.000037994207,0.00014667818,0.00044005114,0.000058878133,0.000013137837,0.00026058443,0.00005888599,0.87523603,0.039860707,0.07907081,0.0047562793,0.000059990805],"about_ca_topic_score_codex":0.0014580375,"about_ca_topic_score_gemma":0.0016417908,"teacher_disagreement_score":0.0014997707,"about_ca_system_score_codex":0.0010940436,"about_ca_system_score_gemma":0.0011204461,"threshold_uncertainty_score":0.007937849},"labels":[],"label_agreement":null},{"id":"W1985033232","doi":"10.1049/iet-com.2014.0658","title":"Improved finite‐length Luby‐transform codes in the binary erasure channel","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Yarmouk University","keywords":"Erasure; Luby transform code; Binary erasure channel; Online codes; Tornado code; Computer science; Erasure code; Binary number; Channel (broadcasting); Algorithm; Decoding methods; Mathematics; Low-density parity-check code; Computer network; Error floor; Arithmetic; Channel capacity","score_opus":0.07969589066284656,"score_gpt":0.3190004978732516,"score_spread":0.23930460721040503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985033232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26827464,0.0024081054,0.7085792,0.0012140707,0.00025493244,0.00010779345,0.00020454121,0.0013023041,0.017654572],"genre_scores_gemma":[0.87661475,0.0009122728,0.11501602,0.00026993133,0.00006201609,0.000078858786,0.00014006872,0.00007524026,0.006830794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00015197063,0.000024583042,0.00005632881,0.00026160115,0.00014312485],"domain_scores_gemma":[0.99842715,0.000718791,0.00020473228,0.00029679056,0.00027708782,0.000075549375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009087923,0.00044095988,0.00058346783,0.0007528106,0.00060172577,0.00079931883,0.00082682073,0.0009305834,0.0013888876],"category_scores_gemma":[0.0044950712,0.00023612885,0.00027344257,0.000978418,0.0014797477,0.0017720677,0.001303862,0.001350949,0.00042498307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012090659,0.00013841856,0.0011559902,0.00030629185,0.000043922824,0.00038060008,0.0007441959,0.2302692,0.06542366,0.5176362,0.004008314,0.1786842],"study_design_scores_gemma":[0.00011346226,0.00031082067,0.0005448989,0.00013902086,0.00003575946,0.00043753724,0.00011044688,0.80771405,0.0806143,0.09717135,0.012668471,0.0001397789],"about_ca_topic_score_codex":0.002352783,"about_ca_topic_score_gemma":0.0021803135,"teacher_disagreement_score":0.002352783,"about_ca_system_score_codex":0.00090869056,"about_ca_system_score_gemma":0.0013849938,"threshold_uncertainty_score":0.0065930486},"labels":[],"label_agreement":null},{"id":"W1985813166","doi":"10.1016/s0004-3702(02)00361-2","title":"Approximate inference in Boltzmann machines","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Belief propagation; Boltzmann constant; Inference; Boltzmann machine; Mathematics; Applied mathematics; Energy (signal processing); Boltzmann distribution; Statistical physics; Order (exchange); Mathematical optimization; Physics; Quantum mechanics; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.08489014672356088,"score_gpt":0.32148816983871753,"score_spread":0.23659802311515665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985813166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014798598,0.0012474889,0.9792697,0.0007774046,0.00012534822,0.000016718659,0.000052189265,0.0003398922,0.0033727495],"genre_scores_gemma":[0.6567044,0.001757721,0.32948878,0.0005106258,0.00049556955,0.00024988613,0.0003719965,0.0003861801,0.010034854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815255,0.00092001347,0.000078651094,0.00023018307,0.000478246,0.00014037729],"domain_scores_gemma":[0.9896305,0.008563827,0.00030517607,0.00077157095,0.000575382,0.00015349548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027352544,0.0006600841,0.0021003976,0.0013743935,0.00094800285,0.0025159915,0.002484834,0.0020263523,0.0032346067],"category_scores_gemma":[0.026654327,0.0010593423,0.00096188666,0.0017333851,0.0031573526,0.005298657,0.002749291,0.004225911,0.00053967146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000961754,0.000031451007,0.0005165674,0.00012301994,0.0000672398,0.00003224165,0.00011170254,0.45784065,0.00047504168,0.5010515,0.001739294,0.03791517],"study_design_scores_gemma":[0.0000065713725,0.0000039940414,0.000053305917,0.00001162874,0.000006439497,0.0000067052447,0.000005581388,0.6707469,0.00016639152,0.32858843,0.00039818123,0.000005902372],"about_ca_topic_score_codex":0.006391902,"about_ca_topic_score_gemma":0.005757579,"teacher_disagreement_score":0.006391902,"about_ca_system_score_codex":0.0019968476,"about_ca_system_score_gemma":0.0013339111,"threshold_uncertainty_score":0.01448822},"labels":[],"label_agreement":null},{"id":"W1985834029","doi":"10.1109/lcomm.2013.091113.131213","title":"On Probabilistic Weight Distribution of Polar Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Polar code; Probabilistic logic; Computer science; Algorithm; Weight distribution; Hamming code; Polar; Coding (social sciences); Hamming weight; Linear code; Theoretical computer science; Mathematics; Block code; Decoding methods; Statistics","score_opus":0.022063561416369813,"score_gpt":0.2649509028680204,"score_spread":0.2428873414516506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985834029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01931797,0.00026781516,0.9737291,0.0002236696,0.000036279147,0.000023172199,0.00008808055,0.00010620359,0.006207696],"genre_scores_gemma":[0.6995095,0.0025003268,0.2829673,0.00043577576,0.00035710615,0.00031757212,0.0005715922,0.00039819174,0.012942665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839514,0.00046180218,0.000056830002,0.00017822091,0.00069032615,0.00021773763],"domain_scores_gemma":[0.9947988,0.0032832536,0.00041277477,0.00052035134,0.0008343784,0.00015041437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019204243,0.0009101584,0.0004952394,0.0017448773,0.0006182074,0.0016699503,0.0012582577,0.0009265093,0.0031150128],"category_scores_gemma":[0.014327297,0.00041003645,0.0005893596,0.0016582877,0.002550972,0.0031521658,0.001834687,0.0022563622,0.0013486249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053632077,0.000012639456,0.0003978608,0.000047033842,0.0000066364696,0.00008201995,0.000105050574,0.11705585,0.0022198334,0.86035,0.00089992804,0.018769434],"study_design_scores_gemma":[0.000009385112,0.000018524539,0.0001413679,0.000030349123,0.0000048244947,0.00010738509,0.000026938807,0.6067225,0.0013947642,0.38954523,0.001977888,0.000020911848],"about_ca_topic_score_codex":0.001286578,"about_ca_topic_score_gemma":0.0008556116,"teacher_disagreement_score":0.0031150128,"about_ca_system_score_codex":0.0013728876,"about_ca_system_score_gemma":0.0009221099,"threshold_uncertainty_score":0.01042068},"labels":[],"label_agreement":null},{"id":"W1986539531","doi":"10.1109/itw.2009.5351244","title":"On the dynamics of the error floor behavior in regular LDPC codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Computer science; Code (set theory); Fixed point; Bit error rate; Iterative method; Topology (electrical circuits); Mathematics; Combinatorics; Mathematical analysis","score_opus":0.01680601596404055,"score_gpt":0.26591321611498014,"score_spread":0.2491072001509396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986539531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7601801,0.0006684112,0.21454178,0.00028077897,0.000028206923,0.000042990578,0.00012097512,0.00032903365,0.023807712],"genre_scores_gemma":[0.9892191,0.00026238238,0.008584887,0.000015278913,0.000007791494,0.00002349108,0.000045442204,0.00002869086,0.0018130131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998963,0.000023942686,0.0000033807826,0.000010041021,0.000047483216,0.000018987845],"domain_scores_gemma":[0.99941003,0.00035792647,0.00008287136,0.000042097414,0.000082695165,0.000024305607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016811586,0.00022370285,0.00016437123,0.0009583599,0.00035880928,0.00044990476,0.0002844439,0.0003062787,0.0012578706],"category_scores_gemma":[0.001951266,0.00015312214,0.00013570052,0.0004982121,0.00095411926,0.0008114382,0.0003179968,0.00029325622,0.00016580526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092858914,0.000033707365,0.0014044209,0.0001027004,0.00001071528,0.0004005402,0.0004261775,0.54456043,0.030127957,0.40482923,0.0006601842,0.017351199],"study_design_scores_gemma":[0.000005824637,0.000035330584,0.0007224048,0.000013896816,0.0000027556941,0.00019183617,0.000055447916,0.93005896,0.004587864,0.06357782,0.0007306554,0.000017307522],"about_ca_topic_score_codex":0.0008233481,"about_ca_topic_score_gemma":0.0006061646,"teacher_disagreement_score":0.0012578706,"about_ca_system_score_codex":0.00036480717,"about_ca_system_score_gemma":0.00024646398,"threshold_uncertainty_score":0.0042079687},"labels":[],"label_agreement":null},{"id":"W1987983940","doi":"10.1109/isit.2005.1523649","title":"A high-speed analog min-sum iterative decoder","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CMOS; Decoding methods; Computer science; Analogue electronics; Throughput; Soft-decision decoder; Coding gain; Electronic circuit; Chip; Electronic engineering; Noise (video); Low-density parity-check code; Algorithm; Electrical engineering; Telecommunications; Engineering; Wireless; Artificial intelligence","score_opus":0.016169751322838266,"score_gpt":0.2698953199410041,"score_spread":0.2537255686181658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987983940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07336457,0.0006235976,0.90413296,0.00027236808,0.00020363097,0.0002299548,0.00032597224,0.0061074323,0.01473952],"genre_scores_gemma":[0.4943303,0.0002712965,0.4922258,0.00028146082,0.00010188815,0.00011384649,0.00029483676,0.00006610429,0.01231439],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976104,0.000025920683,0.000015140785,0.000038953327,0.00013722637,0.000021788304],"domain_scores_gemma":[0.9996915,0.00006624238,0.000034047996,0.000048474958,0.00013611472,0.000023693447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021500271,0.0002480361,0.00020318196,0.00034911677,0.0003123462,0.00054427574,0.0009974474,0.00042066164,0.003172351],"category_scores_gemma":[0.00046571647,0.00016013364,0.00014066724,0.00030525724,0.00019470077,0.0005399485,0.00032876318,0.00035875046,0.00090407324],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030973778,0.000114113915,0.0014284654,0.00021018305,0.000049567192,0.0002813558,0.00015079293,0.010716443,0.5454202,0.023482122,0.0067521823,0.41108486],"study_design_scores_gemma":[0.00009659128,0.0008159031,0.001932465,0.00003656589,0.000105406165,0.0018467745,0.000047647995,0.26541847,0.65963835,0.004630372,0.06535272,0.00007875172],"about_ca_topic_score_codex":0.00070352684,"about_ca_topic_score_gemma":0.001466793,"teacher_disagreement_score":0.003172351,"about_ca_system_score_codex":0.0004171515,"about_ca_system_score_gemma":0.00052979094,"threshold_uncertainty_score":0.010612547},"labels":[],"label_agreement":null},{"id":"W1991079262","doi":"10.1109/tcomm.2003.815083","title":"Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Decoding methods; Turbo code; Sequential decoding; Interleaving; Computer science; Algorithm; Encoder; Concatenated error correction code; List decoding; Error detection and correction; Block code","score_opus":0.05423382058004998,"score_gpt":0.323706578886975,"score_spread":0.269472758306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991079262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03429289,0.00041881227,0.96244013,0.00006410419,0.00005320149,0.0000277003,0.00003676114,0.00038659293,0.0022798416],"genre_scores_gemma":[0.64397585,0.0007678028,0.35000956,0.00007878727,0.000062877494,0.00006531762,0.00017623871,0.00012226177,0.004741336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.00006368294,0.000044315042,0.000048438236,0.00027452942,0.00005457402],"domain_scores_gemma":[0.9991141,0.0003058831,0.00011797558,0.00017275146,0.00025474807,0.000034444194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038132299,0.00031231792,0.00031189123,0.00047131118,0.00029784598,0.00059321575,0.0005252373,0.00041031782,0.0005831345],"category_scores_gemma":[0.0021545056,0.00014446676,0.00023522417,0.0005988129,0.00046684116,0.00089224527,0.00056177075,0.0004829425,0.00033023677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046197404,0.000074889984,0.0021134694,0.00027747705,0.00006781631,0.00042343987,0.00034855006,0.16569664,0.22415625,0.18483716,0.0026397135,0.41890264],"study_design_scores_gemma":[0.000023933211,0.00016105239,0.0003515977,0.000027824637,0.00002636095,0.00048697708,0.000019440573,0.84066755,0.13180588,0.021389907,0.0050049955,0.000034458437],"about_ca_topic_score_codex":0.00089446007,"about_ca_topic_score_gemma":0.0012658433,"teacher_disagreement_score":0.00089446007,"about_ca_system_score_codex":0.00040425517,"about_ca_system_score_gemma":0.0009175757,"threshold_uncertainty_score":0.002933085},"labels":[],"label_agreement":null},{"id":"W1991263632","doi":"10.1109/tbc.2013.2291359","title":"LDPC-RS Product Codes for Digital Terrestrial Broadcasting Transmission System","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Concatenated error correction code; Concatenation (mathematics); Algorithm; Bit error rate; Turbo code; List decoding; Serial concatenated convolutional codes; Electronic engineering; Mathematics; Block code; Arithmetic; Engineering","score_opus":0.024211887064470135,"score_gpt":0.258139219079174,"score_spread":0.23392733201470384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991263632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07852086,0.0020305507,0.9066748,0.00038434722,0.00007536436,0.00012089681,0.00019296641,0.0013696386,0.010630669],"genre_scores_gemma":[0.67974454,0.0013320458,0.30963343,0.00016043897,0.0000722454,0.00018066165,0.00031937694,0.000074207914,0.00848292],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971646,0.0000712746,0.00001373832,0.000036203593,0.0001442948,0.000018065364],"domain_scores_gemma":[0.9997069,0.00007418881,0.000049924427,0.000047133268,0.00011269349,0.000009034746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214676,0.00035627995,0.00023062105,0.00039932845,0.00033510022,0.00029951497,0.0003716585,0.00046044128,0.0013269098],"category_scores_gemma":[0.00081003294,0.00011572982,0.0001716856,0.00046211653,0.00032386722,0.00039334997,0.0003228293,0.0003580137,0.00050227257],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004577669,0.000091675356,0.0015665028,0.00069582986,0.00007620003,0.00071720616,0.0003050217,0.20493805,0.26113713,0.11901014,0.0065548606,0.4044496],"study_design_scores_gemma":[0.000060726186,0.00034510886,0.0008286436,0.00006785785,0.000062459236,0.00096227205,0.000029985647,0.85354084,0.09989938,0.016998012,0.02715108,0.000053483956],"about_ca_topic_score_codex":0.002069872,"about_ca_topic_score_gemma":0.0023088623,"teacher_disagreement_score":0.002069872,"about_ca_system_score_codex":0.0003853457,"about_ca_system_score_gemma":0.0007417306,"threshold_uncertainty_score":0.0044389963},"labels":[],"label_agreement":null},{"id":"W1991621708","doi":"10.1109/tbc.2013.2257585","title":"Constellation Rotation for DVB Multiple Access Channels With Raptor Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Israel Science Foundation","keywords":"Decoding methods; Constellation; Computer science; Decodes; Channel (broadcasting); Telecommunications; Real-time computing; Physics","score_opus":0.0462710419857451,"score_gpt":0.2832437117516656,"score_spread":0.23697266976592052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991621708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059621494,0.0019124656,0.93144876,0.00025507153,0.0000492995,0.00007409008,0.000048678652,0.00033028104,0.0062598796],"genre_scores_gemma":[0.7603233,0.0020286734,0.23528995,0.00008169658,0.00007078292,0.000096398886,0.00006606917,0.000072127434,0.0019710292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901414,0.0005145284,0.000022149248,0.00007989619,0.00026313408,0.000106086685],"domain_scores_gemma":[0.997095,0.0020756035,0.00029962024,0.00025927098,0.00023536912,0.00003513389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010505274,0.00063506834,0.00050460786,0.0006130563,0.0004284212,0.0005873456,0.00050426385,0.0005726364,0.0013609767],"category_scores_gemma":[0.0044637495,0.00030332193,0.00037004956,0.00082876073,0.0011925987,0.000795761,0.0005474704,0.00067246077,0.0004374272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003425947,0.000057360878,0.0007915812,0.0002429337,0.000053435066,0.00035130826,0.00031979493,0.81638604,0.028654605,0.064570494,0.0009705905,0.087259315],"study_design_scores_gemma":[0.000025529416,0.00020204746,0.00020730829,0.000032145406,0.000026923173,0.0003573092,0.000041646366,0.96705496,0.016451247,0.012227971,0.0033402483,0.000032586984],"about_ca_topic_score_codex":0.00087371474,"about_ca_topic_score_gemma":0.00076803454,"teacher_disagreement_score":0.0013609767,"about_ca_system_score_codex":0.0006304597,"about_ca_system_score_gemma":0.0005623303,"threshold_uncertainty_score":0.0055558085},"labels":[],"label_agreement":null},{"id":"W1991921359","doi":"10.1109/lcomm.2012.020212.112311","title":"Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Circulant matrix; Mathematics; Eigenvalues and eigenvectors; Parity-check matrix; Enhanced Data Rates for GSM Evolution; Block code; Algorithm; Combinatorics; Discrete mathematics; Computer science; Decoding methods; Error floor; Telecommunications","score_opus":0.05082889828456905,"score_gpt":0.32112507672631907,"score_spread":0.27029617844175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991921359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14176314,0.00018128045,0.85491145,0.00009289555,0.00003173763,0.0000739187,0.00029889436,0.00093387166,0.0017128502],"genre_scores_gemma":[0.5720919,0.00026654196,0.42393625,0.00005802254,0.000023529818,0.00013488201,0.00057378475,0.0001628074,0.0027523143],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947554,0.00012510504,0.000031669144,0.0000845276,0.00023856468,0.00004462668],"domain_scores_gemma":[0.9979267,0.0008597731,0.00029972865,0.00033500185,0.0005144889,0.0000642415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827001,0.00034853464,0.00032658738,0.0016805769,0.0004326618,0.000584636,0.00054456457,0.00034992266,0.0010706144],"category_scores_gemma":[0.003165913,0.00023820487,0.00018479268,0.0011287841,0.0004663355,0.00080603216,0.00046095598,0.00037384516,0.00024069863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044445292,0.000080557584,0.0072779134,0.0003666078,0.00007588831,0.00044023234,0.00043776975,0.33905277,0.09997044,0.084770024,0.0039122975,0.46317106],"study_design_scores_gemma":[0.000012467978,0.000051852152,0.0013324795,0.00001862639,0.000011507265,0.00023360222,0.00003703297,0.9395887,0.028072095,0.028360736,0.0022551934,0.000025628684],"about_ca_topic_score_codex":0.0020427988,"about_ca_topic_score_gemma":0.0039703236,"teacher_disagreement_score":0.0020427988,"about_ca_system_score_codex":0.0006616552,"about_ca_system_score_gemma":0.0007973504,"threshold_uncertainty_score":0.0048006773},"labels":[],"label_agreement":null},{"id":"W1993133265","doi":"10.1109/ccece.2010.5575233","title":"Quasi-cyclic low density parity check (LDPC) codes for dedicated short range communication (DSRC) systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Dedicated short-range communications; Interleaving; Computer science; Serial concatenated convolutional codes; Forward error correction; Raptor code; Turbo code; Convolutional code; Concatenated error correction code; Algorithm; Error floor; Decoding methods; Block code; Telecommunications; Wireless","score_opus":0.026205348667151608,"score_gpt":0.2916081005763918,"score_spread":0.2654027519092402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993133265","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6253796,0.0029792895,0.36267003,0.00037465198,0.000095317344,0.00007194986,0.0001301619,0.00030106303,0.007997853],"genre_scores_gemma":[0.9716675,0.0006418646,0.026633628,0.000037533955,0.000023144894,0.000023752127,0.00006434958,0.000017573317,0.0008906739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966455,0.00009537171,0.000012109299,0.000023813025,0.00016011349,0.000043988523],"domain_scores_gemma":[0.9982729,0.0009069496,0.00019914765,0.00017670463,0.00039929914,0.00004514155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050266314,0.0004179689,0.00033364756,0.00029556855,0.0003023066,0.0004642739,0.00035353244,0.00050799455,0.0010821187],"category_scores_gemma":[0.0017802989,0.00009760514,0.00019392671,0.00037875774,0.00043869537,0.0005285816,0.00029321568,0.00027994314,0.00011697209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031921352,0.00007073789,0.0034936056,0.00023064781,0.00008369036,0.0003457842,0.000079910686,0.8734516,0.05056338,0.02846262,0.0009474542,0.0419514],"study_design_scores_gemma":[0.000020165518,0.00022888248,0.0014419807,0.000013700573,0.00003943671,0.0001897334,0.000022892622,0.97435135,0.017598981,0.0047811833,0.00129176,0.000019949981],"about_ca_topic_score_codex":0.002926893,"about_ca_topic_score_gemma":0.0041622757,"teacher_disagreement_score":0.002926893,"about_ca_system_score_codex":0.00081925653,"about_ca_system_score_gemma":0.0008704247,"threshold_uncertainty_score":0.005944133},"labels":[],"label_agreement":null},{"id":"W1995314179","doi":"10.1109/jlt.2014.2316732","title":"Staircase Codes With 6% to 33% Overhead","year":2014,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":240,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto; Government of Ontario; Compute Canada","keywords":"Decoding methods; Overhead (engineering); Computer science; Code (set theory); Coding (social sciences); Transmission (telecommunications); Coding gain; Algorithm; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.005793733105844699,"score_gpt":0.23795058775471897,"score_spread":0.23215685464887428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995314179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58388287,0.00062172103,0.3955879,0.00048865227,0.00009900405,0.00028001526,0.0003879009,0.0016886058,0.01696332],"genre_scores_gemma":[0.9286607,0.00015663085,0.06849483,0.000079322395,0.000008055337,0.0000995876,0.00013656818,0.00009302419,0.0022712164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995173,0.00010366902,0.000025385183,0.000043047527,0.00020833751,0.00010213364],"domain_scores_gemma":[0.99703336,0.0011592146,0.00036660198,0.0004951182,0.0008445917,0.000101172634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495811,0.00058435573,0.00022723264,0.0005337511,0.00047389022,0.00065457623,0.0007538882,0.0006601391,0.0027030406],"category_scores_gemma":[0.0039052481,0.00015610168,0.00028522164,0.0006628427,0.00049852306,0.00094256434,0.00039551314,0.00067833305,0.0005709289],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001118469,0.0002435352,0.003800795,0.00037162015,0.000105810774,0.00040793323,0.00023432002,0.72243524,0.1166439,0.07762641,0.003118126,0.07389387],"study_design_scores_gemma":[0.000067736415,0.00038863174,0.00043920075,0.000026843323,0.000041514853,0.0002119121,0.000034188164,0.8810331,0.103420146,0.00843473,0.005866631,0.00003532384],"about_ca_topic_score_codex":0.0029464304,"about_ca_topic_score_gemma":0.004508177,"teacher_disagreement_score":0.0029464304,"about_ca_system_score_codex":0.0012121669,"about_ca_system_score_gemma":0.0015481699,"threshold_uncertainty_score":0.009042561},"labels":[],"label_agreement":null},{"id":"W1995569043","doi":"10.1109/ccece.2012.6334897","title":"Reduced-overhead multicasting of different QoS data classes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Erasure; Computer science; Quality of service; Overhead (engineering); Computer network; Block (permutation group theory); Network packet; Multicast; Erasure code; Block size; Channel (broadcasting); Algorithm; Mathematics; Decoding methods; Computer security","score_opus":0.11832408184493176,"score_gpt":0.34947578927577777,"score_spread":0.231151707430846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995569043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38746685,0.00035696398,0.60709155,0.0007419631,0.00008815657,0.00017514832,0.00006443353,0.00036628466,0.0036486348],"genre_scores_gemma":[0.8580138,0.00013902996,0.1390532,0.00012594218,0.00010218406,0.00009379261,0.00007944363,0.00007294879,0.0023195674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982389,0.00060111313,0.000068709895,0.00018141461,0.0005917449,0.00031806086],"domain_scores_gemma":[0.99032074,0.0066998503,0.00071332464,0.0011914799,0.0007929318,0.00028159353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029823892,0.00074160204,0.00094002404,0.0006029986,0.0009821783,0.0007893528,0.0013591574,0.0012945381,0.0010378753],"category_scores_gemma":[0.011946899,0.00037684978,0.00060585426,0.0005581319,0.0007857756,0.0020290455,0.0016331893,0.0012478384,0.00013504336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013735803,0.00030004384,0.0024093445,0.0002671413,0.00013142843,0.00085469725,0.0006833214,0.7447779,0.063891955,0.07107439,0.0017146642,0.1125215],"study_design_scores_gemma":[0.000038533184,0.00014888494,0.0002686321,0.000008496004,0.00002444096,0.00010777586,0.00006325522,0.9802742,0.008384584,0.009982239,0.000687327,0.000011739321],"about_ca_topic_score_codex":0.0011385005,"about_ca_topic_score_gemma":0.0012301661,"teacher_disagreement_score":0.0029823892,"about_ca_system_score_codex":0.0013681275,"about_ca_system_score_gemma":0.00067067327,"threshold_uncertainty_score":0.015772581},"labels":[],"label_agreement":null},{"id":"W1996287888","doi":"10.1109/bsc.2010.5472942","title":"New stopping criteria for Fountain decoders","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Fountain code; Computer science; Algorithm; Set (abstract data type); Word error rate; Error detection and correction; Error floor; Low-density parity-check code; Speech recognition","score_opus":0.028197470035385995,"score_gpt":0.3347911881548474,"score_spread":0.3065937181194614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996287888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015429428,0.00023731649,0.9823461,0.00009732894,0.000028283384,0.00004102172,0.000026854255,0.00035885497,0.0014348422],"genre_scores_gemma":[0.34569922,0.00033477828,0.6466526,0.00029206078,0.000072155395,0.00022971716,0.00020172587,0.00039389086,0.0061238543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702114,0.0009791495,0.0002984656,0.0002715454,0.0012277019,0.00020202858],"domain_scores_gemma":[0.9892784,0.0064077205,0.0008133104,0.0008270693,0.0022815433,0.00039201335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033694247,0.0008547674,0.0011213805,0.0013183746,0.00080511364,0.0022847794,0.0015598878,0.001851075,0.0012990303],"category_scores_gemma":[0.020096825,0.00045552666,0.0005214727,0.0007162471,0.0018456568,0.002333881,0.0019218178,0.0019925816,0.000712034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083877426,0.00010560513,0.0024564927,0.00031498357,0.000103691615,0.00053291616,0.00086338184,0.25162318,0.062413786,0.4631163,0.0034663812,0.21416453],"study_design_scores_gemma":[0.00004264869,0.0001370259,0.00020260908,0.000040145398,0.000016953543,0.00030285068,0.000038580216,0.8709092,0.040990613,0.08358682,0.0036644232,0.00006816704],"about_ca_topic_score_codex":0.00065462297,"about_ca_topic_score_gemma":0.000848772,"teacher_disagreement_score":0.0033694247,"about_ca_system_score_codex":0.0013999223,"about_ca_system_score_gemma":0.0010583753,"threshold_uncertainty_score":0.017819405},"labels":[],"label_agreement":null},{"id":"W1996804168","doi":"10.1109/bsc.2008.4563216","title":"Successive relaxation for decoding of LDPC codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Belief propagation; Additive white Gaussian noise; Binary number; Error floor; Computer science; Quantization (signal processing); Gaussian; Relaxation (psychology); Mathematics; Channel (broadcasting); Arithmetic; Telecommunications; Physics","score_opus":0.03911459514408671,"score_gpt":0.291403472840777,"score_spread":0.2522888776966903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996804168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015607936,0.00045688802,0.98128915,0.00017872755,0.000026001171,0.000026519765,0.000041666415,0.00012294619,0.0022502868],"genre_scores_gemma":[0.45224887,0.0012803858,0.54168236,0.00014567138,0.00009522572,0.00021624302,0.00027591945,0.00012802759,0.003927327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933606,0.00034063638,0.000020368347,0.00006159096,0.00019182426,0.00004956346],"domain_scores_gemma":[0.9983785,0.0012222197,0.00010919875,0.0001048503,0.00015103555,0.000034058285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011425122,0.0006760319,0.00076567347,0.0003747538,0.0002521641,0.000572876,0.0006466395,0.00077201455,0.0013146832],"category_scores_gemma":[0.0053235507,0.00033909272,0.00066297414,0.00068665843,0.0010075801,0.0006154511,0.00079262035,0.0014892521,0.00033648813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092432565,0.000018088072,0.00016426532,0.00016337217,0.000029722134,0.00007801505,0.0001045164,0.8967122,0.0057381303,0.068181366,0.0006808352,0.028037127],"study_design_scores_gemma":[0.000008701498,0.00002368165,0.000025492474,0.000008161167,0.0000025206182,0.000020753101,0.0000055397973,0.9851372,0.0012596202,0.013051792,0.0004512775,0.0000052065016],"about_ca_topic_score_codex":0.0023275055,"about_ca_topic_score_gemma":0.0012870125,"teacher_disagreement_score":0.0023275055,"about_ca_system_score_codex":0.0007121521,"about_ca_system_score_gemma":0.00085509766,"threshold_uncertainty_score":0.0060423017},"labels":[],"label_agreement":null},{"id":"W1998457119","doi":"10.1109/icc.2004.1312548","title":"Fast length-constrained MAP decoding of variable length coded Markov sequences over noisy channel","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Sequential decoding; List decoding; Algorithm; Markov chain; Directed acyclic graph; Sequence (biology); Mathematics; Parameterized complexity; Markov process; Computer science; Heuristic; Constraint (computer-aided design); Mathematical optimization; Concatenated error correction code; Block code","score_opus":0.015113895998073312,"score_gpt":0.2518160644528165,"score_spread":0.2367021684547432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998457119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03960224,0.00017592388,0.9585976,0.00017761829,0.000013672842,0.00002525952,0.0000671173,0.00022592628,0.0011147286],"genre_scores_gemma":[0.69008046,0.0006799002,0.3049578,0.000069809554,0.00005229641,0.0001272403,0.0003108329,0.00009559185,0.0036260406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949205,0.00019885687,0.000022648124,0.00007591184,0.00014355738,0.000066946806],"domain_scores_gemma":[0.9971921,0.002262166,0.0002006453,0.00012291971,0.00018548642,0.000036785394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007706845,0.00056711864,0.0008165844,0.00044011977,0.00040624107,0.00062609336,0.0005927842,0.000900859,0.0010921115],"category_scores_gemma":[0.0051286533,0.0003798228,0.00034766734,0.0009791198,0.0007304752,0.001283627,0.0008064267,0.00071160664,0.00022920711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020675143,0.000017742504,0.00029073935,0.00009463071,0.000024352688,0.00010400408,0.00007519083,0.9181324,0.004219966,0.02710637,0.0006918902,0.049035948],"study_design_scores_gemma":[0.000009804792,0.000012303443,0.00004308365,0.000004075946,0.0000032938049,0.000020828666,0.0000076514925,0.98924106,0.0019570193,0.008541675,0.0001554704,0.0000036647266],"about_ca_topic_score_codex":0.003936198,"about_ca_topic_score_gemma":0.0030530726,"teacher_disagreement_score":0.003936198,"about_ca_system_score_codex":0.0006586199,"about_ca_system_score_gemma":0.0017130148,"threshold_uncertainty_score":0.007826567},"labels":[],"label_agreement":null},{"id":"W1998593453","doi":"10.1016/j.procs.2013.09.060","title":"AID: An Energy Efficient Decoding Scheme for LDPC Codes in Wireless Body Area Sensor Networks","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Low-density parity-check code; Computer science; Decoding methods; Energy consumption; Wireless; Algorithm; Bit error rate; Code (set theory); Power (physics); Real-time computing; Telecommunications; Electrical engineering","score_opus":0.016395528451132207,"score_gpt":0.25507090615628475,"score_spread":0.23867537770515254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998593453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07575808,0.0006981234,0.9171862,0.00020027759,0.00006241663,0.00010277699,0.000103436585,0.0009962727,0.004892344],"genre_scores_gemma":[0.6990443,0.00056549266,0.29506734,0.000113007096,0.000028681903,0.00010440758,0.00014722272,0.00005876121,0.0048708576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997665,0.00006284117,0.000011549693,0.000028731056,0.000105823405,0.000024505842],"domain_scores_gemma":[0.999716,0.00010419885,0.000034064713,0.000047578902,0.00008394472,0.000014183448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028557185,0.00033528398,0.0002742491,0.00032336125,0.0002903421,0.00038895552,0.00038842697,0.00040212262,0.0006180283],"category_scores_gemma":[0.0009562889,0.00010541851,0.00014364452,0.00039046572,0.00042138464,0.00035006463,0.00057356333,0.00044619903,0.00023192093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005860446,0.00014729347,0.0016593967,0.000408971,0.00006338554,0.0003118277,0.00037079398,0.38291892,0.19788939,0.04809378,0.003150246,0.3643999],"study_design_scores_gemma":[0.00003766292,0.00018611464,0.00040604256,0.000026374024,0.000019275454,0.00027422095,0.0000246322,0.90486294,0.0815487,0.008031738,0.004558442,0.000023913064],"about_ca_topic_score_codex":0.00084917364,"about_ca_topic_score_gemma":0.001289679,"teacher_disagreement_score":0.00084917364,"about_ca_system_score_codex":0.0003490933,"about_ca_system_score_gemma":0.00074200355,"threshold_uncertainty_score":0.0025328398},"labels":[],"label_agreement":null},{"id":"W1998696172","doi":"10.1109/vetecf.2010.5594462","title":"A Modified Belief Propagation Algorithm Based on Attenuation of the Extrinsic LLR","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Communications Research Centre Canada","funders":"","keywords":"Belief propagation; Algorithm; Low-density parity-check code; Decoding methods; Logarithm; Sign (mathematics); Computer science; Joint (building); Bit error rate; Sequential decoding; Message passing; Berlekamp–Welch algorithm; Mathematics; Block code; Error floor; Engineering; Parallel computing","score_opus":0.013878507103076348,"score_gpt":0.24417171072115118,"score_spread":0.23029320361807484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998696172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002867243,0.000114128416,0.9960043,0.00010731571,0.000054753877,0.000021715128,0.000019489313,0.00030309838,0.000508004],"genre_scores_gemma":[0.13402697,0.00043684104,0.86019284,0.00026387093,0.0001650714,0.00013432257,0.00017671936,0.0001365941,0.0044668573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879324,0.0002294219,0.00006341387,0.00020411747,0.0006396266,0.00007013461],"domain_scores_gemma":[0.9978125,0.00086853676,0.00014101245,0.00029487614,0.00082602387,0.000057085184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136176,0.0007958072,0.00087109255,0.0008465891,0.00035471373,0.0008816633,0.0017906398,0.0011973674,0.0014701358],"category_scores_gemma":[0.0055789305,0.00042930813,0.000514191,0.00086662447,0.0006035935,0.0017186169,0.0007639177,0.001848198,0.0010265602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032936677,0.00015224305,0.0013061143,0.00022055513,0.0001686941,0.00015395659,0.00014315775,0.19054316,0.039634123,0.021903994,0.0037336,0.7417111],"study_design_scores_gemma":[0.00004870717,0.000078775345,0.000335889,0.000015645632,0.0000467205,0.00017200048,0.000010113262,0.97481966,0.015485714,0.0049250918,0.004029811,0.00003187602],"about_ca_topic_score_codex":0.0029135523,"about_ca_topic_score_gemma":0.0032947047,"teacher_disagreement_score":0.0029135523,"about_ca_system_score_codex":0.0005556089,"about_ca_system_score_gemma":0.0010883766,"threshold_uncertainty_score":0.0060086846},"labels":[],"label_agreement":null},{"id":"W1998929580","doi":"10.1109/tcomm.2009.11.070095","title":"On the design of raptor codes for binary-input gaussian channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Raptor code; Computer science; EXIT chart; Additive white Gaussian noise; Binary number; Channel (broadcasting); Forward error correction; Decoding methods; Turbo code; Code (set theory); Algorithm; Binary code; Telecommunications; Concatenated error correction code; Block code; Mathematics; Arithmetic","score_opus":0.07119583108889162,"score_gpt":0.3137383782324997,"score_spread":0.24254254714360812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998929580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014057249,0.00097186636,0.98128223,0.00015189481,0.000036294314,0.00004724633,0.000043335418,0.00019392325,0.003215986],"genre_scores_gemma":[0.41916272,0.0028659995,0.574006,0.00021606388,0.00017229418,0.00019404014,0.0001740834,0.0001321334,0.0030767177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979964,0.0011261333,0.000075874756,0.00014391443,0.0005390251,0.00011858361],"domain_scores_gemma":[0.9946938,0.0038908322,0.00040749388,0.00023103818,0.0007065583,0.00007014006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027821867,0.0009386655,0.0007349209,0.00091976003,0.00045384394,0.0010057603,0.00060162257,0.0009690386,0.0010121174],"category_scores_gemma":[0.008923647,0.00041357544,0.0004081046,0.00086972245,0.0010136232,0.0012232991,0.0007639636,0.0008949162,0.00043022435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040661785,0.000055506796,0.0008900665,0.00047347238,0.00008357037,0.00031171727,0.00037725747,0.68877846,0.013673749,0.14402501,0.002406799,0.14851777],"study_design_scores_gemma":[0.000032372336,0.00019923078,0.00014203189,0.00008644172,0.000023785922,0.00032276203,0.00004219677,0.9375989,0.0139094265,0.043369748,0.0042342497,0.00003898832],"about_ca_topic_score_codex":0.00052142923,"about_ca_topic_score_gemma":0.0004930287,"teacher_disagreement_score":0.0027821867,"about_ca_system_score_codex":0.00049064547,"about_ca_system_score_gemma":0.0007790561,"threshold_uncertainty_score":0.014713764},"labels":[],"label_agreement":null},{"id":"W1999589899","doi":"10.1109/icc.2004.1312525","title":"On construction of rate-compatible low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Turbo code; Puncturing; Block code; Raptor code; Computer science; Serial concatenated convolutional codes; Linear code; Hybrid automatic repeat request; Code rate; Algorithm; Concatenated error correction code; Code (set theory); Mathematics; Theoretical computer science; Decoding methods; Telecommunications; Programming language; Transmission (telecommunications)","score_opus":0.01352686782819135,"score_gpt":0.2514271152527381,"score_spread":0.23790024742454674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999589899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04049613,0.00028631286,0.9555781,0.00011459195,0.000024388472,0.00007038776,0.000061162,0.00014923302,0.0032197789],"genre_scores_gemma":[0.4205505,0.00079013454,0.5758363,0.000103980004,0.000056669138,0.0002398232,0.0002491917,0.0000955049,0.0020779725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.00038713685,0.000058662157,0.00012348768,0.00043701765,0.00009199186],"domain_scores_gemma":[0.9983297,0.0008160528,0.0001857788,0.00042280904,0.00018537775,0.000060220726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017720036,0.0003732138,0.00042663387,0.0007122752,0.0005974068,0.00063297636,0.00072001485,0.0005065664,0.0007751782],"category_scores_gemma":[0.0041362024,0.00036133593,0.00059972383,0.00050674315,0.0011816939,0.00086635695,0.0011534343,0.00096234464,0.00032518155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119955,0.000046218818,0.0008665933,0.00020448475,0.00002221769,0.00028874574,0.00026966602,0.11522134,0.026895603,0.80302685,0.00069619785,0.05234215],"study_design_scores_gemma":[0.00007446452,0.0002723708,0.0005367252,0.00010385908,0.00003285646,0.0007523017,0.000065846325,0.6201935,0.06841347,0.2947469,0.014732054,0.00007567331],"about_ca_topic_score_codex":0.00034788216,"about_ca_topic_score_gemma":0.0002625628,"teacher_disagreement_score":0.0017720036,"about_ca_system_score_codex":0.0004901208,"about_ca_system_score_gemma":0.0008244833,"threshold_uncertainty_score":0.00937134},"labels":[],"label_agreement":null},{"id":"W1999735975","doi":"10.1049/ip-cds:20045113","title":"Low-power configurable and generic shift register hardware realisations for convolutional encoders and decoders","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Circuits Devices and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Shift register; Encoder; Computer science; Decoding methods; Convolutional code; Computer hardware; Dissipation; Power (physics); Field-programmable gate array; Embedded system; Electronic engineering; Algorithm; Engineering; Chip","score_opus":0.024038300938761838,"score_gpt":0.2416867537577772,"score_spread":0.21764845281901538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999735975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15717362,0.0014831767,0.8272852,0.00017844747,0.00010236945,0.00014086462,0.00020801096,0.003323161,0.010105194],"genre_scores_gemma":[0.68985856,0.00044515278,0.30397055,0.00008380246,0.00004448907,0.00010708025,0.00019535112,0.00014754008,0.0051476145],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981076,0.000046457568,0.000016328806,0.000035189623,0.0000685111,0.000022732545],"domain_scores_gemma":[0.99975246,0.00007138968,0.00005261079,0.0000814604,0.00003188837,0.00001016168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016371351,0.00055877515,0.00017737267,0.00033682818,0.00019298506,0.00042873167,0.0007423709,0.00038653405,0.0031791166],"category_scores_gemma":[0.0006634437,0.00020924328,0.00017301575,0.00035322,0.00026004954,0.0006395409,0.00022701175,0.00036605404,0.0005182217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006645754,0.000107809785,0.0012055513,0.0004557543,0.00005050317,0.0004590856,0.00015350577,0.060719974,0.45532107,0.052654244,0.003507879,0.42470014],"study_design_scores_gemma":[0.00018380165,0.0010848591,0.002725362,0.0001028048,0.00010374103,0.0026356445,0.00008694629,0.33581164,0.60048044,0.020499513,0.036207322,0.00007799666],"about_ca_topic_score_codex":0.00018097201,"about_ca_topic_score_gemma":0.0007394658,"teacher_disagreement_score":0.0031791166,"about_ca_system_score_codex":0.00029432002,"about_ca_system_score_gemma":0.00019898893,"threshold_uncertainty_score":0.010635138},"labels":[],"label_agreement":null},{"id":"W1999977780","doi":"10.1109/tit.2015.2421520","title":"Energy Consumption of VLSI Decoders","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Energy consumption; Very-large-scale integration; Computer science; Decoding methods; Energy (signal processing); Electronic engineering; Embedded system; Algorithm; Electrical engineering; Mathematics; Engineering; Statistics","score_opus":0.02388982087331856,"score_gpt":0.2543369816320384,"score_spread":0.23044716075871982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999977780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43251207,0.003217649,0.5080892,0.0012147165,0.00021814171,0.000088141256,0.00079495326,0.0025549957,0.05131018],"genre_scores_gemma":[0.9533714,0.0008008153,0.027801951,0.00020075195,0.0000260964,0.00005086106,0.00041158247,0.00023242793,0.01710411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930775,0.000107864245,0.00003564313,0.000123748,0.00031135418,0.000113596776],"domain_scores_gemma":[0.9992931,0.00038296563,0.00003772348,0.00013520973,0.00012979527,0.000021078553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034918552,0.0004988154,0.00053209614,0.00046106032,0.0004374658,0.0012488521,0.0010483464,0.0008226654,0.0059180525],"category_scores_gemma":[0.0027718882,0.0003301842,0.00041861366,0.0010196156,0.0003742891,0.0015596264,0.0005146941,0.0003699663,0.001258287],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007757994,0.00008606087,0.0024031897,0.0002776091,0.000105363666,0.000417388,0.00014198487,0.6426077,0.10321294,0.088446796,0.0049029225,0.15662226],"study_design_scores_gemma":[0.000031563763,0.0002361859,0.0015278189,0.000027000493,0.00006434735,0.00045414452,0.00007342617,0.9052806,0.05998189,0.021904513,0.010384849,0.000033599965],"about_ca_topic_score_codex":0.0015939736,"about_ca_topic_score_gemma":0.0019946755,"teacher_disagreement_score":0.0059180525,"about_ca_system_score_codex":0.0015764004,"about_ca_system_score_gemma":0.00089955184,"threshold_uncertainty_score":0.019797862},"labels":[],"label_agreement":null},{"id":"W2000494984","doi":"10.1007/s11432-010-4152-0","title":"Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth","year":2011,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Circulant matrix; Low-density parity-check code; Block code; Permutation (music); Permutation matrix; Mathematics; Random permutation; Block (permutation group theory); Turbo code; Algorithm; Discrete mathematics; Combinatorics; Decoding methods; Computer science","score_opus":0.037794614096879564,"score_gpt":0.2891319759930405,"score_spread":0.25133736189616096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000494984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11913241,0.00041531646,0.86479324,0.0006945544,0.000104918356,0.00014687594,0.00034721548,0.0007546338,0.013610745],"genre_scores_gemma":[0.6675,0.000433875,0.32397115,0.00022568915,0.00008293318,0.00033395214,0.0006372995,0.00013075932,0.006684408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994355,0.00013907209,0.000025373325,0.00006444758,0.00025729885,0.00007820522],"domain_scores_gemma":[0.99848276,0.0008310541,0.00009557427,0.00027465672,0.00024239061,0.00007357393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048179063,0.00046198885,0.0005391655,0.00076576206,0.0006946361,0.00078870996,0.0008311713,0.0006309718,0.002101734],"category_scores_gemma":[0.0023944187,0.00029478926,0.0005280267,0.0006670379,0.00077763456,0.001010699,0.0017629612,0.0010814731,0.0005529391],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042900213,0.00015962569,0.0023271572,0.00044439087,0.00004790319,0.00047378367,0.00043413026,0.096460976,0.079788424,0.6929406,0.0077288947,0.118765086],"study_design_scores_gemma":[0.000117494754,0.00019778356,0.0008549984,0.00005150515,0.000041076102,0.00046106946,0.00005549418,0.75737655,0.024953078,0.20801666,0.0078104306,0.000063864274],"about_ca_topic_score_codex":0.0009930488,"about_ca_topic_score_gemma":0.0016905473,"teacher_disagreement_score":0.002101734,"about_ca_system_score_codex":0.00078453694,"about_ca_system_score_gemma":0.0016412922,"threshold_uncertainty_score":0.007030964},"labels":[],"label_agreement":null},{"id":"W2000901063","doi":"10.1109/lcomm.2011.122211.111737","title":"Efficient Stochastic Decoding of Non-Binary LDPC Codes with Degree-Two Variable Nodes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Degree (music); Algorithm; Binary number; Node (physics); Variable (mathematics); Computer science; List decoding; Mathematics; Block code; Concatenated error correction code; Arithmetic","score_opus":0.04324977171945868,"score_gpt":0.29854484533774245,"score_spread":0.25529507361828374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000901063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629249,0.00016431585,0.9210915,0.00014655085,0.00002915764,0.000034563727,0.0000759429,0.00031919905,0.0018461787],"genre_scores_gemma":[0.5639768,0.00023500038,0.4316471,0.0001283028,0.000035135094,0.000072534924,0.00029638037,0.00010834246,0.0035003636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.00031551658,0.000050162973,0.0000753455,0.00036166978,0.000092304675],"domain_scores_gemma":[0.99888486,0.00046491277,0.0001437715,0.00028042533,0.00018201827,0.000044056444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819632,0.00048056306,0.0006053976,0.00026901966,0.0002754823,0.00061987917,0.00082930987,0.0005150835,0.00074091856],"category_scores_gemma":[0.002359261,0.00024690756,0.00030928725,0.00048696413,0.00053527235,0.00075785565,0.0009381308,0.0006124597,0.00027874307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000506412,0.000090651396,0.0010132786,0.00020561046,0.00008893661,0.00015523979,0.00016744925,0.7061461,0.062147044,0.09431277,0.001496104,0.13367036],"study_design_scores_gemma":[0.000016898986,0.000039148552,0.00013067239,0.000004718757,0.000004988547,0.00004328501,0.000005661839,0.98245424,0.011061936,0.0057032458,0.00052734977,0.000007802012],"about_ca_topic_score_codex":0.0012212064,"about_ca_topic_score_gemma":0.0031119594,"teacher_disagreement_score":0.0012212064,"about_ca_system_score_codex":0.0004529493,"about_ca_system_score_gemma":0.0015215077,"threshold_uncertainty_score":0.0036066175},"labels":[],"label_agreement":null},{"id":"W2001052502","doi":"10.1109/ew.2010.5483537","title":"Reduced-latency stochastic decoding of LDPC codes over GF(q)","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Western Canada Research Grid","keywords":"Low-density parity-check code; Decoding methods; Computer science; Sequential decoding; List decoding; Algorithm; Binary number; Berlekamp–Welch algorithm; Serial concatenated convolutional codes; Low latency (capital markets); Error floor; Concatenated error correction code; Theoretical computer science; Block code; Mathematics; Arithmetic; Computer network","score_opus":0.013817908742297344,"score_gpt":0.2793023492242658,"score_spread":0.26548444048196845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001052502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09140601,0.0003331725,0.9032457,0.00016714235,0.00004336647,0.000061479266,0.00011528517,0.001307245,0.003320588],"genre_scores_gemma":[0.7698668,0.00041473267,0.22417887,0.00012995882,0.000037673657,0.0000622662,0.00031173715,0.000095767784,0.0049022962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963725,0.00006688346,0.000025311978,0.00004518704,0.00018190486,0.000043561595],"domain_scores_gemma":[0.9991351,0.00037219707,0.00011851574,0.00014477999,0.0002054082,0.000024032028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032970044,0.0002926359,0.00029688462,0.0002952793,0.00033771692,0.00043125518,0.0004542029,0.00034451947,0.0008113907],"category_scores_gemma":[0.0017725535,0.0001280597,0.00019170054,0.0005066562,0.00032270837,0.0006060232,0.00032734047,0.0004214905,0.00031861194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054780464,0.00013669592,0.0024418598,0.0003817999,0.000096383556,0.00035750063,0.00026551614,0.2806686,0.27716532,0.08134742,0.0024219444,0.35416913],"study_design_scores_gemma":[0.000039921015,0.00018034724,0.0006118444,0.000024707444,0.000024328383,0.00034454706,0.000023663904,0.75960296,0.2204132,0.014049046,0.004654738,0.00003067212],"about_ca_topic_score_codex":0.0018707062,"about_ca_topic_score_gemma":0.004311479,"teacher_disagreement_score":0.0018707062,"about_ca_system_score_codex":0.00043953213,"about_ca_system_score_gemma":0.0012523683,"threshold_uncertainty_score":0.0037196279},"labels":[],"label_agreement":null},{"id":"W2002647491","doi":"10.1109/icc.2009.5199493","title":"Stochastic Decoding of LDPC Codes over GF(q)","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Algorithm; Throughput; Concatenated error correction code; Serial concatenated convolutional codes; Code (set theory); Computation; Error detection and correction; Computational complexity theory; Parallel computing; Theoretical computer science; Block code; Telecommunications; Wireless","score_opus":0.01592934303909344,"score_gpt":0.28442974979469837,"score_spread":0.26850040675560494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002647491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09369882,0.00022303045,0.90107393,0.00016599287,0.000038962746,0.000067890374,0.00010284757,0.0007619577,0.0038666525],"genre_scores_gemma":[0.71395004,0.00038421724,0.28045702,0.00013332922,0.00003989811,0.0000876266,0.0002349316,0.00009907487,0.0046137436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992593,0.00018292158,0.00004196429,0.000072008675,0.0003778548,0.000066000015],"domain_scores_gemma":[0.998461,0.0007713771,0.0002053211,0.00019115268,0.00033315626,0.000037995003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056196837,0.00031365262,0.00039282948,0.0004224674,0.00045095818,0.0005649921,0.00039863357,0.000384291,0.0007225096],"category_scores_gemma":[0.0031811208,0.00014311528,0.00020120089,0.00067203573,0.000604989,0.0004869943,0.00045294128,0.00044935508,0.00028158913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050418766,0.00014601187,0.0026032669,0.0004155839,0.000097102864,0.00043829993,0.00028040574,0.3525376,0.15892215,0.19304276,0.0025669981,0.28844568],"study_design_scores_gemma":[0.00004289194,0.00011179948,0.00052519416,0.000031504376,0.00001474582,0.0002784039,0.000017687327,0.8787974,0.08694339,0.029652584,0.0035601796,0.000024225974],"about_ca_topic_score_codex":0.0021362721,"about_ca_topic_score_gemma":0.004339647,"teacher_disagreement_score":0.0021362721,"about_ca_system_score_codex":0.00068366685,"about_ca_system_score_gemma":0.0015237225,"threshold_uncertainty_score":0.004960358},"labels":[],"label_agreement":null},{"id":"W2004015368","doi":"10.1016/j.vlsi.2010.05.001","title":"Scaling of analog LDPC decoders in sub-100 nm CMOS processes","year":2010,"lang":"en","type":"article","venue":"Integration","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Decoding methods; CMOS; Scaling; Transistor; Electronic engineering; Computer science; Leakage (economics); Low-density parity-check code; Sizing; Implementation; Error detection and correction; Analog computer; Computer engineering; Voltage; Algorithm; Electrical engineering; Engineering; Mathematics","score_opus":0.013730571300221178,"score_gpt":0.2799674373427768,"score_spread":0.2662368660425556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004015368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89795905,0.0037185994,0.06635781,0.0005684063,0.00018642303,0.0000875073,0.00044434154,0.0018545935,0.028823258],"genre_scores_gemma":[0.97894317,0.00069065986,0.015747825,0.00008285014,0.000026540338,0.000020661024,0.00012150676,0.000054871427,0.0043119816],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997485,0.000022901922,0.000011350147,0.00004428587,0.00014771476,0.000025260993],"domain_scores_gemma":[0.9994561,0.00021715112,0.00006661761,0.00005906251,0.0001692638,0.000031781354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015628204,0.0003496115,0.0001825653,0.00042420553,0.00022319409,0.0006951351,0.00039859212,0.00037469916,0.002957976],"category_scores_gemma":[0.001269084,0.00013952321,0.000097437376,0.0004968089,0.00019685309,0.00076126197,0.00024168724,0.00026241966,0.0005322519],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005888486,0.00028840927,0.004092777,0.00040818527,0.00006431004,0.0003490751,0.00037488277,0.053167433,0.79537916,0.013640067,0.0022510027,0.12939583],"study_design_scores_gemma":[0.000082587474,0.0007920881,0.009250448,0.000089355584,0.00011975336,0.0004832462,0.00018256898,0.28036252,0.6837073,0.0047477493,0.020137839,0.00004454622],"about_ca_topic_score_codex":0.0017626305,"about_ca_topic_score_gemma":0.0036229468,"teacher_disagreement_score":0.002957976,"about_ca_system_score_codex":0.00089945237,"about_ca_system_score_gemma":0.00042316027,"threshold_uncertainty_score":0.009895384},"labels":[],"label_agreement":null},{"id":"W2004295395","doi":"10.1109/tbc.2012.2197449","title":"Application of Raptor Coding With Power Adaptation to DVB Multiple Access Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decoding methods; Channel (broadcasting); Digital Video Broadcasting; Computer network; Transmitter power output; Channel state information; DVB-T; Coding (social sciences); Telecommunications; Real-time computing; Transmitter; Electronic engineering; Orthogonal frequency-division multiplexing; Wireless; Engineering; Mathematics","score_opus":0.04333763722272177,"score_gpt":0.2922334219272431,"score_spread":0.24889578470452134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004295395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013884,0.00069116324,0.98042583,0.00014827991,0.000046315912,0.000052811218,0.00001055883,0.00027632757,0.004464771],"genre_scores_gemma":[0.51666445,0.0013185781,0.47786894,0.0002244599,0.00014107808,0.00012736484,0.000034171873,0.00007247569,0.0035483858],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927384,0.0003527644,0.00002136321,0.000093296694,0.00020987754,0.00004886875],"domain_scores_gemma":[0.99875164,0.0007323796,0.00010909235,0.00020990234,0.00017206049,0.000024981433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555167,0.0005818939,0.00047769738,0.0005363983,0.00037684405,0.0004783668,0.0008890091,0.0006734684,0.0007695939],"category_scores_gemma":[0.002346751,0.00024718596,0.00034401374,0.00057163544,0.00075945957,0.00064405595,0.00075437943,0.00076230406,0.00036704243],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002474376,0.00013704594,0.0010654436,0.00029350584,0.0001079547,0.0007091481,0.00036949862,0.4039342,0.07454709,0.0840105,0.0016886505,0.43288946],"study_design_scores_gemma":[0.0000246201,0.00022473828,0.00027615324,0.000031358806,0.00004328662,0.00074294425,0.000027708564,0.94208103,0.03138121,0.016912324,0.008216137,0.00003833827],"about_ca_topic_score_codex":0.0005400978,"about_ca_topic_score_gemma":0.0007165038,"teacher_disagreement_score":0.0008890091,"about_ca_system_score_codex":0.00025230192,"about_ca_system_score_gemma":0.00031302232,"threshold_uncertainty_score":0.0034667253},"labels":[],"label_agreement":null},{"id":"W2004601380","doi":"10.1109/cwit.2009.5069514","title":"Dynamics of analog decoders for different message representation domains","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Representation (politics); Decoding methods; Message passing; Domain (mathematical analysis); Theoretical computer science; Contrast (vision); Algorithm; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.01976601256768306,"score_gpt":0.3080409292948543,"score_spread":0.28827491672717126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004601380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22340256,0.0003507731,0.74757457,0.00057771517,0.00007875,0.00006917415,0.00010630202,0.0002025723,0.027637634],"genre_scores_gemma":[0.9370978,0.000377984,0.046142448,0.00014360041,0.000031412015,0.00008474921,0.000089026216,0.00007542713,0.015957573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.0000521264,0.000011017446,0.000042984786,0.000097013966,0.000042588414],"domain_scores_gemma":[0.9990977,0.00049642054,0.00013647515,0.00007994556,0.00014077043,0.000048719532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039519544,0.0003470929,0.0003501978,0.00045643334,0.00042471572,0.0009943529,0.0005317656,0.00081107684,0.0033693847],"category_scores_gemma":[0.0030814738,0.00026768947,0.00033955337,0.00028168203,0.0010914188,0.0016124547,0.00074035005,0.0010161075,0.00040293147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000921838,0.000056195946,0.00074270356,0.0000730909,0.000019535,0.0002416492,0.000379253,0.2960636,0.024325095,0.6629893,0.0006267706,0.0143906],"study_design_scores_gemma":[0.000018866183,0.000029741333,0.00018208267,0.000014883118,0.00000921406,0.00010233959,0.000053598877,0.9273501,0.006731248,0.0641792,0.0013089384,0.000019734629],"about_ca_topic_score_codex":0.0016090147,"about_ca_topic_score_gemma":0.0012275366,"teacher_disagreement_score":0.0033693847,"about_ca_system_score_codex":0.00090768846,"about_ca_system_score_gemma":0.0005106815,"threshold_uncertainty_score":0.011271715},"labels":[],"label_agreement":null},{"id":"W2004641516","doi":"10.1049/iet-com.2013.0857","title":"Quasi‐cyclic low‐density parity‐check codes based on finite set systems","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Parity (physics); Computer science; Mathematics; Algorithm; Decoding methods; Physics","score_opus":0.04603468108576836,"score_gpt":0.30591305968357846,"score_spread":0.2598783785978101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004641516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28937677,0.00058027136,0.7008915,0.00018998297,0.000073967974,0.0000742482,0.00019571536,0.00027693732,0.008340686],"genre_scores_gemma":[0.93495274,0.00022426869,0.06344952,0.00005317651,0.000023727367,0.000099430115,0.00012520369,0.000015033365,0.0010568995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956244,0.00012498352,0.000024092298,0.00006624418,0.00016417184,0.00005802892],"domain_scores_gemma":[0.9991922,0.0003841111,0.00011230296,0.00014620775,0.00013257419,0.000032550077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024509942,0.00022425124,0.00026774587,0.00066501874,0.00044179987,0.0005415967,0.00039717372,0.00031340632,0.00074236316],"category_scores_gemma":[0.0014728458,0.00013091753,0.00028742707,0.00067211135,0.00093106757,0.0006302308,0.00059939356,0.0004102302,0.00015244368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022190175,0.00005232391,0.0025477447,0.00022277384,0.000048869577,0.00034818045,0.00036331773,0.34876895,0.042698927,0.5438824,0.0012746337,0.059569895],"study_design_scores_gemma":[0.000029297687,0.00015173003,0.0010863281,0.0000337177,0.000018701872,0.00029481735,0.00004053176,0.872335,0.015929362,0.10689926,0.0031398726,0.000041359053],"about_ca_topic_score_codex":0.0014107031,"about_ca_topic_score_gemma":0.0012008208,"teacher_disagreement_score":0.0014107031,"about_ca_system_score_codex":0.000536108,"about_ca_system_score_gemma":0.00064245093,"threshold_uncertainty_score":0.0038897991},"labels":[],"label_agreement":null},{"id":"W2005241596","doi":"10.1109/bsc.2008.4563211","title":"Raptor codes for hybrid error-erasure channels with memory","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Raptor code; Online codes; Computer science; Tornado code; Fountain code; Erasure; Luby transform code; Forward error correction; Binary erasure channel; Channel (broadcasting); Concatenated error correction code; Computer network; Decoding methods; Algorithm; Block code; Channel capacity","score_opus":0.034273467666992484,"score_gpt":0.2598771045924954,"score_spread":0.22560363692550292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005241596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21946211,0.0052095694,0.76253146,0.0006628472,0.0001241877,0.00012218239,0.00026440623,0.0010446007,0.010578625],"genre_scores_gemma":[0.90036213,0.0015761968,0.09532755,0.00016468954,0.000053325402,0.00014461504,0.00008658052,0.00004665149,0.0022383449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934024,0.0002669829,0.000026404527,0.00006318502,0.00022470232,0.00007850308],"domain_scores_gemma":[0.9950695,0.003206441,0.0005899168,0.0006320918,0.0004565739,0.00004554864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083866407,0.00053501275,0.00056681084,0.0004637,0.00044077434,0.0008208542,0.00062904536,0.0009645848,0.0013073413],"category_scores_gemma":[0.00531464,0.00021681655,0.00029921584,0.0005712441,0.00091357116,0.0011816736,0.00057534635,0.00086014875,0.0002999007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044796546,0.00006556199,0.00097061694,0.00043224264,0.000101801634,0.000679618,0.00046976,0.6392427,0.032794528,0.24794516,0.0028311098,0.07401892],"study_design_scores_gemma":[0.00005126623,0.00015105939,0.00039180665,0.00006319972,0.00004160564,0.0006347803,0.000049373535,0.92874646,0.019963529,0.044534378,0.0053215693,0.000050983002],"about_ca_topic_score_codex":0.0008636555,"about_ca_topic_score_gemma":0.0009080928,"teacher_disagreement_score":0.0013073413,"about_ca_system_score_codex":0.0005016723,"about_ca_system_score_gemma":0.00056687463,"threshold_uncertainty_score":0.0044353604},"labels":[],"label_agreement":null},{"id":"W2005574940","doi":"10.1109/lcomm.2015.2407878","title":"Fountain Code Design for the Y-Network","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Western Canada Research Grid","keywords":"Fountain code; Fountain; Computer science; Factorization; Code (set theory); Raptor code; Polynomial; Degree (music); Luby transform code; Theoretical computer science; Degree distribution; Algorithm; Decoding methods; Linear code; Mathematics; Block code; Complex network; Programming language","score_opus":0.17796921615290862,"score_gpt":0.3433045544443416,"score_spread":0.165335338291433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005574940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012549386,0.0001496239,0.9845732,0.00007683175,0.000023385122,0.00003901323,0.000017074055,0.00026542586,0.002306084],"genre_scores_gemma":[0.5465861,0.00037684286,0.44820854,0.0001526633,0.000053173422,0.00014206271,0.00005938343,0.000085614534,0.004335681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972934,0.000077624776,0.000011898912,0.000053040963,0.0000863013,0.00004177351],"domain_scores_gemma":[0.99960476,0.00008872127,0.00006928643,0.00006758704,0.00014522843,0.000024456727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031750245,0.00042977696,0.0002873446,0.00037510585,0.0005953636,0.00050951866,0.0005510243,0.00059806113,0.0015899923],"category_scores_gemma":[0.0010694142,0.00015585717,0.00024394259,0.00034833452,0.0004751699,0.0008846637,0.00047197836,0.00064533984,0.000695775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005645345,0.000093785646,0.0010167907,0.00030137663,0.00007051094,0.0004730796,0.0004069479,0.3180018,0.16380009,0.20552862,0.0042668423,0.30547562],"study_design_scores_gemma":[0.000049921488,0.0003465833,0.00028762154,0.00006045843,0.000026620473,0.00072492886,0.000058874193,0.862321,0.09219604,0.025852142,0.01802581,0.000049909206],"about_ca_topic_score_codex":0.0015743363,"about_ca_topic_score_gemma":0.0019250619,"teacher_disagreement_score":0.0015899923,"about_ca_system_score_codex":0.0007118434,"about_ca_system_score_gemma":0.0008030839,"threshold_uncertainty_score":0.0053189993},"labels":[],"label_agreement":null},{"id":"W2006142981","doi":"10.1109/lcomm.2013.111113.131881","title":"Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Error floor; Quantization (signal processing); Computer science; Forward error correction; Error detection and correction; Decoding methods; Algorithm; Turbo code; Theoretical computer science","score_opus":0.08758308685031735,"score_gpt":0.3365748962485317,"score_spread":0.24899180939821436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006142981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036414,0.00054827915,0.95861775,0.000182684,0.000089631205,0.00006515631,0.000062835126,0.0009672244,0.0030523548],"genre_scores_gemma":[0.57101184,0.0004282437,0.42486736,0.00013492709,0.000045287423,0.00008552989,0.00009955023,0.00006692147,0.003260259],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995333,0.00009266501,0.000030244903,0.000055749875,0.00024216111,0.000045923807],"domain_scores_gemma":[0.9991165,0.00034386574,0.00009496846,0.00019469991,0.0002126133,0.0000374365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035851542,0.00046904627,0.00046855537,0.00047588584,0.00042817008,0.0005579069,0.0007669627,0.00051839143,0.0014120921],"category_scores_gemma":[0.0017729349,0.00017808612,0.00019791682,0.0004837036,0.0006206281,0.00069148815,0.0009758361,0.00095578795,0.00038286962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040488236,0.00012856648,0.0013419696,0.00041039815,0.000038638234,0.00034237246,0.00024993584,0.114350274,0.39899898,0.116284646,0.002733321,0.36471605],"study_design_scores_gemma":[0.000039437466,0.00023271513,0.00047459188,0.000049062044,0.000019207971,0.00030678845,0.000025602701,0.7544463,0.223158,0.016016401,0.0051796255,0.000052341657],"about_ca_topic_score_codex":0.0005690787,"about_ca_topic_score_gemma":0.0009427547,"teacher_disagreement_score":0.0014120921,"about_ca_system_score_codex":0.00037866586,"about_ca_system_score_gemma":0.0006181414,"threshold_uncertainty_score":0.0047239065},"labels":[],"label_agreement":null},{"id":"W2006167292","doi":"10.1109/lcomm.2012.042312.120382","title":"Low-Complexity Channel-Likelihood Estimation for Non-Binary Codes and QAM","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Quadrature amplitude modulation; QAM; Binary number; Algorithm; Channel (broadcasting); Low-density parity-check code; Decoding methods; Computer science; Mathematics; Bit error rate; Telecommunications; Arithmetic","score_opus":0.05337486829965723,"score_gpt":0.315533758078992,"score_spread":0.26215888977933477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006167292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015820155,0.000104729064,0.9977197,0.00003572478,0.00001323919,0.000009822938,0.00001243128,0.0000884433,0.0004338565],"genre_scores_gemma":[0.14787559,0.0004256096,0.84892756,0.00006564358,0.000059210226,0.00013550022,0.0001340482,0.00013106629,0.0022457202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931335,0.0002887062,0.000027614968,0.000051951185,0.00027902235,0.000039383838],"domain_scores_gemma":[0.99861526,0.0009803247,0.000087644534,0.0001609696,0.00013157315,0.000024216317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011186694,0.00065198273,0.0005931508,0.0005610944,0.00040121266,0.0011657764,0.000840275,0.0007602742,0.0024928618],"category_scores_gemma":[0.006259747,0.0003378718,0.00036084777,0.0006150667,0.0007039755,0.0014595537,0.0009877435,0.0011657365,0.0010595265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020894162,0.00005085801,0.0009473867,0.0002977706,0.000055646204,0.00016865156,0.0002015644,0.5228605,0.013552624,0.25733277,0.0018852025,0.20243806],"study_design_scores_gemma":[0.0000071830223,0.000018663424,0.00010412244,0.0000131875195,0.00000522735,0.00008067864,0.00000823598,0.9713021,0.0033867497,0.023717353,0.001343167,0.000013276495],"about_ca_topic_score_codex":0.0008254279,"about_ca_topic_score_gemma":0.001280276,"teacher_disagreement_score":0.0024928618,"about_ca_system_score_codex":0.00062746013,"about_ca_system_score_gemma":0.00090434327,"threshold_uncertainty_score":0.008339524},"labels":[],"label_agreement":null},{"id":"W2007380483","doi":"10.1109/tcomm.2012.072612.110143","title":"On Raptor Code Design for Inactivation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Raptor code; Degree (music); Computer science; Fountain code; Set (abstract data type); Code (set theory); Block (permutation group theory); Block code; Degree distribution; Algorithm; Theoretical computer science; Mathematics; Linear code; Combinatorics; Physics","score_opus":0.12737220143933028,"score_gpt":0.3467728440012235,"score_spread":0.2194006425618932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007380483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009615537,0.00018780364,0.98658943,0.00010599437,0.000020643974,0.00002707261,0.000026780435,0.00014226678,0.0032843638],"genre_scores_gemma":[0.5791531,0.0009901287,0.41376728,0.0003568894,0.00014583736,0.00025189118,0.00012280446,0.00012717009,0.005084907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998966,0.000417176,0.000040071987,0.000112349306,0.00038522726,0.00007929556],"domain_scores_gemma":[0.99785954,0.0011398634,0.0002100964,0.00029940737,0.00044453237,0.000046598652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200556,0.000665291,0.0004060419,0.0006063972,0.0003319919,0.00070521235,0.0005961813,0.00082998455,0.0011885943],"category_scores_gemma":[0.004522973,0.00023268882,0.000269436,0.00062668405,0.0008943924,0.0010325664,0.00070179114,0.0009825212,0.00070481864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016686815,0.00004416488,0.00060175033,0.00018337819,0.000028277114,0.0001889058,0.00028557103,0.3881339,0.049532894,0.46374893,0.002476027,0.09460925],"study_design_scores_gemma":[0.000017188822,0.00013851965,0.00013263068,0.00003109046,0.000010899258,0.00029432506,0.000014954829,0.9147902,0.023105241,0.0571403,0.0042969454,0.000027695185],"about_ca_topic_score_codex":0.00049878994,"about_ca_topic_score_gemma":0.0005505313,"teacher_disagreement_score":0.0011885943,"about_ca_system_score_codex":0.00067448965,"about_ca_system_score_gemma":0.000755501,"threshold_uncertainty_score":0.0053946376},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018091293421843995,"score_gpt":0.2731903225689815,"score_spread":0.2550990291471375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008209264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061626425,0.00009198643,0.990956,0.000065650514,0.00002000239,0.000112479596,0.00008467312,0.00080134,0.0017052167],"genre_scores_gemma":[0.06771601,0.00011232823,0.92877537,0.00005637627,0.000014783378,0.00033536946,0.00039243326,0.00015642209,0.00244086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.00012855967,0.00005191893,0.00012654868,0.00028142345,0.00008594365],"domain_scores_gemma":[0.99884206,0.00053959043,0.00008461504,0.00015555299,0.00034095184,0.000037276117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059593254,0.0010696016,0.0008843649,0.0021558776,0.0010929159,0.0009883948,0.0014320627,0.000901668,0.004907652],"category_scores_gemma":[0.0035660486,0.0005065604,0.0006906741,0.0013525094,0.0007268812,0.0012541369,0.0016451504,0.0010516995,0.0018347673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031179056,0.00014656442,0.0015674033,0.0004057851,0.00009011197,0.00037304452,0.00049481634,0.26375455,0.025944628,0.07592497,0.007182109,0.6238043],"study_design_scores_gemma":[0.000113696275,0.00007261255,0.00023244639,0.00003960966,0.000028777009,0.00026500324,0.00007077331,0.93442273,0.010987327,0.047379497,0.0063475715,0.000039877857],"about_ca_topic_score_codex":0.0028735623,"about_ca_topic_score_gemma":0.0037148178,"teacher_disagreement_score":0.004907652,"about_ca_system_score_codex":0.0009759659,"about_ca_system_score_gemma":0.0021671546,"threshold_uncertainty_score":0.016417682},"labels":[],"label_agreement":null},{"id":"W2008314255","doi":"10.1109/istc.2014.6955086","title":"On characterization of elementary trapping sets of variable-regular LDPC codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Variable (mathematics); Node (physics); Set (abstract data type); Graph; Characterization (materials science); Code (set theory); Class (philosophy); Simple (philosophy); Tanner graph; Discrete mathematics; Decoding methods; Combinatorics; Parallel computing; Theoretical computer science; Mathematics; Algorithm; Error floor; Statistics; Programming language","score_opus":0.009991899201599373,"score_gpt":0.23467767256056773,"score_spread":0.22468577335896836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008314255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68426317,0.00047217976,0.30048358,0.00024609343,0.00003088866,0.00011276663,0.0005005261,0.00024132112,0.013649525],"genre_scores_gemma":[0.96571577,0.0003585674,0.02932525,0.000110507695,0.000054260563,0.00011544486,0.0005903633,0.00009400346,0.0036358954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948657,0.00008829146,0.00003116171,0.00015433929,0.0001397497,0.00009979309],"domain_scores_gemma":[0.9966888,0.0018801066,0.000576386,0.00025292847,0.00031399442,0.0002877621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038652835,0.0004162159,0.00048333828,0.0016916285,0.00085755705,0.0010150147,0.0008105762,0.0005948322,0.003245482],"category_scores_gemma":[0.0037658326,0.00038353374,0.00067782606,0.0009493523,0.0015133158,0.0017089319,0.0009882225,0.0009958071,0.00027105975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021366593,0.0001408368,0.010105837,0.00029706105,0.000056671306,0.0007461426,0.0011915214,0.084196866,0.026752742,0.8463908,0.0018436261,0.028064264],"study_design_scores_gemma":[0.000047468402,0.00019745124,0.005437141,0.00008642203,0.00005200771,0.0011681515,0.00037998433,0.41737726,0.01117931,0.5585374,0.0054653883,0.00007194902],"about_ca_topic_score_codex":0.00095230015,"about_ca_topic_score_gemma":0.00072440103,"teacher_disagreement_score":0.003245482,"about_ca_system_score_codex":0.00070651696,"about_ca_system_score_gemma":0.0004325855,"threshold_uncertainty_score":0.010857165},"labels":[],"label_agreement":null},{"id":"W2009015308","doi":"10.5539/nct.v2n2p29","title":"A Fast Raptor Codes Decoding Strategy for Real-Time Communication Systems","year":2013,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Computer science; Sequential decoding; List decoding; Algorithm; Raptor code; Berlekamp–Welch algorithm; Scheme (mathematics); Process (computing); Gaussian; Theoretical computer science; Mathematics; Concatenated error correction code; Block code","score_opus":0.025476165173888395,"score_gpt":0.2686175593594082,"score_spread":0.24314139418551978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009015308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037714078,0.00024808533,0.99426794,0.000082829174,0.000026942163,0.000032651642,0.000028210814,0.00032940967,0.0012124154],"genre_scores_gemma":[0.18056414,0.0005945119,0.81480896,0.00013937669,0.000067124514,0.00015988457,0.0001399956,0.000085882064,0.0034401985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00025121932,0.000038483202,0.0000911142,0.0002803022,0.0000630537],"domain_scores_gemma":[0.9991856,0.00027954596,0.000086669774,0.0001838637,0.00024048686,0.000023724837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005666375,0.0011097145,0.00060393615,0.0009590682,0.0006749362,0.000818268,0.00089388154,0.00093400094,0.0015224172],"category_scores_gemma":[0.0017431381,0.00033785927,0.0003998314,0.0008136569,0.00069178833,0.001168123,0.0007271023,0.00088795007,0.0010634298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021988044,0.00007330652,0.00045146092,0.000276941,0.00008495057,0.00029222472,0.00037525652,0.34249264,0.060410555,0.13321993,0.006413525,0.45568922],"study_design_scores_gemma":[0.000042030315,0.00014038324,0.000110807814,0.000032883643,0.000020725556,0.0004354737,0.00003438098,0.9331756,0.03261086,0.024087423,0.009257572,0.000051718882],"about_ca_topic_score_codex":0.0015670343,"about_ca_topic_score_gemma":0.0017412713,"teacher_disagreement_score":0.0015670343,"about_ca_system_score_codex":0.0005007204,"about_ca_system_score_gemma":0.0013064258,"threshold_uncertainty_score":0.005093038},"labels":[],"label_agreement":null},{"id":"W2010344279","doi":"10.1109/icc.2012.6364482","title":"Connecting spatially coupled LDPC code chains","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Code (set theory); Parallel computing; Theoretical computer science; Algorithm; Programming language; Decoding methods","score_opus":0.03010798511094407,"score_gpt":0.28342488037868596,"score_spread":0.25331689526774187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010344279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819464,0.0002860539,0.39995682,0.00022480341,0.00008010825,0.00013240849,0.00016292627,0.00034142393,0.016869111],"genre_scores_gemma":[0.94502705,0.00019519604,0.051676456,0.00006200664,0.000015514512,0.00012871547,0.00012148477,0.00003282888,0.0027407487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997725,0.00007123679,0.000010473971,0.000037241585,0.00008303301,0.000025460382],"domain_scores_gemma":[0.9992907,0.0003032378,0.00009383044,0.00012764895,0.00012972072,0.000054754826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020760718,0.00038101486,0.00029660284,0.0005331491,0.00064874196,0.0006268779,0.0005608102,0.0007922012,0.0017553989],"category_scores_gemma":[0.0014719701,0.00028082638,0.000265828,0.00062589406,0.0007255238,0.0006438065,0.0009865452,0.000530705,0.00034368772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021329694,0.00010655216,0.0017027782,0.00023126397,0.0000851275,0.00072278647,0.00034593325,0.59382355,0.09918131,0.2744105,0.0007792263,0.028397737],"study_design_scores_gemma":[0.000026875954,0.00009553257,0.000365961,0.000025564828,0.000028142826,0.00015427242,0.00004247783,0.9207374,0.019460486,0.056831423,0.0021997523,0.00003217781],"about_ca_topic_score_codex":0.0005558507,"about_ca_topic_score_gemma":0.00082645804,"teacher_disagreement_score":0.0017553989,"about_ca_system_score_codex":0.0003773567,"about_ca_system_score_gemma":0.00044384797,"threshold_uncertainty_score":0.005872369},"labels":[],"label_agreement":null},{"id":"W2010693663","doi":"10.1049/iet-com.2012.0737","title":"Analysis and design of a new fountain codec under belief propagation","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fountain; Codec; Computer science; Telecommunications; Art","score_opus":0.05794702998626518,"score_gpt":0.3086166259596662,"score_spread":0.25066959597340105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010693663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037918247,0.00015268642,0.95863265,0.00025381194,0.00004024453,0.00006711495,0.000041138515,0.00042903534,0.0024650719],"genre_scores_gemma":[0.6963019,0.00018573838,0.2994544,0.00016687902,0.00003782414,0.00014176784,0.000097866316,0.000071380724,0.0035421418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925405,0.00017819199,0.000027942768,0.000111567766,0.00031672866,0.00011145654],"domain_scores_gemma":[0.9981997,0.0008098091,0.00022238638,0.00020500759,0.0004770043,0.00008595438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008301752,0.00057716353,0.0004970912,0.0006117591,0.0005120646,0.00086945447,0.001090803,0.0011968759,0.0010767935],"category_scores_gemma":[0.002997156,0.00029311646,0.00039557347,0.00049196306,0.0010181842,0.0007129126,0.0007195858,0.0010003209,0.00034167283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003353054,0.00007422085,0.0011052965,0.00016735101,0.000087151144,0.00040186272,0.0002498649,0.7434534,0.055557214,0.109063946,0.0018101959,0.08769428],"study_design_scores_gemma":[0.000010897244,0.000042776635,0.000060717142,0.0000058521578,0.0000079321635,0.000059293438,0.0000056680506,0.9873834,0.007023485,0.0047193756,0.00067254616,0.000008090578],"about_ca_topic_score_codex":0.0031275144,"about_ca_topic_score_gemma":0.0031185863,"teacher_disagreement_score":0.0031275144,"about_ca_system_score_codex":0.0012343216,"about_ca_system_score_gemma":0.0016642206,"threshold_uncertainty_score":0.0089556575},"labels":[],"label_agreement":null},{"id":"W2010884120","doi":"10.1109/itw.2011.6089435","title":"Annotated raptor codes","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Raptor code; Computer science; Decoding methods; Encoding (memory); Fountain code; Overhead (engineering); Block code; Theoretical computer science; Benchmark (surveying); Algorithm; Block (permutation group theory); Linear code; Reduction (mathematics); Computational complexity theory; Mathematics; Artificial intelligence; Geography","score_opus":0.045779771110745125,"score_gpt":0.28064906447003096,"score_spread":0.23486929335928583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010884120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01669691,0.0038350865,0.916846,0.000831549,0.0017613481,0.00026083033,0.0018490059,0.003072732,0.054846603],"genre_scores_gemma":[0.2616234,0.0042244806,0.6734119,0.0015133071,0.0008151807,0.00069948524,0.003758711,0.0006254277,0.05332811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986162,0.00041004329,0.00009520921,0.0002484881,0.00048620204,0.00014385063],"domain_scores_gemma":[0.9968141,0.00080758944,0.00021135581,0.0010375049,0.0010344264,0.00009507311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007012873,0.0008467944,0.0007634545,0.0011668596,0.0009155702,0.001317572,0.0012889698,0.0014299109,0.0108628],"category_scores_gemma":[0.004831973,0.00036899818,0.00047454928,0.0012992895,0.000660467,0.0016253871,0.0012678269,0.00143979,0.006568103],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091903383,0.000100919664,0.00066902186,0.0010350527,0.00009170124,0.0014640455,0.00038173865,0.06647774,0.030128803,0.41952935,0.053570427,0.42563215],"study_design_scores_gemma":[0.00013017433,0.0004561065,0.00063133455,0.00045190236,0.00013844753,0.0049646418,0.00011883338,0.22705789,0.073644005,0.25416198,0.43799242,0.0002523105],"about_ca_topic_score_codex":0.00048413535,"about_ca_topic_score_gemma":0.00065206224,"teacher_disagreement_score":0.0108628,"about_ca_system_score_codex":0.0004075197,"about_ca_system_score_gemma":0.000785955,"threshold_uncertainty_score":0.0363397},"labels":[],"label_agreement":null},{"id":"W2011377472","doi":"10.1109/tit.2012.2236604","title":"Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Encoder; Computer science; Binary number; Low-density parity-check code; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Arithmetic","score_opus":0.019698386856273575,"score_gpt":0.2729342356956928,"score_spread":0.25323584883941924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011377472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08121276,0.0003509199,0.9113389,0.00012431933,0.000031408938,0.00007950339,0.00008801784,0.00060544827,0.0061687413],"genre_scores_gemma":[0.8155865,0.00035776212,0.18022591,0.00006271532,0.00002383272,0.00007411629,0.00018222201,0.000030702668,0.00345627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938023,0.00012778035,0.000031098312,0.000097808566,0.00026416173,0.00009889604],"domain_scores_gemma":[0.999298,0.0003040053,0.0000696184,0.00016477882,0.00012239728,0.000041332198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048022857,0.0005022728,0.00052940275,0.0005492174,0.00035938426,0.00073087384,0.0009303183,0.0006258126,0.0010610239],"category_scores_gemma":[0.0014447469,0.00019146544,0.0003601115,0.00061619614,0.0007047179,0.0010898878,0.0010239166,0.00077370374,0.00035277006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008058941,0.00016953956,0.0030585781,0.00031751796,0.000095233765,0.0009829397,0.00053593196,0.34886244,0.099273406,0.35338843,0.0015619632,0.19094811],"study_design_scores_gemma":[0.000025839874,0.00007110558,0.00023449311,0.00001702816,0.000023813029,0.00021331973,0.00001893992,0.95001566,0.02801409,0.019544084,0.0017957574,0.00002585104],"about_ca_topic_score_codex":0.0013774742,"about_ca_topic_score_gemma":0.0015048311,"teacher_disagreement_score":0.0013774742,"about_ca_system_score_codex":0.0008004157,"about_ca_system_score_gemma":0.0011353332,"threshold_uncertainty_score":0.0058074594},"labels":[],"label_agreement":null},{"id":"W2011704806","doi":"10.1109/tpds.2013.311","title":"Optimizing the Parallel Tree-Search for Finding Shortest-Span Error-Correcting CDO Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Speedup; Notation; Algorithm; Function (biology); Tree (set theory); Theoretical computer science; Mathematics; Combinatorics; Parallel computing; Arithmetic","score_opus":0.04601219332185101,"score_gpt":0.2909916860146083,"score_spread":0.24497949269275726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011704806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09772272,0.00035722597,0.89070904,0.00024051272,0.000041130435,0.00007424294,0.00020334507,0.0027259418,0.007925873],"genre_scores_gemma":[0.28607658,0.00021035681,0.70926386,0.00009375558,0.000017317438,0.0001087839,0.00045870148,0.00028740676,0.0034831753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997136,0.00005221597,0.000017645434,0.000050522078,0.00011453182,0.00005148209],"domain_scores_gemma":[0.9994236,0.00029393294,0.00004077445,0.00007230115,0.00014431306,0.000025170097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703843,0.0004161149,0.0005262558,0.0005794391,0.00037017974,0.00048449522,0.0005206113,0.0004887303,0.0025418738],"category_scores_gemma":[0.0022812744,0.00018319531,0.0003227342,0.0009854861,0.00037144226,0.000840921,0.0004931166,0.00043096527,0.00084032986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033271778,0.00011113366,0.0019110148,0.00028294418,0.00005171903,0.00015244984,0.00017707578,0.58620447,0.02545949,0.02771739,0.006342523,0.3512571],"study_design_scores_gemma":[0.000031730444,0.000025381742,0.00018013384,0.000005601461,0.000006781467,0.0000316439,0.00002312372,0.98767555,0.005938187,0.0049686157,0.00110773,0.0000055830506],"about_ca_topic_score_codex":0.008338053,"about_ca_topic_score_gemma":0.016946817,"teacher_disagreement_score":0.008338053,"about_ca_system_score_codex":0.0007979004,"about_ca_system_score_gemma":0.0024729418,"threshold_uncertainty_score":0.016579092},"labels":[],"label_agreement":null},{"id":"W2012561499","doi":"10.1109/vtcfall.2012.6398904","title":"Design of Low-Delay Distributed Joint Source-Channel Codes Using Irregular LDPC Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Turbo code; Computer science; Puncturing; Algorithm; Channel (broadcasting); Concatenated error correction code; Linear code; Forward error correction; Binary symmetric channel; Serial concatenated convolutional codes; Theoretical computer science; Decoding methods; Electronic engineering; Block code; Telecommunications; Engineering","score_opus":0.05758918031780214,"score_gpt":0.2721683793458315,"score_spread":0.21457919902802935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012561499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024509205,0.00010398914,0.9736326,0.000092221664,0.000018574518,0.00005719739,0.000053564567,0.00026538686,0.001267264],"genre_scores_gemma":[0.54150885,0.00021529758,0.45597464,0.00006715511,0.00002672665,0.00024010144,0.00016609134,0.00007028231,0.0017308329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931085,0.00022127859,0.00003584238,0.00010428971,0.0002542615,0.00007352436],"domain_scores_gemma":[0.997988,0.00084745674,0.00033134766,0.00024318139,0.0004935451,0.00009640927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082426256,0.00066320604,0.0005867822,0.00055174826,0.0004088727,0.0006116375,0.0007409037,0.00059415307,0.00078151166],"category_scores_gemma":[0.002959671,0.00030042094,0.00032144942,0.000776542,0.00085453,0.00054172496,0.00076519966,0.00078861974,0.000303993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021530032,0.00006384173,0.0011461922,0.00017264414,0.000048306545,0.00014652761,0.00013727724,0.84101945,0.0336957,0.044653,0.0009968847,0.077704966],"study_design_scores_gemma":[0.000038525002,0.00007840303,0.000096377975,0.00001410935,0.000013465995,0.00007472207,0.00001464568,0.9746889,0.016833933,0.0064574275,0.0016734898,0.000016097654],"about_ca_topic_score_codex":0.0012821039,"about_ca_topic_score_gemma":0.001781834,"teacher_disagreement_score":0.0012821039,"about_ca_system_score_codex":0.00082342647,"about_ca_system_score_gemma":0.0019736285,"threshold_uncertainty_score":0.0059743524},"labels":[],"label_agreement":null},{"id":"W2013632064","doi":"10.1109/isit.2007.4557138","title":"Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Enumeration; Decoding methods; Algorithm; Tanner graph; Mathematics; Binary number; Error detection and correction; Parity bit; Block code; Word error rate; Discrete mathematics; Computer science; Error floor; Arithmetic","score_opus":0.03522225127309623,"score_gpt":0.3060491880781297,"score_spread":0.27082693680503345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013632064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32580036,0.00015610151,0.672373,0.000066217595,0.000007459027,0.000031579246,0.000061852756,0.0004846748,0.0010187852],"genre_scores_gemma":[0.87523407,0.00017713761,0.12376263,0.000014735299,0.000006247976,0.000050928084,0.00013495609,0.00003381811,0.0005855378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992741,0.00033443514,0.00003259568,0.00006778308,0.0002445315,0.00004650256],"domain_scores_gemma":[0.9954312,0.003225727,0.0004691528,0.00035962652,0.00046317343,0.00005109498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011271557,0.000510034,0.00055984134,0.0011473672,0.00025486253,0.0004977484,0.0005494891,0.000498998,0.0002722963],"category_scores_gemma":[0.010870432,0.0002634015,0.00020784624,0.0006239268,0.00055617397,0.00082516397,0.0004975724,0.0003867222,0.0001694072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021368064,0.0000388375,0.0040571974,0.000053487598,0.000022554166,0.000098905846,0.0000810492,0.9165478,0.015176009,0.00724762,0.00016612225,0.056296736],"study_design_scores_gemma":[0.0000042755796,0.000010002682,0.00043724227,0.0000047155377,0.000001888745,0.000020679856,0.000004404172,0.99098855,0.0066227824,0.0018455689,0.00005362428,0.000006323569],"about_ca_topic_score_codex":0.0025616114,"about_ca_topic_score_gemma":0.0020963268,"teacher_disagreement_score":0.0025616114,"about_ca_system_score_codex":0.00066628534,"about_ca_system_score_gemma":0.00066895253,"threshold_uncertainty_score":0.005961001},"labels":[],"label_agreement":null},{"id":"W2015172776","doi":"10.1145/1594233.1594307","title":"Power-management-based Chien search for low power BCH decoder","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"AUTO21 Network of Centres of Excellence","keywords":"BCH code; Computer science; Decoding methods; Power (physics); Very-large-scale integration; Power analysis; Error detection and correction; Embedded system; Algorithm; Cryptography","score_opus":0.01332962185794859,"score_gpt":0.29098857502408176,"score_spread":0.27765895316613315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015172776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24701661,0.0021736657,0.71838015,0.0011423704,0.00016045704,0.00025768313,0.00016765665,0.003380151,0.027321182],"genre_scores_gemma":[0.873551,0.00030690993,0.117965475,0.00025521097,0.000036522342,0.00006812466,0.0000824071,0.00006366961,0.0076706605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998109,0.000028606453,0.000011120169,0.000031955806,0.000094746065,0.00002274888],"domain_scores_gemma":[0.9998111,0.000052423355,0.000028601902,0.000026464926,0.00007177658,0.0000096955055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013761854,0.000247165,0.00023941531,0.00040069665,0.0005357412,0.00044275544,0.0007164331,0.00030353776,0.0027198289],"category_scores_gemma":[0.0005160157,0.000119474455,0.00011023254,0.0004368078,0.00024623144,0.000491522,0.00028255783,0.00032108737,0.00050290517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037710223,0.00020969573,0.0014152534,0.00033055843,0.000040860017,0.0003957202,0.00030135197,0.04711444,0.44727162,0.02711656,0.00606186,0.4693649],"study_design_scores_gemma":[0.00014088798,0.000636199,0.0016664141,0.00005268783,0.00007368234,0.0009823937,0.00007975133,0.59005445,0.3775996,0.009252416,0.019418202,0.000043264958],"about_ca_topic_score_codex":0.0014673524,"about_ca_topic_score_gemma":0.005391191,"teacher_disagreement_score":0.0027198289,"about_ca_system_score_codex":0.000769763,"about_ca_system_score_gemma":0.0008966518,"threshold_uncertainty_score":0.009098709},"labels":[],"label_agreement":null},{"id":"W2019352729","doi":"10.1109/lcomm.2015.2418260","title":"Multiple-Votes Parallel Symbol-Flipping Decoding Algorithm for Non-Binary LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Université Européenne de Bretagne; Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Computer science; Binary number; Parity-check matrix; Code (set theory); Berlekamp–Welch algorithm; Sequential decoding; Error detection and correction; Mathematics; Block code; Arithmetic; Error floor","score_opus":0.07857282465175856,"score_gpt":0.3242857446273224,"score_spread":0.24571291997556383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019352729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009907058,0.00011775361,0.98793215,0.00008110332,0.000043089385,0.000060267255,0.00005777915,0.00035135396,0.0014493255],"genre_scores_gemma":[0.13558385,0.00021390441,0.8586009,0.000080196325,0.0000380944,0.00020025915,0.00024450303,0.000080267106,0.004958029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.000111390036,0.00003739698,0.00008235347,0.00026803106,0.000035046618],"domain_scores_gemma":[0.99933904,0.00020661668,0.000062984065,0.00013147804,0.00023755185,0.000022289545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045495213,0.00052514864,0.0006508292,0.0005807824,0.0005474808,0.0005691208,0.0010704793,0.0006519399,0.0017666884],"category_scores_gemma":[0.0015572016,0.00028549533,0.00031475408,0.0007189045,0.00045996904,0.0007011497,0.0006617561,0.0008013456,0.00068385975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032149447,0.000072900715,0.001020133,0.00022643596,0.00006167362,0.00019827849,0.00013954546,0.17038187,0.06969008,0.056536105,0.00335081,0.69800067],"study_design_scores_gemma":[0.0000634102,0.0000775988,0.00035176933,0.000016909235,0.00001916111,0.00027867622,0.000013306555,0.93334717,0.04737129,0.011905287,0.0065274085,0.00002792068],"about_ca_topic_score_codex":0.0016051274,"about_ca_topic_score_gemma":0.0026658666,"teacher_disagreement_score":0.0017666884,"about_ca_system_score_codex":0.00055042957,"about_ca_system_score_gemma":0.0015683948,"threshold_uncertainty_score":0.005910158},"labels":[],"label_agreement":null},{"id":"W2019405212","doi":"10.1109/twc.2013.011713.120914","title":"Multi-Layer Iterative LDPC Decoding for Broadband Wireless Access Networks: A Recursive Shortening Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Decoding methods; Algorithm; Low-density parity-check code; Wireless; Wireless broadband; Theoretical computer science; Wireless network; Telecommunications","score_opus":0.065181307738267,"score_gpt":0.336237043108389,"score_spread":0.27105573537012195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019405212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011426133,0.00019954496,0.98639977,0.00007706846,0.000013369342,0.00003272671,0.000017970386,0.00036413642,0.0014692644],"genre_scores_gemma":[0.20795935,0.00033840584,0.7883853,0.00007180492,0.000025241809,0.00010944432,0.000097687094,0.00007705821,0.0029357516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.00016971858,0.000028958466,0.000059418915,0.00018145809,0.00004287881],"domain_scores_gemma":[0.9993162,0.00028398554,0.00008261378,0.00016242542,0.00013452141,0.00002033873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046640373,0.00053677626,0.0003976985,0.0005381038,0.00043769582,0.00044736147,0.00070605596,0.0006312973,0.0010271721],"category_scores_gemma":[0.0018719826,0.00022438192,0.00034106476,0.00059201126,0.0005220158,0.0006481113,0.00068279984,0.00065543613,0.0006269269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017602021,0.000072033305,0.00096685975,0.00013477655,0.00003642597,0.00020650399,0.00032491324,0.4517947,0.07861138,0.073042996,0.0017557929,0.3928776],"study_design_scores_gemma":[0.00001309404,0.00004599297,0.00012807237,0.000013607677,0.000010199701,0.0001223269,0.000009646132,0.9736974,0.017963681,0.005219319,0.002761079,0.000015584475],"about_ca_topic_score_codex":0.0022047583,"about_ca_topic_score_gemma":0.0030891586,"teacher_disagreement_score":0.0022047583,"about_ca_system_score_codex":0.00065762765,"about_ca_system_score_gemma":0.0011914241,"threshold_uncertainty_score":0.004771471},"labels":[],"label_agreement":null},{"id":"W2019751845","doi":"10.1049/el:20030217","title":"Iterative decoding using stochastic computation","year":2003,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computation; Computer science; Sequential decoding; Algorithm; List decoding; Code (set theory); Simple (philosophy); Berlekamp–Welch algorithm; Iterative method; Theoretical computer science; Concatenated error correction code; Set (abstract data type)","score_opus":0.019577352280125516,"score_gpt":0.2767375105798688,"score_spread":0.25716015829974326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019751845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016875695,0.000098162585,0.97759116,0.00010018405,0.000040725714,0.000049951705,0.00003216892,0.00040642312,0.004805538],"genre_scores_gemma":[0.50582343,0.0003039241,0.4875805,0.00013306503,0.0000517001,0.00019511467,0.0001242566,0.00008209971,0.0057059433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995103,0.00013211803,0.000027348393,0.00006148109,0.00021264133,0.000056076526],"domain_scores_gemma":[0.9994215,0.0002664445,0.0000366491,0.00009970964,0.00014941549,0.000026314863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195222,0.0003851143,0.0005310063,0.00040516647,0.00046391928,0.00082009385,0.0006902122,0.000702722,0.0013463771],"category_scores_gemma":[0.0016472536,0.00022285874,0.00038908015,0.00051878416,0.00063438906,0.00062698725,0.000828428,0.00070543453,0.00059759215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020460035,0.00008251183,0.0008464132,0.000120222896,0.00008383008,0.00022417259,0.00015350748,0.55578613,0.0471149,0.2595495,0.0020113157,0.13382286],"study_design_scores_gemma":[0.000017063354,0.000048291953,0.000076237295,0.000008888032,0.000010452385,0.000073753734,0.000004062537,0.9686836,0.009755541,0.01956401,0.0017446547,0.000013569028],"about_ca_topic_score_codex":0.0010766602,"about_ca_topic_score_gemma":0.0019210239,"teacher_disagreement_score":0.0013463771,"about_ca_system_score_codex":0.00054207153,"about_ca_system_score_gemma":0.0010908279,"threshold_uncertainty_score":0.0045040846},"labels":[],"label_agreement":null},{"id":"W2021979706","doi":"10.1109/lcomm.2015.2390648","title":"On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Complement (music); Simple (philosophy); Variable (mathematics); Tanner graph; Code (set theory); Mathematics; Characterization (materials science); Decoding methods; Graph; Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Discrete mathematics; Error floor","score_opus":0.05075294354137328,"score_gpt":0.30113989423923276,"score_spread":0.2503869506978595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021979706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49835438,0.0004039352,0.49074626,0.00022548051,0.000012085123,0.00017332021,0.00035869464,0.00044377949,0.009282101],"genre_scores_gemma":[0.87137467,0.00022452704,0.12528634,0.00006288,0.00001102836,0.00013904911,0.0005870318,0.00005097571,0.002263562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.000066819906,0.000021594335,0.00006382546,0.00010620106,0.000044228105],"domain_scores_gemma":[0.9983726,0.0011356622,0.0001512242,0.0001642378,0.00012381085,0.00005252084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036031497,0.0002698445,0.00037209157,0.00084995036,0.00035974727,0.0005888405,0.0005196787,0.00034538293,0.0015880112],"category_scores_gemma":[0.0036950905,0.00023235496,0.00028876498,0.0009499676,0.00062826107,0.0009202325,0.00064848573,0.0004853429,0.00018841134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005552658,0.00023503721,0.010501134,0.00045359944,0.00007240343,0.00052712276,0.0006135304,0.520075,0.06294985,0.22730432,0.0027475555,0.17396514],"study_design_scores_gemma":[0.000029315963,0.0000755759,0.0009450664,0.000021010439,0.000012932065,0.00017194476,0.000045115306,0.93397254,0.011835717,0.05175918,0.0011170252,0.0000144639835],"about_ca_topic_score_codex":0.0011128024,"about_ca_topic_score_gemma":0.0017663816,"teacher_disagreement_score":0.0015880112,"about_ca_system_score_codex":0.000414735,"about_ca_system_score_gemma":0.0008152393,"threshold_uncertainty_score":0.005312443},"labels":[],"label_agreement":null},{"id":"W2022126092","doi":"10.1587/comex.2.135","title":"DC-free LDPC convolutional codes","year":2013,"lang":"en","type":"article","venue":"IEICE Communications Express","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Convolutional code; Low-density parity-check code; Serial concatenated convolutional codes; Computer science; Algorithm; Turbo code; Decoding methods; Error detection and correction; Concatenated error correction code; Sequence (biology); Forward error correction; Theoretical computer science; Block code","score_opus":0.035281271217993154,"score_gpt":0.2892357806110556,"score_spread":0.2539545093930624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022126092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08244218,0.00083744165,0.8597357,0.00044773435,0.0000882264,0.0001063549,0.0011039366,0.0011752867,0.054063145],"genre_scores_gemma":[0.7710377,0.00092844176,0.19204605,0.0002787956,0.000027351913,0.00016381267,0.0007785376,0.000104261795,0.03463503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997482,0.00003501589,0.0000114884915,0.000035631343,0.0001354253,0.000034381253],"domain_scores_gemma":[0.9994004,0.00018706078,0.00005672913,0.00013962241,0.00019441897,0.000021819778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017315769,0.00026049695,0.00022219848,0.00036429544,0.00030290958,0.0004993632,0.0004297999,0.00048253388,0.003734031],"category_scores_gemma":[0.0012238695,0.00012926213,0.00011472686,0.00056072284,0.00034111613,0.0003343624,0.00032484625,0.0005207771,0.0013397231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026730547,0.00006235773,0.0014967198,0.00043953946,0.000031576987,0.00046808214,0.00018779526,0.12951261,0.19557095,0.4913864,0.008142889,0.17243367],"study_design_scores_gemma":[0.00005804355,0.00009049891,0.0011490766,0.00009227848,0.0000270097,0.0007342639,0.000032600372,0.6331747,0.19558527,0.08618418,0.082802944,0.0000691267],"about_ca_topic_score_codex":0.0028803824,"about_ca_topic_score_gemma":0.0049797455,"teacher_disagreement_score":0.003734031,"about_ca_system_score_codex":0.00071550993,"about_ca_system_score_gemma":0.0009740917,"threshold_uncertainty_score":0.012491524},"labels":[],"label_agreement":null},{"id":"W2023188182","doi":"10.1109/cwit.2013.6621610","title":"Improved systematic fountain codes in AWGN channel","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Yarmouk University","keywords":"Fountain code; Degree (music); Decoding methods; Additive white Gaussian noise; Algorithm; Channel (broadcasting); Computer science; Fountain; Encoder; Gaussian; Mathematics; Topology (electrical circuits); Statistics; Telecommunications; Hamming code; Block code; Physics; Combinatorics","score_opus":0.013959974717010722,"score_gpt":0.2425361177251775,"score_spread":0.22857614300816678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023188182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2098151,0.00085115427,0.7854333,0.0002176663,0.000057446912,0.000027792787,0.00008375752,0.00054375303,0.0029700894],"genre_scores_gemma":[0.88914967,0.00051258254,0.108042985,0.00009320518,0.00002760218,0.000024826415,0.00006589776,0.000048034497,0.0020352069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945325,0.00015984669,0.000022758186,0.000058975435,0.0002236751,0.00008151481],"domain_scores_gemma":[0.9985984,0.00060186087,0.00018330669,0.00020047693,0.0003681859,0.000047746544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053111056,0.000517041,0.00039570848,0.0005028642,0.0002902383,0.00040502072,0.0004980374,0.0005589166,0.00036633626],"category_scores_gemma":[0.002958101,0.00018699531,0.00021092831,0.0006212708,0.0006223005,0.0007616204,0.00057771197,0.00049806474,0.00017868433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007586231,0.000069876936,0.002254596,0.00024422962,0.00007709023,0.00044943934,0.0003644714,0.6250321,0.09892187,0.10244514,0.0016254011,0.16775714],"study_design_scores_gemma":[0.000020286063,0.00008688372,0.0004277423,0.000022532387,0.000017385877,0.0002513208,0.000017733213,0.9557221,0.028940307,0.013392769,0.0010707502,0.000030160953],"about_ca_topic_score_codex":0.0026799454,"about_ca_topic_score_gemma":0.0032548264,"teacher_disagreement_score":0.0026799454,"about_ca_system_score_codex":0.00047107154,"about_ca_system_score_gemma":0.0009635689,"threshold_uncertainty_score":0.005328715},"labels":[],"label_agreement":null},{"id":"W2024069221","doi":"10.1109/glocom.2007.300","title":"A Differential Binary Message-Passing LDPC Decoder","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Message passing; Computer science; Belief propagation; Decoding methods; Algorithm; Binary number; Computational complexity theory; Theoretical computer science; Parallel computing; Mathematics; Arithmetic","score_opus":0.016622195528202918,"score_gpt":0.2826922098348055,"score_spread":0.26607001430660254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024069221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011427433,0.00014489282,0.98606896,0.00011806347,0.000060185448,0.000040975752,0.00004920092,0.00047363495,0.001616525],"genre_scores_gemma":[0.25546628,0.0002111919,0.7384287,0.00018782487,0.000066628425,0.00008871289,0.00017411266,0.00004221104,0.0053342585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964786,0.000076826684,0.000017892022,0.00006576802,0.0001653162,0.00002642215],"domain_scores_gemma":[0.99964046,0.00010552457,0.00003124591,0.000087990826,0.000111772504,0.00002304988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036003682,0.00032614524,0.00042130996,0.00042667863,0.0002929544,0.00050553074,0.00094672333,0.0006175825,0.0010401584],"category_scores_gemma":[0.00094524527,0.00017436019,0.00018731064,0.00033165942,0.00037588197,0.00051855773,0.0004966678,0.0005504789,0.00061096775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041551364,0.0001875158,0.00232315,0.00035187756,0.00007777693,0.00040093082,0.00016086994,0.13722603,0.15460889,0.11221263,0.005141798,0.586893],"study_design_scores_gemma":[0.00007111498,0.00013465119,0.00040065346,0.000016593942,0.000035507186,0.00053284987,0.000010139108,0.9155089,0.06261442,0.008635215,0.012014991,0.000024841895],"about_ca_topic_score_codex":0.0006458105,"about_ca_topic_score_gemma":0.0008739333,"teacher_disagreement_score":0.0010401584,"about_ca_system_score_codex":0.00036840397,"about_ca_system_score_gemma":0.0007963322,"threshold_uncertainty_score":0.0034796596},"labels":[],"label_agreement":null},{"id":"W2024095844","doi":"10.1109/qbsc.2014.6841195","title":"Multiple description coding with polar codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Encoder; Computer science; Algorithm; Polar; Coding (social sciences); Decoding methods; Binary number; Hamming distance; Hamming code; Network packet; Theoretical computer science; Block code; Arithmetic; Computer network; Mathematics","score_opus":0.019710196797844033,"score_gpt":0.22979197571507087,"score_spread":0.21008177891722685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024095844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005263037,0.0008717638,0.98943514,0.00022419119,0.000098936514,0.00008169376,0.00014764936,0.00023083508,0.003646797],"genre_scores_gemma":[0.4142192,0.0029032056,0.57152826,0.00047625462,0.00022244963,0.00037220772,0.0009851374,0.0001045979,0.009188812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909115,0.00033125334,0.000057850088,0.0000971247,0.00033976947,0.00008281847],"domain_scores_gemma":[0.99884975,0.00042980656,0.00011152583,0.00024741693,0.00032338014,0.000038010236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009289945,0.0005216979,0.0005024021,0.00080069527,0.00041038977,0.0011397315,0.00079596497,0.0006615663,0.00253246],"category_scores_gemma":[0.0030047055,0.0002586162,0.00038509705,0.0011625987,0.00068074703,0.0012698391,0.0014435573,0.0010786,0.0010455024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064696604,0.000056078763,0.00059108896,0.0004633665,0.000046103796,0.0006437754,0.00024393444,0.10468214,0.025469549,0.49007422,0.0071501825,0.3699326],"study_design_scores_gemma":[0.00012576973,0.00022091177,0.00023835035,0.00015257258,0.000051878633,0.00086071796,0.00007697408,0.7631465,0.037887614,0.15982215,0.0373151,0.00010146016],"about_ca_topic_score_codex":0.0014172184,"about_ca_topic_score_gemma":0.00085634034,"teacher_disagreement_score":0.00253246,"about_ca_system_score_codex":0.0004957521,"about_ca_system_score_gemma":0.00097199174,"threshold_uncertainty_score":0.008471906},"labels":[],"label_agreement":null},{"id":"W2024128585","doi":"10.1109/iccnc.2013.6504198","title":"Polar codes for data storage applications","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Encoding (memory); Polar; Computer data storage; Error detection and correction; Throughput; Algorithm; Theoretical computer science; Computer engineering; Telecommunications; Computer hardware; Artificial intelligence","score_opus":0.12183898016624352,"score_gpt":0.3524047824314154,"score_spread":0.23056580226517187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024128585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01724139,0.017505718,0.88876635,0.002977028,0.0010732741,0.00018210021,0.00047140857,0.0009887237,0.070794046],"genre_scores_gemma":[0.46924046,0.030280514,0.4608763,0.002133222,0.001246027,0.0005172749,0.000752675,0.00041973576,0.03453364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00011595531,0.000029666231,0.000062611325,0.00026255855,0.000051886767],"domain_scores_gemma":[0.9986873,0.0005133809,0.000109244196,0.00025752588,0.0003876942,0.00004481603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004746226,0.0005893189,0.00042800728,0.0007547958,0.00073172647,0.0016873112,0.00052700297,0.0010454427,0.0057849507],"category_scores_gemma":[0.0031119047,0.00021054855,0.00023868299,0.0014199506,0.0010225899,0.0017949919,0.001144426,0.0016706542,0.0022594559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001403507,0.00003531879,0.00036905688,0.00065445504,0.000014661005,0.00023754316,0.00025766974,0.02005267,0.024634022,0.7773022,0.016148409,0.16015361],"study_design_scores_gemma":[0.000034034867,0.00014524486,0.00029548712,0.00051420287,0.000027669623,0.0012633054,0.00020012743,0.12363664,0.051415484,0.5566619,0.26573667,0.00006922788],"about_ca_topic_score_codex":0.0005028052,"about_ca_topic_score_gemma":0.00051816145,"teacher_disagreement_score":0.0057849507,"about_ca_system_score_codex":0.00066634506,"about_ca_system_score_gemma":0.0009152775,"threshold_uncertainty_score":0.019352615},"labels":[],"label_agreement":null},{"id":"W2024554252","doi":"10.1109/vetecs.2010.5493708","title":"Improved Iterative Water-Filling with Rapid Convergence and Parallel Computation for Gaussian Multiple Access Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computation; Computer science; Convergence (economics); Iterative method; Parallel computing; Gaussian; Algorithm; Computational science; Mathematical optimization; Mathematics; Physics","score_opus":0.02451312956480664,"score_gpt":0.2864795028132181,"score_spread":0.26196637324841143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024554252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005572938,0.00013259871,0.9929321,0.000073404786,0.000018947128,0.000019255103,0.000011303008,0.00013593803,0.0011035713],"genre_scores_gemma":[0.32455018,0.00040952937,0.6718396,0.00010417786,0.00004564142,0.00018409884,0.000071201444,0.00010879311,0.0026867813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945444,0.00020585101,0.000021257216,0.000052283547,0.00018373417,0.000082500796],"domain_scores_gemma":[0.9991035,0.0005761691,0.00006187608,0.00008429259,0.00014233106,0.000031753298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012473862,0.00073055626,0.00087555865,0.00044499693,0.00044459288,0.0006328889,0.0009780476,0.0006890065,0.0012941707],"category_scores_gemma":[0.0038345938,0.00035000656,0.00055640936,0.0008909629,0.0013604338,0.0011030356,0.0012340448,0.0010327701,0.00030899784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010787846,0.000044297856,0.00028825345,0.00008052915,0.00002790771,0.00009067781,0.00013672902,0.8782177,0.002771423,0.061074886,0.0013140384,0.055845696],"study_design_scores_gemma":[0.000008436606,0.000010387499,0.000016594744,0.0000025260117,0.0000020096566,0.000011054093,0.0000039304377,0.99137187,0.0006629358,0.0075336485,0.00037242586,0.000004216153],"about_ca_topic_score_codex":0.004684839,"about_ca_topic_score_gemma":0.0034084532,"teacher_disagreement_score":0.004684839,"about_ca_system_score_codex":0.0007425553,"about_ca_system_score_gemma":0.0021080934,"threshold_uncertainty_score":0.009315133},"labels":[],"label_agreement":null},{"id":"W2026656589","doi":"10.1109/tvt.2015.2395382","title":"LDPC Decoding Over Nonbinary Queue-Based Burst Noise Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Computer science; Fading; Interleaving; Rayleigh fading; Channel (broadcasting); Mathematics; Electronic engineering; Telecommunications; Engineering","score_opus":0.026232647000213372,"score_gpt":0.2697630756069862,"score_spread":0.24353042860677282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026656589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22939196,0.0004051931,0.76618564,0.00021115773,0.000047263584,0.00007894611,0.00009789723,0.00030188018,0.0032799628],"genre_scores_gemma":[0.96452856,0.00023894558,0.033571217,0.000037752314,0.000012596478,0.00003676345,0.000045977416,0.00002716481,0.0015010514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882215,0.00035365042,0.000056440924,0.00012588454,0.0004168145,0.00022503971],"domain_scores_gemma":[0.99531674,0.0032129763,0.0005084268,0.00026723067,0.000591905,0.00010264766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847722,0.00077246164,0.0008117727,0.0005947092,0.00084212463,0.0012563481,0.0011865224,0.00086256175,0.00068162504],"category_scores_gemma":[0.004539242,0.0003272525,0.00029830923,0.0010677787,0.0013092584,0.001307637,0.000873557,0.00094319135,0.00016050097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022013964,0.000055915607,0.00094852917,0.00007952881,0.000029963623,0.00027273592,0.0001573237,0.93125397,0.0078447815,0.04719153,0.00027803428,0.011667615],"study_design_scores_gemma":[0.000004872476,0.000017621252,0.000031842672,0.0000028201937,0.0000024933306,0.000019453935,0.000006833938,0.9962369,0.0013564145,0.0022681854,0.00004891601,0.0000036016272],"about_ca_topic_score_codex":0.009107538,"about_ca_topic_score_gemma":0.010533582,"teacher_disagreement_score":0.009107538,"about_ca_system_score_codex":0.0024861062,"about_ca_system_score_gemma":0.0031143008,"threshold_uncertainty_score":0.018109024},"labels":[],"label_agreement":null},{"id":"W2027136297","doi":"10.1587/transinf.2013lop0010","title":"Asynchronous Stochastic Decoding of LDPC Codes: Algorithm and Simulation Model","year":2014,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Core Research for Evolutional Science and Technology; University of Tokyo; Japan Society for the Promotion of Science; Synopsys","keywords":"Computer science; Decoding methods; Asynchronous communication; Parallel computing; Scheduling (production processes); Algorithm; Low-density parity-check code; Computation; Mathematics; Computer network; Mathematical optimization","score_opus":0.015569112253343466,"score_gpt":0.2580003604589923,"score_spread":0.24243124820564882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027136297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089090884,0.00060310506,0.8933737,0.0003322598,0.000042498155,0.00014504397,0.0004958193,0.00090747204,0.015009096],"genre_scores_gemma":[0.8739737,0.0009246741,0.11724594,0.00006836307,0.000030123603,0.00042822337,0.000598564,0.00012174745,0.006608591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997813,0.000050861054,0.000012674803,0.000031246855,0.00009335529,0.000030597923],"domain_scores_gemma":[0.99946254,0.0002730259,0.00006797034,0.00004123191,0.00014280528,0.000012443036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034265668,0.0004346684,0.00053798174,0.00047315808,0.00036524565,0.0005438915,0.0008758878,0.00088636886,0.0019808072],"category_scores_gemma":[0.0012912061,0.00024946503,0.00040621706,0.00069211813,0.00034502154,0.0007725316,0.00027169107,0.0005625104,0.00043134074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020029092,0.00001120207,0.00037581043,0.00002859409,0.0000063885877,0.000037723144,0.000017699631,0.98766685,0.001660832,0.007479045,0.0001643367,0.002531539],"study_design_scores_gemma":[0.000002259571,0.0000040382597,0.000026099024,0.0000013449747,0.0000014809164,0.0000068210234,0.0000010786734,0.9989574,0.00036828927,0.0004970054,0.00013238336,0.0000017086875],"about_ca_topic_score_codex":0.011739079,"about_ca_topic_score_gemma":0.006211562,"teacher_disagreement_score":0.011739079,"about_ca_system_score_codex":0.00094091694,"about_ca_system_score_gemma":0.0010639679,"threshold_uncertainty_score":0.023341477},"labels":[],"label_agreement":null},{"id":"W2027902934","doi":"10.1109/cjece.2013.6601080","title":"Novel serial code concatenation strategies for error floor mitigation of low-density parity-check and turbo product codes","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Concatenated error correction code; Turbo code; Computer science; Low-density parity-check code; Serial concatenated convolutional codes; Block code; Concatenation (mathematics); Interleaving; Algorithm; Linear code; Computer engineering; Theoretical computer science; Decoding methods; Arithmetic; Mathematics","score_opus":0.01071782983032013,"score_gpt":0.20701697848939016,"score_spread":0.19629914865907003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027902934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04707955,0.0009843528,0.94497484,0.00009358841,0.00015895258,0.000085294356,0.000057541856,0.0006739606,0.005891859],"genre_scores_gemma":[0.49390608,0.0007950544,0.49723077,0.00012371226,0.00013199254,0.00012253947,0.00024946957,0.00011551591,0.007324846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.00013577851,0.000050212762,0.00009331644,0.00026523566,0.000056899],"domain_scores_gemma":[0.99891996,0.0003183058,0.00018731461,0.00022057335,0.00029090483,0.00006300769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045827776,0.00080180843,0.00044950694,0.0007866724,0.00063606724,0.0005424843,0.0007470552,0.00051627227,0.001423134],"category_scores_gemma":[0.0016103871,0.0002602053,0.00034486424,0.00069197104,0.0006492129,0.0009458515,0.00082210155,0.00072598195,0.0007158056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063124613,0.00016890067,0.002258362,0.0004595489,0.00015348135,0.0010345867,0.0004721901,0.16630937,0.20305242,0.09775573,0.003522293,0.5241819],"study_design_scores_gemma":[0.000032493164,0.0005968784,0.0006148237,0.000053275857,0.000080327,0.0014318492,0.00004621603,0.7320872,0.2350152,0.01282758,0.017138088,0.00007602286],"about_ca_topic_score_codex":0.0004993718,"about_ca_topic_score_gemma":0.00092253304,"teacher_disagreement_score":0.001423134,"about_ca_system_score_codex":0.0003045616,"about_ca_system_score_gemma":0.0005878659,"threshold_uncertainty_score":0.004760802},"labels":[],"label_agreement":null},{"id":"W2030719027","doi":"10.1109/lcomm.2012.112812.121785","title":"A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Low-density parity-check code; Additive white Gaussian noise; Algorithm; Computer science; Forward error correction; Turbo code; Bit error rate; Concatenated error correction code; Mathematics; Code (set theory); Decoding methods; Channel (broadcasting); Theoretical computer science; Block code; Telecommunications","score_opus":0.06853258175673221,"score_gpt":0.3152987726318352,"score_spread":0.246766190875103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030719027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06055177,0.000535251,0.93658566,0.0001455641,0.00007738736,0.00009532817,0.00006721108,0.00050906534,0.0014327591],"genre_scores_gemma":[0.61519986,0.0003789668,0.38221416,0.0001013642,0.00008936672,0.00011564471,0.00010295113,0.00005450097,0.0017431508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.000322942,0.00008871662,0.0001130388,0.00040116036,0.00006669652],"domain_scores_gemma":[0.9977209,0.00059518474,0.0004627148,0.0007665999,0.00035336261,0.00010123854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010115635,0.0005735587,0.00048758075,0.0005375486,0.000650446,0.000433392,0.0009919708,0.00062137446,0.0007768351],"category_scores_gemma":[0.003728975,0.00024549186,0.00047490696,0.0005127784,0.0007276748,0.0009803935,0.00097440253,0.0007399328,0.00041590453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012960683,0.0001416003,0.0031695408,0.00054403045,0.00013852053,0.0012820429,0.0008987295,0.15950756,0.31084344,0.112782046,0.0018721579,0.40752438],"study_design_scores_gemma":[0.00017192638,0.0010826542,0.0014799152,0.00011371229,0.000115805095,0.0028435502,0.000082516046,0.7056189,0.2461427,0.02578695,0.016355835,0.00020548597],"about_ca_topic_score_codex":0.00023430285,"about_ca_topic_score_gemma":0.00024061532,"teacher_disagreement_score":0.0010115635,"about_ca_system_score_codex":0.00040062293,"about_ca_system_score_gemma":0.00061113667,"threshold_uncertainty_score":0.0053497553},"labels":[],"label_agreement":null},{"id":"W2030759952","doi":"10.1109/qbsc.2012.6221374","title":"TS-LDPC analog decoding based on the Min-Sum algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Low-density parity-check code; Algorithm; Very-large-scale integration; Computer science; Decoding methods; Soft-decision decoder; Turbo code; Factor graph; Serial concatenated convolutional codes; Concatenated error correction code; Forward error correction; Block code","score_opus":0.03104339399536961,"score_gpt":0.2706700872046232,"score_spread":0.23962669320925362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030759952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014196022,0.00042974472,0.9797031,0.00006714182,0.00004400993,0.00004567353,0.00006465531,0.00044978486,0.0049997717],"genre_scores_gemma":[0.2846326,0.0009358816,0.7068901,0.00011259297,0.000062934305,0.00009862835,0.00019000219,0.00009331686,0.006983893],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945205,0.00012481252,0.00003897848,0.00007789115,0.0002725519,0.000033645898],"domain_scores_gemma":[0.9993148,0.00024523085,0.00007022391,0.00011627971,0.0002373466,0.00001629837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036724718,0.00048326346,0.00044599574,0.0005980568,0.00035829624,0.0008117096,0.0006178557,0.0004040959,0.0017882771],"category_scores_gemma":[0.0017524952,0.00020176377,0.00032229052,0.0008927657,0.00057624857,0.00074034964,0.0005090621,0.0005645574,0.0006481326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030118707,0.000049622387,0.0009997882,0.00050060614,0.000106242886,0.00022370147,0.00021884018,0.25270918,0.079937555,0.18062063,0.0026873455,0.4816453],"study_design_scores_gemma":[0.000028543507,0.00012988794,0.0003671552,0.000048261914,0.000033073524,0.00055519835,0.000019729845,0.8590599,0.10291743,0.02393421,0.012869753,0.000036855705],"about_ca_topic_score_codex":0.0012669975,"about_ca_topic_score_gemma":0.0017688408,"teacher_disagreement_score":0.0017882771,"about_ca_system_score_codex":0.00052015693,"about_ca_system_score_gemma":0.0011337682,"threshold_uncertainty_score":0.005982399},"labels":[],"label_agreement":null},{"id":"W2033682192","doi":"10.1109/icc.2004.1312526","title":"Hybrid hard-decision iterative decoding of regular low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Binary number; Low-density parity-check code; List decoding; Theoretical computer science; Mathematics; Arithmetic; Concatenated error correction code; Block code","score_opus":0.019192268852577406,"score_gpt":0.27036672167309206,"score_spread":0.25117445282051465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033682192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11147167,0.00032721687,0.8811058,0.00013461485,0.00006489335,0.000104488085,0.00008149656,0.000977069,0.005732824],"genre_scores_gemma":[0.58696055,0.0002725758,0.40780967,0.00018113617,0.00004958353,0.00009901921,0.0002256086,0.000105962354,0.004295816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983516,0.0005785682,0.00008854456,0.00023236839,0.00057925825,0.00016968962],"domain_scores_gemma":[0.9967399,0.0016812918,0.00026225334,0.0007868698,0.00043118146,0.00009848897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293427,0.0006623416,0.00070763595,0.00086493866,0.00043235032,0.0012553505,0.0012313015,0.00071846746,0.0011133035],"category_scores_gemma":[0.0045215604,0.00024237283,0.0004953912,0.00093737047,0.0009689674,0.00121476,0.0011893916,0.0007768953,0.0005943754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001236574,0.0002591127,0.0045643505,0.00032737307,0.00031972758,0.00031708064,0.00036608666,0.38429502,0.053543553,0.1406662,0.0019138849,0.412191],"study_design_scores_gemma":[0.00006407421,0.00016668346,0.00041963803,0.000017757757,0.00004594097,0.00022354457,0.000028726598,0.91938454,0.04651576,0.031390432,0.0017017081,0.000041241117],"about_ca_topic_score_codex":0.0010600676,"about_ca_topic_score_gemma":0.0016589044,"teacher_disagreement_score":0.0015293427,"about_ca_system_score_codex":0.0007082414,"about_ca_system_score_gemma":0.0009703097,"threshold_uncertainty_score":0.008087993},"labels":[],"label_agreement":null},{"id":"W2034378621","doi":"10.1049/el:20053325","title":"Design of high-performance low-density parity-check codes using interleaver approach","year":2005,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Turbo code; Low-density parity-check code; Serial concatenated convolutional codes; Error floor; Computer science; Algorithm; Raptor code; Concatenated error correction code; Mathematics; Decoding methods; Block code","score_opus":0.017928669411876517,"score_gpt":0.2329695312148389,"score_spread":0.2150408618029624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034378621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043239225,0.00024843946,0.9533851,0.00007518842,0.000030142575,0.00005171564,0.000043906904,0.00036852947,0.0025578064],"genre_scores_gemma":[0.6631865,0.0003545993,0.33352444,0.000108486216,0.000028370176,0.00015724792,0.00014183992,0.00004070038,0.002457886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998005,0.00006113219,0.000011731638,0.000026227013,0.00007174475,0.000028721677],"domain_scores_gemma":[0.9996848,0.00011833919,0.00004803497,0.000032436194,0.00009622311,0.00002023126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030397417,0.00028232945,0.00024970944,0.0003163965,0.00020881857,0.00037945074,0.00054680835,0.00029572102,0.0006434985],"category_scores_gemma":[0.00066173775,0.00016171038,0.00016040917,0.0002978193,0.00021178194,0.00026568765,0.00027090136,0.00036206466,0.00020789896],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042740107,0.0001691811,0.0026055998,0.00037863688,0.000116870804,0.0006360434,0.0002512275,0.36705452,0.25633582,0.14799802,0.0024659797,0.22156073],"study_design_scores_gemma":[0.00006395932,0.00025029838,0.0003940064,0.000020425437,0.00003459262,0.00020570516,0.000015951933,0.9180118,0.06396964,0.011564429,0.005444008,0.000025162683],"about_ca_topic_score_codex":0.0005186173,"about_ca_topic_score_gemma":0.0010901111,"teacher_disagreement_score":0.0006434985,"about_ca_system_score_codex":0.0002914284,"about_ca_system_score_gemma":0.00054946746,"threshold_uncertainty_score":0.0021526814},"labels":[],"label_agreement":null},{"id":"W2034670354","doi":"10.1007/s10623-009-9349-0","title":"Codes with girth 8 Tanner graph representation","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Tanner graph; BCH code; Mathematics; Combinatorics; Discrete mathematics; Low-density parity-check code; Graph; Block code; Linear code; Algorithm; Decoding methods","score_opus":0.022173682511064947,"score_gpt":0.2638585864305356,"score_spread":0.24168490391947067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034670354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23278366,0.0013919692,0.6731651,0.002769472,0.0006847456,0.00044015166,0.0015477826,0.0029528064,0.08426427],"genre_scores_gemma":[0.7870879,0.0010570642,0.1619779,0.0009136584,0.00022442902,0.00042378908,0.00090313284,0.00034430978,0.047067776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939835,0.0001739952,0.00003263644,0.000080947306,0.00021035419,0.00010367982],"domain_scores_gemma":[0.99837315,0.00048161036,0.00017624052,0.0006360244,0.00027004958,0.00006289613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003985828,0.00056479883,0.0005440442,0.0012429387,0.0010105517,0.0013014135,0.00069761276,0.0013287828,0.008885412],"category_scores_gemma":[0.0025426224,0.0003039649,0.00045891685,0.0014577924,0.000848202,0.0011993815,0.0010535733,0.0015349516,0.0019932494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026962813,0.000088390414,0.00056478794,0.00017575668,0.00003775265,0.0003186402,0.0004224154,0.032874532,0.015486256,0.86094886,0.008558396,0.08025457],"study_design_scores_gemma":[0.0001048562,0.00021858868,0.00059794885,0.00014598202,0.00006273694,0.0007299581,0.00013187986,0.114018746,0.025246197,0.823157,0.035515673,0.00007037584],"about_ca_topic_score_codex":0.0010100415,"about_ca_topic_score_gemma":0.0015085757,"teacher_disagreement_score":0.008885412,"about_ca_system_score_codex":0.00084751245,"about_ca_system_score_gemma":0.0012582714,"threshold_uncertainty_score":0.029724658},"labels":[],"label_agreement":null},{"id":"W2035445587","doi":"10.1109/isit.2007.4557271","title":"Code Decomposition: Theory and Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Matroid; Decoding methods; Coding theory; Linear programming; Linear code; Mathematics; Concatenated error correction code; List decoding; Channel code; Binary code; Binary number; Computer science; Dimension (graph theory); Code (set theory); Context (archaeology); Sequential decoding; Discrete mathematics; Algorithm; Combinatorics; Block code; Arithmetic","score_opus":0.010372614328507605,"score_gpt":0.31082181356583916,"score_spread":0.30044919923733154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035445587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010784993,0.01822447,0.9191446,0.0025150164,0.0004722314,0.00005847454,0.0004204455,0.00033810435,0.048041698],"genre_scores_gemma":[0.45306182,0.03553164,0.47236094,0.002345514,0.0033517322,0.00048461306,0.0014897751,0.00055851386,0.03081529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983852,0.00047580368,0.0000797529,0.0003586316,0.000533923,0.00016668903],"domain_scores_gemma":[0.9959984,0.002133991,0.0002685284,0.0006447572,0.00074502797,0.00020927939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014244803,0.0010537826,0.0010243942,0.0030437792,0.0014242539,0.0033804865,0.001237997,0.0019325543,0.0049801166],"category_scores_gemma":[0.0066065933,0.0006957889,0.0011023182,0.0055194125,0.0038023714,0.004142548,0.0031171371,0.0040279147,0.0018307274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013654656,0.000013225563,0.0001988385,0.00010433571,0.000010615673,0.000034810306,0.00009702026,0.0058369786,0.00035856388,0.96069455,0.0036692806,0.028968154],"study_design_scores_gemma":[0.000007331866,0.000018918408,0.00012950032,0.00006970039,0.000009052956,0.00019909609,0.00004171514,0.0350162,0.00053094665,0.9365451,0.027414296,0.000018282659],"about_ca_topic_score_codex":0.0025273797,"about_ca_topic_score_gemma":0.0010055825,"teacher_disagreement_score":0.0049801166,"about_ca_system_score_codex":0.0024339627,"about_ca_system_score_gemma":0.0011748569,"threshold_uncertainty_score":0.017659664},"labels":[],"label_agreement":null},{"id":"W2038036388","doi":"10.1109/cwit.2013.6621618","title":"Systematic raptor codes for atmospheric optical channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Free-space optical communication; Raptor code; Keying; Transmitter; Redundancy (engineering); Synchronizing; Network packet; Optical communication; Bit error rate; Real-time computing; Electronic engineering; Forward error correction; Channel (broadcasting); Computer network; Telecommunications; Decoding methods; Transmission (telecommunications); Engineering; Concatenated error correction code; Block code","score_opus":0.0146111496507458,"score_gpt":0.25240987383007785,"score_spread":0.23779872417933204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038036388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10654147,0.0026633106,0.8798189,0.00039358868,0.0001340387,0.00010829346,0.00020774775,0.00064502726,0.009487573],"genre_scores_gemma":[0.79898417,0.0013625431,0.19586302,0.00017154693,0.00009837583,0.00017938128,0.00016447488,0.000053540614,0.0031230294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.00022732215,0.000026768941,0.000066322544,0.00027264978,0.00007352489],"domain_scores_gemma":[0.99671054,0.0017476854,0.00048361515,0.00047370765,0.00054947357,0.00003491929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006007007,0.00037942888,0.00026882018,0.0004775376,0.00042494477,0.00046141227,0.00040768483,0.0006109882,0.0011528713],"category_scores_gemma":[0.004087602,0.0001999452,0.0002106399,0.0005349307,0.0006208334,0.0005382159,0.0004368488,0.00055005454,0.00035407837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053515646,0.000075809025,0.0019135616,0.0005527762,0.00010796225,0.00070612505,0.000638943,0.44090757,0.074189976,0.23403198,0.0044097477,0.24193038],"study_design_scores_gemma":[0.000061382336,0.00023835157,0.0007044473,0.00009239368,0.000046435787,0.00081332115,0.000054095894,0.8788441,0.04354223,0.058355696,0.017159946,0.00008761542],"about_ca_topic_score_codex":0.0013087915,"about_ca_topic_score_gemma":0.0016995643,"teacher_disagreement_score":0.0013087915,"about_ca_system_score_codex":0.00029750628,"about_ca_system_score_gemma":0.0009026603,"threshold_uncertainty_score":0.0038567185},"labels":[],"label_agreement":null},{"id":"W2039436865","doi":"10.1109/tcomm.2008.060315","title":"On the complexity of joint source-channel decoding of Markov sequences over memoryless channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Convolutional code; Decoding methods; Viterbi algorithm; Algorithm; Source code; Markov process; Computer science; Markov chain; Viterbi decoder; Discrete mathematics; Mathematics; Theoretical computer science; Statistics","score_opus":0.16279026126519539,"score_gpt":0.3071654428613609,"score_spread":0.1443751815961655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039436865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5281144,0.0021541228,0.44920638,0.0043650037,0.000172719,0.00020509989,0.0013093785,0.0013458409,0.01312705],"genre_scores_gemma":[0.9494375,0.00076907396,0.044315603,0.00024365891,0.00014698583,0.00022267363,0.001011447,0.0002457309,0.003607318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963529,0.0012339476,0.00014118846,0.00041301805,0.0010847995,0.00077418075],"domain_scores_gemma":[0.93490356,0.06007376,0.0016408511,0.0014197689,0.0014705296,0.0004915137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036624747,0.0010317527,0.0015496506,0.0009104464,0.0010514191,0.0025707104,0.001825459,0.0015488806,0.0039839707],"category_scores_gemma":[0.027198222,0.00072254747,0.00092016364,0.0012070524,0.002276515,0.00543316,0.0021967825,0.0024804978,0.0004860656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012214171,0.00007040954,0.0021500182,0.00018472958,0.00009090484,0.000260467,0.00018767678,0.9408568,0.0035560762,0.03212177,0.0017268625,0.017572783],"study_design_scores_gemma":[0.000028775987,0.000032195323,0.00024720523,0.000011003042,0.000011492631,0.000030692263,0.000025767386,0.9809684,0.00095861236,0.017549766,0.00012469952,0.000011429476],"about_ca_topic_score_codex":0.008366216,"about_ca_topic_score_gemma":0.008665002,"teacher_disagreement_score":0.008366216,"about_ca_system_score_codex":0.0042718695,"about_ca_system_score_gemma":0.0042048865,"threshold_uncertainty_score":0.030994713},"labels":[],"label_agreement":null},{"id":"W2041058635","doi":"","title":"Towards deterministic tree code constructions.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Computation; Code (set theory); Bounded function; Product (mathematics); Mathematics; K-ary tree; Interval tree; Discrete mathematics; Construct (python library); Theoretical computer science; Computer science; Operator (biology); Algorithm; Tree structure; Binary tree; Combinatorics","score_opus":0.07038306872289203,"score_gpt":0.2931564632101951,"score_spread":0.2227733944873031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041058635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011542203,0.00035626104,0.982451,0.00030683982,0.000066364526,0.000056109784,0.000083394785,0.00036465246,0.00477304],"genre_scores_gemma":[0.289592,0.0010381872,0.70059973,0.00044920546,0.00014774306,0.00056572276,0.00031675393,0.0004224798,0.0068681226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969164,0.00083545275,0.00012369618,0.0004115807,0.0013779339,0.00033490275],"domain_scores_gemma":[0.9898997,0.0052732243,0.00074524403,0.0026208535,0.0011689261,0.00029207245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024482603,0.0007327997,0.000676871,0.0011460263,0.0013225197,0.0015867861,0.0018097784,0.0015701004,0.0026620177],"category_scores_gemma":[0.011700065,0.0008088632,0.0010604989,0.0012437139,0.00335729,0.0037223662,0.0049842154,0.004225574,0.0013317271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058806334,0.00003536207,0.00036814544,0.00015737646,0.000018822468,0.00010014405,0.00028363147,0.027532406,0.0076536373,0.9378319,0.0018783254,0.024081428],"study_design_scores_gemma":[0.00003818251,0.00007856374,0.00018546174,0.00008244756,0.000026257574,0.00033018613,0.000051435778,0.20926766,0.017990313,0.7556311,0.016253466,0.00006499704],"about_ca_topic_score_codex":0.00095909607,"about_ca_topic_score_gemma":0.0010809529,"teacher_disagreement_score":0.0026620177,"about_ca_system_score_codex":0.0016223289,"about_ca_system_score_gemma":0.0017324167,"threshold_uncertainty_score":0.012947798},"labels":[],"label_agreement":null},{"id":"W2041388961","doi":"10.1016/j.laa.2013.05.016","title":"Solving sparse linear systems of equations over finite fields using bit-flipping algorithm","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Algorithm; Coefficient matrix; Finite field; Decoding methods; System of linear equations; Bounded function; Linear system; Matrix (chemical analysis); Discrete mathematics; Linear equation; Parity-check matrix; Sparse matrix; Combinatorics; Low-density parity-check code; Mathematical analysis","score_opus":0.03267507473192976,"score_gpt":0.28032326905554167,"score_spread":0.2476481943236119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041388961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028933743,0.0001660126,0.96561164,0.00037872227,0.00009813659,0.00005581542,0.00009582413,0.00058095873,0.0040792637],"genre_scores_gemma":[0.35506836,0.00036578998,0.63764656,0.00023435219,0.00010632038,0.00016082829,0.0002902683,0.00014323203,0.0059843217],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937516,0.00022130486,0.000040715742,0.000074079224,0.00022290066,0.00006586901],"domain_scores_gemma":[0.998214,0.0010383484,0.00012753914,0.00029996564,0.00027692958,0.000043247666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007088627,0.00068699854,0.00074160413,0.00054669,0.00052386883,0.00075581786,0.0007571187,0.0008030778,0.0050077867],"category_scores_gemma":[0.0050893677,0.00037233994,0.00049324235,0.0010779651,0.0008048644,0.0014715518,0.0013843207,0.0015601849,0.00088107336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034778935,0.00016608588,0.0014912924,0.000546583,0.00013570591,0.00040102215,0.00038990044,0.29489544,0.018349707,0.2622114,0.010503692,0.41056138],"study_design_scores_gemma":[0.00009038136,0.00006583428,0.00016803616,0.0000401335,0.000028946197,0.00012985595,0.00006096445,0.8581835,0.012515763,0.125157,0.0035320076,0.000027584669],"about_ca_topic_score_codex":0.0014773498,"about_ca_topic_score_gemma":0.0026421302,"teacher_disagreement_score":0.0050077867,"about_ca_system_score_codex":0.00030519816,"about_ca_system_score_gemma":0.0011252691,"threshold_uncertainty_score":0.01675266},"labels":[],"label_agreement":null},{"id":"W2042038317","doi":"10.1109/ecoc.2014.6964209","title":"Next generation error correcting codes for lightwave systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Error detection and correction; Forward error correction; Turbo code; Transmission (telecommunications); Luby transform code; Algorithm; Concatenated error correction code; Theoretical computer science; Computer engineering; Block code; Decoding methods; Telecommunications","score_opus":0.07541534981901463,"score_gpt":0.29556338012128547,"score_spread":0.22014803030227084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042038317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04181541,0.028927859,0.889807,0.003561256,0.0016792377,0.000113375776,0.00014190651,0.00073403184,0.03321997],"genre_scores_gemma":[0.4485405,0.026220191,0.4886199,0.0015584124,0.0014419571,0.0002586702,0.0003343361,0.00028810868,0.032737922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946624,0.000084863386,0.000024573312,0.000056475594,0.0003080916,0.000059802653],"domain_scores_gemma":[0.99854726,0.0004897923,0.0001277227,0.0002689172,0.00051750685,0.000048779882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071074,0.00048441876,0.00042140894,0.0010935726,0.0006113997,0.0010959728,0.0008960907,0.0010439929,0.0032614868],"category_scores_gemma":[0.0024673596,0.000178908,0.00031995005,0.00071296457,0.00088222796,0.0016889209,0.0010032448,0.0016232498,0.00091965223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020102486,0.000100718826,0.0010007989,0.000638261,0.000061952676,0.0003061655,0.00040311526,0.034324188,0.051029567,0.59656984,0.0069053215,0.30845904],"study_design_scores_gemma":[0.00008359756,0.00030469146,0.00081402145,0.0006858108,0.00011389647,0.0018103543,0.00015125686,0.2646286,0.15322132,0.27601507,0.30196583,0.00020548188],"about_ca_topic_score_codex":0.0009140287,"about_ca_topic_score_gemma":0.0013154165,"teacher_disagreement_score":0.0032614868,"about_ca_system_score_codex":0.0009653272,"about_ca_system_score_gemma":0.00097086263,"threshold_uncertainty_score":0.010910749},"labels":[],"label_agreement":null},{"id":"W2043938249","doi":"10.1109/qbsc.2012.6221371","title":"Outage probability of rateless codes in memoryless erasure channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Erasure; Decoding methods; Fountain code; Computer science; Binary erasure channel; Channel (broadcasting); Algorithm; Online codes; Simple (philosophy); Erasure code; Probability distribution; Probability of error; Mathematics; Channel capacity; Statistics; Sequential decoding; Concatenated error correction code; Block code; Telecommunications","score_opus":0.03904096137920101,"score_gpt":0.2838515716197916,"score_spread":0.24481061024059056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043938249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2918604,0.002093642,0.6995563,0.00060751115,0.00007512826,0.0000388493,0.00025563771,0.0004849209,0.0050277268],"genre_scores_gemma":[0.98805153,0.0007570088,0.009763251,0.00006567958,0.000042979835,0.000027909855,0.00007301654,0.000061663784,0.0011570129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979488,0.00074746,0.00007032825,0.00019159287,0.0006796037,0.00036218853],"domain_scores_gemma":[0.9836642,0.0130469315,0.0013928802,0.00070686627,0.000979453,0.0002096311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003095724,0.0011461797,0.0014051568,0.0010289238,0.000655383,0.0013098514,0.0011343365,0.0014597282,0.00073434925],"category_scores_gemma":[0.017988391,0.00047021618,0.00047593008,0.0011421834,0.0025798525,0.0026830877,0.0014846114,0.0012701422,0.00016730827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015622402,0.000029011675,0.0016341681,0.000116628624,0.000029525167,0.00034254743,0.00018118451,0.9462709,0.0024467853,0.042659786,0.00036526495,0.005768027],"study_design_scores_gemma":[0.0000060909338,0.000025257657,0.00037069392,0.000016830716,0.000010806157,0.00010759096,0.000027554252,0.9858943,0.0013339306,0.012096685,0.000094111914,0.000016111018],"about_ca_topic_score_codex":0.0032096135,"about_ca_topic_score_gemma":0.0016054957,"teacher_disagreement_score":0.0032096135,"about_ca_system_score_codex":0.0016421137,"about_ca_system_score_gemma":0.0010834412,"threshold_uncertainty_score":0.016371965},"labels":[],"label_agreement":null},{"id":"W2044607510","doi":"10.1109/tcomm.2005.861668","title":"Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Asynchronous communication; Successive over-relaxation; Belief propagation; Relaxation (psychology); Mathematics; Computer science; Iterative method; Gaussian; Telecommunications","score_opus":0.024923408748593487,"score_gpt":0.2895366205965194,"score_spread":0.2646132118479259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044607510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48824054,0.0005144026,0.5010403,0.00033741494,0.000019777885,0.000052701504,0.00008877283,0.00029448356,0.009411608],"genre_scores_gemma":[0.98731405,0.00017879308,0.011460153,0.000018817427,0.000006001336,0.00002140917,0.00003900519,0.000022184064,0.00093973655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.00011905771,0.000009823292,0.000039205246,0.00013791957,0.0000374235],"domain_scores_gemma":[0.99811745,0.0012596592,0.00022348206,0.00011043053,0.00025469446,0.000034263165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006604814,0.0003420188,0.00034871427,0.00035313852,0.00020715041,0.00036229103,0.00046766896,0.00037807613,0.0007616894],"category_scores_gemma":[0.0048801373,0.00020243708,0.00021796298,0.00033226327,0.00080276985,0.00079573935,0.00043059528,0.0005715205,0.00014934942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006355107,0.000022254446,0.0010423448,0.00004912837,0.000012477887,0.00007161346,0.00012433658,0.95535684,0.011938042,0.023776865,0.00017182797,0.0073707676],"study_design_scores_gemma":[0.0000014714316,0.00001047123,0.00014508603,0.0000018136618,0.0000013507986,0.000009997589,0.00000461235,0.99747485,0.0011821368,0.0011167522,0.000048582067,0.0000028288703],"about_ca_topic_score_codex":0.0028920495,"about_ca_topic_score_gemma":0.0013307546,"teacher_disagreement_score":0.0028920495,"about_ca_system_score_codex":0.000929811,"about_ca_system_score_gemma":0.0006259609,"threshold_uncertainty_score":0.0067463517},"labels":[],"label_agreement":null},{"id":"W2045353245","doi":"10.1109/ciss.2007.4298343","title":"An FPGA Architecture of Stable-Sorting on a Large Data Volume : Application to Video Signals","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; VHDL; Sorting; Sorting algorithm; Clock rate; MATLAB; Hardware architecture; Parallel computing; Computer hardware; Volume (thermodynamics); Software; Embedded system; Chip; Algorithm","score_opus":0.026952612442233823,"score_gpt":0.3251996530663583,"score_spread":0.29824704062412444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045353245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104949765,0.00089467183,0.87900484,0.00017986311,0.00017163821,0.00013435484,0.0001898574,0.0047890325,0.009685932],"genre_scores_gemma":[0.5204849,0.00045642356,0.47169647,0.00010526824,0.000062487066,0.00007010906,0.0002754809,0.000076290795,0.006772566],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999306,0.0000088813385,0.0000041470034,0.000015051609,0.000031825475,0.000009405896],"domain_scores_gemma":[0.9999379,0.0000127040785,0.0000075082057,0.000011474881,0.000023771992,0.000006675822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105963656,0.0002571724,0.0002149984,0.00036119833,0.00023797971,0.00039150807,0.0006925338,0.00021598669,0.0024567482],"category_scores_gemma":[0.00017972135,0.000111946676,0.00012498818,0.00039611646,0.0001281093,0.00029750145,0.0001017854,0.00016219406,0.0005921027],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052072015,0.000070691654,0.0012409807,0.00027589293,0.000056195477,0.0005398536,0.0000814597,0.05054811,0.32188633,0.016016208,0.0061677652,0.60259587],"study_design_scores_gemma":[0.0002117436,0.0012801256,0.0036644798,0.00005446584,0.00008661948,0.0020989173,0.00005617098,0.68265724,0.2619365,0.003499547,0.04438767,0.000066665765],"about_ca_topic_score_codex":0.0013436729,"about_ca_topic_score_gemma":0.0026639148,"teacher_disagreement_score":0.0024567482,"about_ca_system_score_codex":0.00033357122,"about_ca_system_score_gemma":0.00044516832,"threshold_uncertainty_score":0.008218646},"labels":[],"label_agreement":null},{"id":"W2046943920","doi":"10.1109/lcomm.2014.2331070","title":"Fast and Accurate Error Floor Estimation of Quantized Iterative Decoders for Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Variable (mathematics); Computer science; Error floor; Error detection and correction; Code (set theory); Random variable; Iterative method; Concatenated error correction code; Theoretical computer science; Mathematics; Block code; Statistics; Set (abstract data type)","score_opus":0.0358510518894255,"score_gpt":0.31529368093715215,"score_spread":0.27944262904772665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046943920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030706348,0.000119612654,0.9681267,0.000028011276,0.000011515501,0.000018106477,0.00004095984,0.00038924947,0.0005593946],"genre_scores_gemma":[0.5382855,0.00021641614,0.46062768,0.000027626787,0.000013902766,0.000041697305,0.00010911829,0.00006114039,0.00061689335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933654,0.00016956571,0.000035967496,0.00008079639,0.00032659748,0.000050425006],"domain_scores_gemma":[0.99864155,0.0007137091,0.00018185578,0.00018409493,0.00024799438,0.00003082408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364617,0.0005771121,0.0005730617,0.00069914194,0.00032393422,0.000693313,0.0006122155,0.00041274677,0.0005993156],"category_scores_gemma":[0.004776802,0.00028881067,0.00020120302,0.00042705217,0.0006188258,0.0011461447,0.0007309525,0.0007738836,0.00020380593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027975434,0.00005673346,0.0032910928,0.00022412074,0.000055364297,0.00019903177,0.0003474963,0.6460323,0.09420364,0.037401788,0.0008889396,0.21701975],"study_design_scores_gemma":[0.000008168438,0.000032027183,0.00035533583,0.000011641889,0.00000572732,0.00007180124,0.000017674678,0.9662837,0.0281037,0.0047399425,0.00035101373,0.000019302533],"about_ca_topic_score_codex":0.0015466448,"about_ca_topic_score_gemma":0.0019377936,"teacher_disagreement_score":0.0015466448,"about_ca_system_score_codex":0.00048517872,"about_ca_system_score_gemma":0.000751798,"threshold_uncertainty_score":0.0035202503},"labels":[],"label_agreement":null},{"id":"W2048201255","doi":"10.1142/s0218126605002428","title":"A NOVEL STATE ENCODING ALGORITHM FOR LOW POWER IMPLEMENTATION","year":2005,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Encoding (memory); Computer science; State (computer science); Algorithm; Power (physics); Dissipation; Binary number; Function (biology); Mathematics; Arithmetic; Artificial intelligence","score_opus":0.019186119098559926,"score_gpt":0.2836292654400049,"score_spread":0.26444314634144495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048201255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040477677,0.000085717475,0.9936341,0.00008005246,0.000034846384,0.000042740143,0.000043544314,0.0008330833,0.0011981581],"genre_scores_gemma":[0.09640998,0.00020283638,0.8993553,0.00009583542,0.000039563904,0.00019679272,0.00028219193,0.00013416182,0.0032833244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968255,0.000062281244,0.00002773726,0.00006697419,0.00012840645,0.000032138676],"domain_scores_gemma":[0.99955076,0.00018228331,0.000043527223,0.000096256925,0.000114856375,0.000012375562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034344092,0.00075336185,0.00047231498,0.0005951631,0.0004233374,0.0006524163,0.00094439136,0.0007474533,0.0035561437],"category_scores_gemma":[0.0014447655,0.0002755564,0.0003837773,0.0007642621,0.00036951707,0.0015037304,0.0006229892,0.0012455733,0.0008790486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012341511,0.00014497778,0.00027817066,0.00015759838,0.000026394408,0.00006458154,0.00007163757,0.09438907,0.028928371,0.05862332,0.0048158695,0.8123767],"study_design_scores_gemma":[0.000056751756,0.000118686134,0.00013119778,0.000028989252,0.000028004706,0.00014228326,0.000017460803,0.924349,0.029501867,0.0355674,0.0100367265,0.000021583577],"about_ca_topic_score_codex":0.0007450269,"about_ca_topic_score_gemma":0.0011450311,"teacher_disagreement_score":0.0035561437,"about_ca_system_score_codex":0.0004536564,"about_ca_system_score_gemma":0.0010487245,"threshold_uncertainty_score":0.011896431},"labels":[],"label_agreement":null},{"id":"W2048639857","doi":"10.1109/tce.2005.1405697","title":"Robust data transmission using the transmitter identification sequences in ATSC DVT signals","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Communications Research Centre Canada","funders":"","keywords":"Transmitter; Computer science; Robustness (evolution); Transmission (telecommunications); Data transmission; Identification (biology); Electronic engineering; Synchronization (alternating current); Digital radio; Telecommunications; Engineering; Computer network; Channel (broadcasting)","score_opus":0.07861075684714051,"score_gpt":0.3116254020682989,"score_spread":0.2330146452211584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048639857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24321336,0.0012942762,0.74525374,0.00032577768,0.00014185018,0.00013991268,0.00015319929,0.0012361995,0.008241762],"genre_scores_gemma":[0.8541962,0.00049703586,0.14191334,0.00010340111,0.00008682519,0.000063741616,0.0001515878,0.00004715398,0.0029407255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995497,0.00010496109,0.00003209046,0.00006349901,0.00021838519,0.00003135088],"domain_scores_gemma":[0.99939096,0.00017130391,0.00014518353,0.00010114992,0.0001737288,0.000017587583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037225086,0.00028894894,0.0002511461,0.000504663,0.0002496247,0.00036422012,0.00030290495,0.00034169515,0.00072926766],"category_scores_gemma":[0.0011978243,0.00010901016,0.00012234258,0.0004023124,0.00030018875,0.00042710223,0.00030982145,0.00033683702,0.00035340711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007453252,0.000059641046,0.0020612555,0.0002368059,0.000031553434,0.00035816655,0.00033086943,0.015242103,0.6766911,0.014801734,0.0014684258,0.2879731],"study_design_scores_gemma":[0.00008903605,0.0016509134,0.003969378,0.00008730062,0.00008118376,0.002366646,0.000109295645,0.21604683,0.75579214,0.0043887217,0.015361514,0.000057169334],"about_ca_topic_score_codex":0.00029926805,"about_ca_topic_score_gemma":0.00022608295,"teacher_disagreement_score":0.00072926766,"about_ca_system_score_codex":0.0002482185,"about_ca_system_score_gemma":0.00020176012,"threshold_uncertainty_score":0.002439618},"labels":[],"label_agreement":null},{"id":"W2049509824","doi":"10.1186/1687-1499-2014-3","title":"Distributed joint source-channel code design for GMAC using irregular LDPC codes","year":2014,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Computer science; Algorithm; Source code; Channel code; Channel (broadcasting); Gaussian; Coding (social sciences); Decoding methods; Theoretical computer science; Binary number; Mathematics; Telecommunications; Statistics","score_opus":0.10530911055905905,"score_gpt":0.3081077437521318,"score_spread":0.20279863319307273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049509824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01409707,0.00012746248,0.9842159,0.00009542493,0.000017051558,0.00003417059,0.0000459347,0.00024783422,0.0011190677],"genre_scores_gemma":[0.6019538,0.00027444505,0.39539295,0.00012064526,0.000034918437,0.00016406924,0.00017807461,0.00007975374,0.0018012945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881244,0.0004256353,0.000042818414,0.00019728391,0.00042687822,0.00009497379],"domain_scores_gemma":[0.9975272,0.0010335369,0.00041120665,0.00037459243,0.000566694,0.00008672006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089372875,0.0007242226,0.0005330797,0.00060783053,0.0005449745,0.0007142213,0.00081950164,0.0007094716,0.0010005912],"category_scores_gemma":[0.0032736266,0.00028751724,0.00044299607,0.0008843312,0.0009021551,0.00080646854,0.00092743617,0.0011004888,0.00040043582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024887657,0.00006768926,0.0010192074,0.00017734934,0.000084166444,0.00013259766,0.00019556317,0.8075135,0.034098793,0.07019408,0.0011720108,0.08509628],"study_design_scores_gemma":[0.000018859566,0.00006110016,0.00009969815,0.000012875761,0.0000122590645,0.00008140192,0.0000133764715,0.97966397,0.009763267,0.0090153655,0.0012418656,0.00001600084],"about_ca_topic_score_codex":0.0019551143,"about_ca_topic_score_gemma":0.0036015748,"teacher_disagreement_score":0.0019551143,"about_ca_system_score_codex":0.0010248271,"about_ca_system_score_gemma":0.0020221928,"threshold_uncertainty_score":0.0074356794},"labels":[],"label_agreement":null},{"id":"W2049608049","doi":"10.1109/tit.2006.887467","title":"On Designing Good LDPC Codes for Markov Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Markov chain; Decoding methods; Computer science; Schedule; Channel (broadcasting); Algorithm; Block (permutation group theory); Markov process; Code (set theory); Message passing; Theoretical computer science; Mathematics; Parallel computing; Telecommunications; Combinatorics; Set (abstract data type); Statistics","score_opus":0.01377970465499197,"score_gpt":0.2608090091921903,"score_spread":0.24702930453719832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049608049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04034106,0.00028604266,0.95660937,0.00019296173,0.000017865874,0.00006111518,0.00004233995,0.00020670149,0.002242519],"genre_scores_gemma":[0.62836,0.00083406945,0.36773857,0.00016786365,0.00004865072,0.00022485282,0.00013631738,0.00011671225,0.0023730306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988255,0.0005138799,0.00005052492,0.0001274611,0.0003841342,0.000098522105],"domain_scores_gemma":[0.99679947,0.0021249764,0.00026301964,0.0004700428,0.00027176063,0.00007078444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280945,0.0006516998,0.000635517,0.0005023621,0.00062775705,0.0006276808,0.00064521004,0.00070440094,0.0010348418],"category_scores_gemma":[0.009426466,0.000415069,0.00031553497,0.0005280551,0.001504551,0.0015251988,0.0010779373,0.00091709103,0.000327873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016414093,0.00003769593,0.0007828784,0.00018230603,0.000031281554,0.000073969364,0.00034078877,0.6814886,0.013730546,0.24508761,0.00076085917,0.057319343],"study_design_scores_gemma":[0.000028920418,0.00005884391,0.00011362045,0.000023776312,0.000010657639,0.00005044354,0.000021727445,0.93176246,0.006979093,0.05894469,0.001989213,0.000016549338],"about_ca_topic_score_codex":0.0013639027,"about_ca_topic_score_gemma":0.0017039859,"teacher_disagreement_score":0.0017280945,"about_ca_system_score_codex":0.0010643105,"about_ca_system_score_gemma":0.0010443472,"threshold_uncertainty_score":0.009139121},"labels":[],"label_agreement":null},{"id":"W2051270424","doi":"10.1109/lcomm.2011.101811.111480","title":"A Simplified Successive-Cancellation Decoder for Polar Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":457,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Block code; Algorithm; Latency (audio); Soft-decision decoder; Polar; Bit error rate; Concatenated error correction code; Linear code; Polar code; Telecommunications","score_opus":0.09236214429013771,"score_gpt":0.3130310112581669,"score_spread":0.22066886696802918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051270424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049325414,0.00019780712,0.98748404,0.00012215505,0.00015513228,0.00010739449,0.00022457854,0.00086590793,0.0059103793],"genre_scores_gemma":[0.14860663,0.0010831499,0.8304265,0.0003916879,0.00020341054,0.00025766253,0.0011615427,0.000234246,0.017635288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994055,0.00007543015,0.000033089473,0.00007044904,0.00036578838,0.000049755632],"domain_scores_gemma":[0.9993144,0.00013429197,0.000045895715,0.00018163882,0.00028850668,0.000035218105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040645857,0.00071341894,0.00065821235,0.00054195634,0.0004883419,0.00090375636,0.0010164804,0.0005206284,0.004024907],"category_scores_gemma":[0.0015586272,0.00029565394,0.00049895473,0.00056512456,0.0005087136,0.00088712847,0.00088683644,0.0014956233,0.0034789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007531113,0.00010678548,0.0006270917,0.00052684057,0.00008822923,0.0007581007,0.00018892299,0.118587166,0.30307987,0.16175762,0.012959934,0.40056634],"study_design_scores_gemma":[0.00015892451,0.00030782385,0.00048331454,0.000083516425,0.00010713407,0.001938127,0.000051012415,0.6633887,0.2192892,0.042068712,0.07195946,0.00016409883],"about_ca_topic_score_codex":0.0020705606,"about_ca_topic_score_gemma":0.0040763915,"teacher_disagreement_score":0.004024907,"about_ca_system_score_codex":0.00044925994,"about_ca_system_score_gemma":0.001852763,"threshold_uncertainty_score":0.01346463},"labels":[],"label_agreement":null},{"id":"W2051569409","doi":"10.1016/j.ejc.2003.10.002","title":"On codes from hypergraphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hebrew University of Jerusalem","keywords":"Mathematics; Hypergraph; Combinatorics; Vertex (graph theory); Discrete mathematics; Binary number; Decoding methods; List decoding; Block code; Algorithm; Graph; Concatenated error correction code","score_opus":0.01307566050862434,"score_gpt":0.22208362489756325,"score_spread":0.20900796438893893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051569409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18520093,0.0058889766,0.669038,0.0077097714,0.0012571677,0.00022339045,0.001286605,0.0015358966,0.12785923],"genre_scores_gemma":[0.7884899,0.007908884,0.12032376,0.0025746638,0.0018676424,0.00050119194,0.0016839773,0.0015834958,0.075066514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812204,0.000652493,0.00008411909,0.00025888273,0.0006739234,0.00020850035],"domain_scores_gemma":[0.98748326,0.008723185,0.00079012994,0.001421259,0.0011371254,0.00044508904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691945,0.0017291213,0.0013914057,0.004579078,0.0023379514,0.0035409082,0.0015391243,0.0021429057,0.007921099],"category_scores_gemma":[0.014755139,0.0010747915,0.0010692395,0.0049158935,0.0031627708,0.006505927,0.0053775953,0.0045103407,0.0017733866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006313008,0.000015436854,0.00021970608,0.00008323616,0.000014798282,0.00009044071,0.00028633,0.009219635,0.0007497677,0.96659774,0.0037234537,0.018936288],"study_design_scores_gemma":[0.000009170368,0.00001179191,0.00007019136,0.0000498683,0.000010682555,0.000084943786,0.000033736917,0.017815657,0.00067090924,0.9767736,0.0044528954,0.000016478933],"about_ca_topic_score_codex":0.0032025746,"about_ca_topic_score_gemma":0.002509269,"teacher_disagreement_score":0.007921099,"about_ca_system_score_codex":0.002440678,"about_ca_system_score_gemma":0.0013289117,"threshold_uncertainty_score":0.026498735},"labels":[],"label_agreement":null},{"id":"W2051821457","doi":"10.1109/tcomm.2009.11.080460","title":"Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Transmission (telecommunications); Channel (broadcasting); Rayleigh fading; Automatic repeat request; Computer network; Hybrid automatic repeat request; Algorithm; Real-time computing; Bitstream; Fading; Decoding methods; Telecommunications","score_opus":0.024948729394263604,"score_gpt":0.2998096858582066,"score_spread":0.274860956463943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051821457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036321,0.000255162,0.9623092,0.00013671574,0.000047375972,0.000051711326,0.000015827187,0.00026048187,0.00060242217],"genre_scores_gemma":[0.8407345,0.0001910389,0.15778472,0.00006299296,0.000043155625,0.00008548596,0.000030753592,0.00003885798,0.001028479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991047,0.00033266182,0.00006457524,0.00010677679,0.00027650318,0.000114772374],"domain_scores_gemma":[0.9970655,0.0018766177,0.00034799206,0.0002133824,0.00039474203,0.000101815305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014198729,0.00045536688,0.0007965394,0.00039409896,0.0005354068,0.0008036623,0.00071540696,0.0005694469,0.0008496577],"category_scores_gemma":[0.006035945,0.00029533278,0.00021540816,0.00036658818,0.00076252787,0.0007858737,0.0006559104,0.000663446,0.00019589852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092432025,0.00013056175,0.00124489,0.00016403841,0.00005812558,0.0002664125,0.0003636707,0.7483416,0.027265554,0.032005325,0.0018913784,0.187344],"study_design_scores_gemma":[0.00001661595,0.00004136067,0.00007453594,0.0000047385047,0.000005154485,0.00003901021,0.00000989217,0.994128,0.002921918,0.0024791092,0.00027278552,0.00000690785],"about_ca_topic_score_codex":0.001161712,"about_ca_topic_score_gemma":0.0009742782,"teacher_disagreement_score":0.0014198729,"about_ca_system_score_codex":0.0009055686,"about_ca_system_score_gemma":0.0010925141,"threshold_uncertainty_score":0.0075091124},"labels":[],"label_agreement":null},{"id":"W2052423140","doi":"10.1109/tit.2013.2253512","title":"Hierarchical and High-Girth QC LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Circulant matrix; Block code; Code (set theory); Parity-check matrix; Hierarchy; Linear code; Concatenated error correction code; Turbo code","score_opus":0.006841640311332939,"score_gpt":0.21768916800015495,"score_spread":0.210847527688822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052423140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07909833,0.00023976756,0.90626174,0.00019539532,0.00002568015,0.00007310503,0.00021565348,0.00055456517,0.01333573],"genre_scores_gemma":[0.56916404,0.00021587189,0.4234905,0.00017169029,0.000016786022,0.000116379044,0.0002441582,0.00008922861,0.006491452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963367,0.00007375236,0.000015194774,0.000064263084,0.00016791331,0.000045141183],"domain_scores_gemma":[0.99945337,0.00015451235,0.00006345015,0.00015376648,0.00014139085,0.000033429853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003056402,0.0002256389,0.00014653115,0.00029775428,0.0002969268,0.00037145393,0.00051512325,0.00036951038,0.0015922299],"category_scores_gemma":[0.0009967757,0.00016588687,0.00020447903,0.00042500166,0.00053760246,0.00038999124,0.00043996584,0.00051604916,0.00039001246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016782452,0.00005708466,0.0019568817,0.00022905314,0.000020272084,0.00031648364,0.000301667,0.370564,0.20946468,0.31633744,0.0027069005,0.097877726],"study_design_scores_gemma":[0.00003731072,0.00015834352,0.0016062225,0.000027874492,0.000019138994,0.00034722453,0.00005756499,0.8280448,0.084465854,0.06800054,0.017194824,0.00004028976],"about_ca_topic_score_codex":0.001935881,"about_ca_topic_score_gemma":0.0037572428,"teacher_disagreement_score":0.001935881,"about_ca_system_score_codex":0.0008234713,"about_ca_system_score_gemma":0.0008094168,"threshold_uncertainty_score":0.00597471},"labels":[],"label_agreement":null},{"id":"W2052749401","doi":"10.1109/bsc.2008.4563244","title":"An FPGA implementation of a soft-in soft-out decoder for block codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Field-programmable gate array; Computer science; Hamming code; VHDL; Soft-decision decoder; Soft error; Computer hardware; Parallel computing; Clock rate; Block (permutation group theory); Decoding methods; Embedded system; Block code; Algorithm; Electronic engineering; Engineering; Mathematics; Chip","score_opus":0.03945036789092545,"score_gpt":0.3518185278466181,"score_spread":0.31236815995569267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052749401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14825532,0.0007382288,0.80778515,0.00028729884,0.0003642054,0.0004343929,0.00058159576,0.008301602,0.033252265],"genre_scores_gemma":[0.6071944,0.0003815155,0.37384936,0.00020502973,0.000057065652,0.000120383025,0.000555757,0.00018374785,0.01745268],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998987,0.000015050525,0.00000564483,0.000013297123,0.000049521557,0.000017953727],"domain_scores_gemma":[0.9998692,0.000039221883,0.00001283815,0.000018715415,0.000047539157,0.000012408274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012416733,0.0003343879,0.00019453767,0.0003526653,0.00021468377,0.00037941855,0.0004052903,0.0002311227,0.0050869584],"category_scores_gemma":[0.0003243372,0.00014529662,0.00011089971,0.00015451771,0.00010858562,0.00021454318,0.00011488461,0.00026811144,0.0014347114],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084758986,0.000217013,0.0026346508,0.0005198107,0.00012208111,0.0012852672,0.00021180119,0.044102892,0.45324156,0.017547889,0.010490706,0.4687788],"study_design_scores_gemma":[0.00022674665,0.001532045,0.0044125225,0.00011599423,0.00008762036,0.0026155016,0.00006439725,0.37261784,0.54191077,0.00196166,0.07438371,0.00007119926],"about_ca_topic_score_codex":0.0011488922,"about_ca_topic_score_gemma":0.0028768198,"teacher_disagreement_score":0.0050869584,"about_ca_system_score_codex":0.00031488916,"about_ca_system_score_gemma":0.00045121342,"threshold_uncertainty_score":0.017017543},"labels":[],"label_agreement":null},{"id":"W2052963087","doi":"10.1109/jproc.2007.896497","title":"The Factor Graph Approach to Model-Based Signal Processing","year":2007,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":533,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Message passing; Factor graph; Computer science; Computation; Gaussian; Algorithm; Variety (cybernetics); Gradient descent; Graph; Kalman filter; Focus (optics); Theoretical computer science; Artificial intelligence; Artificial neural network","score_opus":0.026298629698420024,"score_gpt":0.2620263511875703,"score_spread":0.23572772148915025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052963087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000343202,0.00068356364,0.99480516,0.00028751642,0.00005444099,0.000011432288,0.00006600969,0.00030421847,0.0034444192],"genre_scores_gemma":[0.14611359,0.0075046043,0.8224028,0.00072668993,0.00078923884,0.00020377383,0.0007495677,0.0005761593,0.020933505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992895,0.00025937,0.000032154116,0.0001503177,0.00022792062,0.000040761122],"domain_scores_gemma":[0.9992374,0.0003935888,0.000057459674,0.00015694172,0.00012889893,0.000025813686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067789,0.000930282,0.00068420917,0.0013073357,0.0004173464,0.0018106686,0.0013849568,0.0011876051,0.0071573644],"category_scores_gemma":[0.0025457868,0.00050716015,0.00088257523,0.001794072,0.0011832723,0.0016834643,0.0009945793,0.0018433296,0.0034383098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033562603,0.000026727732,0.00019078958,0.00020996823,0.000084766085,0.00012495757,0.00010106701,0.17865784,0.002471064,0.6483692,0.010644686,0.15908524],"study_design_scores_gemma":[0.000009943567,0.000033452623,0.00014688278,0.00004087257,0.00002638257,0.00011140533,0.000018913897,0.44382098,0.0012579928,0.51428664,0.040221475,0.0000250331],"about_ca_topic_score_codex":0.0043796245,"about_ca_topic_score_gemma":0.0033447472,"teacher_disagreement_score":0.0071573644,"about_ca_system_score_codex":0.0008722017,"about_ca_system_score_gemma":0.0008658304,"threshold_uncertainty_score":0.023943722},"labels":[],"label_agreement":null},{"id":"W2056299877","doi":"10.1109/isit.2005.1523628","title":"On the complexity of joint source-channel decoding of markov sequences over memoryless channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Viterbi algorithm; Decoding methods; Convolutional code; Algorithm; Source code; Markov chain; Computer science; Markov process; Discrete mathematics; Tree (set theory); Mathematics; Combinatorics; Statistics","score_opus":0.08727047721142209,"score_gpt":0.287291421623702,"score_spread":0.20002094441227994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056299877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50049084,0.0022225478,0.4776818,0.0041686688,0.000163878,0.00018487031,0.0013458828,0.0012906927,0.012450812],"genre_scores_gemma":[0.9433462,0.0008265931,0.05026002,0.0002310192,0.00016055796,0.00021636405,0.0011536522,0.00024060851,0.003564999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961732,0.0013685661,0.00015021664,0.00041003845,0.0011643766,0.0007335805],"domain_scores_gemma":[0.9304464,0.06447684,0.0017055433,0.0014430493,0.0014502889,0.0004778848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004013557,0.0010441695,0.0015891554,0.0009348294,0.0010068461,0.002557751,0.0017746488,0.0015941223,0.00392866],"category_scores_gemma":[0.029674876,0.00072539033,0.00087410404,0.0012412346,0.002124032,0.005169992,0.0021706189,0.0024332993,0.0004955416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013882596,0.00007048116,0.0024082565,0.00020444895,0.00009887656,0.0002771132,0.0001981045,0.93540394,0.0033661067,0.035045996,0.001862535,0.01967595],"study_design_scores_gemma":[0.000030765113,0.00003415705,0.0002744121,0.0000128591355,0.000012864006,0.00003486121,0.000025651756,0.9791206,0.00095567777,0.019353546,0.00013278906,0.000011807782],"about_ca_topic_score_codex":0.007711474,"about_ca_topic_score_gemma":0.008413192,"teacher_disagreement_score":0.007711474,"about_ca_system_score_codex":0.0039341627,"about_ca_system_score_gemma":0.0039889277,"threshold_uncertainty_score":0.028544486},"labels":[],"label_agreement":null},{"id":"W2057542493","doi":"10.1109/lcomm.2006.1714538","title":"Parallel processing for fast iterative decoding of orthogonal convolutional codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Sequential decoding; Computer science; Algorithm; Serial concatenated convolutional codes; List decoding; Berlekamp–Welch algorithm; Concatenated error correction code; Theoretical computer science; Block code","score_opus":0.038993725407732806,"score_gpt":0.3071188366573375,"score_spread":0.2681251112496047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057542493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015544592,0.00015306352,0.9815247,0.00007786624,0.000031757918,0.000027172484,0.000025498257,0.00039781,0.0022175177],"genre_scores_gemma":[0.4288836,0.00042666154,0.56604207,0.000110749985,0.00006654584,0.00020397955,0.00015030014,0.000106853535,0.004009206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994529,0.0001563594,0.000026610482,0.000048694852,0.0002655695,0.00004985551],"domain_scores_gemma":[0.99908173,0.0004069849,0.00006336966,0.00016588111,0.00026202522,0.000020005693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618687,0.0005041468,0.00032633432,0.00037560792,0.0003457377,0.00049637817,0.00053297833,0.00044505866,0.0011562185],"category_scores_gemma":[0.002203803,0.00023016325,0.00028511832,0.0005063933,0.00050896924,0.0006162702,0.00057237933,0.00060769496,0.00045686887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039185394,0.000113389935,0.001053802,0.00019643699,0.00008493518,0.00031732587,0.00020470168,0.40626937,0.09078492,0.15170224,0.0039392556,0.3449417],"study_design_scores_gemma":[0.000020949723,0.00006281469,0.00014470592,0.0000095244495,0.000010280546,0.00010173937,0.0000065902373,0.96010804,0.019769503,0.017518403,0.0022358096,0.000011668976],"about_ca_topic_score_codex":0.00083156704,"about_ca_topic_score_gemma":0.0011853786,"teacher_disagreement_score":0.0011562185,"about_ca_system_score_codex":0.00044560904,"about_ca_system_score_gemma":0.0008054836,"threshold_uncertainty_score":0.0038679242},"labels":[],"label_agreement":null},{"id":"W2057938077","doi":"10.1109/glocom.2006.873","title":"WLC44-3: Reduced-Complexity Decoding of Raptor Codes over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fountain code; Fading; Raptor code; Decoding methods; Computer science; Luby transform code; Tornado code; Binary erasure channel; Algorithm; Erasure; Online codes; Channel (broadcasting); Theoretical computer science; Concatenated error correction code; Computer network; Block code; Channel capacity","score_opus":0.032573212726410575,"score_gpt":0.28419459446730794,"score_spread":0.2516213817408974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057938077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033648618,0.00062576163,0.95239407,0.00033803523,0.00016548333,0.00010570166,0.00019914098,0.0018656484,0.010657515],"genre_scores_gemma":[0.3809721,0.0007557318,0.60730416,0.0003254939,0.00014885401,0.00017635849,0.00035956292,0.00029885923,0.009658875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999124,0.00026701041,0.000042771604,0.00008989992,0.0003541198,0.0001222717],"domain_scores_gemma":[0.998862,0.00039476922,0.00010976986,0.0003954337,0.00020505676,0.00003289916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197796,0.00077835965,0.0007506862,0.0006972569,0.0003856573,0.0008156096,0.00071273366,0.0012593649,0.001647824],"category_scores_gemma":[0.0034626138,0.00021576337,0.00048156182,0.0007794552,0.00073507533,0.00084285915,0.00086022256,0.0011152055,0.0013762108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044512248,0.000097412325,0.0008047462,0.0002974822,0.00016898537,0.0008111329,0.0002960459,0.3521064,0.0817818,0.1575196,0.012661341,0.39300984],"study_design_scores_gemma":[0.00004536516,0.00011036037,0.0002690814,0.000036051242,0.000026200287,0.00063622906,0.000017171591,0.8878334,0.0659113,0.030798402,0.014264241,0.000052089792],"about_ca_topic_score_codex":0.0014047206,"about_ca_topic_score_gemma":0.0018126502,"teacher_disagreement_score":0.001647824,"about_ca_system_score_codex":0.00039084317,"about_ca_system_score_gemma":0.0008857977,"threshold_uncertainty_score":0.0055125356},"labels":[],"label_agreement":null},{"id":"W2058277537","doi":"10.1049/iet-com.2014.0235","title":"Recursive method for generating column weight 3 low‐density parity‐check codes based on three‐partite graphs","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Parity (physics); Low-density parity-check code; Combinatorics; Discrete mathematics; Algorithm; Decoding methods; Physics","score_opus":0.037734728780342,"score_gpt":0.32790374855602983,"score_spread":0.2901690197756878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058277537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033444885,0.00007445266,0.96207523,0.00005895985,0.00002649168,0.00010142319,0.00008313814,0.00071797456,0.0034174784],"genre_scores_gemma":[0.29010323,0.0001347434,0.70530623,0.000110880246,0.000017443037,0.00023677462,0.00038036634,0.00017744841,0.0035329284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972874,0.000064178916,0.0000135940045,0.000044944558,0.00010619518,0.00004236776],"domain_scores_gemma":[0.9996326,0.0001523737,0.00003282672,0.000089670495,0.00007388407,0.00001863431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019119891,0.0003900476,0.00033618833,0.00074311625,0.00049616955,0.00037009155,0.0005168585,0.00035064394,0.002367609],"category_scores_gemma":[0.0008762902,0.00028121754,0.0005941749,0.0004982335,0.00047691847,0.00045137104,0.0006794724,0.0005254376,0.00082562445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003076525,0.0001711532,0.0014496811,0.00035877436,0.000103927276,0.0007040181,0.0006947236,0.23347355,0.17890391,0.17833363,0.0054665436,0.4000325],"study_design_scores_gemma":[0.00008532733,0.00021965477,0.0007324892,0.00003649152,0.000052872525,0.00055396114,0.00007505318,0.84772074,0.08277692,0.052369796,0.01528887,0.00008783632],"about_ca_topic_score_codex":0.0014052143,"about_ca_topic_score_gemma":0.0020946367,"teacher_disagreement_score":0.002367609,"about_ca_system_score_codex":0.00027203996,"about_ca_system_score_gemma":0.00065186963,"threshold_uncertainty_score":0.007920444},"labels":[],"label_agreement":null},{"id":"W2058963238","doi":"10.1109/tbc.2014.2364532","title":"Variable LLR Scaling in Min-Sum Decoding for Irregular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Communications Research Centre Canada; Institut National de la Recherche Scientifique","funders":"Higher Education Discipline Innovation Project; Shanghai Key Laboratory of Digital Media Processing and Transmission; National Natural Science Foundation of China","keywords":"Low-density parity-check code; Scaling; Decoding methods; Algorithm; Mathematics; Variable (mathematics); Node (physics); Bit error rate; Computer science","score_opus":0.024635099983043272,"score_gpt":0.2672479783556441,"score_spread":0.24261287837260084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058963238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023767164,0.00040024685,0.97350717,0.0001083588,0.000020439118,0.000022510772,0.000028708175,0.00022614778,0.0019192875],"genre_scores_gemma":[0.6151591,0.000629957,0.38213173,0.00009789479,0.000056098746,0.00009170843,0.00010072412,0.00016939983,0.0015633513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987178,0.0005275638,0.00007534072,0.00017491986,0.00042704685,0.00007739056],"domain_scores_gemma":[0.997695,0.0014190093,0.00022285129,0.00038154764,0.00023439068,0.000047106467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014516754,0.00066927844,0.0006389155,0.00066966855,0.00046992407,0.00095989095,0.00083064684,0.00051622035,0.0007611056],"category_scores_gemma":[0.007622548,0.00032388917,0.00042266923,0.0010713965,0.0014347504,0.0016828553,0.00125707,0.0009880334,0.00023849714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017593779,0.00003459459,0.0012696586,0.00017048493,0.00003532198,0.00011388795,0.00029122687,0.65117,0.015410921,0.15445545,0.00081258384,0.1760599],"study_design_scores_gemma":[0.000006356662,0.000051205614,0.00017612215,0.000015902351,0.000008593218,0.000098223725,0.000020120371,0.94698167,0.008631818,0.042984888,0.0010103169,0.0000147976225],"about_ca_topic_score_codex":0.00063745305,"about_ca_topic_score_gemma":0.00077828654,"teacher_disagreement_score":0.0014516754,"about_ca_system_score_codex":0.0009193938,"about_ca_system_score_gemma":0.0006936616,"threshold_uncertainty_score":0.007677257},"labels":[],"label_agreement":null},{"id":"W2060232182","doi":"10.1007/s11277-013-1597-7","title":"Towards Fountain Codes","year":2014,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Luby transform code; Computer science; Raptor code; Tornado code; Online codes; Theoretical computer science; Linear code; Binary erasure channel; Algorithm; Lossy compression; Fountain; Block code; Decoding methods; Computer network; Channel capacity; Artificial intelligence","score_opus":0.036272840341379266,"score_gpt":0.30529440605444425,"score_spread":0.26902156571306496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060232182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026247347,0.0017562936,0.92233074,0.0025410238,0.00075969915,0.00007605661,0.00011043137,0.0015338116,0.044644702],"genre_scores_gemma":[0.48734105,0.002755008,0.44563276,0.0023341035,0.0007590479,0.00022279657,0.0003544509,0.00080323045,0.059797525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979227,0.00055496633,0.000058603215,0.00021452323,0.0010009407,0.00024820943],"domain_scores_gemma":[0.99561983,0.001423006,0.00020091441,0.0014080533,0.0012009265,0.00014725844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015488975,0.0009996598,0.00075021386,0.001591222,0.0017337607,0.0022232514,0.0014590785,0.0025864055,0.004707988],"category_scores_gemma":[0.013887222,0.0005109473,0.00053694536,0.0011917237,0.0024249698,0.003386824,0.0035832704,0.0036047434,0.0030133731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013926973,0.000040658753,0.00036476055,0.00009162373,0.00001862534,0.00010586597,0.00034987638,0.015397946,0.0040567336,0.87011766,0.010490637,0.098826304],"study_design_scores_gemma":[0.00002730305,0.00006640663,0.00017216262,0.00014288758,0.000017237859,0.00042697505,0.000092580645,0.13904236,0.012518637,0.78990144,0.057543293,0.000048783917],"about_ca_topic_score_codex":0.0026933826,"about_ca_topic_score_gemma":0.0019854666,"teacher_disagreement_score":0.004707988,"about_ca_system_score_codex":0.0013634397,"about_ca_system_score_gemma":0.0013834639,"threshold_uncertainty_score":0.015749812},"labels":[],"label_agreement":null},{"id":"W2060429191","doi":"10.1007/s00453-008-9192-0","title":"Random Matrices and Codes for the Erasure Channel","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Mathematics; Erasure; Overhead (engineering); Discrete mathematics; Algorithm; Computer science; Block code; Concatenated error correction code","score_opus":0.0217023613800945,"score_gpt":0.2532438025626427,"score_spread":0.23154144118254816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060429191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961753,0.014939185,0.84567475,0.008548381,0.00091015577,0.0001073828,0.00072534813,0.00035090197,0.03256859],"genre_scores_gemma":[0.75218457,0.016870521,0.1849668,0.0016096421,0.0027657233,0.00051558943,0.0009060162,0.00025088314,0.03993024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868935,0.00051352323,0.00004893799,0.00020328889,0.00040155736,0.00014333228],"domain_scores_gemma":[0.9929972,0.0048795245,0.0006725477,0.00060980616,0.0006804294,0.00016041519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013671442,0.0011669568,0.0009087676,0.0023105864,0.0010189479,0.0021561545,0.0010803662,0.0021662298,0.0035083948],"category_scores_gemma":[0.011906738,0.00065757905,0.0007457181,0.00217822,0.0027262997,0.0031023384,0.0015105221,0.0036650698,0.0008275636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003555914,0.000016700695,0.00018365118,0.00007448411,0.000014414815,0.000053929944,0.000119719356,0.027374323,0.0006548781,0.95862037,0.0019486876,0.010903244],"study_design_scores_gemma":[0.000018731,0.000016759326,0.00015802859,0.00004270829,0.000010875516,0.00007819745,0.000024707479,0.0832642,0.00041752047,0.912318,0.003624303,0.000025984644],"about_ca_topic_score_codex":0.0019187607,"about_ca_topic_score_gemma":0.002073203,"teacher_disagreement_score":0.0035083948,"about_ca_system_score_codex":0.0014428708,"about_ca_system_score_gemma":0.0015771171,"threshold_uncertainty_score":0.011736751},"labels":[],"label_agreement":null},{"id":"W2061690338","doi":"10.1049/iet-com.2014.0535","title":"On polar multiple description coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Computer science; Polar; Polar code; Algorithm; Coding (social sciences); Binary number; Hamming distance; Hamming code; Variable-length code; Decoding methods; Network packet; Multiple description coding; Theoretical computer science; Block code; Computer network; Arithmetic; Mathematics","score_opus":0.14326756998204065,"score_gpt":0.3265984394758602,"score_spread":0.18333086949381955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061690338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005231763,0.0028887796,0.9770348,0.000492307,0.0001631594,0.000064770415,0.00011113906,0.00010741746,0.013905818],"genre_scores_gemma":[0.4265184,0.016360601,0.53760314,0.0011417208,0.00072725996,0.0004193106,0.0009516328,0.00012609568,0.016151797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.0003533024,0.0000408467,0.000103852086,0.0003928389,0.000083537634],"domain_scores_gemma":[0.9985079,0.0007793696,0.00007797015,0.00024745308,0.00035799545,0.000029179946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508535,0.00050074974,0.00041976632,0.0010474869,0.00040066874,0.0010602686,0.0008231857,0.000652852,0.002400777],"category_scores_gemma":[0.0033621406,0.0002724763,0.00029678838,0.0015116336,0.0011192301,0.0019929004,0.0017166882,0.001362457,0.0008532928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017517392,0.000023666369,0.00034213622,0.00025043017,0.000017439173,0.00026798452,0.0001916719,0.06537056,0.0081304405,0.7486679,0.005358719,0.17120396],"study_design_scores_gemma":[0.000047222482,0.00014562775,0.00029320116,0.00021429361,0.00003141034,0.0006211107,0.00006993562,0.6263743,0.015651926,0.30833286,0.048137408,0.00008064201],"about_ca_topic_score_codex":0.0019678683,"about_ca_topic_score_gemma":0.0011284534,"teacher_disagreement_score":0.002400777,"about_ca_system_score_codex":0.0007231458,"about_ca_system_score_gemma":0.0008455761,"threshold_uncertainty_score":0.008031428},"labels":[],"label_agreement":null},{"id":"W2061692327","doi":"10.1109/cig.2010.5592848","title":"Valiant transform of forney graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Duality (order theory); Interpretation (philosophy); Extension (predicate logic); Holography; Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.010516782987735578,"score_gpt":0.2514913456474596,"score_spread":0.24097456265972403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061692327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20087434,0.000823242,0.6751116,0.0019304381,0.00054508384,0.000074337586,0.00031687482,0.0004640515,0.11986001],"genre_scores_gemma":[0.8697188,0.00068321166,0.09311568,0.0007988118,0.00027113792,0.00006287193,0.0002453726,0.00020270218,0.034901418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.00010441267,0.000015031489,0.00009204031,0.00014917538,0.00008484595],"domain_scores_gemma":[0.9992963,0.00026777462,0.00007445426,0.00009368843,0.000185777,0.00008186237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045483766,0.00036933145,0.00035948158,0.0010969824,0.0008574745,0.0011668318,0.0004904528,0.00065677427,0.0036703323],"category_scores_gemma":[0.0024024814,0.00019722866,0.0005340671,0.0006901382,0.00196253,0.002106508,0.000986486,0.0017792908,0.0006432756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014917737,0.0000053358795,0.00007992474,0.000010395474,0.0000023052892,0.000042333864,0.00007525059,0.0012873177,0.0011118564,0.99136037,0.00072743895,0.0052826223],"study_design_scores_gemma":[0.000006408202,0.000020311107,0.00008505003,0.000008487707,0.0000034820823,0.00013643056,0.00004408531,0.01422655,0.0019600403,0.97696894,0.0065292325,0.000011062037],"about_ca_topic_score_codex":0.0013767967,"about_ca_topic_score_gemma":0.00081772316,"teacher_disagreement_score":0.0036703323,"about_ca_system_score_codex":0.0009297773,"about_ca_system_score_gemma":0.00057798985,"threshold_uncertainty_score":0.012278497},"labels":[],"label_agreement":null},{"id":"W2061964274","doi":"10.1109/isit.2005.1523513","title":"Stochastic iterative decoders","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Factor graph; Decoding methods; Computer science; Turbo code; Algorithm; Trellis (graph); Hamming code; Block code","score_opus":0.014335364747141009,"score_gpt":0.27145197882089916,"score_spread":0.25711661407375813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061964274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023598676,0.00010082633,0.9931242,0.00007676302,0.00003847553,0.000039170576,0.000041876385,0.00027783556,0.0039409637],"genre_scores_gemma":[0.22626992,0.00068940426,0.7567161,0.00029216654,0.00013549281,0.00037635415,0.0003599659,0.00026817294,0.014892447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801147,0.0005039271,0.00011147177,0.0002547267,0.00095844315,0.00015992769],"domain_scores_gemma":[0.99814105,0.0009686716,0.0001155287,0.00028493506,0.00042981858,0.000060063445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012412623,0.00065603794,0.00081842905,0.0008882949,0.0006422915,0.0010953206,0.0013303339,0.0012391666,0.0039520497],"category_scores_gemma":[0.0062179617,0.00041002728,0.00085079996,0.000854528,0.0010706374,0.001191583,0.0014943905,0.0013152707,0.0019813124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010000759,0.000040931314,0.00035201732,0.000105294355,0.00005518653,0.00010165342,0.00013147305,0.3569634,0.00576881,0.5001218,0.002896552,0.13336283],"study_design_scores_gemma":[0.000024669245,0.00004808215,0.00007301133,0.00002656121,0.000012313321,0.00013413836,0.000010104377,0.88308525,0.0044129225,0.10309133,0.009057502,0.00002409413],"about_ca_topic_score_codex":0.0013527309,"about_ca_topic_score_gemma":0.0014853015,"teacher_disagreement_score":0.0039520497,"about_ca_system_score_codex":0.0009985337,"about_ca_system_score_gemma":0.0014409422,"threshold_uncertainty_score":0.013220966},"labels":[],"label_agreement":null},{"id":"W2062038811","doi":"10.1109/isbmsb.2010.5463163","title":"Optimization of rateless coding for multimedia multicasting","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Erasure; Online codes; Multicast; Decoding methods; Raptor code; Luby transform code; Erasure code; Coding (social sciences); Forward error correction; Computer network; Quality of service; Computer engineering; Algorithm; Block code; Concatenated error correction code","score_opus":0.02383862625995316,"score_gpt":0.2923811090237147,"score_spread":0.2685424827637616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062038811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047737103,0.00041852778,0.947738,0.00017506034,0.000023041628,0.000031833828,0.000033636305,0.00011144164,0.0037313045],"genre_scores_gemma":[0.86132324,0.00038597145,0.13624558,0.000058118516,0.00002122264,0.00007932958,0.00004218711,0.000054162083,0.0017901516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954164,0.00020485469,0.000013600382,0.000043138738,0.00014929556,0.00004747244],"domain_scores_gemma":[0.99950063,0.00028224825,0.00007949341,0.000034275457,0.00008833642,0.000015040173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007504387,0.00060145947,0.00033084906,0.0003479843,0.00018816415,0.00046129114,0.00053793663,0.0005336054,0.0006977172],"category_scores_gemma":[0.0025350293,0.00022955179,0.00023712782,0.0003647305,0.0004686748,0.0005453676,0.00045713352,0.00036744817,0.00015282516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000514938,0.000017757246,0.0001899256,0.000042321186,0.00001183541,0.000045593577,0.000029022915,0.9485226,0.007796584,0.019257957,0.0003498077,0.023685072],"study_design_scores_gemma":[0.0000064195724,0.00002496163,0.00004684124,0.0000041024064,0.0000033711412,0.000014436188,0.000003892665,0.9933869,0.0021018297,0.004092608,0.00031135086,0.0000032020218],"about_ca_topic_score_codex":0.00092693267,"about_ca_topic_score_gemma":0.00094766193,"teacher_disagreement_score":0.00092693267,"about_ca_system_score_codex":0.0008134093,"about_ca_system_score_gemma":0.0005843624,"threshold_uncertainty_score":0.005901754},"labels":[],"label_agreement":null},{"id":"W2064102818","doi":"10.1109/isit.2005.1523516","title":"A degree-matched check node approximation for LDPC decoding","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Degree (music); Decoding methods; Low-density parity-check code; Node (physics); Mathematics; Algorithm; Simple (philosophy); Factor graph; Computer science; Discrete mathematics","score_opus":0.05704207632537503,"score_gpt":0.3040474406461272,"score_spread":0.24700536432075218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064102818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054831594,0.00035389536,0.93847126,0.00015351236,0.00004208722,0.000031356096,0.000047111,0.0003000734,0.0057690763],"genre_scores_gemma":[0.75585127,0.00062418234,0.238627,0.00010102625,0.000036650188,0.000047550286,0.00008319122,0.00008253051,0.0045465976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995036,0.00011405492,0.0000129743585,0.00004542623,0.00027935533,0.000044538476],"domain_scores_gemma":[0.9990502,0.0005071754,0.000060228103,0.00022990281,0.00012536488,0.000027038725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061946805,0.00037014426,0.00039656158,0.00038111967,0.0004399075,0.0006327089,0.0007692442,0.0005431046,0.00090655277],"category_scores_gemma":[0.0052055568,0.00018833177,0.00032047514,0.0005654753,0.0006995148,0.0011014947,0.0006113138,0.0008952206,0.00048164328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018424132,0.000030514391,0.0014220022,0.00006733193,0.000026915659,0.00018520794,0.00016230703,0.7875649,0.012835563,0.1579354,0.0008011077,0.038784478],"study_design_scores_gemma":[0.000003911014,0.000014141465,0.00008405076,0.000005328808,0.000004722805,0.00006382455,0.000008358565,0.983751,0.0021669916,0.013128323,0.00076245004,0.000006973792],"about_ca_topic_score_codex":0.004323752,"about_ca_topic_score_gemma":0.0040759775,"teacher_disagreement_score":0.004323752,"about_ca_system_score_codex":0.0010167622,"about_ca_system_score_gemma":0.00079077494,"threshold_uncertainty_score":0.008597195},"labels":[],"label_agreement":null},{"id":"W2064450393","doi":"10.1109/tsp.2013.2264813","title":"Adaptive Multiset Stochastic Decoding of Non-Binary LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Rogue Research (Canada)","funders":"","keywords":"Multiset; Decoding methods; Computer science; Algorithm; Binary number; Low-density parity-check code; List decoding; Discrete mathematics; Mathematics; Arithmetic; Concatenated error correction code; Block code","score_opus":0.025940419415568666,"score_gpt":0.2750119041399348,"score_spread":0.24907148472436616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064450393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06670661,0.00015758822,0.9309473,0.000103052145,0.000039760544,0.000032749325,0.000055181095,0.00042157678,0.0015362503],"genre_scores_gemma":[0.6052223,0.0002348667,0.39082766,0.00011593416,0.00004429036,0.00008594922,0.00020931102,0.00007180689,0.0031877703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00013173674,0.000037138783,0.00008089606,0.0002546041,0.000045767738],"domain_scores_gemma":[0.9992048,0.00033803092,0.000114782466,0.0001254357,0.00018872504,0.000028191926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004066421,0.00035587687,0.00036916195,0.0003715926,0.0003145795,0.00048729964,0.00069997663,0.0003980163,0.00073635805],"category_scores_gemma":[0.0014434947,0.00018099496,0.00036027032,0.00043823643,0.0003481053,0.0005399315,0.0004980222,0.0004894585,0.0002643351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031439477,0.00010152818,0.002679892,0.00015557288,0.0000691619,0.00024751393,0.00015419196,0.6036392,0.079058245,0.067134075,0.0012973795,0.24514887],"study_design_scores_gemma":[0.00001704589,0.000047023124,0.00022927964,0.0000059471236,0.000005344503,0.00007472134,0.000004995659,0.97756517,0.015321578,0.0058148047,0.0009055465,0.000008611983],"about_ca_topic_score_codex":0.0012526984,"about_ca_topic_score_gemma":0.002272855,"teacher_disagreement_score":0.0012526984,"about_ca_system_score_codex":0.00051497476,"about_ca_system_score_gemma":0.00092413765,"threshold_uncertainty_score":0.0037363768},"labels":[],"label_agreement":null},{"id":"W2064622997","doi":"10.1109/icics.2013.6782968","title":"Linearly-encodable rate-compatible punctured LDPC codes with low error floor","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Low-density parity-check code; Algorithm; Error floor; Word error rate; Computer science; Parity-check matrix; Decoding methods; Mathematics; Code (set theory); Discrete mathematics; Speech recognition","score_opus":0.010077652057899058,"score_gpt":0.22929572359068506,"score_spread":0.219218071532786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064622997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10001617,0.0007061132,0.8916273,0.00021347778,0.00004294072,0.00009999168,0.00014849933,0.0008821311,0.006263376],"genre_scores_gemma":[0.6920243,0.000573014,0.30314755,0.000149147,0.00005285817,0.00013348558,0.00025242977,0.0000875666,0.0035796426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00013090334,0.00003792475,0.00008771572,0.00031576774,0.000064227526],"domain_scores_gemma":[0.9984823,0.00040805683,0.00032483292,0.00034780256,0.0003734923,0.00006350043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046134018,0.00058487034,0.00036073636,0.0005517075,0.00037616855,0.00065248186,0.0010826029,0.00056670664,0.0007803061],"category_scores_gemma":[0.0025276442,0.00018997771,0.00029875748,0.0006715114,0.00056889135,0.00076267717,0.0005863975,0.0006980368,0.00052167306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055362954,0.00015269876,0.0038103347,0.000489282,0.000082024424,0.0009473508,0.00045627766,0.22600529,0.21462047,0.2916761,0.003375449,0.2578311],"study_design_scores_gemma":[0.00008294388,0.00026035498,0.00080427504,0.000045817844,0.000045471388,0.0011345001,0.000032606426,0.80899584,0.15174028,0.026071465,0.010696657,0.00008981502],"about_ca_topic_score_codex":0.0008654292,"about_ca_topic_score_gemma":0.00079996814,"teacher_disagreement_score":0.0010826029,"about_ca_system_score_codex":0.0005336089,"about_ca_system_score_gemma":0.00077770907,"threshold_uncertainty_score":0.0038716197},"labels":[],"label_agreement":null},{"id":"W2065641815","doi":"10.1155/2007/76146","title":"LDPC Code Design for Nonuniform Power-Line Channels","year":2007,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Channel (broadcasting); Decoding methods; Algorithm; Coding (social sciences); Code rate; Code (set theory); Electronic engineering; Theoretical computer science; Computer engineering; Telecommunications; Mathematics","score_opus":0.04221261234473051,"score_gpt":0.3508074368376701,"score_spread":0.30859482449293957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065641815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058293544,0.00016402519,0.93885404,0.00012661958,0.000009343088,0.000035555167,0.000052714877,0.00010797952,0.0023562459],"genre_scores_gemma":[0.811021,0.00028314156,0.18648376,0.00005818901,0.000018652463,0.000102163256,0.00008033184,0.00004121782,0.0019115009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.0001393084,0.000017797578,0.00006600751,0.00013753765,0.000035955218],"domain_scores_gemma":[0.99863976,0.0007808441,0.00021059622,0.00012567852,0.00021221151,0.000030903444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004655021,0.00031658084,0.00037242193,0.0003162689,0.00024471298,0.00041279258,0.00036555377,0.0004216949,0.00074314175],"category_scores_gemma":[0.0033821883,0.00013893601,0.00012819545,0.0005093725,0.0005757981,0.00062665803,0.00042530603,0.00031385513,0.0001637961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006351169,0.000020528207,0.00087480753,0.0000940913,0.000014937138,0.00008212434,0.000072898016,0.913006,0.011140049,0.033732355,0.00048670548,0.0404119],"study_design_scores_gemma":[0.0000066331554,0.000019273886,0.00006866292,0.0000036251429,0.0000031039085,0.000023980128,0.00000624921,0.99110925,0.0034987945,0.0048318533,0.00042502146,0.0000035280605],"about_ca_topic_score_codex":0.001402469,"about_ca_topic_score_gemma":0.0012193919,"teacher_disagreement_score":0.001402469,"about_ca_system_score_codex":0.00070194795,"about_ca_system_score_gemma":0.0006587885,"threshold_uncertainty_score":0.005093038},"labels":[],"label_agreement":null},{"id":"W2065779582","doi":"10.1109/pimrc.2011.6139888","title":"Optimization of rateless-coded asynchronous multimedia multicast","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Computer science; Greedy algorithm; Asynchronous communication; Coding (social sciences); Optimization problem; Convex optimization; Mathematical optimization; Encoding (memory); Relaxation (psychology); Regular polygon; Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.032355112673933754,"score_gpt":0.25538930314672775,"score_spread":0.223034190472794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065779582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10191376,0.00063488627,0.88538647,0.0008319112,0.000089614594,0.00006895882,0.000103859915,0.00009618736,0.010874388],"genre_scores_gemma":[0.91594,0.0006116508,0.077992976,0.00012535111,0.00009122992,0.00012622586,0.00006332923,0.000049538074,0.0049996288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00017619165,0.0000069216217,0.000035216122,0.000099656005,0.0000454075],"domain_scores_gemma":[0.9992586,0.00052330486,0.00008366708,0.000020037114,0.0000834695,0.00003088593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008461733,0.0008937696,0.000590189,0.00032996174,0.00024230329,0.00065889175,0.0005984049,0.0009653755,0.0011700406],"category_scores_gemma":[0.0023235492,0.00023269014,0.0002624857,0.0005103997,0.00062035106,0.0006310269,0.00064082985,0.0005936465,0.00015243613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000423443,0.00002319177,0.0001238753,0.000038180246,0.0000090285375,0.000054397507,0.000016624037,0.9785822,0.0017434799,0.012366744,0.00031444858,0.006685517],"study_design_scores_gemma":[0.0000059961662,0.00001537084,0.000029593164,0.000001408731,0.0000019747854,0.000006202916,0.0000027233489,0.99740654,0.00025858686,0.0021736734,0.00009633427,0.0000016096683],"about_ca_topic_score_codex":0.0016243923,"about_ca_topic_score_gemma":0.0010031287,"teacher_disagreement_score":0.0016243923,"about_ca_system_score_codex":0.0007073447,"about_ca_system_score_gemma":0.00059991254,"threshold_uncertainty_score":0.0051321387},"labels":[],"label_agreement":null},{"id":"W2065996751","doi":"10.1109/vtcfall.2012.6399337","title":"A Novel Hybrid ARQ Scheme Based on LDPC Code Extension and Feedback","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Low-density parity-check code; Hybrid automatic repeat request; Computer science; Algorithm; Forward error correction; Automatic repeat request; Error detection and correction; Throughput; Decoding methods; Turbo code; Computer network; Wireless; Telecommunications; Telecommunications link","score_opus":0.03417933702898021,"score_gpt":0.2714742757230194,"score_spread":0.2372949386940392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065996751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044394545,0.00058704865,0.95161057,0.00013613884,0.000067256406,0.000121514255,0.00008301352,0.0010147166,0.0019851413],"genre_scores_gemma":[0.6060806,0.0003420988,0.38885784,0.0001766654,0.00007374574,0.00017369042,0.00012879983,0.000037423204,0.0041290876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957806,0.000094886374,0.000022959417,0.000096532036,0.00016547326,0.00004205802],"domain_scores_gemma":[0.9994529,0.0001610074,0.00008563688,0.00011234341,0.00015791567,0.000030252972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043015712,0.0004667344,0.0005431012,0.00041048092,0.0004618499,0.00045785683,0.0011409791,0.0005385441,0.0010348837],"category_scores_gemma":[0.0007475698,0.00023086282,0.00029951954,0.0004362005,0.00037751804,0.0007281781,0.0005913867,0.00045174168,0.00042974128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006866233,0.00018440674,0.00144863,0.0003633233,0.00010764858,0.0009100394,0.00035817456,0.09944466,0.48115984,0.055757932,0.0030162719,0.35656238],"study_design_scores_gemma":[0.000111774905,0.00066937594,0.00067015714,0.000034431374,0.000067756126,0.001265393,0.000030487172,0.90018445,0.077181816,0.0077584647,0.01192356,0.00010243434],"about_ca_topic_score_codex":0.0006484557,"about_ca_topic_score_gemma":0.0009276695,"teacher_disagreement_score":0.0011409791,"about_ca_system_score_codex":0.00036407184,"about_ca_system_score_gemma":0.0004497414,"threshold_uncertainty_score":0.0034620166},"labels":[],"label_agreement":null},{"id":"W2066943407","doi":"10.1109/icc.2004.1312528","title":"Reliability-based schedule for decoding low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Computer science; Schedule; Low-density parity-check code; Flooding (psychology); Tanner graph; Binary number; Reliability (semiconductor); Sequential decoding; List decoding; Algorithm; Parallel computing; Theoretical computer science; Concatenated error correction code; Arithmetic; Mathematics; Block code","score_opus":0.021037294120186692,"score_gpt":0.28387837566982804,"score_spread":0.26284108154964136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066943407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024022885,0.00017909109,0.9725351,0.00012812534,0.00005754083,0.000116573596,0.00010803465,0.00087800523,0.0019746488],"genre_scores_gemma":[0.5803293,0.00039386714,0.41430056,0.00008993244,0.00009102422,0.0004284414,0.00046720522,0.00016392612,0.0037356927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00016272948,0.000032493517,0.000055024455,0.00020162016,0.000054516127],"domain_scores_gemma":[0.9982681,0.0007174709,0.00020247078,0.0002589389,0.00047909273,0.00007386912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075479,0.0005748073,0.00040956686,0.0007062501,0.00048231587,0.00037018044,0.0008540469,0.0004072131,0.0013490315],"category_scores_gemma":[0.0039888686,0.00024368944,0.00029779034,0.0005439446,0.0004907201,0.0005098933,0.0005012457,0.00068833976,0.0006028492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005109748,0.000083423285,0.0009095977,0.00027168755,0.00004864882,0.00028782393,0.0002659805,0.6298515,0.0503098,0.11680911,0.0049606985,0.19569075],"study_design_scores_gemma":[0.000062032945,0.00025036593,0.00022994926,0.000015813686,0.000026616934,0.00013645744,0.000017021293,0.95340747,0.014218847,0.026990578,0.0046126614,0.000032159565],"about_ca_topic_score_codex":0.0018606333,"about_ca_topic_score_gemma":0.0018987418,"teacher_disagreement_score":0.0018606333,"about_ca_system_score_codex":0.0007150894,"about_ca_system_score_gemma":0.0012357945,"threshold_uncertainty_score":0.0051884055},"labels":[],"label_agreement":null},{"id":"W2067040891","doi":"10.1109/globalsip.2013.6737143","title":"Scalable successive-cancellation hardware decoder for polar codes","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Polar code; Computer science; Decoding methods; Field-programmable gate array; Code (set theory); Encoding (memory); Polar; Algorithm; Stratix; Computer engineering; Computer hardware; Parallel computing; Theoretical computer science","score_opus":0.017242240994259236,"score_gpt":0.26781731140095005,"score_spread":0.2505750704066908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067040891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11131895,0.000682405,0.8648654,0.00030870043,0.0001745299,0.00013971062,0.0003506615,0.005010323,0.017149363],"genre_scores_gemma":[0.56282145,0.00041367728,0.42628887,0.00019607056,0.00007590328,0.00010708101,0.0004671271,0.00010338174,0.009526439],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980944,0.000026827915,0.000011018557,0.000028861972,0.00009858803,0.000025363146],"domain_scores_gemma":[0.9996063,0.00012900322,0.00004436351,0.000062548555,0.00013744559,0.00002043369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020590724,0.00036277383,0.00024794744,0.00034539838,0.00031155808,0.00044644644,0.00062060356,0.00025440296,0.003223808],"category_scores_gemma":[0.00069694396,0.00014839732,0.00017735592,0.0003876895,0.00031098205,0.0005998774,0.00041401526,0.00049376284,0.00095286063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079076336,0.00010654008,0.0013340524,0.00037626026,0.00006582908,0.00056182453,0.0002050462,0.12250224,0.41664487,0.07010094,0.013453901,0.37385765],"study_design_scores_gemma":[0.00014648307,0.00058144104,0.0008321727,0.000049160157,0.00005167519,0.00058369245,0.00005818254,0.64208055,0.31441686,0.013443037,0.027708309,0.000048364913],"about_ca_topic_score_codex":0.0016462166,"about_ca_topic_score_gemma":0.003662236,"teacher_disagreement_score":0.003223808,"about_ca_system_score_codex":0.00049090484,"about_ca_system_score_gemma":0.0008153508,"threshold_uncertainty_score":0.010784686},"labels":[],"label_agreement":null},{"id":"W2068666152","doi":"10.1109/cwit.2013.6621584","title":"When are maximum likelihood and minimum distance decoding equivalent for binary contagion channels?","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Interleaving; Hamming distance; Binary number; Block code; List decoding; Sequential decoding; Hamming code; Algorithm; Maximum likelihood; Mathematics; Channel (broadcasting); Minimum distance; Hamming weight; Computer science; Statistics; Concatenated error correction code; Arithmetic; Telecommunications","score_opus":0.024671182206556053,"score_gpt":0.2599840851905888,"score_spread":0.23531290298403273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068666152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32602414,0.0020831693,0.64321023,0.002554361,0.00015814269,0.00010928129,0.0005217532,0.00026474122,0.02507415],"genre_scores_gemma":[0.9675456,0.0012484429,0.027510677,0.000270869,0.00015169312,0.000080563615,0.00024882023,0.00009567721,0.0028478098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960819,0.0015776618,0.0002297945,0.0005990739,0.0008442224,0.00066737767],"domain_scores_gemma":[0.9648381,0.029422738,0.0027989035,0.0010600223,0.0015154985,0.0003646963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044128024,0.00083225744,0.001497913,0.0011140237,0.0006719195,0.002975959,0.0012440747,0.0028167765,0.0031079445],"category_scores_gemma":[0.06807217,0.0006495787,0.00042645092,0.0012762345,0.004642928,0.007602764,0.0019395337,0.001584673,0.00056128483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010086633,0.000095632015,0.0029314416,0.00038611406,0.00007996872,0.00054196233,0.00069033925,0.19942531,0.004601132,0.7574726,0.0015247461,0.031242121],"study_design_scores_gemma":[0.00007951105,0.00009138167,0.0007729596,0.00009781651,0.000026591679,0.0002172984,0.00019779963,0.45587298,0.0051503642,0.53668034,0.00074676174,0.00006632313],"about_ca_topic_score_codex":0.0020051321,"about_ca_topic_score_gemma":0.0013793376,"teacher_disagreement_score":0.0044128024,"about_ca_system_score_codex":0.0018710028,"about_ca_system_score_gemma":0.0013130733,"threshold_uncertainty_score":0.023337424},"labels":[],"label_agreement":null},{"id":"W2068985238","doi":"10.1109/bmsb.2013.6621773","title":"Quarter-rate LDPC code and its truncated performance for the cloud transmission","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Low-density parity-check code; Code word; Computer science; Additive white Gaussian noise; Code rate; Concatenated error correction code; Code (set theory); Algorithm; Decoding methods; Channel (broadcasting); Electronic engineering; Real-time computing; Telecommunications; Block code; Engineering","score_opus":0.02030387314826338,"score_gpt":0.24823507253453542,"score_spread":0.22793119938627204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068985238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872363,0.0024322835,0.693311,0.0006132961,0.000115304065,0.00007659884,0.00043480456,0.0011787246,0.014601711],"genre_scores_gemma":[0.893735,0.0006764074,0.102076925,0.00009656723,0.00003656111,0.00003409229,0.00019920565,0.000060999406,0.0030842235],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996828,0.000066195826,0.00001366161,0.00004923424,0.00014547641,0.000042614818],"domain_scores_gemma":[0.99903595,0.00023334316,0.00010893043,0.0002387984,0.00033873192,0.000044255234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028407777,0.0003223452,0.00031688067,0.00035815075,0.00037477436,0.00052308146,0.00047847762,0.0004506297,0.0013140216],"category_scores_gemma":[0.0014696431,0.000097702636,0.0001879117,0.00048666506,0.00047997825,0.0006388324,0.00036763443,0.00052537397,0.0004251354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015434778,0.00010197461,0.0035926523,0.00044836212,0.00009423323,0.0012348494,0.00040583865,0.2607294,0.3660721,0.11540757,0.0044820164,0.2458876],"study_design_scores_gemma":[0.00004608953,0.00034753114,0.0011351776,0.000043181273,0.000036736,0.0012999554,0.00004641032,0.8342626,0.14183812,0.0123304585,0.008547334,0.00006640216],"about_ca_topic_score_codex":0.0025737393,"about_ca_topic_score_gemma":0.0017334842,"teacher_disagreement_score":0.0025737393,"about_ca_system_score_codex":0.00078717596,"about_ca_system_score_gemma":0.0009580061,"threshold_uncertainty_score":0.005711317},"labels":[],"label_agreement":null},{"id":"W2069005831","doi":"10.1016/j.vlsi.2007.07.003","title":"A scalable LDPC decoder ASIC architecture with bit-serial message exchange","year":2007,"lang":"en","type":"article","venue":"Integration","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Soft-decision decoder; Code word; Decoding methods; Parity bit; Pipeline (software); Application-specific integrated circuit; Parallel computing; Scalability; CMOS; Computer hardware; Algorithm; Electronic engineering; Engineering","score_opus":0.012781627108877659,"score_gpt":0.25941890582610605,"score_spread":0.2466372787172284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069005831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12559776,0.001326092,0.8132842,0.00059059466,0.0003559329,0.00046592983,0.000588758,0.013759706,0.04403093],"genre_scores_gemma":[0.57801795,0.00049434335,0.39668676,0.00039715276,0.00012981486,0.00025737585,0.0006745463,0.00022786215,0.023114309],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997154,0.00004839067,0.000013592812,0.00004513049,0.00014730093,0.000030226132],"domain_scores_gemma":[0.9997174,0.000039774575,0.000021300966,0.00008327553,0.000113008944,0.000025209738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025033925,0.0005322899,0.000529589,0.0005930281,0.00056446006,0.00088117196,0.0012245931,0.0005664606,0.0052105663],"category_scores_gemma":[0.00039114506,0.000253209,0.000205976,0.00078330364,0.000253167,0.00090334774,0.0005055476,0.0005529557,0.0018489197],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008862918,0.00037305985,0.0012915814,0.00057944003,0.00015716917,0.00065662136,0.00019962761,0.039713234,0.5169897,0.06940511,0.025368994,0.34437913],"study_design_scores_gemma":[0.0002682053,0.0010116748,0.0010206703,0.00011350973,0.00023430615,0.0010330582,0.00006079529,0.51541615,0.40285537,0.01226189,0.06562849,0.00009585645],"about_ca_topic_score_codex":0.0014794525,"about_ca_topic_score_gemma":0.0041307164,"teacher_disagreement_score":0.0052105663,"about_ca_system_score_codex":0.0006374032,"about_ca_system_score_gemma":0.00088907045,"threshold_uncertainty_score":0.01743114},"labels":[],"label_agreement":null},{"id":"W2069839933","doi":"10.1007/s11265-009-0441-5","title":"Tracking Forecast Memories for Stochastic Decoding","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Decoding methods; Computer science; Tracking (education); Encoding (memory); Channel (broadcasting); Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence; Theoretical computer science; Arithmetic; Mathematics; Computer network; Psychology","score_opus":0.031948975350521276,"score_gpt":0.29427333874851663,"score_spread":0.26232436339799536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069839933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019622931,0.00038963178,0.9770494,0.00032512852,0.00016213885,0.00002289519,0.00012002172,0.0004915834,0.001816289],"genre_scores_gemma":[0.7107746,0.0009926837,0.27298036,0.00045678712,0.00034722587,0.00013041164,0.0005475962,0.00025331278,0.013517058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995129,0.00011316214,0.000039971528,0.00010702538,0.00014969989,0.00007731388],"domain_scores_gemma":[0.99583614,0.0026762055,0.0002574753,0.0005368047,0.00060209824,0.00009128513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013081253,0.0007886742,0.0009172125,0.0007503998,0.00074330746,0.0015414599,0.001142824,0.0014496256,0.0037258125],"category_scores_gemma":[0.0110229235,0.0006735656,0.0004505275,0.0009777136,0.0009880258,0.0020345526,0.001499787,0.0017754787,0.00094678515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054116483,0.000077465265,0.0013545745,0.0001561185,0.00011537878,0.00018738366,0.00016466237,0.5428022,0.011896966,0.21881801,0.005078257,0.21880776],"study_design_scores_gemma":[0.000010389842,0.000024147477,0.00009565507,0.000016208156,0.000011882762,0.000048091282,0.000007566092,0.9626614,0.0045833783,0.031857114,0.00067029457,0.000013857555],"about_ca_topic_score_codex":0.0040102513,"about_ca_topic_score_gemma":0.00576473,"teacher_disagreement_score":0.0040102513,"about_ca_system_score_codex":0.0008799399,"about_ca_system_score_gemma":0.0015957116,"threshold_uncertainty_score":0.012464106},"labels":[],"label_agreement":null},{"id":"W2071727855","doi":"10.1007/s11265-012-0685-3","title":"Hardware Implementation of Successive-Cancellation Decoders for Polar Codes","year":2012,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Coding (social sciences); Polar; Logarithm; Arithmetic; Algorithm; Coding theory; Theoretical computer science; Computer engineering; Mathematics","score_opus":0.029619153393336657,"score_gpt":0.33070118210275046,"score_spread":0.3010820287094138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071727855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801528,0.00056031946,0.90632856,0.0002941016,0.00029704615,0.00013138144,0.00021738204,0.0040123994,0.01014358],"genre_scores_gemma":[0.5315674,0.0003952413,0.4592222,0.000249386,0.00009933826,0.00011608681,0.00041546684,0.000099401186,0.007835457],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999608,0.00009438516,0.000025875966,0.000034653618,0.00017298361,0.00006408799],"domain_scores_gemma":[0.9991672,0.00035789495,0.000050225462,0.000104296,0.0002816108,0.000038821297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046047618,0.00057639444,0.00035329207,0.0006738087,0.00047623322,0.00095925236,0.00084264914,0.00055737037,0.005804342],"category_scores_gemma":[0.0017241859,0.00029459686,0.00026910944,0.00042367508,0.0002496442,0.0005527004,0.00053068146,0.000636113,0.0020291999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018888502,0.00035430607,0.0019229752,0.0004305227,0.00015442133,0.0004570656,0.0003134271,0.06535044,0.3112888,0.059556287,0.007173326,0.5511096],"study_design_scores_gemma":[0.00028323414,0.00070025364,0.0010043146,0.000071620394,0.000084148356,0.0007068066,0.000078179044,0.5764771,0.39284337,0.011211095,0.016463531,0.0000764038],"about_ca_topic_score_codex":0.0016791472,"about_ca_topic_score_gemma":0.003837774,"teacher_disagreement_score":0.005804342,"about_ca_system_score_codex":0.00047980598,"about_ca_system_score_gemma":0.0012390204,"threshold_uncertainty_score":0.019417405},"labels":[],"label_agreement":null},{"id":"W2072100797","doi":"10.1109/lcomm.2013.021213.121633","title":"Increasing the Throughput of Polar Decoders","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Throughput; Decoding methods; Computer science; Algorithm; Polar; Sequential decoding; Error detection and correction; Telecommunications; Wireless; Block code","score_opus":0.03240705621641109,"score_gpt":0.2830047920305757,"score_spread":0.2505977358141646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072100797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30703902,0.0011703887,0.6523424,0.00097253086,0.00029684033,0.00021390479,0.0003714149,0.004709356,0.032884136],"genre_scores_gemma":[0.84351814,0.0005777707,0.14359686,0.00029616154,0.0001359889,0.00010246662,0.00045907332,0.00013726136,0.011176349],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885416,0.00022572637,0.000062713756,0.0001215025,0.0005910693,0.00014483015],"domain_scores_gemma":[0.9966732,0.0015075227,0.00018986815,0.00048808468,0.0010645636,0.00007670305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086136966,0.0006770597,0.00054525404,0.0007770568,0.00048366,0.000975983,0.0006332914,0.00055662496,0.005056612],"category_scores_gemma":[0.0049886894,0.00025099478,0.00023406172,0.0006989018,0.00064891047,0.0013764664,0.00068207376,0.0007638992,0.0017171842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019132807,0.00016103488,0.0040769735,0.00037456088,0.00010609381,0.000583698,0.00025738383,0.15538801,0.50578946,0.041314844,0.0064701317,0.28356454],"study_design_scores_gemma":[0.00008714176,0.00035480605,0.0016678375,0.000040836057,0.00006767256,0.00092933123,0.000059017297,0.43923426,0.53758836,0.007486468,0.012424687,0.000059594986],"about_ca_topic_score_codex":0.0016119059,"about_ca_topic_score_gemma":0.002201156,"teacher_disagreement_score":0.005056612,"about_ca_system_score_codex":0.0009414092,"about_ca_system_score_gemma":0.0014279513,"threshold_uncertainty_score":0.016916096},"labels":[],"label_agreement":null},{"id":"W2072132013","doi":"10.1109/tcomm.2013.070213.120264","title":"Distributed Joint Source-Channel Coding Using Unequal Error Protection LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Code word; Algorithm; Computer science; Distributed source coding; Channel (broadcasting); Binary symmetric channel; Turbo code; Binary number; Theoretical computer science; Decoding methods; Forward error correction; Variable-length code; Source code; Error detection and correction; Mathematics; Telecommunications; Arithmetic","score_opus":0.12038957945736296,"score_gpt":0.3059059524873597,"score_spread":0.18551637302999674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072132013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011332413,0.00010112622,0.98704183,0.000066709494,0.000010439858,0.000040235824,0.000034544224,0.0001650775,0.0012076383],"genre_scores_gemma":[0.62057614,0.00030390572,0.37636846,0.000068644214,0.000030352294,0.00024929253,0.00014076057,0.000049376984,0.0022131235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837023,0.0006196736,0.00005938445,0.00020373138,0.00062276673,0.00012421505],"domain_scores_gemma":[0.9980368,0.00096751616,0.00027497372,0.00039155176,0.000266053,0.00006313777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589096,0.0008519004,0.0008351444,0.0006539165,0.0004880404,0.00074264733,0.0010968267,0.00073533354,0.0008173601],"category_scores_gemma":[0.0034560615,0.0003486322,0.00048448134,0.0010647572,0.0011526665,0.0010730416,0.0015833268,0.0011518779,0.00030124353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024303002,0.00007585604,0.00070149783,0.0001761806,0.00004874796,0.00017691235,0.00021617042,0.783832,0.02724277,0.10830428,0.00070355705,0.078278944],"study_design_scores_gemma":[0.000039311893,0.00008756036,0.00010607563,0.000022206497,0.00001690532,0.00009468263,0.000014471488,0.9629162,0.016399479,0.018556308,0.0017250498,0.00002175019],"about_ca_topic_score_codex":0.0011497309,"about_ca_topic_score_gemma":0.0018033664,"teacher_disagreement_score":0.0011589096,"about_ca_system_score_codex":0.00092688145,"about_ca_system_score_gemma":0.0014461647,"threshold_uncertainty_score":0.0067250133},"labels":[],"label_agreement":null},{"id":"W2074125084","doi":"10.1109/glocom.2011.6133617","title":"Power Adaptation for DVB Multiple Access Channel with Raptor Code","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decoding methods; Channel (broadcasting); Digital Video Broadcasting; Computer network; Channel capacity; Real-time computing; Broadcasting (networking); Telecommunications","score_opus":0.0977458847624008,"score_gpt":0.28933675768733896,"score_spread":0.19159087292493815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074125084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043108333,0.0017362062,0.9508361,0.00030693828,0.000103105616,0.000056969555,0.000039697265,0.00051977707,0.0032928744],"genre_scores_gemma":[0.8206275,0.0013794625,0.17433669,0.0002360869,0.00014491392,0.000117053634,0.00006408483,0.000057451623,0.0030367805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00025045968,0.00002212698,0.00011765136,0.00021402593,0.000067809946],"domain_scores_gemma":[0.9988912,0.0005494485,0.00013333841,0.00014290123,0.00025347553,0.00002961543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046333682,0.00060890324,0.00045055585,0.000417497,0.00054525404,0.0004827287,0.0007177134,0.00065573317,0.0008219786],"category_scores_gemma":[0.001855905,0.00022173561,0.00021864277,0.0004509133,0.00076191983,0.0006413226,0.0005484957,0.0006765824,0.0003204996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000653856,0.0001289346,0.0013872356,0.0005233787,0.00013337817,0.0009972749,0.000617969,0.4758046,0.11203569,0.049014356,0.004478865,0.35422453],"study_design_scores_gemma":[0.000040360843,0.0002560565,0.00037626742,0.00003094809,0.000041465843,0.0007153769,0.000035901856,0.962427,0.023508128,0.007966196,0.004555075,0.000047244062],"about_ca_topic_score_codex":0.0011398809,"about_ca_topic_score_gemma":0.0012024976,"teacher_disagreement_score":0.0011398809,"about_ca_system_score_codex":0.00031225628,"about_ca_system_score_gemma":0.00036231763,"threshold_uncertainty_score":0.0027498007},"labels":[],"label_agreement":null},{"id":"W2074157441","doi":"10.1109/globalsip.2014.7032067","title":"Autogenerating software polar decoders","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Computer science; Decoding methods; Polar; Software; Implementation; Polar code; Floating point; Code (set theory); Parallel computing; Computer hardware; Computer architecture; Computer engineering; Algorithm; Operating system; Set (abstract data type); Programming language","score_opus":0.011414294373872749,"score_gpt":0.23959651249387195,"score_spread":0.2281822181199992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074157441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09038246,0.00023141614,0.8861386,0.00009325932,0.00009881573,0.00009490861,0.00026529006,0.00913928,0.013555965],"genre_scores_gemma":[0.5851323,0.00035094458,0.39452353,0.00014901288,0.000069960326,0.00020131681,0.0010274136,0.00218336,0.016362142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973935,0.000035633406,0.000016129325,0.000045172354,0.00012536417,0.00003839527],"domain_scores_gemma":[0.9994784,0.00015940968,0.000051370527,0.000105131614,0.0001879443,0.00001779744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021974732,0.00048457534,0.00028726461,0.00038922465,0.000252912,0.000593507,0.0005938273,0.0003217051,0.0059001935],"category_scores_gemma":[0.0011614646,0.00027466356,0.00031236885,0.00036099748,0.00041222264,0.00072495284,0.00059272686,0.00062387245,0.0019589616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068357313,0.00014039043,0.002223705,0.000584739,0.000050396116,0.00043399422,0.00039222775,0.08658678,0.36837468,0.09828559,0.009646051,0.43259785],"study_design_scores_gemma":[0.00011691425,0.00035807674,0.0006546141,0.000055647637,0.00003908704,0.00045451318,0.00006320551,0.30542955,0.6283925,0.021911683,0.042470455,0.00005361594],"about_ca_topic_score_codex":0.00052076665,"about_ca_topic_score_gemma":0.0009102091,"teacher_disagreement_score":0.0059001935,"about_ca_system_score_codex":0.00031498584,"about_ca_system_score_gemma":0.0005965346,"threshold_uncertainty_score":0.019738138},"labels":[],"label_agreement":null},{"id":"W2075176455","doi":"10.1109/isit.2012.6284250","title":"Polar coding to achieve the Holevo capacity of a pure-loss optical channel","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar; Channel capacity; Channel (broadcasting); Coding (social sciences); Computer science; Electronic engineering; Telecommunications; Physics; Mathematics; Engineering; Quantum mechanics; Statistics","score_opus":0.052093199859835994,"score_gpt":0.28714929020276136,"score_spread":0.23505609034292538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075176455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12794016,0.0008409424,0.8339556,0.00074079545,0.00010421153,0.000085451575,0.00018592566,0.0002847663,0.03586229],"genre_scores_gemma":[0.93570817,0.0006894545,0.06000794,0.00025379183,0.000115513874,0.000113664886,0.00013029718,0.000055465778,0.0029257168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00022486414,0.00002700191,0.000073183655,0.0002539285,0.00011790564],"domain_scores_gemma":[0.99717206,0.0018450893,0.00024560984,0.00030319224,0.00031250948,0.00012155706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009825643,0.00057835487,0.00039658387,0.0007525743,0.00046485843,0.0012761354,0.0007033746,0.0006283092,0.0017971788],"category_scores_gemma":[0.0046864687,0.00019073732,0.00022047851,0.00058378436,0.0030924056,0.0016344166,0.0021195032,0.001801135,0.0004079284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011509778,0.000026778867,0.0002162878,0.00009993471,0.000009215425,0.00006343603,0.00016792928,0.04575707,0.013396498,0.92575544,0.0007304519,0.013661827],"study_design_scores_gemma":[0.000039369424,0.00011391377,0.00016743391,0.00007519833,0.000019317464,0.00020048508,0.00007356748,0.50055647,0.042421225,0.45090204,0.005385957,0.000045050267],"about_ca_topic_score_codex":0.00037112355,"about_ca_topic_score_gemma":0.00027839091,"teacher_disagreement_score":0.0017971788,"about_ca_system_score_codex":0.0005155504,"about_ca_system_score_gemma":0.00073105766,"threshold_uncertainty_score":0.0060121417},"labels":[],"label_agreement":null},{"id":"W2075239581","doi":"10.1007/s11122-005-0008-4","title":"On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices","year":2005,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Low-density parity-check code; Permutation matrix; Combinatorics; Parity (physics); Permutation (music); Minimum distance; Parity-check matrix; Discrete mathematics; Decoding methods; Algorithm; Physics","score_opus":0.008146864414246495,"score_gpt":0.22065389719314865,"score_spread":0.21250703277890215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075239581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40804556,0.003790121,0.5362896,0.0050002434,0.00036937124,0.00013975699,0.000722869,0.0003970155,0.045245554],"genre_scores_gemma":[0.8720394,0.0022471896,0.113799974,0.0005615382,0.00040033355,0.0003399418,0.0007560456,0.000273073,0.009582476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0011105862,0.000099745834,0.000259587,0.00061124173,0.00017681763],"domain_scores_gemma":[0.9749312,0.021536773,0.0012049054,0.000905308,0.0009277283,0.00049427245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028563018,0.0014049916,0.0014261996,0.0016785741,0.0015324785,0.0019639463,0.0028058887,0.0026650236,0.0033670878],"category_scores_gemma":[0.028629651,0.00079250213,0.00067349087,0.001486764,0.0034339451,0.0041723102,0.0032556031,0.0032321294,0.0006845767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006672505,0.00012783078,0.0008364776,0.00046356555,0.000065870336,0.00017364124,0.00044242424,0.14008394,0.004764858,0.82225335,0.0038487182,0.026272183],"study_design_scores_gemma":[0.0001080222,0.00010459001,0.00037103944,0.00008402033,0.00002252601,0.00016079612,0.00008721232,0.23429415,0.0022633313,0.7611846,0.0012729964,0.00004666341],"about_ca_topic_score_codex":0.0007541605,"about_ca_topic_score_gemma":0.0006356509,"teacher_disagreement_score":0.0033670878,"about_ca_system_score_codex":0.0017836594,"about_ca_system_score_gemma":0.0014756655,"threshold_uncertainty_score":0.015105724},"labels":[],"label_agreement":null},{"id":"W2077262688","doi":"10.1109/tcomm.2006.888584","title":"Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Binary number; Computer science; Code (set theory); Discrete mathematics; Mathematics; Arithmetic","score_opus":0.0390375926743596,"score_gpt":0.3129934600301889,"score_spread":0.27395586735582933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077262688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45421576,0.00022495397,0.53806794,0.0002256939,0.0000374523,0.00007358528,0.000073335876,0.0004266892,0.00665466],"genre_scores_gemma":[0.9482578,0.00007756477,0.04955096,0.000051887833,0.000009332254,0.000042595966,0.000070404974,0.000026272288,0.0019132235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873453,0.00039786528,0.00005319405,0.00016834021,0.0004355907,0.00021039377],"domain_scores_gemma":[0.99219316,0.0054917405,0.0006362015,0.00070037553,0.000793393,0.00018508571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016408516,0.000412002,0.00063458853,0.0005736948,0.00048109583,0.0010076761,0.0011646049,0.00076902326,0.00094030576],"category_scores_gemma":[0.008502157,0.00030263246,0.00037837593,0.0006218695,0.0012782295,0.001282469,0.001216465,0.00081251294,0.00022751902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003182135,0.000078887635,0.0025733553,0.000080249534,0.00005151609,0.00015661563,0.00024584407,0.8584367,0.007913482,0.102401435,0.0004221409,0.02732162],"study_design_scores_gemma":[0.0000086505825,0.000020541382,0.00010324646,0.0000031529812,0.0000031383383,0.000021020427,0.000009387989,0.9907645,0.0022143235,0.006762192,0.00008461841,0.0000052279534],"about_ca_topic_score_codex":0.0031108535,"about_ca_topic_score_gemma":0.0029415428,"teacher_disagreement_score":0.0031108535,"about_ca_system_score_codex":0.0015747127,"about_ca_system_score_gemma":0.0014281743,"threshold_uncertainty_score":0.011425376},"labels":[],"label_agreement":null},{"id":"W2077577809","doi":"10.1109/isit.2007.4557089","title":"On the Dynamics of Analog Min-Sum Iterative Decoders, an Analytical Approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Decoding methods; Invertible matrix; Computer science; Ideal (ethics); Piecewise linear function; Algorithm; Piecewise; Soft-decision decoder; Applied mathematics; Mathematics; Mathematical analysis; Pure mathematics","score_opus":0.032372843289076816,"score_gpt":0.30304464903193756,"score_spread":0.27067180574286076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077577809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025508953,0.0013986666,0.9332234,0.0008807628,0.00011437165,0.000031183437,0.00007155953,0.0001532872,0.03861776],"genre_scores_gemma":[0.88196,0.0044950643,0.08813635,0.00048294678,0.00018602678,0.00006648613,0.000085745705,0.00011857476,0.024468822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998387,0.000039207145,0.000005039021,0.00002394293,0.00007138596,0.000021700636],"domain_scores_gemma":[0.9996489,0.00017076168,0.00004284651,0.000035388595,0.000083461666,0.00001859921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003101622,0.0004362537,0.0003530426,0.0004512259,0.00045824214,0.0009154449,0.00058404176,0.00056448474,0.0038209315],"category_scores_gemma":[0.002079859,0.00021894611,0.00026018568,0.0003683155,0.0011389804,0.0014486795,0.0007251916,0.00082889624,0.0007042143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003466057,0.000022423132,0.00022648688,0.00009794702,0.000010945267,0.00011937177,0.00021729068,0.3624967,0.0068798703,0.61033255,0.0012978595,0.018263938],"study_design_scores_gemma":[0.0000037467971,0.000021243759,0.000089349625,0.000022569178,0.0000051508537,0.00014472051,0.000041078976,0.8781864,0.0016198131,0.11600586,0.0038474104,0.0000126204295],"about_ca_topic_score_codex":0.0013204016,"about_ca_topic_score_gemma":0.0008996332,"teacher_disagreement_score":0.0038209315,"about_ca_system_score_codex":0.0008702758,"about_ca_system_score_gemma":0.0005297622,"threshold_uncertainty_score":0.012782276},"labels":[],"label_agreement":null},{"id":"W2081481775","doi":"10.1109/ismvl.2013.35","title":"Lowering Error Floors in Stochastic Decoding of LDPC Codes Based on Wire-Delay Dependent Asynchronous Updating","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Core Research for Evolutional Science and Technology; University of Tokyo","keywords":"Asynchronous communication; Decoding methods; Computer science; Low-density parity-check code; Computation; Algorithm; Stochastic computing; Throughput; Node (physics); Lock (firearm); CMOS; Parallel computing; Electronic engineering; Wireless; Computer network; Telecommunications; Engineering","score_opus":0.015455700793031317,"score_gpt":0.2614948929016428,"score_spread":0.24603919210861147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081481775","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64811015,0.00020718368,0.34769687,0.00007919105,0.000021934196,0.000016746426,0.000040178522,0.00056357257,0.0032640917],"genre_scores_gemma":[0.9771773,0.00007279153,0.022159467,0.000013202438,0.000004861368,0.000007312254,0.000019623702,0.00001996389,0.0005255049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971455,0.00005884544,0.000015621586,0.000042757394,0.00013708815,0.000031191357],"domain_scores_gemma":[0.9992176,0.00037135344,0.00014775408,0.00010342664,0.00014062681,0.000019152965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027403605,0.00024302075,0.00014555149,0.0002471848,0.0002141271,0.00029840306,0.00028216664,0.00022314151,0.00035690275],"category_scores_gemma":[0.0015484764,0.00012800441,0.00010696444,0.00029962236,0.00029105492,0.00043932121,0.00021963338,0.0002501574,0.00008774465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046827053,0.00012213802,0.004516488,0.00013677584,0.000030778127,0.00029064948,0.00018431258,0.50410783,0.38924912,0.026318964,0.00044945203,0.0741253],"study_design_scores_gemma":[0.000013968601,0.00015450151,0.00072127616,0.000006062371,0.000014401185,0.000104472674,0.000010332464,0.8706474,0.12613319,0.0016323001,0.0005521858,0.000009977484],"about_ca_topic_score_codex":0.0010580986,"about_ca_topic_score_gemma":0.0020783779,"teacher_disagreement_score":0.0010580986,"about_ca_system_score_codex":0.0003607427,"about_ca_system_score_gemma":0.0004445293,"threshold_uncertainty_score":0.0026173592},"labels":[],"label_agreement":null},{"id":"W2082703745","doi":"10.1109/sips.2014.6986088","title":"FPGA implementation of a clockless stochastic LDPC decoder","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stratix; Field-programmable gate array; Computer science; Low-density parity-check code; Decoding methods; Throughput; Parallel computing; Gate array; Adder; Combinational logic; Multiplication (music); Computer hardware; Arithmetic; Logic gate; Algorithm; Mathematics; Latency (audio)","score_opus":0.013301808036864876,"score_gpt":0.3054921862613593,"score_spread":0.29219037822449445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082703745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25934944,0.00054524484,0.6868332,0.0003814304,0.00031325888,0.00023663955,0.0006845646,0.010501559,0.04115469],"genre_scores_gemma":[0.79404265,0.0002091427,0.19620198,0.00018305428,0.000033613218,0.000060211554,0.00032698124,0.00008672233,0.008855646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998727,0.000018616578,0.000007684101,0.000019553592,0.00005995314,0.000021514574],"domain_scores_gemma":[0.9998932,0.000028573417,0.000013026762,0.000018167235,0.000037453494,0.000009586059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008689557,0.00023939497,0.0001696301,0.00028305853,0.00022113789,0.0003708719,0.00037724283,0.00021879397,0.0030704613],"category_scores_gemma":[0.00026190726,0.00013057653,0.00009643547,0.00016796365,0.00010778981,0.00019627283,0.00011946602,0.00020649156,0.0007429885],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067119545,0.00018891068,0.0029573606,0.00036374785,0.00010117544,0.0011854249,0.0001429686,0.104158714,0.56845945,0.02248838,0.011906952,0.28737575],"study_design_scores_gemma":[0.00018681784,0.0009602331,0.0032333084,0.000060650407,0.00006908623,0.0017615014,0.000035400124,0.5422233,0.40023687,0.0019829236,0.049182963,0.00006691885],"about_ca_topic_score_codex":0.0018795334,"about_ca_topic_score_gemma":0.0027667787,"teacher_disagreement_score":0.0030704613,"about_ca_system_score_codex":0.00030592002,"about_ca_system_score_gemma":0.00046205358,"threshold_uncertainty_score":0.010271728},"labels":[],"label_agreement":null},{"id":"W2083625472","doi":"10.1109/allerton.2011.6120280","title":"Causes and dynamics of LDPC error floors on AWGN channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Decoding methods; Algorithm; Computer science; Trapping; Code (set theory); Channel (broadcasting); Theoretical computer science; Telecommunications","score_opus":0.046401774410569786,"score_gpt":0.26634572111807486,"score_spread":0.21994394670750508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083625472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305001,0.00087644195,0.15199228,0.0005537984,0.000043821445,0.00003686014,0.00025647323,0.0010459453,0.014694273],"genre_scores_gemma":[0.99428624,0.00019445817,0.0041482076,0.000020055126,0.000009655878,0.000013530138,0.000031996668,0.000041686646,0.0012540971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961424,0.00009891551,0.000012497731,0.0000426639,0.00014337133,0.000088341316],"domain_scores_gemma":[0.99732274,0.0016161796,0.0004892341,0.00018920803,0.00026716499,0.000115533774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038650827,0.0004601309,0.00043490218,0.0011407672,0.0005714311,0.0006183656,0.0003949781,0.00054533716,0.0010983575],"category_scores_gemma":[0.0040251687,0.00039054,0.00021380477,0.0004984121,0.0016801393,0.0006796965,0.00078440394,0.00074443006,0.00021371753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044079914,0.00007897269,0.005841676,0.00022696129,0.000049653976,0.00277264,0.00087151723,0.691677,0.06208006,0.21053584,0.002221411,0.023203524],"study_design_scores_gemma":[0.000016656591,0.00003610008,0.002696243,0.00003483557,0.000012467575,0.000491862,0.00007347495,0.9396641,0.012144041,0.044203617,0.00058209617,0.000044461143],"about_ca_topic_score_codex":0.0020562557,"about_ca_topic_score_gemma":0.0013288207,"teacher_disagreement_score":0.0020562557,"about_ca_system_score_codex":0.00068792887,"about_ca_system_score_gemma":0.0004280801,"threshold_uncertainty_score":0.004991293},"labels":[],"label_agreement":null},{"id":"W2083834044","doi":"10.1109/cwit.2013.6621592","title":"Index assignment capable of detecting one bit errors for multiple description scalar quantizers","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hypercube; Hamming distance; Algorithm; Computer science; Permutation (music); Robustness (evolution); Error detection and correction; Mathematics; Diagonal; Decoding methods; Theoretical computer science; Discrete mathematics","score_opus":0.04253458306905226,"score_gpt":0.25075800393641334,"score_spread":0.2082234208673611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083834044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34391674,0.00029800148,0.64673805,0.00043381253,0.000050611445,0.00006419228,0.0000860232,0.0012387609,0.0071738027],"genre_scores_gemma":[0.823717,0.00012758803,0.17285618,0.000102180966,0.00002244588,0.00007479085,0.00010041392,0.00009461043,0.0029047765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.00012415917,0.000049433143,0.00009452759,0.00016759035,0.00007619701],"domain_scores_gemma":[0.99755067,0.0009921003,0.000441582,0.00069784216,0.00021993263,0.000098000695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008728818,0.00041229924,0.00043879097,0.000535754,0.0006011325,0.00064345036,0.0008803768,0.00049358595,0.0019854694],"category_scores_gemma":[0.0040204306,0.00022085659,0.00022378028,0.0005713399,0.00091662764,0.0012358892,0.001161609,0.0008217072,0.00043032054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015726952,0.00023971534,0.0026905334,0.00032325962,0.000042297423,0.0005132532,0.00053930166,0.22738615,0.27839231,0.19893633,0.0018717727,0.2874924],"study_design_scores_gemma":[0.00006424744,0.00055915926,0.00065099355,0.00006030305,0.000033433138,0.00034408583,0.00014857337,0.6503393,0.26131722,0.0816831,0.0047433837,0.000056334575],"about_ca_topic_score_codex":0.00043828366,"about_ca_topic_score_gemma":0.00067601836,"teacher_disagreement_score":0.0019854694,"about_ca_system_score_codex":0.00071904185,"about_ca_system_score_gemma":0.00063369167,"threshold_uncertainty_score":0.0066420436},"labels":[],"label_agreement":null},{"id":"W2085137187","doi":"10.1016/j.cpc.2015.03.019","title":"Parallel finite element technique using Gaussian belief propagation","year":2015,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multi-core processor; Parallel computing; Finite element method; Belief propagation; Multigrid method; Parallel algorithm; Computation; CUDA; Computational science; Algorithm; Mathematics; Decoding methods; Partial differential equation","score_opus":0.10306521588247543,"score_gpt":0.32825912461331463,"score_spread":0.22519390873083922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085137187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012533029,0.000025475447,0.9974433,0.00005146182,0.000026172043,0.000013053122,0.000016898326,0.00035060677,0.00081977085],"genre_scores_gemma":[0.08015672,0.000099249744,0.9149266,0.00010599767,0.000028302366,0.0001174054,0.00008982892,0.00023984392,0.004236087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993998,0.00010173863,0.000022899829,0.00007036027,0.00037569148,0.000029564857],"domain_scores_gemma":[0.99863017,0.0005830126,0.000103539285,0.00022370138,0.0004088547,0.000050765735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007003206,0.00080905133,0.0011261249,0.0009476592,0.00067660917,0.00087897165,0.0017151247,0.0013857539,0.0046940106],"category_scores_gemma":[0.0028259594,0.00067567796,0.00060504116,0.0012276102,0.00083344744,0.0011936801,0.0014725653,0.0019506067,0.0013216485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015591053,0.00011483859,0.00055329717,0.00016288283,0.00008779214,0.0001045408,0.00015524554,0.75496596,0.010592557,0.051294535,0.003453889,0.17835858],"study_design_scores_gemma":[0.000008080069,0.000009792542,0.0000312134,0.000005263149,0.000006878995,0.000023105904,0.000006806988,0.9913122,0.0024465802,0.004924669,0.0012192433,0.000006126123],"about_ca_topic_score_codex":0.005162473,"about_ca_topic_score_gemma":0.007056381,"teacher_disagreement_score":0.005162473,"about_ca_system_score_codex":0.00056896434,"about_ca_system_score_gemma":0.0016537423,"threshold_uncertainty_score":0.015703022},"labels":[],"label_agreement":null},{"id":"W2086353208","doi":"10.1109/tmag.2013.2284483","title":"Parallel Multigrid Acceleration for the Finite-Element Gaussian Belief Propagation Algorithm","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multigrid method; Conjugate gradient method; Finite element method; Computer science; Solver; Belief propagation; Speedup; Parallel computing; Stencil; Algorithm; Computational science; Parallel algorithm; Domain decomposition methods; Discretization; Convergence (economics); Applied mathematics; Mathematical optimization; Mathematics; Partial differential equation; Physics; Mathematical analysis","score_opus":0.02371085942687847,"score_gpt":0.2654709053875145,"score_spread":0.24176004596063602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086353208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004792542,0.00010563153,0.9915872,0.00012481894,0.000048287577,0.000020896412,0.00003884355,0.0009789133,0.0023027807],"genre_scores_gemma":[0.1753505,0.00017885119,0.8206018,0.00011710022,0.000040619707,0.000111032794,0.00022538746,0.0003177762,0.0030568503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.00010015207,0.00001724452,0.0000562202,0.0002653858,0.000059005146],"domain_scores_gemma":[0.9992735,0.00022970083,0.00004976078,0.00012733208,0.00028049885,0.00003916634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071584276,0.00059722323,0.0006657902,0.00050911476,0.00039147525,0.0006312904,0.0010745426,0.0007245519,0.0030334136],"category_scores_gemma":[0.002319377,0.00031952848,0.0005748815,0.0008055458,0.00049127796,0.0007288342,0.0010524868,0.001218314,0.0010951608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016645424,0.000096136326,0.0014462809,0.00014283594,0.000069769725,0.00015677004,0.00014937176,0.74451756,0.012741645,0.037613448,0.006908399,0.19599132],"study_design_scores_gemma":[0.000009707269,0.000007365938,0.000074803545,0.0000027666454,0.0000029573046,0.000015698108,0.0000042134193,0.9931035,0.001839147,0.0032075108,0.0017288171,0.0000034905197],"about_ca_topic_score_codex":0.0062596695,"about_ca_topic_score_gemma":0.0070601706,"teacher_disagreement_score":0.0062596695,"about_ca_system_score_codex":0.00059500145,"about_ca_system_score_gemma":0.0012028745,"threshold_uncertainty_score":0.012446463},"labels":[],"label_agreement":null},{"id":"W2086463378","doi":"10.1109/natw.2014.18","title":"Design and Test of Adaptive Computing Fabrics for Scalable and High-Efficiency Cognitive SoC Applications","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"CMC Microsystems","keywords":"Computer science; Scalability; Low-density parity-check code; CMOS; Field-programmable gate array; Throughput; Bit error rate; Very-large-scale integration; Embedded system; Decoding methods; Computer hardware; Electronic engineering; Wireless; Engineering; Algorithm","score_opus":0.024986410997634982,"score_gpt":0.26472630907338457,"score_spread":0.23973989807574958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086463378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674836,0.00029376283,0.026912268,0.000111000394,0.00009737296,0.00012640789,0.0001335113,0.0005544841,0.004287609],"genre_scores_gemma":[0.9791838,0.000067687724,0.019592397,0.000025647296,0.000008276715,0.000043797812,0.00006023228,0.00002519096,0.0009928319],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999721,0.0000351163,0.000012840066,0.000042654876,0.00010502213,0.00008340196],"domain_scores_gemma":[0.99945,0.00007076152,0.00011722544,0.000108303386,0.00017443902,0.00007928165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029555813,0.00032784237,0.00015440724,0.00037058914,0.00020256816,0.00038516533,0.0006739467,0.00027057924,0.0009127233],"category_scores_gemma":[0.0007225158,0.000102549304,0.00016291636,0.00021793369,0.00019988934,0.00037369106,0.00020275214,0.00018565045,0.00015838032],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007377992,0.0004087057,0.009169495,0.000480162,0.00008782978,0.00063416234,0.00016042113,0.05788044,0.82419515,0.0040882095,0.0022264547,0.09993115],"study_design_scores_gemma":[0.00016750302,0.0043987026,0.016324516,0.000047388632,0.00007579632,0.0006964366,0.00016255648,0.26873487,0.69531024,0.0008291832,0.013197437,0.000055366057],"about_ca_topic_score_codex":0.0009829224,"about_ca_topic_score_gemma":0.0008422904,"teacher_disagreement_score":0.0009829224,"about_ca_system_score_codex":0.00048313977,"about_ca_system_score_gemma":0.00033868614,"threshold_uncertainty_score":0.0035054684},"labels":[],"label_agreement":null},{"id":"W2086523057","doi":"10.1109/ita.2012.6181790","title":"Nearly-optimal associative memories based on distributed constant weight codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Associative property; Computer science; Constant (computer programming); Content-addressable memory; Parallel computing; Bidirectional associative memory; Content-addressable storage; Distributed computing; Mathematics; Programming language; Artificial neural network; Artificial intelligence","score_opus":0.021871883428724242,"score_gpt":0.2738545134822867,"score_spread":0.2519826300535624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086523057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3347374,0.0007428574,0.6524525,0.0005271493,0.00012372376,0.000057949186,0.00014197206,0.0011112088,0.010105261],"genre_scores_gemma":[0.936052,0.00026067783,0.060125817,0.00012305813,0.000043784134,0.0000461299,0.000094346535,0.000054485037,0.0031997543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996898,0.00006385474,0.000015942234,0.00006734565,0.00010849841,0.000054639895],"domain_scores_gemma":[0.99893767,0.00039805193,0.00011894156,0.00025689564,0.0002228409,0.000065644184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041573902,0.00024364205,0.0004220711,0.00042584358,0.00038778502,0.0007005081,0.00096343213,0.00062853866,0.001379002],"category_scores_gemma":[0.0027529988,0.00015646261,0.00017967148,0.00050164503,0.0008540339,0.0014842376,0.0008031237,0.0006352445,0.00026609324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057344977,0.000142817,0.001471502,0.00016268551,0.000074912554,0.00027577393,0.00020126805,0.27763194,0.054589935,0.50632966,0.0047861896,0.15375997],"study_design_scores_gemma":[0.00004389837,0.00008721803,0.00018269685,0.000011332719,0.000014766871,0.00012541347,0.000032137446,0.8205882,0.020342601,0.15629275,0.0022575308,0.000021444668],"about_ca_topic_score_codex":0.0010472549,"about_ca_topic_score_gemma":0.0017896437,"teacher_disagreement_score":0.001379002,"about_ca_system_score_codex":0.0005643938,"about_ca_system_score_gemma":0.0006163612,"threshold_uncertainty_score":0.0046132803},"labels":[],"label_agreement":null},{"id":"W2087488579","doi":"10.1117/12.2001664","title":"A monolithic optical front-end for soft-decision LDPC decoders","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Front and back ends; Phase-shift keying; Forward error correction; Decoding methods; Keying; Multiplexing; Electronic engineering; Optics; Physics; Bit error rate; Algorithm; Telecommunications","score_opus":0.016518528588818773,"score_gpt":0.2565284839641146,"score_spread":0.24000995537529582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087488579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10309762,0.0013314856,0.882279,0.0005460108,0.00040238912,0.00016028136,0.00027280694,0.0036242025,0.008286298],"genre_scores_gemma":[0.5297896,0.00038186085,0.45101324,0.0008213249,0.00020795714,0.000094646166,0.00031714197,0.00014619184,0.017228015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996075,0.000033682307,0.000012573561,0.00007977594,0.00022638487,0.000039992054],"domain_scores_gemma":[0.99949694,0.00015411511,0.00004517708,0.0000673611,0.00019941485,0.00003699196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028907156,0.0004419709,0.0003382023,0.00040468667,0.00047219457,0.00083526544,0.0013938161,0.001171356,0.0028921913],"category_scores_gemma":[0.0005293768,0.0004065287,0.00025419978,0.00022374254,0.00041119746,0.0010459692,0.0004816853,0.00093168527,0.0020270487],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038825933,0.0002293622,0.0013299892,0.000254093,0.00005568964,0.00027650723,0.00008971919,0.007722409,0.87007123,0.0121614225,0.003242095,0.10417927],"study_design_scores_gemma":[0.0000805332,0.00051784667,0.0020788554,0.000034572153,0.00006845273,0.00065488025,0.000029491537,0.14912531,0.8173609,0.0024452799,0.027541764,0.00006205605],"about_ca_topic_score_codex":0.00038887007,"about_ca_topic_score_gemma":0.0010211534,"teacher_disagreement_score":0.0028921913,"about_ca_system_score_codex":0.00058362435,"about_ca_system_score_gemma":0.0003881133,"threshold_uncertainty_score":0.009675384},"labels":[],"label_agreement":null},{"id":"W2088111058","doi":"10.1109/tcomm.2012.100512.120006","title":"Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Computer science; Algorithm; Bit error rate; Modulation (music); Error detection and correction; Electronic engineering; Turbo code; Block code; Linear code; Bandwidth (computing); Theoretical computer science; Mathematics; Decoding methods; Telecommunications; Engineering","score_opus":0.07044379227568483,"score_gpt":0.33031192657691716,"score_spread":0.25986813430123235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088111058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014998471,0.00024633584,0.9825289,0.000058971375,0.000021382943,0.000021673719,0.00002470707,0.00016686,0.0019327168],"genre_scores_gemma":[0.3239638,0.0004626756,0.6729905,0.00008805805,0.000036219688,0.00012004092,0.000095440635,0.00006311436,0.0021800648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997154,0.00009255787,0.000013015307,0.000030572515,0.00012618737,0.000022294029],"domain_scores_gemma":[0.99954695,0.00016863804,0.000052842974,0.00011359385,0.00009908049,0.000018814953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042734112,0.0003525784,0.00032490416,0.0005195259,0.00033197165,0.00044908808,0.0005632065,0.0004943398,0.0009691936],"category_scores_gemma":[0.0013575157,0.00018108748,0.00022794092,0.00042800032,0.00043061722,0.0004730758,0.000544407,0.0008159097,0.00040517247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001871387,0.000100516845,0.0013920243,0.00028440266,0.000037786423,0.00021140695,0.0002120071,0.25592607,0.175546,0.29407707,0.0017939071,0.2702317],"study_design_scores_gemma":[0.000017755241,0.000104267594,0.00032865076,0.000037088408,0.000012443478,0.0002578232,0.000010760947,0.899216,0.06054706,0.03363671,0.00580245,0.000028915294],"about_ca_topic_score_codex":0.00017169282,"about_ca_topic_score_gemma":0.0003688856,"teacher_disagreement_score":0.0009691936,"about_ca_system_score_codex":0.0002679747,"about_ca_system_score_gemma":0.00043667163,"threshold_uncertainty_score":0.0032423139},"labels":[],"label_agreement":null},{"id":"W2088929178","doi":"10.1109/itwksps.2010.5503202","title":"Performance analysis of iterative decoding algorithms with memory","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Low-density parity-check code; Belief propagation; Decoding methods; Message passing; Iterative method; Theoretical computer science; Parallel computing","score_opus":0.01132446896551465,"score_gpt":0.2567128962242748,"score_spread":0.24538842725876014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088929178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19607568,0.0006597517,0.7972616,0.00031889664,0.000018233482,0.000062425956,0.000079914855,0.00047274868,0.0050507262],"genre_scores_gemma":[0.9356702,0.000345266,0.06210096,0.00005476704,0.000026452686,0.00009846557,0.00012720584,0.000069488415,0.0015072934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819845,0.000676559,0.000068169305,0.00017367877,0.00064539956,0.0002377029],"domain_scores_gemma":[0.98613805,0.010983939,0.00080064515,0.00082158647,0.0011172025,0.00013848711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488631,0.00071517756,0.00080638897,0.0010555243,0.00050233334,0.0009289547,0.0013317036,0.0011383801,0.0011989367],"category_scores_gemma":[0.022114066,0.00040157442,0.00047743678,0.000986754,0.00119804,0.0020554487,0.0011318555,0.0008956865,0.00028848843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013002881,0.000035709432,0.001723209,0.000046955232,0.00003932734,0.00005222109,0.00011202345,0.9311691,0.0028105502,0.04244033,0.00023893092,0.021201534],"study_design_scores_gemma":[0.0000028466895,0.000016177795,0.00011527372,0.0000031732866,0.0000032664266,0.00001620074,0.000003876141,0.9944518,0.0010762301,0.004258211,0.000048806705,0.000004076007],"about_ca_topic_score_codex":0.003467807,"about_ca_topic_score_gemma":0.0016801666,"teacher_disagreement_score":0.003467807,"about_ca_system_score_codex":0.0017908309,"about_ca_system_score_gemma":0.0015916632,"threshold_uncertainty_score":0.013161302},"labels":[],"label_agreement":null},{"id":"W2089870764","doi":"10.1364/oe.20.018336","title":"45 Gb/s low complexity optical front-end for soft-decision LDPC decoders","year":2012,"lang":"en","type":"article","venue":"Optics Express","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Coding gain; Bit error rate; Decoding methods; Forward error correction; Front and back ends; Electronic engineering; Optics; Algorithm; Physics; Engineering","score_opus":0.05054392370068255,"score_gpt":0.3135865928694848,"score_spread":0.26304266916880226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089870764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44773912,0.0008828043,0.52555084,0.00057627365,0.00021074862,0.00020367614,0.0005822259,0.004713937,0.01954034],"genre_scores_gemma":[0.7665317,0.0002951447,0.20317507,0.00053780025,0.00006745542,0.000085274645,0.00044406092,0.00012155855,0.028741961],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996897,0.000028233055,0.000013663867,0.00004385785,0.00018295726,0.00004159381],"domain_scores_gemma":[0.99960214,0.00018338894,0.000042248703,0.0000358792,0.000114677416,0.000021638203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019055062,0.00031398382,0.00023624818,0.0003784679,0.00026453933,0.00065657677,0.0005977708,0.0005026799,0.008341374],"category_scores_gemma":[0.0006531709,0.00019332356,0.00015578022,0.00020329357,0.00022688387,0.00059301284,0.00030128055,0.0004478938,0.002647724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083494873,0.0001670863,0.0023843744,0.0002787051,0.0000411053,0.00036426014,0.00021317716,0.007999254,0.7624765,0.010667441,0.002870119,0.21170303],"study_design_scores_gemma":[0.000090058384,0.00054586696,0.0041729696,0.000078063415,0.00006466403,0.00064879924,0.00006150897,0.118408404,0.83766127,0.0030868128,0.03512496,0.000056629222],"about_ca_topic_score_codex":0.0009249098,"about_ca_topic_score_gemma":0.0019266485,"teacher_disagreement_score":0.008341374,"about_ca_system_score_codex":0.0005560764,"about_ca_system_score_gemma":0.00041764174,"threshold_uncertainty_score":0.02790469},"labels":[],"label_agreement":null},{"id":"W2091520801","doi":"10.1109/bsc.2010.5472982","title":"Cross-layer optimization of rateless coding over wireless fading channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Cooperative Research Centres, Australian Government Department of Industry","keywords":"Computer science; Fading; Erasure; Forward error correction; Physical layer; Network packet; Erasure code; Fountain code; Code rate; Bit error rate; Convolutional code; Error detection and correction; Link adaptation; Coding (social sciences); Wireless; Computer network; Throughput; Decoding methods; Algorithm; Concatenated error correction code; Telecommunications; Block code; Mathematics","score_opus":0.02312550320283621,"score_gpt":0.30332970092503664,"score_spread":0.28020419772220045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091520801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14663072,0.0011973865,0.84759426,0.00025217808,0.000065376305,0.000044203684,0.000037485785,0.00020563613,0.0039727413],"genre_scores_gemma":[0.95375013,0.00043405138,0.0445744,0.00006387475,0.000022648212,0.00003530023,0.000028544388,0.00002651799,0.001064699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.00027261558,0.000022448958,0.00006028492,0.00015162032,0.000092396294],"domain_scores_gemma":[0.99850595,0.0008653763,0.00021969757,0.00009789735,0.0002689389,0.000042227894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015760801,0.0010546729,0.0005551258,0.00038678487,0.00025933696,0.00062562956,0.0005657036,0.00048939994,0.00080677023],"category_scores_gemma":[0.0029260905,0.00029550373,0.00029421228,0.00052285864,0.0006969005,0.0008489908,0.0008939118,0.0005358454,0.00014060193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007555044,0.000021542715,0.0003301064,0.000033656706,0.000028406217,0.000044125452,0.000028183682,0.97579145,0.005118106,0.0060914997,0.00022643858,0.012211009],"study_design_scores_gemma":[0.0000057780376,0.000031143387,0.000067517605,0.0000034414627,0.0000080644595,0.000013195168,0.0000033020497,0.9971476,0.001610128,0.0010130729,0.00009244657,0.0000043280243],"about_ca_topic_score_codex":0.001998302,"about_ca_topic_score_gemma":0.0016414218,"teacher_disagreement_score":0.001998302,"about_ca_system_score_codex":0.0008079896,"about_ca_system_score_gemma":0.0007591796,"threshold_uncertainty_score":0.008335233},"labels":[],"label_agreement":null},{"id":"W2093546964","doi":"10.1109/cwit.2013.6621611","title":"Streaming erasure codes under mismatched source-channel frame rates","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary erasure channel; Computer science; Decoding methods; Erasure; Network packet; Erasure code; Channel (broadcasting); Frame (networking); Luby transform code; Online codes; Encoding (memory); List decoding; Code (set theory); Code rate; Raptor code; Upper and lower bounds; Channel capacity; Computer network; Algorithm; Sequential decoding; Concatenated error correction code; Block code; Mathematics; Set (abstract data type)","score_opus":0.018554479915262018,"score_gpt":0.25538686272735034,"score_spread":0.23683238281208832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093546964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35385665,0.0010809866,0.63721985,0.00055261934,0.00007108903,0.000071909584,0.00040472235,0.0005674034,0.006174706],"genre_scores_gemma":[0.9689451,0.00077926036,0.027836228,0.000049410908,0.000073228504,0.000091409405,0.0001489257,0.000071635324,0.0020049135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983436,0.00040275604,0.0001036445,0.00020888064,0.00048755793,0.00045352505],"domain_scores_gemma":[0.9783588,0.016683806,0.0017304518,0.0012613856,0.0014612959,0.00050430413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022305378,0.0013244004,0.0012165642,0.00086007174,0.0007711613,0.001259047,0.0012177455,0.0013524797,0.0016870293],"category_scores_gemma":[0.021204403,0.00060540345,0.00038638394,0.0011983898,0.0018055023,0.003998969,0.0025448787,0.0017335725,0.0003036214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042693346,0.00004159717,0.0008487518,0.00011761504,0.000029544783,0.00045784866,0.00021310213,0.82330763,0.012561941,0.15113914,0.00056820514,0.010287738],"study_design_scores_gemma":[0.000016813496,0.000052725565,0.00019002405,0.00002421573,0.000010631763,0.00010100526,0.000040365187,0.95512754,0.0073641757,0.036788367,0.00025896213,0.000025179725],"about_ca_topic_score_codex":0.0030720006,"about_ca_topic_score_gemma":0.0019686897,"teacher_disagreement_score":0.0030720006,"about_ca_system_score_codex":0.0019247265,"about_ca_system_score_gemma":0.001554746,"threshold_uncertainty_score":0.013964891},"labels":[],"label_agreement":null},{"id":"W2094116203","doi":"10.1109/tcomm.2010.092810.090549","title":"Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Electrical, Communications and Cyber Systems; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"MIMO; Link adaptation; Low-density parity-check code; Computer science; Code rate; Spectral efficiency; Adaptive coding; Communications system; Wireless; Bit error rate; Throughput; Coding (social sciences); Electronic engineering; Algorithm; Channel (broadcasting); Real-time computing; Computer network; Decoding methods; Mathematics; Telecommunications; Fading; Engineering","score_opus":0.039680225384198894,"score_gpt":0.298442293113083,"score_spread":0.2587620677288841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094116203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05369742,0.00038835156,0.9403193,0.00024339507,0.000062640305,0.00009095096,0.00007296902,0.0004575668,0.004667435],"genre_scores_gemma":[0.78487426,0.00043373377,0.21152346,0.00015284175,0.00008552967,0.00015708961,0.000076983786,0.000023654979,0.0026724532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.00021861562,0.00003117634,0.00009436299,0.00025473512,0.00006118029],"domain_scores_gemma":[0.99894875,0.00044895918,0.00016375796,0.00018598088,0.00021323343,0.00003925669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048607998,0.0005253855,0.000362621,0.0003748333,0.00037188517,0.0006116104,0.00076382933,0.0004718607,0.00065225863],"category_scores_gemma":[0.0022249657,0.0002167002,0.00022163226,0.0005800845,0.0006403017,0.00065859605,0.00063501176,0.0006892144,0.00033727597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006198514,0.00021824002,0.002470863,0.00038367393,0.00010821318,0.0008415191,0.0004350851,0.4918301,0.20083982,0.14382504,0.0026941635,0.15573339],"study_design_scores_gemma":[0.00008446687,0.0002260442,0.0004184527,0.000026587653,0.00004002425,0.00035584677,0.000025305766,0.9258895,0.051340844,0.016866064,0.0046746857,0.000052241703],"about_ca_topic_score_codex":0.00091831526,"about_ca_topic_score_gemma":0.0011491118,"teacher_disagreement_score":0.00091831526,"about_ca_system_score_codex":0.00044477513,"about_ca_system_score_gemma":0.00056700374,"threshold_uncertainty_score":0.003227055},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01878489496873109,"score_gpt":0.2653956083520281,"score_spread":0.246610713383297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094676669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10072845,0.0008992315,0.82162684,0.0015301738,0.00019155715,0.00012357684,0.0004068284,0.00024078903,0.07425248],"genre_scores_gemma":[0.8537337,0.0013549506,0.12782562,0.0007740698,0.00028957677,0.00035736465,0.0005211472,0.00009340042,0.01505032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991721,0.00022306354,0.00002998459,0.000103766135,0.00034331882,0.00012782455],"domain_scores_gemma":[0.99775773,0.0012357582,0.00019906349,0.00036818848,0.00032937134,0.000109833745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075794704,0.00041234444,0.0002853824,0.0005867117,0.0006226974,0.0013421407,0.0004590155,0.0007007118,0.003418772],"category_scores_gemma":[0.0033032685,0.0002449462,0.000386385,0.0005607356,0.0019990876,0.0019444375,0.0018898273,0.0017475944,0.000739177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026686219,0.000007739936,0.00006391631,0.000021329926,0.0000019383565,0.000021264446,0.00007489448,0.007136919,0.0011501515,0.98495317,0.00052616006,0.006015795],"study_design_scores_gemma":[0.000016510774,0.00001810903,0.00011087659,0.00002126935,0.0000048243865,0.000051037117,0.00003800994,0.053740807,0.0036107257,0.9372977,0.0050748894,0.000015260419],"about_ca_topic_score_codex":0.00054988416,"about_ca_topic_score_gemma":0.00038061355,"teacher_disagreement_score":0.003418772,"about_ca_system_score_codex":0.00087780115,"about_ca_system_score_gemma":0.00084749673,"threshold_uncertainty_score":0.011436939},"labels":[],"label_agreement":null},{"id":"W2095820036","doi":"10.1109/ccece.2004.1345016","title":"Irregular rate-compatible LDPC codes for capacity-approaching hybrid-ARQ schemes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Turbo code; Puncturing; Hybrid automatic repeat request; Block code; Serial concatenated convolutional codes; Concatenated error correction code; Raptor code; Algorithm; Linear code; Computer science; Code rate; Mathematics; Forward error correction; Decoding methods; Telecommunications; Transmission (telecommunications)","score_opus":0.03558437949558501,"score_gpt":0.26827319983956865,"score_spread":0.23268882034398364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095820036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09452011,0.0004875644,0.90090996,0.00014112699,0.000040347815,0.0000856912,0.00007201933,0.00037863618,0.0033645283],"genre_scores_gemma":[0.71990985,0.00043344664,0.2771861,0.00007084728,0.00005391026,0.00017206116,0.00014712288,0.000065496286,0.001961183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944276,0.00017648403,0.000031930274,0.000056601566,0.00024827573,0.000043892116],"domain_scores_gemma":[0.99823076,0.0006550431,0.0002434631,0.00053796015,0.00026744293,0.000065432854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008917098,0.00038597363,0.00030289977,0.0004249346,0.00039089256,0.0004305569,0.0005700244,0.00037360238,0.0007258356],"category_scores_gemma":[0.0023888543,0.00018239566,0.00024819293,0.00042782005,0.00076491426,0.0005660313,0.0006307957,0.000703383,0.00028915674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045362854,0.00009141661,0.002378118,0.00039918552,0.000050283623,0.0007582611,0.0006180363,0.2823432,0.15062658,0.41319963,0.0015027144,0.14757895],"study_design_scores_gemma":[0.000052638792,0.00025389635,0.000719209,0.000057368947,0.000029208344,0.0007308914,0.00005180856,0.8525009,0.06660382,0.0627457,0.01619484,0.000059669972],"about_ca_topic_score_codex":0.00030592352,"about_ca_topic_score_gemma":0.00039058115,"teacher_disagreement_score":0.0008917098,"about_ca_system_score_codex":0.00043616784,"about_ca_system_score_gemma":0.0005462038,"threshold_uncertainty_score":0.0047159195},"labels":[],"label_agreement":null},{"id":"W2096151552","doi":"10.1109/pacrim.2009.5291266","title":"Low density parity check codes for dedicated short range communication (DSRC) systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dedicated short-range communications; Computer science; Convolutional code; Low-density parity-check code; Serial concatenated convolutional codes; Raptor code; Turbo code; Forward error correction; Concatenated error correction code; Algorithm; Decoding methods; Computer network; Error floor; Telecommunications; Block code; Wireless","score_opus":0.033342148487898536,"score_gpt":0.29640623196212307,"score_spread":0.26306408347422455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096151552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45776048,0.0027747136,0.52762365,0.0005542918,0.00012795911,0.000089237226,0.00022263196,0.00033743388,0.010509509],"genre_scores_gemma":[0.96240413,0.0006525071,0.035338007,0.00006837736,0.00004382453,0.00004621396,0.000109367946,0.000020868103,0.001316718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954396,0.000116698466,0.0000161963,0.000030068613,0.00023211272,0.000060949915],"domain_scores_gemma":[0.9977119,0.0013175604,0.00024590082,0.0002508204,0.0004270763,0.000046817044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005731502,0.00040716035,0.0003949416,0.00040429065,0.00030593053,0.00060649985,0.0004098942,0.0005949564,0.0012660585],"category_scores_gemma":[0.002923775,0.00013230792,0.00021263216,0.00044042466,0.00042138647,0.00064488116,0.00047135743,0.0004088641,0.00013104342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043233729,0.00007476208,0.0032349622,0.0002492685,0.00007951175,0.0004807329,0.00009886285,0.82851225,0.035727628,0.08097068,0.0015354813,0.048603404],"study_design_scores_gemma":[0.000030462083,0.00015270353,0.00085744297,0.000017766119,0.00003273469,0.0001965502,0.000017358028,0.9712513,0.009430631,0.016674,0.0013192699,0.000019898345],"about_ca_topic_score_codex":0.00203375,"about_ca_topic_score_gemma":0.0026508172,"teacher_disagreement_score":0.00203375,"about_ca_system_score_codex":0.0008237224,"about_ca_system_score_gemma":0.0008429085,"threshold_uncertainty_score":0.0059765577},"labels":[],"label_agreement":null},{"id":"W2096497197","doi":"10.1109/itw.2007.4313137","title":"LDPC Decoder Message Formatting Based on Activity Factor Minimization Using Differential Density Evolution","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Disk formatting; Minification; Power consumption; Message passing; Implementation; Power (physics); Electronic engineering; Algorithm; Parallel computing; Engineering","score_opus":0.027774053855003884,"score_gpt":0.2882722834355185,"score_spread":0.2604982295805146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096497197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669686,0.00027886586,0.82478446,0.00015695691,0.000026682914,0.000073869895,0.000050649473,0.0007667469,0.0068932534],"genre_scores_gemma":[0.7560595,0.00021120756,0.2395934,0.000043692973,0.00001129108,0.00005652043,0.00007616223,0.0000549279,0.0038933302],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.000038496266,0.000006709826,0.000016884853,0.00009363308,0.000009912755],"domain_scores_gemma":[0.999708,0.00013427762,0.000037258367,0.000049446287,0.000063224186,0.000007682146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001941565,0.00021157648,0.00020923931,0.00022946952,0.00014928209,0.00034840076,0.00040886956,0.00024671224,0.0008197543],"category_scores_gemma":[0.0008766309,0.00010120016,0.00010356051,0.00028152418,0.00028815938,0.00032352222,0.0002175301,0.00025694052,0.00020789776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002301664,0.00012392366,0.001515926,0.00023697564,0.00004372519,0.00025165468,0.00024395839,0.3330352,0.3471698,0.107030235,0.0012776826,0.20884085],"study_design_scores_gemma":[0.000018650568,0.00006397144,0.00027350022,0.000008258589,0.000009081346,0.00011096439,0.000009551794,0.89457285,0.09872606,0.0045329225,0.0016644018,0.000009757089],"about_ca_topic_score_codex":0.00044014998,"about_ca_topic_score_gemma":0.000700044,"teacher_disagreement_score":0.0008197543,"about_ca_system_score_codex":0.0004561376,"about_ca_system_score_gemma":0.00029113653,"threshold_uncertainty_score":0.003309548},"labels":[],"label_agreement":null},{"id":"W2096848776","doi":"10.1109/ccece.2009.5090295","title":"Design and FPGA implementation of iterative decoders for codes on graphs","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Field-programmable gate array; Computer science; Speedup; Parallel computing; Decoding methods; Reconfigurable computing; Gate array; Software; Computer hardware; Embedded system; Algorithm; Programming language","score_opus":0.03425657745476295,"score_gpt":0.3431259678160269,"score_spread":0.30886939036126393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096848776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15605511,0.00061609526,0.82248116,0.0002322058,0.00014941704,0.0002444787,0.0002045776,0.0050738244,0.014943065],"genre_scores_gemma":[0.49453965,0.00032321006,0.4992834,0.00010783995,0.000033877277,0.000111065434,0.00023659886,0.00014066162,0.005223654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.000040750827,0.000013378684,0.00002573895,0.000083960775,0.00003094857],"domain_scores_gemma":[0.9997322,0.0000973488,0.000035696787,0.000036634283,0.000082900064,0.00001509813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017987323,0.00042791976,0.00023624954,0.00044986315,0.00026376164,0.00046195075,0.00071426993,0.00030787513,0.002384279],"category_scores_gemma":[0.00066464994,0.00019525553,0.00022014366,0.00035366157,0.00022034842,0.00032308517,0.00020431123,0.00030618062,0.0006840325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006937355,0.0001752147,0.00220876,0.00056106894,0.0001448594,0.0008878852,0.00028132793,0.17509875,0.26945546,0.03773255,0.005039028,0.50772136],"study_design_scores_gemma":[0.00018969964,0.0007624552,0.0016908179,0.000068884285,0.000062267565,0.0009167809,0.0000711261,0.5627977,0.4026409,0.004860411,0.025870694,0.0000682862],"about_ca_topic_score_codex":0.0015826343,"about_ca_topic_score_gemma":0.003513755,"teacher_disagreement_score":0.002384279,"about_ca_system_score_codex":0.0005785834,"about_ca_system_score_gemma":0.0007794422,"threshold_uncertainty_score":0.007976174},"labels":[],"label_agreement":null},{"id":"W2098209061","doi":"10.1109/lcomm.2006.1633327","title":"A class of irregular ldpc codes with low error floor and low encoding complexity","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"CMC Microsystems","keywords":"Low-density parity-check code; Encoder; Computer science; Encoding (memory); Algorithm; Error floor; Decoding methods; Parity-check matrix; Diagonal; Error detection and correction; Concatenated error correction code; Block code; Mathematics","score_opus":0.03349696006564392,"score_gpt":0.27283999888355537,"score_spread":0.23934303881791144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098209061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24208279,0.0009706631,0.74185205,0.000320607,0.00011231367,0.00014412931,0.00036139376,0.0005907549,0.013565243],"genre_scores_gemma":[0.8170709,0.00072682695,0.17683044,0.0001976641,0.00008283894,0.00016033268,0.00057619537,0.00008459347,0.004270225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999824,0.000026511598,0.000011543663,0.000032538,0.00007894796,0.000026535325],"domain_scores_gemma":[0.999366,0.00018341347,0.00009929031,0.00016368565,0.00013753999,0.000050148625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017170608,0.00030463102,0.00029701486,0.00047513907,0.0003309415,0.00052884803,0.00028076267,0.00034709505,0.00056069315],"category_scores_gemma":[0.0009985579,0.00012133332,0.00020896496,0.00033889996,0.0004754306,0.0004976585,0.0003352811,0.00059020054,0.0002676591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057311996,0.00022026229,0.0045383847,0.0004874714,0.00006648735,0.0009242928,0.00028965663,0.14963423,0.32441697,0.27903718,0.0039547575,0.23585719],"study_design_scores_gemma":[0.00011157425,0.00037245653,0.0019228919,0.00006149751,0.000047321337,0.0021853503,0.00007933537,0.77699685,0.109460734,0.071072765,0.037581943,0.00010726451],"about_ca_topic_score_codex":0.00030563172,"about_ca_topic_score_gemma":0.000428096,"teacher_disagreement_score":0.00056069315,"about_ca_system_score_codex":0.00027231008,"about_ca_system_score_gemma":0.0003816885,"threshold_uncertainty_score":0.0019757152},"labels":[],"label_agreement":null},{"id":"W2098237535","doi":"10.1109/tcomm.2011.011811.090638","title":"Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Low-density parity-check code; List decoding; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; Linear programming; Concatenated error correction code; Computer science; Mathematics; Block code; Error floor","score_opus":0.0926874537098621,"score_gpt":0.3199310397218236,"score_spread":0.22724358601196148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098237535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028449248,0.0000506357,0.99600667,0.000027269216,0.000009221376,0.00001434871,0.000011814379,0.00019310926,0.00084205763],"genre_scores_gemma":[0.10511034,0.00014641463,0.89124507,0.000063723084,0.000017053007,0.00015961254,0.000114538234,0.000115619565,0.0030276864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.00011241902,0.000017634668,0.00005374816,0.000186966,0.00003106682],"domain_scores_gemma":[0.9995276,0.00027178263,0.000025501038,0.000041103147,0.00011782804,0.00001616784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041166815,0.0004924562,0.0006949158,0.00047718178,0.00035163012,0.00067147677,0.0007046218,0.0006586353,0.0019232598],"category_scores_gemma":[0.0012325869,0.0002703843,0.0004295648,0.0005027801,0.00045047508,0.0006617129,0.0007395215,0.0014245271,0.0009346219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013814314,0.00007097889,0.00047106852,0.00015408175,0.00004829753,0.00011548182,0.0001647299,0.5657615,0.01722945,0.08539354,0.0018287211,0.328624],"study_design_scores_gemma":[0.000014177798,0.000026884087,0.000036108348,0.0000067983274,0.0000038969542,0.000041571435,0.000006085903,0.98724127,0.0034243672,0.007629674,0.0015616155,0.0000075444855],"about_ca_topic_score_codex":0.0012331388,"about_ca_topic_score_gemma":0.0011094216,"teacher_disagreement_score":0.0019232598,"about_ca_system_score_codex":0.000530528,"about_ca_system_score_gemma":0.0007683046,"threshold_uncertainty_score":0.006433964},"labels":[],"label_agreement":null},{"id":"W2098352022","doi":"10.1109/isbmsb.2009.5133817","title":"QoS/QoE techniques for IPTV transmissions","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"IPTV; Computer science; Computer network; Residential gateway; Quality of experience; Quality of service; Key (lock); Internet Protocol; Channel (broadcasting); Telecommunications; The Internet; Service (business); Computer security; World Wide Web","score_opus":0.01924759194975232,"score_gpt":0.2994215514991363,"score_spread":0.28017395954938396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098352022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031108458,0.0017205848,0.9611702,0.0004154827,0.000109004395,0.00007096097,0.000021151347,0.00035469758,0.0050294874],"genre_scores_gemma":[0.74715674,0.0023935304,0.24418212,0.00018323389,0.00023810551,0.00008700759,0.000052594205,0.00012088081,0.0055857743],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940753,0.000111539055,0.000022567216,0.000055966582,0.00034747808,0.00005490922],"domain_scores_gemma":[0.9990138,0.00041557898,0.00010191265,0.000114019254,0.0003212451,0.000033428063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047904,0.00048979855,0.00043515305,0.00056972244,0.0004792173,0.00057467964,0.0006466355,0.00054278114,0.0014526864],"category_scores_gemma":[0.0029072368,0.0002091659,0.00034747264,0.0003916038,0.0005679595,0.000890639,0.00077268435,0.0008987974,0.00033620148],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044088307,0.00023346445,0.0017295931,0.00041414623,0.00006185302,0.0008084248,0.00085399055,0.11513819,0.29564813,0.06643562,0.0032236488,0.51501197],"study_design_scores_gemma":[0.000044831406,0.0002464801,0.0012314935,0.00006562634,0.000052804662,0.0013258535,0.00031971402,0.8871111,0.071538314,0.023652317,0.014335725,0.0000756363],"about_ca_topic_score_codex":0.00077895616,"about_ca_topic_score_gemma":0.0005964223,"teacher_disagreement_score":0.0014526864,"about_ca_system_score_codex":0.0004081425,"about_ca_system_score_gemma":0.00026351277,"threshold_uncertainty_score":0.004859686},"labels":[],"label_agreement":null},{"id":"W2098669738","doi":"10.1109/tcomm.2006.887488","title":"Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Belief propagation; Decoding methods; Bit error rate; Mathematics; Channel (broadcasting); Node (physics); Computer science; Telecommunications; Physics","score_opus":0.05991274641773332,"score_gpt":0.3339470309411472,"score_spread":0.2740342845234139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098669738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6256165,0.0007949732,0.3707384,0.00035744655,0.000027827959,0.000043889424,0.00008541854,0.0006982637,0.0016372971],"genre_scores_gemma":[0.9642044,0.00015155859,0.035216626,0.000034745066,0.0000073270107,0.000023451801,0.00007393211,0.000024660718,0.00026332753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974354,0.0009465035,0.00010244264,0.00020507225,0.0010270035,0.0002835576],"domain_scores_gemma":[0.97810966,0.018061632,0.0009953358,0.00079278153,0.0018005609,0.00024012676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005242143,0.000841841,0.0009105375,0.0008205316,0.0004793765,0.00092199736,0.00069576805,0.0013646758,0.000328793],"category_scores_gemma":[0.03440241,0.00034897617,0.00025007848,0.0007360812,0.0013577447,0.0018520383,0.0013290478,0.0008736132,0.00011581416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008119721,0.00006197494,0.004815758,0.00008245185,0.000075501324,0.00007093857,0.00011260613,0.9545921,0.0058933636,0.0040291944,0.00013975755,0.029314473],"study_design_scores_gemma":[0.000009716555,0.00006918847,0.00042638506,0.0000044488384,0.0000071265063,0.000019704688,0.000009501786,0.99398994,0.0043094154,0.0011200642,0.000024197248,0.000010273176],"about_ca_topic_score_codex":0.004827815,"about_ca_topic_score_gemma":0.0026916668,"teacher_disagreement_score":0.005242143,"about_ca_system_score_codex":0.0013485253,"about_ca_system_score_gemma":0.0011178517,"threshold_uncertainty_score":0.027723432},"labels":[],"label_agreement":null},{"id":"W2098823658","doi":"10.1162/08997660460734056","title":"Linear Response Algorithms for Approximate Inference in Graphical Models","year":2004,"lang":"en","type":"article","venue":"Neural Computation","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Belief propagation; Graphical model; Algorithm; Random graph; Mathematics; Inference; Gaussian; Pairwise comparison; Graph; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.06625622953003661,"score_gpt":0.34801919563422784,"score_spread":0.2817629661041912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098823658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000984033,0.0002546054,0.9978169,0.00015047098,0.000016839602,0.000013900684,0.000028092449,0.00038019632,0.00035486236],"genre_scores_gemma":[0.17092912,0.0016414049,0.8214888,0.00036301836,0.00022885685,0.0006275515,0.00048855564,0.0004285756,0.0038040588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660206,0.0017505985,0.00015364031,0.00048678313,0.0008161025,0.00019089962],"domain_scores_gemma":[0.98676455,0.011054068,0.00049105904,0.00079999026,0.0007837613,0.00010652426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003580236,0.0013744687,0.0014831051,0.0018219461,0.00072201644,0.0015607814,0.0028795688,0.0023859004,0.0040132846],"category_scores_gemma":[0.029840287,0.0009073387,0.00091261714,0.0028637075,0.0021843298,0.0031905973,0.0022049923,0.0034010396,0.0014446643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008491352,0.000043563206,0.00024669484,0.000189884,0.00007534725,0.00005262002,0.00010547068,0.73214984,0.00056030846,0.15514754,0.002760789,0.108583085],"study_design_scores_gemma":[0.000009563473,0.000007582008,0.000024329293,0.000010233011,0.0000051350985,0.000009123903,0.0000054993984,0.92166805,0.00022348469,0.0774274,0.0006023313,0.0000073292413],"about_ca_topic_score_codex":0.00871393,"about_ca_topic_score_gemma":0.005750797,"teacher_disagreement_score":0.00871393,"about_ca_system_score_codex":0.0017955936,"about_ca_system_score_gemma":0.0018646856,"threshold_uncertainty_score":0.01893437},"labels":[],"label_agreement":null},{"id":"W2099114934","doi":"10.1109/tcomm.2007.895978","title":"Convergence Speed and Throughput of Analog Decoders","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convergence (economics); Throughput; Computer science; Electronic engineering; Engineering; Telecommunications; Wireless","score_opus":0.04220366089989956,"score_gpt":0.31848603325049724,"score_spread":0.27628237235059766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099114934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48380566,0.001719904,0.49621847,0.00047297092,0.00007131622,0.00008384981,0.00022841962,0.0010514279,0.016347956],"genre_scores_gemma":[0.9503154,0.0005786405,0.045511607,0.000080698366,0.00004113431,0.0000810595,0.00014886561,0.00012808808,0.0031145865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980438,0.00053249224,0.000082834034,0.00026528488,0.0008421965,0.00023340018],"domain_scores_gemma":[0.98656034,0.010017304,0.00062603666,0.00085992995,0.0017740573,0.00016231922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026792663,0.0005316617,0.0006461266,0.0013199791,0.0005821474,0.0014755116,0.00082215166,0.0007370303,0.0019594007],"category_scores_gemma":[0.025825622,0.00032170265,0.00029609032,0.0009087585,0.0011960828,0.0019672343,0.0009326195,0.0007889016,0.0005125854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081767474,0.00009368257,0.0051594037,0.00024172818,0.000080122234,0.00023415942,0.00030731867,0.7960829,0.037000403,0.09175567,0.0010291603,0.06719773],"study_design_scores_gemma":[0.000036275047,0.00012099029,0.00092076656,0.000044761164,0.000027995864,0.00017897243,0.000048610495,0.94408876,0.037757315,0.015863748,0.0008851814,0.000026738257],"about_ca_topic_score_codex":0.0014507793,"about_ca_topic_score_gemma":0.0010120792,"teacher_disagreement_score":0.0026792663,"about_ca_system_score_codex":0.0018284677,"about_ca_system_score_gemma":0.0013221867,"threshold_uncertainty_score":0.014169514},"labels":[],"label_agreement":null},{"id":"W2100137244","doi":"10.1109/cwit.2011.5872144","title":"Streaming codes for a double-link burst erasure channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication source; Computer science; Erasure; Erasure code; Network packet; Computer network; Channel (broadcasting); Binary erasure channel; Online codes; Fountain code; Link (geometry); Code (set theory); Upper and lower bounds; Raptor code; Decoding methods; Channel capacity; Algorithm; Linear code; Block code; Mathematics","score_opus":0.07374493322767492,"score_gpt":0.2844889436659752,"score_spread":0.2107440104383003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100137244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19675016,0.0010802494,0.78566647,0.0008160818,0.00014066092,0.00008096635,0.00029674132,0.0005292267,0.014639531],"genre_scores_gemma":[0.8723264,0.00089582213,0.119219095,0.00015005238,0.00012539116,0.0001341635,0.00020323685,0.00006236838,0.006883474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.00005344238,0.000013842869,0.000038316455,0.0001164878,0.00006781299],"domain_scores_gemma":[0.9981212,0.00095960125,0.00019076225,0.00029447686,0.0003432702,0.000090713875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048387947,0.00042417258,0.00026555595,0.00051835633,0.00041548169,0.0006690157,0.00037917792,0.0005690774,0.002785753],"category_scores_gemma":[0.0031179874,0.00017701178,0.00024695677,0.0005813878,0.00075536995,0.0010005307,0.0008825794,0.00096732366,0.0004099821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033412216,0.0000477248,0.00078958063,0.00017460837,0.00001885364,0.00035272466,0.00024899174,0.2165755,0.033385552,0.68640804,0.0039044213,0.05775982],"study_design_scores_gemma":[0.00003900744,0.00008224457,0.0003425707,0.00006688235,0.0000129953205,0.00029635945,0.000050065195,0.79826474,0.013185883,0.18046327,0.007156454,0.00003946021],"about_ca_topic_score_codex":0.0011822511,"about_ca_topic_score_gemma":0.0010894383,"teacher_disagreement_score":0.002785753,"about_ca_system_score_codex":0.00059315417,"about_ca_system_score_gemma":0.0006985129,"threshold_uncertainty_score":0.009319246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009182243179655785,"score_gpt":0.24043260148729442,"score_spread":0.23125035830763863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100525102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055534262,0.0032211125,0.90942657,0.00031815137,0.0003232719,0.00013162325,0.00062562077,0.0008545642,0.029564794],"genre_scores_gemma":[0.65145993,0.0033481151,0.29330492,0.0006361949,0.00030790234,0.00046766954,0.0016443876,0.00034360032,0.048487213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.000116468225,0.000039733408,0.00014037767,0.00036655643,0.00013012612],"domain_scores_gemma":[0.9986191,0.00031072387,0.0001559848,0.00033098063,0.00048568528,0.000097563105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037843996,0.0005161968,0.0006591791,0.00091063464,0.0004738297,0.0012778778,0.0008408353,0.00065584696,0.0040692757],"category_scores_gemma":[0.002336106,0.000231472,0.0002549741,0.00094633957,0.00091368996,0.0015865738,0.00112106,0.0013635565,0.0018059363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036678696,0.00005096037,0.0010639225,0.00022807729,0.000035073685,0.00044507557,0.0002479262,0.04366266,0.0507011,0.71823245,0.006210735,0.17875528],"study_design_scores_gemma":[0.00012063025,0.00032038533,0.0010548157,0.00017542863,0.000043135275,0.0015349579,0.00006995894,0.45038214,0.055595517,0.38377494,0.10677999,0.00014814586],"about_ca_topic_score_codex":0.001084993,"about_ca_topic_score_gemma":0.0013613072,"teacher_disagreement_score":0.0040692757,"about_ca_system_score_codex":0.00065739953,"about_ca_system_score_gemma":0.0012536736,"threshold_uncertainty_score":0.013613045},"labels":[],"label_agreement":null},{"id":"W2100808169","doi":"10.1109/pimrc.2009.5449868","title":"Low-complexity iterative detection and decoding in finite geometry LDPC-coded MIMO systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Decoding methods; MIMO; Algorithm; Belief propagation; Detector; Computer science; Factor graph; Sequential decoding; List decoding; Computational complexity theory; Bit error rate; Joint (building); Channel (broadcasting); Theoretical computer science; Mathematics; Block code; Concatenated error correction code; Telecommunications; Engineering","score_opus":0.030408108251991747,"score_gpt":0.27647716709293896,"score_spread":0.2460690588409472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100808169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015823323,0.00017536881,0.9820129,0.00009671311,0.000015340547,0.00002562481,0.000023459253,0.00040821667,0.0014190794],"genre_scores_gemma":[0.4586747,0.0002872458,0.53774405,0.00011617983,0.00003213356,0.000090528156,0.000087091554,0.000050493538,0.0029175186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863905,0.00040913664,0.0000542701,0.00013800537,0.0006480962,0.000111367124],"domain_scores_gemma":[0.99787116,0.0013227582,0.00021253247,0.00022697807,0.00031894952,0.00004757696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009384159,0.00064087805,0.0006319399,0.00049837196,0.00043417333,0.00078551844,0.0009510113,0.0010211427,0.0007591459],"category_scores_gemma":[0.0043354807,0.00036349148,0.00031019413,0.000608661,0.0008198911,0.0009310977,0.00082996837,0.00096383796,0.0005407288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031467734,0.00007831287,0.0012712472,0.00018141489,0.0000818973,0.00041710958,0.00031482906,0.70115054,0.038213324,0.054839086,0.0012927647,0.20184484],"study_design_scores_gemma":[0.00002021641,0.000046905418,0.00015761434,0.000011174277,0.0000108289505,0.00013584731,0.000010565275,0.97553855,0.01630855,0.0069183223,0.00082489004,0.00001646111],"about_ca_topic_score_codex":0.0025303336,"about_ca_topic_score_gemma":0.0028737562,"teacher_disagreement_score":0.0025303336,"about_ca_system_score_codex":0.0008441424,"about_ca_system_score_gemma":0.001272747,"threshold_uncertainty_score":0.0061246753},"labels":[],"label_agreement":null},{"id":"W2101377473","doi":"10.1109/tip.2010.2049529","title":"Joint Decoding of Unequally Protected JPEG2000 Bitstreams and Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decoding methods; Computer science; Joint (building); List decoding; Sequential decoding; JPEG 2000; Context (archaeology); Error detection and correction; Process (computing); Soft-decision decoder; Set (abstract data type); Real-time computing; Algorithm; Computer vision; Image processing; Image (mathematics); Concatenated error correction code; Image compression; Block code; Engineering","score_opus":0.017169380655402116,"score_gpt":0.26534954425761537,"score_spread":0.24818016360221326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101377473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14297785,0.0010318,0.8501433,0.00016683183,0.000120513345,0.000065264096,0.000058422964,0.000978151,0.0044578845],"genre_scores_gemma":[0.6675836,0.00052558654,0.31985837,0.00008595706,0.00006023124,0.000045168497,0.00019501917,0.00020298117,0.01144302],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992755,0.0001263224,0.000044602046,0.00008653303,0.0003830634,0.00008394311],"domain_scores_gemma":[0.9990734,0.00030953312,0.000101045094,0.00025453293,0.00021909471,0.000042438223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357821,0.0005914177,0.00052917574,0.0004017768,0.00020519091,0.0006930266,0.00056703,0.0006327725,0.0012804393],"category_scores_gemma":[0.0024776761,0.00023131825,0.00040631893,0.00031438042,0.0004627919,0.00096100953,0.0010282461,0.0006650758,0.00065348233],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008913919,0.00012336562,0.0019772253,0.0003203232,0.00011042942,0.0009841622,0.00040552695,0.10597392,0.46221197,0.035058185,0.0013793006,0.39056426],"study_design_scores_gemma":[0.000037355,0.00037119,0.0010424549,0.000037143986,0.000047072674,0.00088463177,0.000048544876,0.4316175,0.55250305,0.006326795,0.007036178,0.000048126232],"about_ca_topic_score_codex":0.0005770161,"about_ca_topic_score_gemma":0.000978633,"teacher_disagreement_score":0.0012804393,"about_ca_system_score_codex":0.00026102003,"about_ca_system_score_gemma":0.0004791933,"threshold_uncertainty_score":0.004283428},"labels":[],"label_agreement":null},{"id":"W2101838504","doi":"10.1145/764808.764814","title":"Iterative decoding in analog CMOS","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CMOS; Computer science; Low-density parity-check code; Decoding methods; Turbo code; Electronic engineering; Electronic circuit; Coding (social sciences); Analogue electronics; Hamming distance; Algorithm; Electrical engineering; Engineering; Mathematics","score_opus":0.01920809034637836,"score_gpt":0.2750883874898317,"score_spread":0.25588029714345334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101838504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021127695,0.0011123552,0.9494,0.00023912152,0.00017077712,0.00006968343,0.000069892216,0.000978587,0.026831856],"genre_scores_gemma":[0.5276066,0.0014272437,0.45691255,0.0003664385,0.000107772954,0.00009957545,0.000109297274,0.00006442411,0.0133061465],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999688,0.00004641564,0.000019757636,0.00004251567,0.00017682,0.000026429287],"domain_scores_gemma":[0.99974316,0.00008382308,0.000021853924,0.000035875637,0.0001063608,0.000008962368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022294525,0.0002844206,0.00018091593,0.00027186106,0.00024949238,0.00071726175,0.0005420927,0.0005222731,0.002389127],"category_scores_gemma":[0.00096961384,0.00013456198,0.00020980186,0.0003056868,0.00028664139,0.0007191827,0.00034042544,0.00036164987,0.00087215775],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024418507,0.000073681236,0.0010296805,0.00044392943,0.00006163623,0.0005293763,0.00036088904,0.11916414,0.2317221,0.24704976,0.003191003,0.39612955],"study_design_scores_gemma":[0.0000796973,0.0004545936,0.00059557555,0.00014157605,0.000073706135,0.0013042652,0.00007919166,0.67402565,0.20499377,0.056389898,0.06179606,0.00006604084],"about_ca_topic_score_codex":0.0009844769,"about_ca_topic_score_gemma":0.0013559465,"teacher_disagreement_score":0.002389127,"about_ca_system_score_codex":0.00048692888,"about_ca_system_score_gemma":0.00047288617,"threshold_uncertainty_score":0.007992446},"labels":[],"label_agreement":null},{"id":"W2102245115","doi":"10.1109/tcsi.2006.880313","title":"Termination Sequence Generation Circuits for Low-Density Parity-Check Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Semiconductor Research Corporation","keywords":"Convolutional code; Computer science; Encoder; Electronic circuit; Shift register; Algorithm; Sequence (biology); Low-density parity-check code; Logic gate; Decoding methods; Complement (music); Theoretical computer science; Telecommunications; Electrical engineering; Engineering","score_opus":0.035250923481235374,"score_gpt":0.2770360279038416,"score_spread":0.2417851044226062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102245115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11127474,0.0002021879,0.8776394,0.00013849245,0.000039688817,0.00015635468,0.00008602292,0.0006971809,0.009765997],"genre_scores_gemma":[0.73528737,0.00020809755,0.25864482,0.00008897519,0.000036349888,0.0002587187,0.0002483176,0.000108920525,0.00511846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996592,0.00008427483,0.000018605308,0.000039431525,0.00015592377,0.000042707186],"domain_scores_gemma":[0.99927,0.0004417527,0.00008442781,0.00007323975,0.00010834679,0.00002215957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043097325,0.00029156095,0.00023769011,0.0003998238,0.0003863213,0.00048529851,0.00047393265,0.0005382059,0.0019347933],"category_scores_gemma":[0.001508858,0.00012334234,0.00022852105,0.0003091599,0.00048502657,0.00050233357,0.0003912055,0.00071436324,0.00041933818],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003791857,0.00021211947,0.0014580281,0.00027044988,0.00002497047,0.0003797104,0.0003533324,0.11923005,0.19458683,0.4824421,0.0025113283,0.19815195],"study_design_scores_gemma":[0.00014222182,0.00035262865,0.0005171308,0.000050406936,0.000031184714,0.0003506284,0.00003392,0.7003212,0.18336715,0.10644598,0.008344114,0.000043411786],"about_ca_topic_score_codex":0.00030396404,"about_ca_topic_score_gemma":0.00048787688,"teacher_disagreement_score":0.0019347933,"about_ca_system_score_codex":0.0007321576,"about_ca_system_score_gemma":0.00040872558,"threshold_uncertainty_score":0.006472528},"labels":[],"label_agreement":null},{"id":"W2102876996","doi":"10.1109/ccece.2005.1556908","title":"Iterative ordered-statistic decoding for LDPC coded modulation systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Demodulation; Decoding methods; Low-density parity-check code; Algorithm; Computer science; Statistic; Concatenated error correction code; Soft-decision decoder; Block code; Mathematics; Theoretical computer science; Telecommunications; Statistics; Channel (broadcasting)","score_opus":0.020916602010657894,"score_gpt":0.2790849750564407,"score_spread":0.25816837304578283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102876996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024391878,0.00033037437,0.97246134,0.00010054569,0.000023377092,0.00003443598,0.000035190627,0.0003392925,0.002283517],"genre_scores_gemma":[0.60138005,0.0005192163,0.39492056,0.00013241587,0.000055523793,0.00009632192,0.00019372687,0.00006942288,0.0026327688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990134,0.00029233878,0.0000560857,0.0000829865,0.00049598113,0.0000591406],"domain_scores_gemma":[0.9987658,0.00051582535,0.00017355704,0.00022109062,0.00029082608,0.000032784992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059718505,0.00051335304,0.0004839985,0.00049964193,0.00047194143,0.00065682025,0.0005812933,0.0005800126,0.0007883774],"category_scores_gemma":[0.0028441441,0.00021973831,0.000255932,0.0006203312,0.00072903145,0.00074278563,0.0006439685,0.000595474,0.00044255648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039185653,0.000080620484,0.002204566,0.00032684355,0.00011201408,0.00058175053,0.0005019826,0.4080882,0.091818005,0.20090117,0.0021030672,0.29288998],"study_design_scores_gemma":[0.000027840955,0.00012291377,0.00029699822,0.00002388865,0.000022609705,0.0002875283,0.000019233514,0.9389849,0.029200897,0.027464096,0.003518818,0.000030333511],"about_ca_topic_score_codex":0.00088942633,"about_ca_topic_score_gemma":0.0011384051,"teacher_disagreement_score":0.00088942633,"about_ca_system_score_codex":0.0006364981,"about_ca_system_score_gemma":0.0011469213,"threshold_uncertainty_score":0.004618168},"labels":[],"label_agreement":null},{"id":"W2102981938","doi":"10.1109/lcomm.2002.803481","title":"Bootstrap decoding of low-density parity-check codes","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Erasure; Computer science; Algorithm; Parity bit; List decoding; Sequential decoding; Mathematics; Arithmetic; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.08314543522971805,"score_gpt":0.30421547431048007,"score_spread":0.221070039080762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102981938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372941,0.0005299303,0.8554906,0.00026100155,0.000091579976,0.00006454231,0.00018314362,0.0012001401,0.008449603],"genre_scores_gemma":[0.75814605,0.00044853997,0.23692006,0.00013025913,0.00007375442,0.00013255997,0.0005202815,0.0001169706,0.0035115923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922276,0.00030690344,0.000028222774,0.000056435885,0.00030589072,0.00007979134],"domain_scores_gemma":[0.99793446,0.0010212329,0.0001260265,0.00036925648,0.0004941469,0.00005494596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079849135,0.00042454796,0.0005500899,0.00051856984,0.0004790535,0.0006529067,0.0006256796,0.0007080906,0.0011678032],"category_scores_gemma":[0.005326253,0.00022122267,0.00029192923,0.00045715465,0.00059948955,0.0006591612,0.00086682924,0.00079865,0.0010392957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008323335,0.00013978539,0.0030931933,0.0003299941,0.000074544,0.00080948084,0.00035966773,0.32670793,0.12705486,0.22278045,0.006439803,0.31137806],"study_design_scores_gemma":[0.00003147447,0.000097896045,0.00039009211,0.000026050659,0.000012372948,0.00016622277,0.000017977003,0.89389485,0.055029087,0.04718527,0.0031217,0.000027014541],"about_ca_topic_score_codex":0.0005423749,"about_ca_topic_score_gemma":0.0007303892,"teacher_disagreement_score":0.0011678032,"about_ca_system_score_codex":0.0003946023,"about_ca_system_score_gemma":0.0005484016,"threshold_uncertainty_score":0.00422287},"labels":[],"label_agreement":null},{"id":"W2103061764","doi":"10.1109/pacrim.2007.4313293","title":"Improved Iterative Bit Flipping Decoding Algorithms for LDPC Convolutional Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Convolutional code; Computer science; Coding gain; Sequential decoding; Serial concatenated convolutional codes; Bit error rate; Berlekamp–Welch algorithm; Concatenated error correction code; Coding (social sciences); Error detection and correction; List decoding; Parity bit; Error floor; Mathematics; Block code","score_opus":0.03855092747249914,"score_gpt":0.3239399459391314,"score_spread":0.2853890184666322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103061764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007915593,0.00039425696,0.9893828,0.00005610879,0.000036179328,0.000041571995,0.00006452751,0.00056829315,0.0015407435],"genre_scores_gemma":[0.09628815,0.0008762675,0.8985135,0.00009247764,0.00006378867,0.00015916135,0.00039040603,0.00013156439,0.0034846736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.00013715596,0.000044495762,0.00006498491,0.0003774974,0.000053447944],"domain_scores_gemma":[0.99885726,0.0003677424,0.0000932989,0.00020580043,0.00044663154,0.00002924527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069391687,0.0008720301,0.0006444219,0.0010149543,0.00034394243,0.00063139753,0.0011569865,0.0009670666,0.0014171617],"category_scores_gemma":[0.0027650597,0.00030171315,0.00048654078,0.0012543047,0.0004513657,0.0011016012,0.000585874,0.0013486795,0.00089002954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022185195,0.00007978973,0.0009292897,0.0002305822,0.00007552208,0.00014596575,0.00016540654,0.2546546,0.068343006,0.054819513,0.004309597,0.6160249],"study_design_scores_gemma":[0.000039402126,0.000078409896,0.00042161814,0.000027136317,0.000023030603,0.00027170152,0.000006968558,0.93562347,0.041193746,0.012981714,0.009284547,0.000048407837],"about_ca_topic_score_codex":0.0018811469,"about_ca_topic_score_gemma":0.0021328998,"teacher_disagreement_score":0.0018811469,"about_ca_system_score_codex":0.00058292336,"about_ca_system_score_gemma":0.0008413683,"threshold_uncertainty_score":0.004740894},"labels":[],"label_agreement":null},{"id":"W2103237477","doi":"10.1109/icc.2006.255225","title":"Wireless Image Transmission Using Rate-Compatible LDPC Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Low-density parity-check code; Computer science; Algorithm; Fading; Channel (broadcasting); Forward error correction; Signal-to-noise ratio (imaging); Transmitter; Transmission (telecommunications); Decoding methods; Image compression; Telecommunications; Image (mathematics); Image processing; Artificial intelligence","score_opus":0.10195383576930901,"score_gpt":0.365148018683611,"score_spread":0.263194182914302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103237477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07450168,0.0010516742,0.9184495,0.00028537793,0.00011824386,0.00011026732,0.0001162366,0.00073506957,0.0046318807],"genre_scores_gemma":[0.75453836,0.0011166894,0.23879816,0.00018485826,0.00012729876,0.00014165926,0.0001789894,0.00005858466,0.004855473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996408,0.00007975813,0.000018025004,0.000051137733,0.00017368639,0.00003657906],"domain_scores_gemma":[0.9992694,0.0002740677,0.00011187005,0.00014925704,0.00016842732,0.000026934804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038135608,0.00049073645,0.0003567296,0.0005554008,0.0003637832,0.0004477544,0.00054548244,0.0004907201,0.0010238815],"category_scores_gemma":[0.0016877605,0.00018728065,0.00021585883,0.0005568248,0.00046442685,0.00079835893,0.0006719922,0.00056165433,0.00036056648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063848536,0.0001540967,0.0017324412,0.0006415218,0.00013579788,0.0011142999,0.0004032055,0.17117165,0.3556057,0.09301298,0.003746678,0.37164313],"study_design_scores_gemma":[0.000100953104,0.00041080028,0.00070604554,0.0000744393,0.00008479283,0.0010999626,0.0000551056,0.7999794,0.16592382,0.015461426,0.016014416,0.000088819594],"about_ca_topic_score_codex":0.0007071671,"about_ca_topic_score_gemma":0.0007152706,"teacher_disagreement_score":0.0010238815,"about_ca_system_score_codex":0.00034739234,"about_ca_system_score_gemma":0.00034066814,"threshold_uncertainty_score":0.0034252405},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018742915787540726,"score_gpt":0.26302770636179845,"score_spread":0.24428479057425773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103374230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020566218,0.00021270815,0.9760666,0.00011534308,0.00002006772,0.000011206029,0.000053878113,0.00016859607,0.0027853781],"genre_scores_gemma":[0.8294364,0.0012449716,0.16243367,0.00020105875,0.00009842005,0.00008929138,0.0002040056,0.0001438099,0.0061484533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995197,0.00013429894,0.000015603431,0.000056470537,0.00020984231,0.000064061365],"domain_scores_gemma":[0.99861014,0.0007577455,0.00012517064,0.000149353,0.00032391518,0.000033740373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974248,0.000460157,0.00049449387,0.0006636518,0.0002892138,0.0005793726,0.0005775853,0.00068148825,0.00101588],"category_scores_gemma":[0.0042750044,0.00024123324,0.0005589075,0.0008086983,0.0010304403,0.001128618,0.0005846714,0.00069781125,0.0005105535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056231424,0.000014132365,0.0009117822,0.000039743492,0.000029888215,0.00015636712,0.000087755085,0.78413975,0.004528395,0.19295125,0.0008062957,0.016278375],"study_design_scores_gemma":[0.0000018580133,0.00001019614,0.00011163715,0.0000029315772,0.0000032975104,0.000030212954,0.0000051926813,0.97680366,0.0010230269,0.021673083,0.00032991508,0.0000051054335],"about_ca_topic_score_codex":0.004154304,"about_ca_topic_score_gemma":0.002766284,"teacher_disagreement_score":0.004154304,"about_ca_system_score_codex":0.00088370155,"about_ca_system_score_gemma":0.0013293688,"threshold_uncertainty_score":0.00826025},"labels":[],"label_agreement":null},{"id":"W2103435488","doi":"10.1109/tcomm.2009.0901.060118","title":"Design of irregular LDPC codes for BIAWGN channels with SNR mismatch","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Noisy-channel coding theorem; Decoding methods; Turbo code; Signal-to-noise ratio (imaging); Channel (broadcasting); Concatenated error correction code; Computer science; Belief propagation; Binary number; Mathematics; Error floor; Block code; Telecommunications; Arithmetic","score_opus":0.05956928053002612,"score_gpt":0.302457746603452,"score_spread":0.24288846607342585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103435488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115471855,0.0002217708,0.88164306,0.00014654157,0.000025224295,0.000052537165,0.000063026804,0.00022903981,0.0021469083],"genre_scores_gemma":[0.8331893,0.00021243424,0.1654054,0.00006263181,0.000016841923,0.000098001365,0.00009010074,0.000045962464,0.00087933685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994199,0.00021043618,0.00004346354,0.00008623313,0.00018096065,0.000058911297],"domain_scores_gemma":[0.99801314,0.00082125585,0.000410387,0.00023731135,0.00043018974,0.000087695495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843856,0.00050889427,0.00043028974,0.0005972998,0.00030263158,0.0006356733,0.00043755939,0.00052871066,0.00038499208],"category_scores_gemma":[0.0037544523,0.000210871,0.00022076354,0.0005044602,0.00072146655,0.0005933427,0.0006580806,0.0004978103,0.00014945869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041445397,0.000059035166,0.0022938168,0.00014875675,0.000041449806,0.00020162386,0.00021756373,0.82494146,0.042388275,0.062268596,0.00059098884,0.06643399],"study_design_scores_gemma":[0.000019981957,0.00008789479,0.0001864502,0.0000127221565,0.000008368175,0.00007916716,0.000013716069,0.9769951,0.013691388,0.008080366,0.0008123116,0.000012603255],"about_ca_topic_score_codex":0.00062903756,"about_ca_topic_score_gemma":0.0006178943,"teacher_disagreement_score":0.000843856,"about_ca_system_score_codex":0.0006511475,"about_ca_system_score_gemma":0.00081798463,"threshold_uncertainty_score":0.004724443},"labels":[],"label_agreement":null},{"id":"W2103642899","doi":"10.1109/tcomm.2005.857160","title":"DC-Free Error-Control Block Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Concatenated error correction code; Linear code; Turbo code; Computer science; BCH code; Serial concatenated convolutional codes; List decoding; Algorithm; Low-density parity-check code; Tornado code; Forward error correction; Decoding methods; Theoretical computer science","score_opus":0.033329838642760554,"score_gpt":0.29479614562807477,"score_spread":0.2614663069853142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103642899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044419914,0.0022900742,0.9283493,0.00043108207,0.00027477418,0.00015837645,0.00040027936,0.0011239526,0.022552196],"genre_scores_gemma":[0.62205106,0.0017620819,0.34715044,0.00059949583,0.00022148679,0.00032749955,0.00079208694,0.000133147,0.02696265],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.000106039755,0.000044363373,0.000086525164,0.000386469,0.000081381695],"domain_scores_gemma":[0.9981567,0.00044184332,0.0001936522,0.00038926105,0.000752749,0.000065803586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000450036,0.00041942336,0.00038455924,0.0005713195,0.00042285398,0.0006293062,0.00068712624,0.00058665464,0.002848292],"category_scores_gemma":[0.0024192159,0.00014594285,0.00017010047,0.000654768,0.00044994464,0.000779661,0.0006480082,0.000777456,0.0012733404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008010947,0.000098266806,0.0017469147,0.00041706936,0.000056936453,0.0004217362,0.00022068596,0.071503624,0.110633865,0.32983434,0.008324416,0.47594112],"study_design_scores_gemma":[0.0001583378,0.0003602726,0.0012791278,0.00016886507,0.000069618065,0.0014144941,0.00004557364,0.56957555,0.2304883,0.06392737,0.13241297,0.00009951303],"about_ca_topic_score_codex":0.0014336441,"about_ca_topic_score_gemma":0.0024978337,"teacher_disagreement_score":0.002848292,"about_ca_system_score_codex":0.00051271025,"about_ca_system_score_gemma":0.0008699454,"threshold_uncertainty_score":0.009528518},"labels":[],"label_agreement":null},{"id":"W2103645772","doi":"10.1364/ofc.2009.owe1","title":"Operating Points for Low-Density Parity-Check Codes in On-off Keyed Fiber-Optic Transmission Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Raptor code; Forward error correction; Transmission (telecommunications); Algorithm; Turbo code; Bit error rate; Error floor; Electronic engineering; Telecommunications; Engineering","score_opus":0.019682359145790314,"score_gpt":0.28009834414291823,"score_spread":0.2604159849971279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103645772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96971726,0.00031937967,0.02196713,0.00018184641,0.000014247835,0.0000189264,0.000052314856,0.000089290144,0.0076396493],"genre_scores_gemma":[0.9981482,0.000086576154,0.001280686,0.000008317657,0.0000054390302,0.0000072734733,0.000010421542,0.0000097627035,0.0004432528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976593,0.00007827922,0.000008371654,0.000019983,0.00007083514,0.000056665136],"domain_scores_gemma":[0.9987692,0.0008149488,0.00017571085,0.000062634426,0.00012689419,0.000050474107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063033897,0.00032229637,0.00034996468,0.00055672263,0.00037771586,0.0010499521,0.00031735114,0.00060071156,0.0012263801],"category_scores_gemma":[0.0026946806,0.00018496966,0.0001965142,0.00030888827,0.00082012865,0.00062993146,0.0005107552,0.0003956787,0.00018954727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011968636,0.0001339854,0.006572635,0.00017328224,0.000057397036,0.00077980245,0.0006302146,0.81074613,0.075263195,0.08386329,0.0007929539,0.019790202],"study_design_scores_gemma":[0.000047437286,0.0001413028,0.0017268448,0.00003969041,0.000023036579,0.00011216349,0.00009913849,0.964865,0.010530226,0.021995477,0.0003841525,0.000035520618],"about_ca_topic_score_codex":0.0013090719,"about_ca_topic_score_gemma":0.0011953635,"teacher_disagreement_score":0.0013090719,"about_ca_system_score_codex":0.00072898174,"about_ca_system_score_gemma":0.00030783843,"threshold_uncertainty_score":0.0052891374},"labels":[],"label_agreement":null},{"id":"W2104155297","doi":"10.1109/ico-ip.2011.5953744","title":"Decoding of long-block soft decision LDPC codes for optical communication systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Coding gain; Forward error correction; Block code; Error floor; Coding (social sciences); Block (permutation group theory); Concatenated error correction code; Turbo code; Communications system; Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.062355166677275434,"score_gpt":0.3078829083929358,"score_spread":0.24552774171566039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104155297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62705815,0.000571283,0.36749294,0.00045562335,0.000037857266,0.000049831673,0.00010251373,0.0003594878,0.0038724362],"genre_scores_gemma":[0.9400666,0.00026235142,0.057000462,0.00007685568,0.000020468957,0.000040671217,0.0000839039,0.000030991407,0.0024176715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.00010542091,0.000013404798,0.000018743309,0.00018681465,0.000039426403],"domain_scores_gemma":[0.9980622,0.0013724715,0.00018611041,0.00011116213,0.00021526172,0.00005284969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051381,0.00033231016,0.0002469563,0.00020263153,0.00022031208,0.0005147485,0.00025633347,0.0005860304,0.001021729],"category_scores_gemma":[0.0029602817,0.00015719386,0.00010271696,0.00023630608,0.0004048254,0.00062790996,0.00042916203,0.00041328813,0.00023308185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009336829,0.00018048592,0.0034628352,0.00038088407,0.00005568805,0.00041595753,0.00026910842,0.494275,0.36886856,0.03621272,0.00097296305,0.09397211],"study_design_scores_gemma":[0.00003424182,0.00014607675,0.00055004645,0.000019440547,0.000010297803,0.000068690235,0.00001964037,0.8877589,0.1049887,0.0058362675,0.00055142597,0.000016373502],"about_ca_topic_score_codex":0.00081139564,"about_ca_topic_score_gemma":0.0018632148,"teacher_disagreement_score":0.001021729,"about_ca_system_score_codex":0.00051636406,"about_ca_system_score_gemma":0.00068593863,"threshold_uncertainty_score":0.0037465692},"labels":[],"label_agreement":null},{"id":"W2104758809","doi":"10.1109/tcomm.2005.851582","title":"Sample Rejection for Efficient Simulation of Binary Coding Schemes Over Quantized Additive White Gaussian Noise Channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Algorithm; Additive white Gaussian noise; Binary number; Computer science; Hypersphere; Curse of dimensionality; Gaussian noise; Mathematics; White noise; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.05092323093219039,"score_gpt":0.3348693885056417,"score_spread":0.2839461575734513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104758809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18875451,0.00015020724,0.80709374,0.00025731136,0.000028261757,0.00009576296,0.000061657454,0.00050366874,0.0030548105],"genre_scores_gemma":[0.92730534,0.00008912943,0.071964525,0.000052635085,0.000007835588,0.00011593448,0.000046603644,0.00004939297,0.00036851456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00045556697,0.000028871797,0.000029616232,0.0002323706,0.00006665331],"domain_scores_gemma":[0.99525094,0.0037272053,0.0003034595,0.00035495273,0.0002917657,0.000071669085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018573711,0.00035705726,0.00045384152,0.00032455093,0.0002921748,0.0004935904,0.000609933,0.00051557325,0.0012718999],"category_scores_gemma":[0.009479052,0.00020948824,0.0003067565,0.0002840493,0.0007340603,0.00085020263,0.0006390373,0.000770686,0.00018969353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309881,0.000025076475,0.00055105623,0.0000279632,0.000007497473,0.00003130592,0.000056567544,0.9761989,0.0023207858,0.016569931,0.00009144304,0.0039884993],"study_design_scores_gemma":[0.0000047827452,0.0000117201125,0.000020829973,0.0000017099377,5.2450764e-7,0.0000030938559,0.0000024470703,0.9979461,0.0007021135,0.0012521123,0.000052977615,0.0000015731575],"about_ca_topic_score_codex":0.0018762418,"about_ca_topic_score_gemma":0.0010859387,"teacher_disagreement_score":0.0018762418,"about_ca_system_score_codex":0.0006302008,"about_ca_system_score_gemma":0.0005075171,"threshold_uncertainty_score":0.009822845},"labels":[],"label_agreement":null},{"id":"W2105050988","doi":"10.1109/ismvl.2012.35","title":"Asynchronous Stochastic Decoding of Low-Density Parity-Check Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Decoding methods; Decodes; Low-density parity-check code; Algorithm; Computation; Scheduling (production processes); Parallel computing; Theoretical computer science; Mathematics; Computer network; Mathematical optimization","score_opus":0.020416355353310246,"score_gpt":0.2716427372605129,"score_spread":0.25122638190720264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105050988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755358,0.0000964556,0.9493495,0.00006210341,0.00003360096,0.00002591417,0.00003255878,0.0004435003,0.002402704],"genre_scores_gemma":[0.7900351,0.0001857947,0.207135,0.000064372514,0.000044130786,0.000050609517,0.00010018019,0.0000722448,0.0023124719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956924,0.000105432046,0.000023087441,0.00006071395,0.00020698085,0.000034489865],"domain_scores_gemma":[0.99933124,0.00027305304,0.00009701046,0.00012991812,0.00014048116,0.000028350098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037673413,0.00027510515,0.00025597765,0.00029126785,0.00036321956,0.00045865576,0.0005249475,0.0002647245,0.00070391974],"category_scores_gemma":[0.0015629067,0.00013622924,0.00017344455,0.00027554407,0.0003044655,0.0004897425,0.00036849652,0.00036276606,0.0002749866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039660826,0.00013523451,0.002365216,0.00019876251,0.000041127267,0.0002649165,0.00018814015,0.42590544,0.17142023,0.19447112,0.0019157033,0.20269752],"study_design_scores_gemma":[0.000013709921,0.000051924242,0.00014898118,0.0000058605383,0.000006554403,0.000069738235,0.000005064961,0.96323526,0.02757693,0.0072455457,0.001632316,0.00000820212],"about_ca_topic_score_codex":0.0007454221,"about_ca_topic_score_gemma":0.0014827127,"teacher_disagreement_score":0.0007454221,"about_ca_system_score_codex":0.00047183462,"about_ca_system_score_gemma":0.0007288303,"threshold_uncertainty_score":0.0034233928},"labels":[],"label_agreement":null},{"id":"W2105546360","doi":"10.1109/tit.2005.853318","title":"An analysis of the orthogonality structures of convolutional codes for iterative decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Sequential decoding; Algorithm; Orthogonality; List decoding; Computer science; Belief propagation; Mathematics; Berlekamp–Welch algorithm; Concatenated error correction code; Block code","score_opus":0.013512906685516492,"score_gpt":0.28592022626285846,"score_spread":0.272407319577342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105546360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912944,0.0001903292,0.93364966,0.00017028782,0.00001829281,0.000054630116,0.00006405427,0.00011014916,0.006613013],"genre_scores_gemma":[0.6771205,0.00069238234,0.31778958,0.00014552935,0.00007086949,0.000262509,0.00024789077,0.0001512028,0.0035195076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913824,0.00017427189,0.000044640856,0.00006289009,0.00048970984,0.00009010909],"domain_scores_gemma":[0.9949739,0.0029386443,0.00042543883,0.00047972094,0.001079434,0.000102848695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301257,0.0005183645,0.0003238975,0.0010327863,0.0005685837,0.0009099733,0.000620268,0.0005828408,0.0014197606],"category_scores_gemma":[0.010424619,0.00039062134,0.00038902412,0.0010927785,0.001207215,0.0016277954,0.0008084371,0.00090895896,0.00032321637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007168308,0.000046051064,0.0010139295,0.0000822201,0.000014508004,0.00011123828,0.00017594788,0.1504728,0.011649275,0.7855651,0.00072553457,0.05007168],"study_design_scores_gemma":[0.000009160068,0.000060679293,0.00033350612,0.000030182006,0.000011600457,0.0001343806,0.00002571863,0.75676095,0.007749596,0.2333363,0.0015300413,0.00001789581],"about_ca_topic_score_codex":0.0012171356,"about_ca_topic_score_gemma":0.0017549845,"teacher_disagreement_score":0.0014197606,"about_ca_system_score_codex":0.0010756719,"about_ca_system_score_gemma":0.0016807609,"threshold_uncertainty_score":0.0078045726},"labels":[],"label_agreement":null},{"id":"W2105937669","doi":"10.1109/isit.2009.5205588","title":"Disjoint LDPC coding for Gaussian broadcast channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Low-density parity-check code; Coding (social sciences); Joint (building); Disjoint sets; Dirty paper coding; Gaussian","score_opus":0.029211315599108917,"score_gpt":0.29223484687554363,"score_spread":0.26302353127643474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105937669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029221924,0.0008552359,0.96059114,0.00031236498,0.00003861191,0.000055331224,0.00023885007,0.00035897963,0.00832762],"genre_scores_gemma":[0.6397011,0.0016036932,0.35119715,0.00020583227,0.00008247897,0.00037929037,0.0006165427,0.000073209725,0.0061406353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993455,0.000209916,0.000022791177,0.00007122301,0.00029091636,0.000059689683],"domain_scores_gemma":[0.9989183,0.0005475241,0.00011160178,0.00019808611,0.0001928876,0.00003159949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047728437,0.00043349885,0.000360322,0.0005974168,0.00057550374,0.000580009,0.00054505735,0.00060125714,0.0013339733],"category_scores_gemma":[0.00305642,0.00023069493,0.00021383862,0.00076980883,0.0007215947,0.00048271028,0.0009006693,0.0006856377,0.00044415123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028391258,0.000080064834,0.00057512266,0.00031985933,0.00003111085,0.00040540675,0.00032497078,0.33536583,0.03163157,0.43289235,0.004937297,0.19315244],"study_design_scores_gemma":[0.000071779235,0.00006403153,0.00028171093,0.000054978496,0.000024609604,0.00025485497,0.000025984298,0.7940073,0.015757408,0.17891389,0.010508288,0.00003516953],"about_ca_topic_score_codex":0.0021132203,"about_ca_topic_score_gemma":0.0024493693,"teacher_disagreement_score":0.0021132203,"about_ca_system_score_codex":0.00079968455,"about_ca_system_score_gemma":0.0012492577,"threshold_uncertainty_score":0.0058021545},"labels":[],"label_agreement":null},{"id":"W2106104156","doi":"10.1109/wcnc.2008.49","title":"Decoding with Early Termination for Rateless (Luby Transform) Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fountain code; Decoding methods; Computer science; Raptor code; Luby transform code; List decoding; Algorithm; Sequential decoding; Online codes; Block code; Concatenated error correction code; Linear code; Theoretical computer science; Computer engineering; Real-time computing","score_opus":0.02643436694157408,"score_gpt":0.2607378716159897,"score_spread":0.23430350467441563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106104156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038768385,0.00020605614,0.959021,0.00012571755,0.000017032591,0.0000396784,0.000022951703,0.00030805368,0.0014911612],"genre_scores_gemma":[0.6263438,0.0004669198,0.3686621,0.00016246241,0.00005540097,0.00018829263,0.00015317502,0.0001649527,0.0038029465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901557,0.00037719673,0.000050367773,0.00010356916,0.00033560282,0.00011766946],"domain_scores_gemma":[0.9959292,0.0028557337,0.000423377,0.00037619282,0.00032350555,0.000092037335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013799776,0.0004598099,0.0006676869,0.00046123972,0.0004557156,0.00090178393,0.00079829356,0.0009129616,0.0007940211],"category_scores_gemma":[0.013863506,0.00021603469,0.00029704886,0.0005724421,0.0014570652,0.0013597588,0.0011080417,0.0011051849,0.0004256597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007410133,0.000088096465,0.0015665678,0.00026028193,0.00003233947,0.0005386602,0.0008069924,0.51481086,0.0366575,0.27884486,0.0019490387,0.16370381],"study_design_scores_gemma":[0.00004429075,0.00011209455,0.0001438041,0.000024614304,0.0000069174107,0.000144868,0.00003625996,0.90978116,0.020633517,0.06743528,0.0016167506,0.000020490295],"about_ca_topic_score_codex":0.0012592264,"about_ca_topic_score_gemma":0.0010599721,"teacher_disagreement_score":0.0013799776,"about_ca_system_score_codex":0.00079591613,"about_ca_system_score_gemma":0.0014956369,"threshold_uncertainty_score":0.007298112},"labels":[],"label_agreement":null},{"id":"W2106414790","doi":"10.1109/pacrim.2005.1517230","title":"Performance evaluation of LDPC codes in the presence of colored noise","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Low-density parity-check code; Additive white Gaussian noise; Computer science; Turbo code; Algorithm; Forward error correction; Serial concatenated convolutional codes; Concatenated error correction code; Bit error rate; Electronic engineering; Decoding methods; Theoretical computer science; Block code; Telecommunications; White noise; Engineering","score_opus":0.04143355552254348,"score_gpt":0.3151403437637523,"score_spread":0.2737067882412088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106414790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91969705,0.0014541592,0.07071535,0.0002921715,0.00007085576,0.000054739197,0.00018762315,0.0005010413,0.0070270672],"genre_scores_gemma":[0.9933895,0.0002552122,0.005748567,0.00002585733,0.000011130308,0.000011466923,0.0000743763,0.00002009922,0.00046388607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966534,0.0014380872,0.00013881279,0.0002557837,0.001163394,0.00035067406],"domain_scores_gemma":[0.9765673,0.017547576,0.0011603066,0.0008957293,0.0035423352,0.0002867314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020321356,0.0008671163,0.00074736995,0.0009200041,0.0007244076,0.0009546781,0.00048378334,0.0010550438,0.0006535956],"category_scores_gemma":[0.017037146,0.00021066058,0.00020962751,0.001138808,0.0009988348,0.0008822872,0.00067599776,0.00046659383,0.0001861963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001073195,0.000084612715,0.0048611206,0.00022966454,0.00012012586,0.0004362149,0.00016248113,0.93292004,0.03821486,0.00472454,0.00028139868,0.016891716],"study_design_scores_gemma":[0.000027876751,0.00030779233,0.0013322384,0.000032919663,0.00005025564,0.00026534116,0.00004236403,0.94905114,0.047314264,0.0011006716,0.00043389044,0.000041235253],"about_ca_topic_score_codex":0.0054588113,"about_ca_topic_score_gemma":0.0025930738,"teacher_disagreement_score":0.0054588113,"about_ca_system_score_codex":0.0013506172,"about_ca_system_score_gemma":0.0011501045,"threshold_uncertainty_score":0.010854065},"labels":[],"label_agreement":null},{"id":"W2107082557","doi":"10.1109/tcsii.2010.2082970","title":"A Min-Sum Iterative Decoder Based on Pulsewidth Message Encoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; CMOS; Quantization (signal processing); Decoding methods; Soft-decision decoder; Coding (social sciences); Efficient energy use; Algorithm; Offset (computer science); Parallel computing; Computer hardware; Electronic engineering; Mathematics; Electrical engineering; Engineering","score_opus":0.01908469058350544,"score_gpt":0.2559832696798948,"score_spread":0.2368985790963894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107082557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028198348,0.00033797979,0.9621793,0.00011257427,0.00009219317,0.00011108706,0.00012815646,0.0017517463,0.0070886114],"genre_scores_gemma":[0.260111,0.0003019644,0.7291359,0.00021446109,0.000064664295,0.00013174767,0.00035964488,0.000118402786,0.009562242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.0000696139,0.000023664817,0.000055281762,0.00021851207,0.00003831495],"domain_scores_gemma":[0.99961084,0.00011060693,0.000033466516,0.00006660532,0.0001540113,0.00002449011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032515268,0.00038115945,0.00038006148,0.00041191388,0.00030842717,0.00067590823,0.001221421,0.00052852696,0.00227038],"category_scores_gemma":[0.0007577098,0.00025208888,0.00031159847,0.0004087836,0.00027821818,0.000797678,0.00045622827,0.0005819929,0.0010741394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074285414,0.00022354451,0.0020270462,0.00036938494,0.00018147023,0.0004050865,0.00019565328,0.08763088,0.3289929,0.05890747,0.0054057967,0.51491797],"study_design_scores_gemma":[0.00007583656,0.0003707572,0.00057512155,0.000023087325,0.00006332854,0.0006698667,0.000019769795,0.74258494,0.23248246,0.0041684364,0.018916009,0.00005040235],"about_ca_topic_score_codex":0.0012243843,"about_ca_topic_score_gemma":0.0026252898,"teacher_disagreement_score":0.00227038,"about_ca_system_score_codex":0.0005190871,"about_ca_system_score_gemma":0.0011193346,"threshold_uncertainty_score":0.007595122},"labels":[],"label_agreement":null},{"id":"W2108147365","doi":"10.1109/isit.2011.6033699","title":"An efficient algorithm for finding dominant trapping sets of irregular LDPC codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Degree (music); Variable (mathematics); Trapping; Computer science; Set (abstract data type); Decoding methods; Mathematics","score_opus":0.047251097621052014,"score_gpt":0.2983019714345189,"score_spread":0.2510508738134669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108147365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010095427,0.00008397882,0.9875064,0.000055239136,0.00002052188,0.00010316663,0.00006797771,0.0007376715,0.0013297342],"genre_scores_gemma":[0.06329488,0.00008489451,0.9342638,0.000032850643,0.000010862383,0.00020180402,0.00028778607,0.000104537015,0.0017185238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00006341922,0.000033742293,0.00007975889,0.00017825549,0.000054633358],"domain_scores_gemma":[0.9991689,0.0003419587,0.00007776177,0.00013460398,0.00024435166,0.000032494452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046582986,0.0007946918,0.0007073905,0.0016911613,0.0010258597,0.00075088727,0.0011706449,0.00067635864,0.0031554834],"category_scores_gemma":[0.0026359078,0.0004087735,0.0005933515,0.0010693362,0.00060610427,0.0009870421,0.0012735333,0.00078397046,0.0012008145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025075636,0.00010665106,0.0016417957,0.0003403447,0.00007363293,0.00030646817,0.00044621315,0.21032183,0.032993723,0.042372424,0.0051134108,0.70603275],"study_design_scores_gemma":[0.000104916304,0.000081965285,0.0003606106,0.00003643679,0.000031705724,0.00032587236,0.00008862509,0.9440034,0.01622683,0.031576537,0.0071206526,0.000042282987],"about_ca_topic_score_codex":0.0025179787,"about_ca_topic_score_gemma":0.003441605,"teacher_disagreement_score":0.0031554834,"about_ca_system_score_codex":0.0006797742,"about_ca_system_score_gemma":0.0016888148,"threshold_uncertainty_score":0.010556102},"labels":[],"label_agreement":null},{"id":"W2108789220","doi":"10.1109/vetecf.2004.1400464","title":"A serial design of iterative belief propagation decoders for convolutional codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Computer science; Serial concatenated convolutional codes; Turbo code; Decoding methods; Belief propagation; Algorithm; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.03259586085487599,"score_gpt":0.2878854589260832,"score_spread":0.2552895980712072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108789220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015653986,0.00012563536,0.9800464,0.000052579402,0.000050128663,0.000079916754,0.00005293133,0.0007971227,0.0031414223],"genre_scores_gemma":[0.3432838,0.00023017763,0.64864063,0.00012186159,0.000053053558,0.00017888594,0.00025535066,0.000080312486,0.007155929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996704,0.000056774177,0.00003158588,0.00006568644,0.00014010197,0.00003542886],"domain_scores_gemma":[0.999303,0.00015208105,0.00008643413,0.0001248477,0.00030074682,0.00003278321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047516354,0.0005582649,0.00033254563,0.00043026434,0.00028962494,0.0005326036,0.00083313585,0.00053487153,0.0022471661],"category_scores_gemma":[0.0013081952,0.00033626045,0.0003167079,0.0003784093,0.0002444996,0.000548691,0.00033427795,0.0005927032,0.00095273496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000554495,0.00022669278,0.0023115927,0.00033820092,0.00020254577,0.00042237356,0.00021258602,0.1629264,0.24415973,0.046298515,0.003879059,0.5384678],"study_design_scores_gemma":[0.00007475832,0.0005916767,0.0008252507,0.000037846887,0.000086696855,0.000639852,0.000017345325,0.7856124,0.19096725,0.005900938,0.015201363,0.00004466578],"about_ca_topic_score_codex":0.0009730268,"about_ca_topic_score_gemma":0.0020388695,"teacher_disagreement_score":0.0022471661,"about_ca_system_score_codex":0.00039393522,"about_ca_system_score_gemma":0.00080139376,"threshold_uncertainty_score":0.007517457},"labels":[],"label_agreement":null},{"id":"W2109465956","doi":"10.1109/iscas.2011.5937662","title":"Performance analysis of lattice-reduction algorithms for a novel LR-compatible K-Best MIMO detector","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lattice reduction; Algorithm; MIMO; Reduction (mathematics); Detector; Computer science; Computational complexity theory; Tree (set theory); Mathematics; Telecommunications; Combinatorics; Channel (broadcasting)","score_opus":0.08362498249105385,"score_gpt":0.2942258399484327,"score_spread":0.21060085745737886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109465956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047907516,0.000500303,0.94718546,0.00018222023,0.000029235283,0.000048759754,0.00007378206,0.00044645643,0.0036264095],"genre_scores_gemma":[0.45785102,0.00042922853,0.53858256,0.00012369847,0.000041454114,0.00009437212,0.00020001484,0.00009287562,0.0025847643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979234,0.000826159,0.00006901043,0.00017529001,0.0008213222,0.00018486688],"domain_scores_gemma":[0.99657494,0.0021660042,0.00025975163,0.0003631164,0.00054062385,0.000095543066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022238914,0.000728905,0.0008499925,0.0006825179,0.0005181185,0.0010698645,0.0007575488,0.00082605175,0.0020777786],"category_scores_gemma":[0.00620337,0.00033664762,0.00051175256,0.00078331487,0.000858146,0.0010366648,0.0009891212,0.00094112405,0.00094580336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012002004,0.00022918812,0.0024239663,0.00036124757,0.00015167368,0.00022617866,0.00025961228,0.6459302,0.050674606,0.09099727,0.0023044331,0.20524137],"study_design_scores_gemma":[0.000026677657,0.0000953605,0.00020306143,0.000009781552,0.000011307024,0.00014220655,0.00001642466,0.9837933,0.010539975,0.0045022736,0.000634139,0.000025457699],"about_ca_topic_score_codex":0.0011321672,"about_ca_topic_score_gemma":0.0018879232,"teacher_disagreement_score":0.0022238914,"about_ca_system_score_codex":0.0008819485,"about_ca_system_score_gemma":0.0018003337,"threshold_uncertainty_score":0.0117611885},"labels":[],"label_agreement":null},{"id":"W2109846433","doi":"10.1109/ccece.2009.5090167","title":"Content-based blind compensation and shaping for streaming video","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Byte; Compensation (psychology); Computer network; Transmission (telecommunications); Wireless; Video streaming; Real-time computing; Path (computing); Computer hardware; Telecommunications","score_opus":0.108088413389253,"score_gpt":0.3119144058415996,"score_spread":0.20382599245234656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109846433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060663305,0.0006497505,0.9361269,0.00012902479,0.00007399625,0.000059342772,0.000026869377,0.00063648174,0.0016343141],"genre_scores_gemma":[0.783577,0.0008937628,0.21044804,0.00013687696,0.00014789516,0.000053605676,0.00009532915,0.00008909473,0.004558425],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996573,0.00007835287,0.000010936317,0.000038498372,0.0001801098,0.000034850673],"domain_scores_gemma":[0.9993019,0.0002983193,0.00006444917,0.000086201486,0.0002240101,0.000025112296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840502,0.0004332419,0.0003740917,0.00051924546,0.00036033095,0.0003572544,0.00044399992,0.00057839707,0.00076443003],"category_scores_gemma":[0.0022834516,0.00015320377,0.00022562749,0.0004535295,0.00056740973,0.00085740007,0.00029965292,0.00044501096,0.00031744552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070237205,0.00018481803,0.00095842424,0.00026927303,0.000062667925,0.0003387292,0.000279454,0.19544062,0.43872985,0.022581402,0.0023775324,0.3380749],"study_design_scores_gemma":[0.000025604217,0.00017960533,0.00041933128,0.000012862448,0.000024928157,0.0002284361,0.000029424613,0.88119805,0.110492446,0.0052607446,0.0021047571,0.000023829502],"about_ca_topic_score_codex":0.0021155332,"about_ca_topic_score_gemma":0.0012554623,"teacher_disagreement_score":0.0021155332,"about_ca_system_score_codex":0.00056053844,"about_ca_system_score_gemma":0.00050038187,"threshold_uncertainty_score":0.0042064786},"labels":[],"label_agreement":null},{"id":"W2110288531","doi":"10.1109/tcomm.2013.021913.120149","title":"Relaxed Half-Stochastic Belief Propagation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Belief propagation; Computer science; Code word; Algorithm; Binary number; Throughput; Low-density parity-check code; Bit error rate; Coding (social sciences); Sequential decoding; Theoretical computer science; Wireless; Block code; Mathematics; Arithmetic; Telecommunications","score_opus":0.03033599025639153,"score_gpt":0.27193571936845407,"score_spread":0.24159972911206254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110288531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024414029,0.00011367705,0.972008,0.00021323007,0.000026816415,0.00003817019,0.00009768605,0.0002449717,0.0028433998],"genre_scores_gemma":[0.6182256,0.00028835208,0.3750565,0.00028865968,0.000054543376,0.00021142312,0.00040889124,0.000106274325,0.0053597763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.0005291552,0.00006625137,0.0001553722,0.0004313566,0.00013054413],"domain_scores_gemma":[0.9945187,0.0035133343,0.00029322883,0.0007011089,0.0008709578,0.00010274705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616489,0.0005868493,0.00076268916,0.00054738927,0.00043504522,0.0010384842,0.0016947597,0.0011516052,0.0023117464],"category_scores_gemma":[0.008655414,0.00044380128,0.0005947871,0.00066068955,0.0011241196,0.0016876808,0.0010406174,0.0013862052,0.00063696323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000264012,0.000041249496,0.0006745442,0.000115422044,0.000043143107,0.00010159116,0.00013163283,0.81042373,0.0054868283,0.12547353,0.0015510782,0.05569313],"study_design_scores_gemma":[0.000010371872,0.000015419728,0.000036741087,0.0000041877825,0.0000035250407,0.000015400637,0.0000049524133,0.98767483,0.0013346076,0.01063594,0.00025864158,0.0000053406166],"about_ca_topic_score_codex":0.0029609897,"about_ca_topic_score_gemma":0.0024780568,"teacher_disagreement_score":0.0029609897,"about_ca_system_score_codex":0.0008692051,"about_ca_system_score_gemma":0.0013939522,"threshold_uncertainty_score":0.008548915},"labels":[],"label_agreement":null},{"id":"W2110529479","doi":"10.1109/tcomm.2012.050812.110115a","title":"Dithered Belief Propagation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dither; Decoding methods; Belief propagation; Overhead (engineering); Computer science; Limit (mathematics); Algorithm; Waterfall; Propagation of uncertainty; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.0562468275296146,"score_gpt":0.3094651156017489,"score_spread":0.2532182880721343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110529479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068930485,0.00024224824,0.98803085,0.00026789616,0.00013884374,0.000041874686,0.0001371958,0.0010666264,0.0031813474],"genre_scores_gemma":[0.2192118,0.0004520297,0.76671606,0.00043287547,0.0001264296,0.00014081637,0.00036508183,0.00022904911,0.012325896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.00016067272,0.000051267427,0.00020107396,0.00044864876,0.00013046242],"domain_scores_gemma":[0.99802077,0.000665652,0.00014567676,0.0005578016,0.0005336675,0.00007643395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000552835,0.00093105744,0.0008518727,0.0010729674,0.00057729526,0.0016926611,0.0016885343,0.0017598565,0.0062625655],"category_scores_gemma":[0.0038318154,0.0004859776,0.0004921451,0.0012957902,0.0008405481,0.0019603074,0.0015965264,0.0019126938,0.002142352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062607887,0.00021335059,0.0008259628,0.0003820825,0.00012440643,0.00029057285,0.00018634183,0.24750634,0.05808773,0.1229459,0.008557614,0.5602537],"study_design_scores_gemma":[0.000058829282,0.00009759853,0.00020434844,0.0000273035,0.000030048002,0.00023640222,0.000016763037,0.92142045,0.04463748,0.026653562,0.0065640802,0.000053114032],"about_ca_topic_score_codex":0.002207522,"about_ca_topic_score_gemma":0.003535987,"teacher_disagreement_score":0.0062625655,"about_ca_system_score_codex":0.0008109907,"about_ca_system_score_gemma":0.0016957403,"threshold_uncertainty_score":0.020950377},"labels":[],"label_agreement":null},{"id":"W2110585393","doi":"10.1109/tbc.2014.2304134","title":"Raptor-Like Rate Compatible LDPC Codes and Their Puncturing Performance for the Cloud Transmission System","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Low-density parity-check code; Puncturing; Turbo code; Raptor code; Forward error correction; Computer science; Concatenated error correction code; Code word; Serial concatenated convolutional codes; Algorithm; Block code; Electronic engineering; Decoding methods; Telecommunications; Error floor; Engineering","score_opus":0.02195811863038086,"score_gpt":0.2309530373258717,"score_spread":0.20899491869549083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110585393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41577026,0.0028957562,0.5667935,0.0005756557,0.00007941476,0.00007951518,0.00018156321,0.00097365933,0.012650801],"genre_scores_gemma":[0.9635141,0.00051209185,0.03495447,0.000051630366,0.00002293847,0.000022764261,0.000039588336,0.000029271898,0.00085303886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.00017688393,0.000018485913,0.00004957231,0.00019605891,0.00006910004],"domain_scores_gemma":[0.9984884,0.00071022095,0.00023169143,0.00022282374,0.00029388623,0.000052931595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061390793,0.0004324882,0.00034283524,0.0004719671,0.00045931884,0.0005469191,0.0003923121,0.00059346063,0.0007635178],"category_scores_gemma":[0.0026210046,0.00014422287,0.00018876902,0.00049712224,0.0005103233,0.00056657783,0.00035790825,0.0004705619,0.00023846416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012835055,0.000114346316,0.004257443,0.00032343448,0.0000965259,0.0009578018,0.00044178247,0.5865682,0.15178236,0.10145319,0.0028697425,0.1498517],"study_design_scores_gemma":[0.000023025053,0.00019232018,0.0006720801,0.000021402151,0.000020570475,0.0004217697,0.00002698505,0.9435108,0.048170164,0.0051159253,0.001789295,0.0000356291],"about_ca_topic_score_codex":0.0018788297,"about_ca_topic_score_gemma":0.0013313111,"teacher_disagreement_score":0.0018788297,"about_ca_system_score_codex":0.00062437955,"about_ca_system_score_gemma":0.00076267467,"threshold_uncertainty_score":0.0045301914},"labels":[],"label_agreement":null},{"id":"W2111686337","doi":"10.1109/tit.2009.2015989","title":"The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Division of Electrical, Communications and Cyber Systems; University of Illinois at Urbana-Champaign; National Science Foundation","keywords":"Markov chain; Intersymbol interference; Markov process; Mathematics; Markov model; Algorithm; Computer science; Control theory (sociology); Decoding methods; Statistics; Artificial intelligence","score_opus":0.00820575316659722,"score_gpt":0.22780317577312845,"score_spread":0.21959742260653123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111686337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37831315,0.006046731,0.6005962,0.0015645492,0.00030687838,0.00007843917,0.00036181463,0.00030588376,0.012426277],"genre_scores_gemma":[0.9824034,0.0016019393,0.013542555,0.00008202973,0.00013855836,0.00005579412,0.000105968546,0.00006321469,0.0020065878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793774,0.0006339693,0.0001048468,0.00019953925,0.00071984285,0.0004040422],"domain_scores_gemma":[0.9607247,0.032727476,0.0027190147,0.0010673761,0.002334955,0.00042648197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036079735,0.0011836676,0.0009991907,0.0014276692,0.00063228904,0.0015499805,0.0010737056,0.0010032171,0.0016774717],"category_scores_gemma":[0.029062727,0.0004138395,0.00032109473,0.0011390022,0.002170936,0.0028811686,0.0016484265,0.0015425377,0.00024472977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051713426,0.000058735248,0.002909091,0.00027984087,0.000056998073,0.00051711797,0.00043327452,0.575638,0.0072245803,0.3817372,0.0014721075,0.029155895],"study_design_scores_gemma":[0.000018867173,0.00007881305,0.0004942021,0.00007042874,0.000015637124,0.00014684824,0.000045744226,0.8834401,0.002322048,0.11290401,0.00042426653,0.000039117076],"about_ca_topic_score_codex":0.0016575828,"about_ca_topic_score_gemma":0.0008990553,"teacher_disagreement_score":0.0036079735,"about_ca_system_score_codex":0.0017094795,"about_ca_system_score_gemma":0.0013725647,"threshold_uncertainty_score":0.019080997},"labels":[],"label_agreement":null},{"id":"W2111789128","doi":"10.1109/isit.2002.1023726","title":"Designing irregular LPDC codes using EXIT charts based on message error rate","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Computer science; Additive white Gaussian noise; Algorithm; Turbo code; Decoding methods; Information transfer; Gaussian; Word error rate; Range (aeronautics); Theoretical computer science; Channel (broadcasting); Telecommunications; Speech recognition; Engineering","score_opus":0.0523591337626671,"score_gpt":0.2917638333100579,"score_spread":0.2394046995473908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111789128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0364562,0.00012722524,0.9606371,0.00006135038,0.000020110787,0.000032765103,0.00003543651,0.00047196355,0.0021579019],"genre_scores_gemma":[0.7685806,0.00048623746,0.22802007,0.00007784171,0.000046093875,0.00016962012,0.00016987039,0.00026624414,0.0021833696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914575,0.000282688,0.00003927627,0.00007607785,0.00036177493,0.0000944717],"domain_scores_gemma":[0.9969432,0.0015763816,0.0003663914,0.00046819786,0.0005530947,0.00009277707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012585231,0.0007989644,0.0006269057,0.001037011,0.00047565225,0.0009808929,0.00058821536,0.0004291029,0.0009293247],"category_scores_gemma":[0.005415117,0.00030459877,0.0003935784,0.00076831016,0.0012708083,0.0010336328,0.0008235258,0.00097545644,0.00031473787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001444607,0.000027008293,0.001150847,0.000077888806,0.000022204425,0.00015504404,0.00016788415,0.84432936,0.016785752,0.10256561,0.00063839764,0.03393553],"study_design_scores_gemma":[0.000007027202,0.00003784384,0.00010688663,0.0000092254095,0.000006023269,0.00004324211,0.000012726816,0.9760015,0.008124883,0.014647031,0.0009900881,0.000013541916],"about_ca_topic_score_codex":0.0009967895,"about_ca_topic_score_gemma":0.00069247605,"teacher_disagreement_score":0.0012585231,"about_ca_system_score_codex":0.00098467,"about_ca_system_score_gemma":0.0006999159,"threshold_uncertainty_score":0.007144332},"labels":[],"label_agreement":null},{"id":"W2112113416","doi":"10.1109/vetecs.2007.414","title":"Performance Comparison of Iterative BP and Threshold Decoding for Convolutional Self-Doubly-Orthogonal Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sequential decoding; Convolutional code; List decoding; Computer science; Algorithm; Berlekamp–Welch algorithm; Serial concatenated convolutional codes; Additive white Gaussian noise; Convergence (economics); Concatenated error correction code; Channel (broadcasting); Theoretical computer science; Telecommunications; Block code","score_opus":0.03676323783177058,"score_gpt":0.32624500777997445,"score_spread":0.28948176994820385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112113416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2273576,0.0012101878,0.7582554,0.00019756657,0.000075984775,0.00007648316,0.00013138299,0.0019801506,0.0107152555],"genre_scores_gemma":[0.8222437,0.0006596269,0.17391382,0.000074745985,0.000028509186,0.00007826771,0.00023946767,0.00014866091,0.002613285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983767,0.00037476432,0.000088836576,0.00013482268,0.0008333793,0.00019152628],"domain_scores_gemma":[0.99441224,0.0030180563,0.00029419066,0.00042388993,0.0017016069,0.00014998157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015167876,0.00073202467,0.0006198673,0.0010711174,0.00038650053,0.0010135343,0.0009080924,0.0011299482,0.0012170218],"category_scores_gemma":[0.010582535,0.00022692347,0.00029590094,0.0011648135,0.0005462575,0.0012392971,0.00079178193,0.0006195345,0.0005568115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017423035,0.00015198025,0.0048971106,0.00030123815,0.00018633266,0.00018129298,0.0004017273,0.5582858,0.051413164,0.030407552,0.0012418214,0.35078964],"study_design_scores_gemma":[0.00002428469,0.00024345434,0.00059955165,0.000017659824,0.00002580311,0.00017550851,0.000027161665,0.96034557,0.03551314,0.0024500615,0.00054886675,0.000028980026],"about_ca_topic_score_codex":0.003062961,"about_ca_topic_score_gemma":0.0026531655,"teacher_disagreement_score":0.003062961,"about_ca_system_score_codex":0.00093701854,"about_ca_system_score_gemma":0.0017838478,"threshold_uncertainty_score":0.008021653},"labels":[],"label_agreement":null},{"id":"W2112736588","doi":"10.1109/tcsii.2006.882204","title":"Degree-Matched Check Node Decoding for Regular and Irregular LDPCs","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Degree (music); Low-density parity-check code; Node (physics); Mathematics; Degree distribution; List decoding; Parity (physics); Computer science; Algorithm; Discrete mathematics; Combinatorics; Arithmetic; Concatenated error correction code; Complex network","score_opus":0.03121611143255829,"score_gpt":0.2437217073219459,"score_spread":0.2125055958893876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112736588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077972814,0.0005488199,0.91427004,0.00020614553,0.000049115195,0.000045378365,0.00008747184,0.0003174079,0.006502643],"genre_scores_gemma":[0.59848917,0.0012073468,0.39495093,0.00012180229,0.00004357744,0.00006682711,0.0001918492,0.00010265529,0.004825826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00017480347,0.000031930827,0.000065208995,0.00039201908,0.000064680375],"domain_scores_gemma":[0.9983632,0.0009887461,0.0000989304,0.0003239401,0.00018951275,0.000035712525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442163,0.0002813766,0.00031201736,0.00041548704,0.0003608908,0.0008916695,0.00057164766,0.00061128463,0.0011282095],"category_scores_gemma":[0.0058735907,0.00013836526,0.00025293467,0.0006440688,0.0007622917,0.0009840993,0.0006468003,0.0006357245,0.000369052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003876732,0.000034907895,0.0019185152,0.00019641714,0.000042929587,0.00016072922,0.00030033517,0.5510419,0.020779038,0.29837617,0.001154455,0.12560686],"study_design_scores_gemma":[0.000014631925,0.000038900875,0.00025020126,0.000020612038,0.000009708104,0.00013773602,0.000026441709,0.9610429,0.010534133,0.025255388,0.0026537352,0.000015706883],"about_ca_topic_score_codex":0.0024544552,"about_ca_topic_score_gemma":0.0034998413,"teacher_disagreement_score":0.0024544552,"about_ca_system_score_codex":0.0010257014,"about_ca_system_score_gemma":0.0010060526,"threshold_uncertainty_score":0.007442057},"labels":[],"label_agreement":null},{"id":"W2113120847","doi":"10.1109/tcomm.2010.01.070451","title":"Systematic design of low-density parity-check code ensembles for binary erasure channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Erasure; Binary erasure channel; Low-density parity-check code; Binary number; Algorithm; Node (physics); Upper and lower bounds; Mathematics; Code (set theory); Degree (music); Computer science; Theoretical computer science; Topology (electrical circuits); Decoding methods; Channel capacity; Arithmetic; Combinatorics; Coding (social sciences); Statistics","score_opus":0.05596313526142133,"score_gpt":0.30405353589121603,"score_spread":0.2480904006297947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113120847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11875272,0.00022627779,0.8782061,0.00010562478,0.000038076774,0.00007537412,0.000056404493,0.00022584747,0.0023135128],"genre_scores_gemma":[0.7119408,0.00016887649,0.2868999,0.000056014895,0.000016668813,0.00018312497,0.00006296818,0.0000356528,0.00063600315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956733,0.00016515523,0.000024138688,0.000058796497,0.0001435537,0.000040882027],"domain_scores_gemma":[0.99890804,0.00037894511,0.00026356222,0.00017782036,0.00022563264,0.00004600823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884248,0.00033949074,0.0003719651,0.0003765485,0.00031887722,0.00032167105,0.00043941085,0.00036009555,0.00037385355],"category_scores_gemma":[0.0019494968,0.0002533133,0.0002562924,0.00026817762,0.00046173084,0.0003223529,0.0005568667,0.00040483425,0.00014111125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001838197,0.00012112026,0.003569351,0.00027876662,0.000102583756,0.0002018287,0.00020617795,0.6818574,0.108069144,0.097136475,0.0011559157,0.10711739],"study_design_scores_gemma":[0.000028376431,0.00017194942,0.00038873745,0.000020099484,0.000021037818,0.00010204293,0.00001398641,0.960971,0.026751045,0.009795617,0.0017114852,0.000024539517],"about_ca_topic_score_codex":0.00027797793,"about_ca_topic_score_gemma":0.00056209264,"teacher_disagreement_score":0.0005884248,"about_ca_system_score_codex":0.00029805876,"about_ca_system_score_gemma":0.0006296712,"threshold_uncertainty_score":0.0031119585},"labels":[],"label_agreement":null},{"id":"W2113217811","doi":"10.1109/lcomm.2005.1576587","title":"Construction of low-density parity-check convolutional codes through progressive edge-growth","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Convolutional code; Enhanced Data Rates for GSM Evolution; Parity-check matrix; Parity bit; Decoding methods; Theoretical computer science; Concatenated error correction code; Block code; Telecommunications","score_opus":0.027529556562433923,"score_gpt":0.28936615693695206,"score_spread":0.2618366003745181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113217811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242082,0.00019309665,0.9217335,0.00012971701,0.00004813331,0.00006959612,0.000067436995,0.00047927577,0.004858421],"genre_scores_gemma":[0.5180641,0.0003505826,0.4777238,0.00009824828,0.000022992961,0.0001009284,0.0002113841,0.00006433774,0.0033635967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999824,0.000036579862,0.0000074105455,0.000025086414,0.00008008588,0.000026928454],"domain_scores_gemma":[0.99960643,0.0001516498,0.000037409733,0.00008354635,0.00009901714,0.00002198274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025955512,0.0003315507,0.00024558714,0.00042908412,0.00032048003,0.0002957182,0.0005598355,0.00035143024,0.0006927519],"category_scores_gemma":[0.0010879429,0.00013943065,0.0002639586,0.00035046515,0.0005000219,0.0006026398,0.0006603971,0.0006063152,0.00027044822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028583736,0.000111374466,0.0023334685,0.0003688546,0.000043361113,0.0007493548,0.00029777962,0.23343006,0.16673145,0.3093966,0.002454984,0.28379685],"study_design_scores_gemma":[0.00004360821,0.00011908577,0.00045534843,0.000024333458,0.00001958576,0.000404007,0.000024652598,0.83512896,0.11780634,0.036733285,0.009206172,0.000034641987],"about_ca_topic_score_codex":0.00080937054,"about_ca_topic_score_gemma":0.00093524274,"teacher_disagreement_score":0.00080937054,"about_ca_system_score_codex":0.00027857596,"about_ca_system_score_gemma":0.00060026115,"threshold_uncertainty_score":0.0023174882},"labels":[],"label_agreement":null},{"id":"W2113324266","doi":"10.1109/iscas.2005.1464593","title":"A Memory-Based Architecture for FPGA Implementations of Low-Density Parity-Check Convolutional Decoders","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stratix; Computer science; Field-programmable gate array; Convolutional code; Throughput; Low-density parity-check code; Decoding methods; Block (permutation group theory); Parallel computing; Soft-decision decoder; Architecture; Network packet; Computer architecture; Embedded system; Computer network; Algorithm","score_opus":0.021642439805185713,"score_gpt":0.30437389154865757,"score_spread":0.28273145174347186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113324266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25546432,0.0030819008,0.7013863,0.00044532612,0.00035908245,0.00019316515,0.00035995123,0.0104757985,0.028234152],"genre_scores_gemma":[0.762722,0.0005269099,0.22738814,0.00014690327,0.000042399388,0.000070079856,0.00026427364,0.000063139065,0.008776176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995375,0.0000076253345,0.0000044955764,0.0000075356916,0.000016241307,0.000010392949],"domain_scores_gemma":[0.99990284,0.000023312585,0.000012238818,0.000022458054,0.000033426044,0.0000057802436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007935145,0.00020085015,0.00011168941,0.00028333743,0.00021406914,0.00038244188,0.00068684336,0.00025376803,0.003337954],"category_scores_gemma":[0.00028683632,0.000111429305,0.00009118914,0.0002919345,0.00011867385,0.0004231314,0.00014602943,0.00026421493,0.0006892817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006063276,0.00012307994,0.0021787996,0.00041966973,0.00006234129,0.0004986316,0.00013820773,0.035127234,0.2871224,0.042131852,0.010006328,0.62158513],"study_design_scores_gemma":[0.00017832615,0.0012905381,0.0026205836,0.00012795985,0.00013777598,0.0018071105,0.00007841619,0.38298225,0.5133899,0.009084267,0.08823058,0.00007234152],"about_ca_topic_score_codex":0.0012123038,"about_ca_topic_score_gemma":0.0026219608,"teacher_disagreement_score":0.003337954,"about_ca_system_score_codex":0.00034735724,"about_ca_system_score_gemma":0.00032832063,"threshold_uncertainty_score":0.011166573},"labels":[],"label_agreement":null},{"id":"W2113587209","doi":"10.1109/tcsi.2008.925813","title":"Efficient Implementation of Low-Density Parity-Check Convolutional Code Encoders With Built-In Termination","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Encoder; Computer science; Algorithm; Serial concatenated convolutional codes; Convolutional code; Code (set theory); Parallel computing; Block code; Computer hardware; Concatenated error correction code; Decoding methods","score_opus":0.019043731042467833,"score_gpt":0.2530776807509332,"score_spread":0.23403394970846533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113587209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25704905,0.00046814902,0.73147774,0.00012840831,0.00007153613,0.0001595833,0.00017990686,0.0024190003,0.008046588],"genre_scores_gemma":[0.7567859,0.0002113073,0.23948279,0.00003360097,0.00001759807,0.00009569332,0.00029554308,0.000054486783,0.0030231113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983907,0.00002470502,0.000012706652,0.000019577192,0.000079237056,0.000024604995],"domain_scores_gemma":[0.99949574,0.0001809528,0.00006179061,0.000097869335,0.00014670605,0.00001689382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029203584,0.00029279554,0.00021342104,0.00029763364,0.00021428007,0.0003425404,0.0005508909,0.00027139048,0.0007833257],"category_scores_gemma":[0.0010872724,0.0001190959,0.00013097434,0.00028157732,0.00024711387,0.00041644427,0.00023117999,0.0004004324,0.00033857426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041302433,0.0001856689,0.003048307,0.00034283282,0.000042349988,0.00039071645,0.00020496458,0.09081179,0.5373357,0.06635203,0.002366148,0.2985065],"study_design_scores_gemma":[0.00006300478,0.00023989788,0.001214801,0.000025861622,0.0000300063,0.00024988837,0.000016846512,0.53417903,0.45082447,0.0048969816,0.008237451,0.000021750977],"about_ca_topic_score_codex":0.0007932093,"about_ca_topic_score_gemma":0.0017686406,"teacher_disagreement_score":0.0007932093,"about_ca_system_score_codex":0.00046274668,"about_ca_system_score_gemma":0.0007912732,"threshold_uncertainty_score":0.0033574104},"labels":[],"label_agreement":null},{"id":"W2114074598","doi":"10.1109/tit.2010.2048448","title":"On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Bit error rate; Code (set theory); Computer science; Turbo code; Concatenated error correction code; Iterative method; Topology (electrical circuits); Mathematics; Block code; Combinatorics","score_opus":0.008429924930415729,"score_gpt":0.23618999613754812,"score_spread":0.2277600712071324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114074598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7730035,0.0007241408,0.20166226,0.00037209492,0.0000342015,0.0000473678,0.00013750605,0.00032419336,0.02369479],"genre_scores_gemma":[0.9881919,0.0002668021,0.009489564,0.000019178213,0.000008519228,0.000028220997,0.00005365158,0.00003166914,0.001910542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989295,0.000028227649,0.0000035674498,0.000010157951,0.0000456756,0.00001947471],"domain_scores_gemma":[0.9993113,0.0004314252,0.00009529802,0.000042256754,0.000089572204,0.000030076038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019098044,0.00024106381,0.0001752202,0.0009814271,0.00039689438,0.0004989982,0.00030695807,0.00033710914,0.0013443065],"category_scores_gemma":[0.0021432533,0.00015656887,0.00014830622,0.0005094512,0.001012411,0.0008623042,0.00036472618,0.0003189341,0.00016101095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009283014,0.00003800774,0.0015829084,0.00011285081,0.000010868277,0.00037414988,0.0004215574,0.5115521,0.024033146,0.44423577,0.0007957242,0.016749999],"study_design_scores_gemma":[0.0000059694294,0.000034066103,0.00071381143,0.000014672973,0.0000027425913,0.00017094157,0.000062413885,0.9230715,0.0037906715,0.07140503,0.00071124284,0.000016964437],"about_ca_topic_score_codex":0.00080910267,"about_ca_topic_score_gemma":0.0006612013,"teacher_disagreement_score":0.0013443065,"about_ca_system_score_codex":0.00039212735,"about_ca_system_score_gemma":0.00025708217,"threshold_uncertainty_score":0.004497111},"labels":[],"label_agreement":null},{"id":"W2114161025","doi":"","title":"Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Subgradient method; Solver; Convergence (economics); Computer science; Algorithm; Coordinate descent; Quadratic programming; Relaxation (psychology); Linear programming relaxation; Mathematical optimization; Block (permutation group theory); Quadratic equation; Linear programming; Mathematics","score_opus":0.019159476069594773,"score_gpt":0.26095168223799126,"score_spread":0.24179220616839647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114161025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039658938,0.00014136665,0.99072987,0.00017728898,0.00004377952,0.00004595819,0.00008529366,0.0011216907,0.0036888388],"genre_scores_gemma":[0.15045802,0.00017672198,0.8408769,0.0001656237,0.00008161272,0.00035100977,0.00039053883,0.00060110335,0.006898431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.00014151813,0.0000251414,0.00009854217,0.00017187714,0.00007456322],"domain_scores_gemma":[0.9987954,0.0006929456,0.00007928111,0.00012602436,0.00025034987,0.000055971843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067881,0.001422567,0.0014999034,0.00068215857,0.00061090256,0.0013621353,0.0015192992,0.0017120985,0.008821668],"category_scores_gemma":[0.0039063836,0.0007291572,0.00077985675,0.00085302704,0.00082196255,0.0010847605,0.0014856233,0.0024165635,0.0026886526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000137809,0.00006706699,0.00034344243,0.00014915166,0.000047912978,0.00016150024,0.000080994265,0.89184165,0.0017167291,0.022082197,0.0063833212,0.076988176],"study_design_scores_gemma":[0.000017430179,0.000010524386,0.000019240164,0.000004510603,0.0000028063355,0.000011751153,0.000007756253,0.9949758,0.00034075984,0.003922116,0.0006844853,0.0000028252998],"about_ca_topic_score_codex":0.0061841626,"about_ca_topic_score_gemma":0.0067052892,"teacher_disagreement_score":0.008821668,"about_ca_system_score_codex":0.00087177136,"about_ca_system_score_gemma":0.0023885758,"threshold_uncertainty_score":0.029511392},"labels":[],"label_agreement":null},{"id":"W2114350539","doi":"10.1109/pacrim.1989.48374","title":"Low-complexity parallel-structure symbol-by-symbol detection for ISI channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Symbol (formal); Computer science; Viterbi algorithm; Algorithm; Computation; Lookup table; Speedup; Realization (probability); Mathematics; Parallel computing; Decoding methods; Statistics; Telecommunications","score_opus":0.02213749920366569,"score_gpt":0.2615947932714889,"score_spread":0.23945729406782318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114350539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009602247,0.00014145016,0.98786014,0.00013935789,0.000023179335,0.00003642454,0.000053104905,0.00068041723,0.0014636645],"genre_scores_gemma":[0.1960925,0.0003270056,0.7995355,0.00009059819,0.00007075301,0.00011443752,0.00022011969,0.00008200068,0.0034671738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924076,0.00020936783,0.000030998868,0.0001012511,0.00033099376,0.00008669026],"domain_scores_gemma":[0.9984799,0.00092220015,0.000119636126,0.00021277794,0.00023507694,0.000030474048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008887334,0.0006002128,0.0007439428,0.0005686599,0.00055593543,0.0010266316,0.0010460798,0.0006833379,0.00358326],"category_scores_gemma":[0.0037282805,0.000411561,0.00034854678,0.0009491741,0.0007544118,0.0016081709,0.00075982074,0.0011456584,0.0012296266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055864605,0.00011552856,0.0014303343,0.00026899803,0.00008355125,0.00020744119,0.00020119564,0.45812365,0.03329784,0.1261831,0.0053558336,0.37417385],"study_design_scores_gemma":[0.000024572873,0.000079880694,0.0001432986,0.000009086363,0.000014020923,0.000103609585,0.000016272,0.966648,0.008345257,0.022264201,0.002341903,0.0000099639265],"about_ca_topic_score_codex":0.0024946646,"about_ca_topic_score_gemma":0.0037371172,"teacher_disagreement_score":0.00358326,"about_ca_system_score_codex":0.0011441523,"about_ca_system_score_gemma":0.0022198511,"threshold_uncertainty_score":0.01198715},"labels":[],"label_agreement":null},{"id":"W2114415531","doi":"10.1109/jssc.2007.905232","title":"Design and Test of a 175-Mb/s, Rate-1/2 (128,3,6) Low-Density Parity-Check Convolutional Code Encoder and Decoder","year":2007,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"CMC Microsystems","keywords":"Low-density parity-check code; Computer science; Encoder; Convolutional code; Chip; Forward error correction; Very-large-scale integration; Decoding methods; Parallel computing; Algorithm; Computer hardware; Embedded system; Telecommunications","score_opus":0.028042793189049932,"score_gpt":0.2863491822441549,"score_spread":0.25830638905510495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114415531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90853626,0.0005051499,0.07911645,0.00044166815,0.00020012217,0.0010660934,0.0011413296,0.003638224,0.005354613],"genre_scores_gemma":[0.9520293,0.00018034062,0.04132032,0.00016472334,0.000034921635,0.00030470858,0.00059226365,0.00009620514,0.005277228],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990947,0.0001326365,0.00005300628,0.00021113307,0.00037757863,0.00013098864],"domain_scores_gemma":[0.9982426,0.00038492447,0.0003184232,0.00025398872,0.00064607046,0.00015398073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072682305,0.000529349,0.0005137657,0.0005162474,0.00036603885,0.00056824944,0.0013665083,0.0009649525,0.0018203415],"category_scores_gemma":[0.0016791007,0.0002400244,0.0002602661,0.00036832565,0.0004147619,0.00059783796,0.00027235292,0.00034225854,0.0006414421],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019481189,0.0011380602,0.01774668,0.0011358656,0.0004456976,0.0015863098,0.0007121772,0.05090276,0.8235816,0.0048039495,0.005139151,0.09085966],"study_design_scores_gemma":[0.00041972665,0.0110030025,0.008419685,0.0000393974,0.00027361332,0.0007988725,0.000072222545,0.10518596,0.8640859,0.00029662313,0.00934631,0.00005862911],"about_ca_topic_score_codex":0.0021188466,"about_ca_topic_score_gemma":0.0016713645,"teacher_disagreement_score":0.0021188466,"about_ca_system_score_codex":0.00090922276,"about_ca_system_score_gemma":0.0015537603,"threshold_uncertainty_score":0.006596923},"labels":[],"label_agreement":null},{"id":"W2114726247","doi":"10.1109/isit.2004.1365331","title":"Density evolution analysis of device mismatch in analog decoders","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Analogue electronics; Analog multiplier; Decoding methods; Electronic engineering; Electronic circuit; Power (physics); Algorithm; Electrical engineering; Computer hardware; Analog signal; Engineering; Physics","score_opus":0.014348144217943183,"score_gpt":0.27068059066940203,"score_spread":0.25633244645145886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114726247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677949,0.0011001998,0.31366804,0.0007345277,0.00004199816,0.000058019174,0.00013390693,0.00040743567,0.016061008],"genre_scores_gemma":[0.99014074,0.000117721786,0.0078119594,0.000038531904,0.000010662499,0.000018974162,0.000038473376,0.000029330418,0.0017936475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997204,0.00006430121,0.0000092865275,0.000031608673,0.0001418641,0.000032577598],"domain_scores_gemma":[0.9987313,0.00084600016,0.00012790751,0.0000673959,0.00019140037,0.000036023135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004781425,0.0002624244,0.0003913204,0.000492806,0.00032520044,0.00049230387,0.0005173203,0.0006215842,0.0013709493],"category_scores_gemma":[0.004532524,0.00029462576,0.00015882193,0.00038556874,0.00053522823,0.0010083925,0.0004256092,0.00037156144,0.00022208557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023065343,0.000061581384,0.005459905,0.000114391325,0.000043435197,0.00037604588,0.0002956796,0.7347072,0.038187087,0.20396107,0.0008957788,0.015667152],"study_design_scores_gemma":[0.0000031738844,0.00001340728,0.00046462068,0.0000036670385,0.0000035875103,0.00005292577,0.000010790294,0.9896952,0.0033605213,0.006111166,0.00027378107,0.00000718853],"about_ca_topic_score_codex":0.0019996357,"about_ca_topic_score_gemma":0.0013098769,"teacher_disagreement_score":0.0019996357,"about_ca_system_score_codex":0.0012887843,"about_ca_system_score_gemma":0.0003209925,"threshold_uncertainty_score":0.009350836},"labels":[],"label_agreement":null},{"id":"W2114997074","doi":"10.1109/acssc.2005.1599845","title":"Stochastic Implementation of LDPC Decoders","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; McGill University","funders":"","keywords":"Stratix; Computer science; Low-density parity-check code; Field-programmable gate array; Decoding methods; Factor graph; Throughput; WiMAX; Soft-decision decoder; Forward error correction; Parallel computing; Algorithm; Computer hardware; Wireless; Telecommunications","score_opus":0.009162287173892447,"score_gpt":0.2878477871638672,"score_spread":0.27868549998997477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114997074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016053839,0.00029730212,0.9741383,0.00012511188,0.000049423496,0.00004525491,0.00009623117,0.0014181341,0.0077764047],"genre_scores_gemma":[0.53620315,0.0008177754,0.4529525,0.00023120877,0.000072296025,0.00017565097,0.00035694288,0.00013569606,0.009054673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989372,0.00025078809,0.00005808561,0.000116892974,0.00053344434,0.000103575265],"domain_scores_gemma":[0.99908066,0.00032907567,0.000084175066,0.00016231438,0.0003143112,0.000029467885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047567015,0.00042687144,0.00040013454,0.00044216157,0.00040812037,0.0007234711,0.0006906705,0.0005875785,0.0023659405],"category_scores_gemma":[0.0018422692,0.00025444056,0.00032048277,0.0005540649,0.00042580505,0.000552475,0.0004678462,0.0006926229,0.0009138493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022261836,0.00008494862,0.0009404237,0.00027523143,0.00008836797,0.00025469193,0.00018561608,0.4497755,0.062999055,0.28568515,0.0040028547,0.19548541],"study_design_scores_gemma":[0.000035159428,0.00010406233,0.00022789577,0.00003513335,0.000021693097,0.00025493975,0.00001327473,0.9092655,0.04303443,0.028878026,0.018097272,0.00003260895],"about_ca_topic_score_codex":0.0019100233,"about_ca_topic_score_gemma":0.0022176607,"teacher_disagreement_score":0.0023659405,"about_ca_system_score_codex":0.000735767,"about_ca_system_score_gemma":0.0011504232,"threshold_uncertainty_score":0.007914901},"labels":[],"label_agreement":null},{"id":"W2115515841","doi":"10.1109/iccsc.2008.15","title":"High Throughput Parallel Decoder Design for LDPC Convolutional Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Parallel computing; Throughput; Soft-decision decoder; Convolutional code; Code (set theory); Dimension (graph theory); Node (physics); Serial concatenated convolutional codes; Decoding methods; Concatenated error correction code; Algorithm; Block code; Mathematics; Telecommunications","score_opus":0.07444156334132539,"score_gpt":0.2891477881057698,"score_spread":0.2147062247644444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115515841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06477338,0.00038250178,0.92568374,0.00018866052,0.00007346766,0.00014253723,0.0002665967,0.0017884603,0.006700621],"genre_scores_gemma":[0.527172,0.00037818117,0.46226308,0.00013819856,0.00007513818,0.00027716142,0.00056933233,0.00019135073,0.008935531],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950814,0.00007690524,0.000028742705,0.00008983453,0.00025532726,0.00004110721],"domain_scores_gemma":[0.9992914,0.0001834367,0.00009290048,0.00012874826,0.0002688339,0.00003456433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003615723,0.00062093226,0.00056685734,0.00043166117,0.0004610801,0.000539602,0.0007169761,0.0004891034,0.0018439464],"category_scores_gemma":[0.0010387393,0.00028456622,0.00026144495,0.0006055263,0.0003276349,0.00066322216,0.00049927155,0.0005995904,0.0007958297],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077909406,0.00023894905,0.0019787962,0.0004819608,0.0001979939,0.0005681189,0.00018423586,0.32951528,0.39892396,0.05043312,0.0068229255,0.2098756],"study_design_scores_gemma":[0.000089120156,0.00016637995,0.0004628233,0.00001777182,0.000057940844,0.00035780482,0.000014850071,0.794213,0.18816516,0.007953806,0.008470234,0.000031052976],"about_ca_topic_score_codex":0.0014764006,"about_ca_topic_score_gemma":0.003501558,"teacher_disagreement_score":0.0018439464,"about_ca_system_score_codex":0.00084100594,"about_ca_system_score_gemma":0.0014503656,"threshold_uncertainty_score":0.0061686635},"labels":[],"label_agreement":null},{"id":"W2115825742","doi":"10.1109/tcomm.2006.869865","title":"Reliability-based coded modulation with low-density parity-check codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Demodulation; Decoding methods; Algorithm; Raptor code; Computer science; Coding (social sciences); Turbo code; Modulation (music); Bit error rate; Error detection and correction; Electronic engineering; Mathematics; Statistics; Telecommunications; Error floor; Engineering","score_opus":0.01966030584582169,"score_gpt":0.26426229313043303,"score_spread":0.24460198728461136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115825742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090166345,0.0013038706,0.9007663,0.00043448657,0.00010031021,0.0000650701,0.000036047844,0.00018097798,0.0069466094],"genre_scores_gemma":[0.8480115,0.00065911625,0.14959629,0.00011192661,0.00007897116,0.000064096406,0.000031267064,0.000022508066,0.0014242681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.00026388827,0.000022059805,0.000044772594,0.00026407282,0.000056431432],"domain_scores_gemma":[0.99854773,0.00082603836,0.00016024361,0.00018840373,0.00025286357,0.000024691542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080818794,0.00050767796,0.00043253665,0.00041362437,0.00028714383,0.0005827423,0.0006907778,0.0007618382,0.0005425637],"category_scores_gemma":[0.0041124304,0.00017297849,0.00021283825,0.00047194006,0.0008136375,0.0008021291,0.0005212322,0.0006127917,0.00027565495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028781284,0.00007183247,0.001371734,0.0003608484,0.000056989036,0.0005010467,0.00023824324,0.6254845,0.04197717,0.2603459,0.0009912072,0.06831273],"study_design_scores_gemma":[0.000029926314,0.00014133057,0.00015007031,0.000027327776,0.000022495642,0.00021494264,0.000013781507,0.957941,0.013732722,0.025939653,0.0017675869,0.00001910858],"about_ca_topic_score_codex":0.0004863655,"about_ca_topic_score_gemma":0.0004970154,"teacher_disagreement_score":0.00080818794,"about_ca_system_score_codex":0.00042239594,"about_ca_system_score_gemma":0.00044179673,"threshold_uncertainty_score":0.0042741895},"labels":[],"label_agreement":null},{"id":"W2115973658","doi":"10.1109/icc.2011.5962486","title":"Raptor Coding for Non-Orthogonal Multiple Access Channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Decoding methods; Channel (broadcasting); Single antenna interference cancellation; Computer network; Digital Video Broadcasting; Coding (social sciences); Interference (communication); Channel capacity; Raptor code; Telecommunications; Concatenated error correction code; Block code; Mathematics","score_opus":0.10624332927409423,"score_gpt":0.3146883759725378,"score_spread":0.20844504669844355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115973658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009593645,0.0027131233,0.98005694,0.0003439019,0.00014114512,0.00007150322,0.00008003355,0.00038250058,0.0066171978],"genre_scores_gemma":[0.47236776,0.0042196787,0.5142495,0.0005628994,0.00033894513,0.00051522657,0.00026840178,0.00010629157,0.007371322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873203,0.0005382713,0.000051333394,0.00013210117,0.00041919056,0.00012712614],"domain_scores_gemma":[0.99781466,0.0012457257,0.00020358985,0.00038520386,0.0003170745,0.00003363485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402893,0.0007975948,0.00065630244,0.0007013171,0.00072270277,0.0009557547,0.0010592595,0.0010173392,0.0019782712],"category_scores_gemma":[0.0035048136,0.00032293552,0.000449774,0.00073139847,0.0010729914,0.0010940447,0.0010077438,0.0011243417,0.0008930274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030713037,0.00007511241,0.00039169428,0.00078235235,0.00010718206,0.0009431622,0.00044993838,0.18453774,0.028969103,0.5404112,0.0065819826,0.23644353],"study_design_scores_gemma":[0.00006999224,0.00019733942,0.00021313604,0.00013667166,0.000072870556,0.0010906425,0.000053109085,0.80586094,0.019762905,0.14669998,0.02574797,0.000094482435],"about_ca_topic_score_codex":0.000870649,"about_ca_topic_score_gemma":0.0010719646,"teacher_disagreement_score":0.0019782712,"about_ca_system_score_codex":0.0004930506,"about_ca_system_score_gemma":0.00081388024,"threshold_uncertainty_score":0.006618023},"labels":[],"label_agreement":null},{"id":"W2116173156","doi":"10.1109/iwsoc.2005.109","title":"Turbo codes - digital IC design","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Turbo code; Encoder; Application-specific integrated circuit; Turbo; Computer hardware; CMOS; Block (permutation group theory); Latency (audio); Throughput; Network packet; Embedded system; Electronic engineering; Decoding methods; Engineering; Algorithm; Computer network; Telecommunications; Wireless","score_opus":0.024055837820567888,"score_gpt":0.25279252628483545,"score_spread":0.22873668846426756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116173156","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016432334,0.0024533316,0.92429066,0.00040769126,0.00039988014,0.00024059335,0.00023265975,0.003301605,0.05224113],"genre_scores_gemma":[0.5235024,0.002788037,0.4266188,0.0006021394,0.00018537516,0.00026720154,0.00044019354,0.0003545697,0.045241386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995763,0.0000753589,0.000018344726,0.000045028733,0.00024950004,0.000035478068],"domain_scores_gemma":[0.999524,0.00010040695,0.00002828769,0.0000743652,0.00025635606,0.000016706203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027279992,0.0004214405,0.00027963318,0.00046787676,0.0002979238,0.00073942216,0.00078814646,0.00075541175,0.006044061],"category_scores_gemma":[0.0010092325,0.00020163492,0.00033703618,0.0004215484,0.0004107473,0.0006832975,0.00026175173,0.00049730495,0.0023328897],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002665396,0.000066331326,0.0014666672,0.0009421377,0.00013944402,0.00059648853,0.00022886434,0.2564364,0.099459164,0.14975633,0.01957854,0.47106305],"study_design_scores_gemma":[0.00006505081,0.00068692246,0.0008428354,0.00014627907,0.00012928869,0.0020132477,0.000052961237,0.6077129,0.14116141,0.028632302,0.21848947,0.00006730913],"about_ca_topic_score_codex":0.0013270349,"about_ca_topic_score_gemma":0.0017758766,"teacher_disagreement_score":0.006044061,"about_ca_system_score_codex":0.0007379709,"about_ca_system_score_gemma":0.00079760695,"threshold_uncertainty_score":0.020219386},"labels":[],"label_agreement":null},{"id":"W2116381650","doi":"10.1109/issse.2007.4294441","title":"Powerful LDPC Codes for Broadband Wireless Networks: High-performance Code Construction and High-speed Encoder/Decoder Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Low-density parity-check code; Computer science; Encoder; Decoding methods; Forward error correction; Throughput; Parity-check matrix; Concatenated error correction code; Code (set theory); Field-programmable gate array; Error detection and correction; Block code; Algorithm; Wireless; Parallel computing; Computer hardware; Telecommunications","score_opus":0.016201328850415028,"score_gpt":0.2526243120765192,"score_spread":0.23642298322610417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116381650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009249745,0.0014098185,0.984521,0.00018679963,0.000058842492,0.00006361784,0.00004762139,0.00035121434,0.0041112425],"genre_scores_gemma":[0.14045031,0.0031667985,0.8508032,0.0001240866,0.00011085056,0.00017197909,0.00022846951,0.00012267745,0.004821578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.00012998775,0.000021999584,0.00004807525,0.00019149904,0.000029503788],"domain_scores_gemma":[0.99947447,0.00020971078,0.000067550645,0.00009879591,0.00013301279,0.000016483078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004518472,0.00052691135,0.00031934603,0.0005931635,0.00037146173,0.00063182553,0.00048355004,0.00071321195,0.001321449],"category_scores_gemma":[0.0013924814,0.0003154691,0.00027308616,0.0007129476,0.000617411,0.00094594795,0.0005555051,0.0009012003,0.00076446135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015684425,0.00007813922,0.00079938973,0.0007550331,0.000052289262,0.0004391673,0.00036116637,0.10936349,0.14612146,0.34404036,0.0045531155,0.39327952],"study_design_scores_gemma":[0.000072634,0.00024626378,0.00069391937,0.00016051243,0.00007183038,0.0018469088,0.00006467204,0.53904223,0.28359255,0.083072595,0.09101161,0.00012428386],"about_ca_topic_score_codex":0.00042113048,"about_ca_topic_score_gemma":0.00063552125,"teacher_disagreement_score":0.001321449,"about_ca_system_score_codex":0.0005213987,"about_ca_system_score_gemma":0.0005956875,"threshold_uncertainty_score":0.004420638},"labels":[],"label_agreement":null},{"id":"W2116941076","doi":"10.1109/ccece.2008.4564647","title":"A new criterion to compare different LDPC codes for hardware implementation","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Low-density parity-check code; Computer science; Forward error correction; Parallel computing; Computer architecture; Computer hardware; Computer engineering; Decoding methods; Algorithm","score_opus":0.029931355738925695,"score_gpt":0.25851880776135255,"score_spread":0.22858745202242686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116941076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02370571,0.00039166136,0.970617,0.00014313,0.00012890162,0.000111263726,0.00011695643,0.00055696786,0.0042283908],"genre_scores_gemma":[0.35258764,0.00017790048,0.64463377,0.000110736946,0.000118237,0.00023918894,0.00042857803,0.00026748795,0.0014364426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9915916,0.0024388493,0.0007415809,0.0006377044,0.0043245517,0.0002655712],"domain_scores_gemma":[0.98673415,0.0058059758,0.0009846743,0.001778266,0.0042586457,0.00043834667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037755303,0.0010374888,0.00129041,0.0041286084,0.0008842524,0.0022067388,0.0011894747,0.0014061922,0.0021168694],"category_scores_gemma":[0.01615682,0.00030334134,0.0007845691,0.0022120462,0.0021113337,0.003005037,0.0022891064,0.0013581871,0.00094735005],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010864371,0.00022620622,0.018613178,0.0009880243,0.0005073425,0.00051799073,0.00050692365,0.12555419,0.13520862,0.18659629,0.005326519,0.52486825],"study_design_scores_gemma":[0.00014538177,0.0018388269,0.013767526,0.00019972557,0.0003000373,0.0028430445,0.00039205793,0.70625746,0.10668973,0.13408427,0.033079937,0.00040203758],"about_ca_topic_score_codex":0.0003183757,"about_ca_topic_score_gemma":0.0003938809,"teacher_disagreement_score":0.0041286084,"about_ca_system_score_codex":0.00086823036,"about_ca_system_score_gemma":0.0009929007,"threshold_uncertainty_score":0.019967198},"labels":[],"label_agreement":null},{"id":"W2117147358","doi":"10.1109/icc.1991.162274","title":"Efficient ARQ schemes for point-to-multipoint communication","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute for Materials Science","keywords":"Additive white Gaussian noise; Decoding methods; Computer science; Channel (broadcasting); Algorithm; Automatic repeat request; Selective Repeat ARQ; Hybrid automatic repeat request; Rayleigh fading; Forward error correction; Binary symmetric channel; Error detection and correction; Throughput; Binary number; Fading; Computer network; Mathematics; Wireless; Telecommunications; Arithmetic; Low-density parity-check code; Telecommunications link","score_opus":0.0346465515536406,"score_gpt":0.277372398854377,"score_spread":0.24272584730073637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117147358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042487342,0.0025129572,0.94805837,0.00028336872,0.0001351122,0.00012169791,0.000121453384,0.0007804224,0.005499169],"genre_scores_gemma":[0.62332726,0.0027567225,0.36387283,0.0001599534,0.00021024424,0.00020107625,0.00025531842,0.00006338771,0.009153198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989868,0.00035226304,0.000031875676,0.00007833646,0.0004613126,0.00008931727],"domain_scores_gemma":[0.99811566,0.00096997124,0.0001755659,0.00029552658,0.00042244958,0.000020846352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398297,0.0006653341,0.000565009,0.00064354885,0.00057026214,0.000667755,0.0012031776,0.00073358894,0.003457499],"category_scores_gemma":[0.0025848143,0.00023035951,0.00025868823,0.0007827433,0.000547735,0.0011432224,0.0005798648,0.0006406305,0.0011656748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046598425,0.00019977317,0.0007180123,0.000404323,0.00010271137,0.0005222438,0.0005141419,0.34663987,0.09041958,0.18238904,0.007418775,0.37020558],"study_design_scores_gemma":[0.00006534888,0.0002698241,0.00027300365,0.00003093913,0.00003031254,0.00042033393,0.0000612343,0.94353855,0.020842643,0.026480043,0.007941398,0.0000463488],"about_ca_topic_score_codex":0.0011625893,"about_ca_topic_score_gemma":0.0017150881,"teacher_disagreement_score":0.003457499,"about_ca_system_score_codex":0.00054428226,"about_ca_system_score_gemma":0.00044762596,"threshold_uncertainty_score":0.01156646},"labels":[],"label_agreement":null},{"id":"W2118083070","doi":"10.1109/tcsi.2004.838266","title":"FPGA design and implementation of a low-power systolic array-based adaptive Viterbi decoder","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Viterbi decoder; Viterbi algorithm; Soft output Viterbi algorithm; Computer science; Field-programmable gate array; Iterative Viterbi decoding; Parallel computing; Gate array; Algorithm; Soft-decision decoder; Sequential decoding; Convolutional code; Decoding methods; Computer hardware","score_opus":0.021154444329782134,"score_gpt":0.2785693925274865,"score_spread":0.2574149481977044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118083070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097421266,0.0008685236,0.8803356,0.00024829758,0.0002895428,0.00022053966,0.0002740076,0.005883527,0.014458715],"genre_scores_gemma":[0.5818749,0.00046824722,0.40738943,0.00021280278,0.000086266096,0.00012599074,0.00040047467,0.00009122122,0.009350595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999879,0.000019110266,0.000008552999,0.00002214421,0.000049845858,0.000021276186],"domain_scores_gemma":[0.9998733,0.000031826592,0.000013858919,0.000016290258,0.000054001386,0.000010711119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001512026,0.00031834294,0.0002479108,0.00038583862,0.00018604526,0.00044491992,0.00080646854,0.00027479374,0.002854036],"category_scores_gemma":[0.00030608723,0.00019496142,0.00016889448,0.0002452158,0.00010911083,0.0002805007,0.000115297255,0.00030208274,0.0009803766],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072272564,0.0001731063,0.002616712,0.000378122,0.00014616993,0.00061695854,0.0001357046,0.08850084,0.36034656,0.011735875,0.007965025,0.5266622],"study_design_scores_gemma":[0.00032044286,0.0014689866,0.0038369766,0.000059585826,0.000145928,0.0014768272,0.000046554156,0.678842,0.26312694,0.0019294037,0.04867524,0.00007112845],"about_ca_topic_score_codex":0.0016478844,"about_ca_topic_score_gemma":0.0023054706,"teacher_disagreement_score":0.002854036,"about_ca_system_score_codex":0.00036944592,"about_ca_system_score_gemma":0.000686347,"threshold_uncertainty_score":0.00954777},"labels":[],"label_agreement":null},{"id":"W2118114660","doi":"10.1109/cwit.2011.5872111","title":"Design of multi-edge-type LDPC codes for high-order coded modulation","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Algorithm; Quadrature amplitude modulation; QAM; Decoding methods; Computer science; Enhanced Data Rates for GSM Evolution; Modulation (music); Bit error rate; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics","score_opus":0.0966450070941632,"score_gpt":0.29902760019323005,"score_spread":0.20238259309906687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118114660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019106448,0.00008976143,0.9788087,0.00004731963,0.000012839076,0.000035135196,0.000028219218,0.00010754825,0.001764004],"genre_scores_gemma":[0.3653682,0.000184201,0.6323306,0.000059489706,0.000017360257,0.00019092452,0.00009554463,0.00006269347,0.0016909441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.00015855448,0.000019259767,0.00004850242,0.00014847502,0.000031024654],"domain_scores_gemma":[0.9993267,0.00026629955,0.00010059644,0.00008831566,0.00018341484,0.000034690118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000618332,0.0005253817,0.0003702973,0.00035369847,0.00031730303,0.00044774715,0.0006025758,0.0006454142,0.0007468709],"category_scores_gemma":[0.0017179332,0.00029559026,0.0002821535,0.00037830343,0.00051183277,0.00041712885,0.0005294222,0.0007071529,0.00038656205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013090772,0.00006781838,0.0008270373,0.00012899414,0.00004429833,0.00011581103,0.00019256747,0.730593,0.071145415,0.11901727,0.000983492,0.07675333],"study_design_scores_gemma":[0.000010969533,0.00004176643,0.00009587979,0.0000113310925,0.000004929309,0.0000460264,0.000006364871,0.9787209,0.0114188045,0.00821903,0.0014109944,0.000012931668],"about_ca_topic_score_codex":0.00050121825,"about_ca_topic_score_gemma":0.0009891697,"teacher_disagreement_score":0.0007468709,"about_ca_system_score_codex":0.00064504833,"about_ca_system_score_gemma":0.0007494182,"threshold_uncertainty_score":0.004680097},"labels":[],"label_agreement":null},{"id":"W2118552966","doi":"10.1109/tit.2010.2053873","title":"Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Low-density parity-check code; Turbo code; Mathematics; Upper and lower bounds; Concatenated error correction code; Bounding overwatch; Discrete mathematics; Combinatorics; Algorithm; Block code; Computer science; Decoding methods","score_opus":0.006618558313170579,"score_gpt":0.23229913271338398,"score_spread":0.2256805744002134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118552966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13088754,0.0061707767,0.83694303,0.0011794375,0.00020702428,0.000061220955,0.0005437531,0.00053019496,0.02347703],"genre_scores_gemma":[0.8704684,0.0028780568,0.11579217,0.00039312177,0.00016790464,0.0001737716,0.00070084207,0.00023827695,0.009187534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985851,0.00021285476,0.00009018383,0.00027771425,0.000619567,0.00021452809],"domain_scores_gemma":[0.9877537,0.008221245,0.0009834819,0.001271684,0.0013489703,0.0004209705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542194,0.0010329093,0.0007229852,0.00149758,0.0007748754,0.0015598179,0.0017883477,0.001346919,0.0028803428],"category_scores_gemma":[0.013360162,0.0004430945,0.0005480285,0.0012519099,0.0016715092,0.0029257804,0.0025215717,0.002836677,0.0006329245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007785171,0.00010563792,0.0021863764,0.00067015924,0.000100707395,0.00045167832,0.000667833,0.29399452,0.05012478,0.5346419,0.0039288406,0.11234911],"study_design_scores_gemma":[0.000033959586,0.00019896346,0.0013836985,0.00012272532,0.000051355106,0.0004995072,0.00011938007,0.64343023,0.03370454,0.3141179,0.0062253396,0.000112417474],"about_ca_topic_score_codex":0.0010868809,"about_ca_topic_score_gemma":0.0011600091,"teacher_disagreement_score":0.0028803428,"about_ca_system_score_codex":0.002165725,"about_ca_system_score_gemma":0.0011470579,"threshold_uncertainty_score":0.015713453},"labels":[],"label_agreement":null},{"id":"W2118847369","doi":"10.1109/ccece.2007.233","title":"Fixed-Rate Raptor Code Performance Over Correlated Rayleigh Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Raptor code; Rayleigh fading; Turbo code; Computer science; Decoding methods; Algorithm; Serial concatenated convolutional codes; Concatenated error correction code; Block code","score_opus":0.01765054697915327,"score_gpt":0.2620232174229932,"score_spread":0.24437267044383995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118847369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95400155,0.0010358986,0.040373653,0.00011431161,0.000019394249,0.000023906166,0.00015313106,0.00035223283,0.003925967],"genre_scores_gemma":[0.9956644,0.00034235802,0.0036604537,0.000014407488,0.000005561313,0.000007912743,0.0000423353,0.000020119865,0.0002423703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981894,0.00073411077,0.00007168046,0.00018850161,0.0005736036,0.00024286052],"domain_scores_gemma":[0.98915756,0.00681791,0.00096604315,0.0010436794,0.0018687415,0.00014602467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016966107,0.001043482,0.0010626302,0.00072825793,0.0005607605,0.00088887016,0.0006735852,0.0009768743,0.0005912328],"category_scores_gemma":[0.009114269,0.00025032254,0.00035623973,0.0011263142,0.0013971606,0.0012295371,0.0005919893,0.00047268343,0.00022140055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050917687,0.00003931877,0.0024309428,0.00013485707,0.00011465983,0.00040178647,0.0001042709,0.96636826,0.0143945385,0.0028832846,0.00027765296,0.01234115],"study_design_scores_gemma":[0.000043280586,0.00062910153,0.0020596327,0.000036897327,0.00011842318,0.00076033175,0.00008465527,0.93364644,0.060375825,0.0018992367,0.00028003313,0.00006614561],"about_ca_topic_score_codex":0.0036683239,"about_ca_topic_score_gemma":0.002266386,"teacher_disagreement_score":0.0036683239,"about_ca_system_score_codex":0.00081676414,"about_ca_system_score_gemma":0.00094088103,"threshold_uncertainty_score":0.008972645},"labels":[],"label_agreement":null},{"id":"W2118903319","doi":"10.1109/isit.2009.5205618","title":"Asynchronous Slepian-Wolf code design","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Low-density parity-check code; Distributed source coding; Encoder; Asynchronous communication; Variable-length code; Algorithm; Block code; Source code; Theoretical computer science; Coding (social sciences); Code (set theory); Shannon–Fano coding; Randomness; Decoding methods; Mathematics; Computer network","score_opus":0.02886858764964444,"score_gpt":0.2754180029006428,"score_spread":0.24654941525099833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118903319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016932229,0.00016472275,0.9793711,0.00009155646,0.000027854949,0.000050852526,0.000044807486,0.00012843714,0.0031883654],"genre_scores_gemma":[0.52747166,0.0004489023,0.4673439,0.00016916217,0.00007264516,0.0002754549,0.00015035828,0.000052799747,0.0040150867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993531,0.00020937479,0.000033117034,0.00011946051,0.00022978443,0.00005509795],"domain_scores_gemma":[0.9990276,0.00029977667,0.00012961065,0.00020529935,0.00028456876,0.00005327389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518608,0.0005356266,0.00038060063,0.0005214822,0.00041493966,0.0006061693,0.00095706724,0.00072338805,0.0011192573],"category_scores_gemma":[0.0014890126,0.00017761129,0.0002390246,0.0005625614,0.00059527287,0.00083865883,0.000572105,0.0006742921,0.00040823958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040229375,0.00009248715,0.0014498585,0.0002842869,0.000054182754,0.0006109778,0.00032580603,0.24704374,0.10976914,0.4828495,0.00288377,0.15423395],"study_design_scores_gemma":[0.00005734278,0.00016310095,0.00017097592,0.00003323769,0.000021067566,0.00042421804,0.000025183237,0.85785383,0.06484508,0.06659295,0.009772082,0.000040877407],"about_ca_topic_score_codex":0.0003549732,"about_ca_topic_score_gemma":0.0003743919,"teacher_disagreement_score":0.0011192573,"about_ca_system_score_codex":0.0005110172,"about_ca_system_score_gemma":0.00070602057,"threshold_uncertainty_score":0.0037443042},"labels":[],"label_agreement":null},{"id":"W2119412051","doi":"10.1109/ciss.2006.286585","title":"A New Fast Density Evolution Method for LDPC Codes Using Higher Order Statistics","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Algorithm; Bipartite graph; Gaussian; Computer science; Code (set theory); Matching (statistics); Decoding methods; Message passing; Mathematics; Graph; Theoretical computer science; Statistics; Parallel computing","score_opus":0.02785267376776435,"score_gpt":0.32364583902632976,"score_spread":0.2957931652585654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119412051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011885016,0.000056784196,0.9982528,0.00003017086,0.000014219273,0.000012218459,0.00001503048,0.00010736603,0.0003229031],"genre_scores_gemma":[0.055536952,0.00025190838,0.93957496,0.00007297179,0.00003938207,0.00014591079,0.00015428528,0.00013407569,0.004089579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996674,0.00009254602,0.000012472331,0.000042327603,0.00016668136,0.000018463032],"domain_scores_gemma":[0.99931455,0.00038306264,0.00005150224,0.00006688763,0.00016138755,0.00002263864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251727,0.0005092213,0.0005462796,0.00071373314,0.00041598146,0.0004931561,0.0007678578,0.0007053626,0.0017932891],"category_scores_gemma":[0.0025261021,0.00032026347,0.00050189183,0.0008043438,0.00055248546,0.0009838224,0.00064430764,0.0011049554,0.0007165467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009177752,0.00006246662,0.0007935388,0.00017215378,0.000055199827,0.00012624706,0.00019034573,0.4865129,0.018389437,0.14415511,0.0035705415,0.34588033],"study_design_scores_gemma":[0.0000059926165,0.000009769034,0.000062996165,0.0000053211875,0.0000026829587,0.00003448013,0.0000034143075,0.9905219,0.0013040368,0.0060026636,0.0020387084,0.000008059087],"about_ca_topic_score_codex":0.0031398986,"about_ca_topic_score_gemma":0.0034125294,"teacher_disagreement_score":0.0031398986,"about_ca_system_score_codex":0.0007048102,"about_ca_system_score_gemma":0.0011591696,"threshold_uncertainty_score":0.0062432885},"labels":[],"label_agreement":null},{"id":"W2119420182","doi":"10.1109/icc.2007.116","title":"An Efficient Analysis of Finite-Length LDPC Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Code word; Decoding methods; Algorithm; Concatenated error correction code; Channel (broadcasting); Computer science; Mathematics; Block (permutation group theory); Parity-check matrix; Block code; Telecommunications; Combinatorics","score_opus":0.015639497302249516,"score_gpt":0.3026015579986918,"score_spread":0.2869620606964423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119420182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010526066,0.00021375428,0.9870782,0.000046717418,0.000013307988,0.00003666738,0.00010679618,0.0002414464,0.001737052],"genre_scores_gemma":[0.42368504,0.0011283893,0.5678817,0.000078513905,0.000079142825,0.00038495066,0.00074747676,0.00029794508,0.0057168235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00017466552,0.000024826264,0.00005287836,0.00037312115,0.000046924626],"domain_scores_gemma":[0.99851817,0.00081106124,0.00010514977,0.00021329301,0.00032392054,0.000028441562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005293377,0.0006884775,0.0006489915,0.0012307755,0.00049106235,0.00071000867,0.00077759643,0.00043911627,0.001733103],"category_scores_gemma":[0.00362225,0.00031453598,0.00063055527,0.00077152404,0.0005932118,0.0009822045,0.00061956194,0.0008865074,0.00066861854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044940905,0.000030300766,0.00079873804,0.00018837395,0.00004635612,0.0002903412,0.00011780195,0.7519264,0.02160876,0.14813466,0.001329731,0.075483546],"study_design_scores_gemma":[0.0000032157818,0.000008141435,0.0001362769,0.000010948062,0.0000050196445,0.00004423398,0.000004887207,0.9686603,0.0035558701,0.02643463,0.0011277907,0.000008677098],"about_ca_topic_score_codex":0.0018941595,"about_ca_topic_score_gemma":0.0018835139,"teacher_disagreement_score":0.0018941595,"about_ca_system_score_codex":0.0009539888,"about_ca_system_score_gemma":0.0013416288,"threshold_uncertainty_score":0.0069217086},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009495993991673227,"score_gpt":0.22409884733800917,"score_spread":0.21460285334633594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119604283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778673,0.00084348273,0.20781939,0.00046489984,0.000059917413,0.000046911726,0.00021711546,0.00025521315,0.012425773],"genre_scores_gemma":[0.97990626,0.0007675511,0.017827088,0.00006268396,0.000041923155,0.000041503627,0.00012744176,0.00005237082,0.0011731245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995684,0.00010054902,0.00001528858,0.00007287752,0.0001502646,0.00009270768],"domain_scores_gemma":[0.99648994,0.0023784162,0.00033192543,0.00043403308,0.00020603037,0.0001596796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049944955,0.00040523388,0.00035182128,0.0009688063,0.00045001347,0.0005531779,0.0004893811,0.0004532166,0.0013470935],"category_scores_gemma":[0.0048019188,0.00027339044,0.00031610072,0.0006710469,0.0013539142,0.0010431961,0.0010493321,0.001045007,0.00024334606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048271762,0.00008001968,0.0069497447,0.0003825507,0.00007703281,0.00055909995,0.0008413575,0.56506693,0.08080284,0.29216015,0.0014421334,0.05115539],"study_design_scores_gemma":[0.000037337402,0.00028447728,0.0046771653,0.000101629186,0.000045498604,0.00062803295,0.00017601141,0.6525343,0.028999854,0.3086627,0.0037816889,0.00007128255],"about_ca_topic_score_codex":0.00065864186,"about_ca_topic_score_gemma":0.0007598512,"teacher_disagreement_score":0.0013470935,"about_ca_system_score_codex":0.0007543963,"about_ca_system_score_gemma":0.0005587797,"threshold_uncertainty_score":0.0054736137},"labels":[],"label_agreement":null},{"id":"W2119852332","doi":"10.1109/glocom.2007.301","title":"Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Erasure; Binary erasure channel; Computer science; Algorithm; Binary number; Erasure code; Theoretical computer science; Code (set theory); Decoding methods; Mathematics; Channel capacity; Channel (broadcasting); Arithmetic; Computer network","score_opus":0.04368098598646759,"score_gpt":0.30152507183351335,"score_spread":0.25784408584704577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119852332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036816318,0.00016131486,0.96092016,0.00013371125,0.000037995316,0.000041631112,0.00005012781,0.00014910352,0.0016895974],"genre_scores_gemma":[0.7201966,0.0002468053,0.2780889,0.00009681566,0.000032879485,0.00017918946,0.00008685861,0.00004976818,0.001022211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.00028316907,0.000037783862,0.000091082606,0.00028018758,0.00007080679],"domain_scores_gemma":[0.9983348,0.0008070802,0.00029576576,0.00025284267,0.00025130273,0.000058215574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087073154,0.0004240034,0.0004830028,0.0004454846,0.00043676927,0.00053960306,0.00063807727,0.00050871674,0.0005755257],"category_scores_gemma":[0.0034337365,0.00031503718,0.00034884477,0.00037625968,0.00077197194,0.00042862096,0.00077210215,0.0006024529,0.00017125005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011309745,0.00005639199,0.0013211007,0.00015633638,0.00005189953,0.00008437262,0.00009828505,0.8339906,0.016654516,0.098207764,0.0008322785,0.04843348],"study_design_scores_gemma":[0.000016697595,0.000039661085,0.000118205295,0.00000767182,0.000008543056,0.000036418594,0.0000060035377,0.9833098,0.0055944882,0.010032546,0.0008173346,0.000012604524],"about_ca_topic_score_codex":0.00054607604,"about_ca_topic_score_gemma":0.0008874738,"teacher_disagreement_score":0.00087073154,"about_ca_system_score_codex":0.00054449396,"about_ca_system_score_gemma":0.00093065435,"threshold_uncertainty_score":0.0046049356},"labels":[],"label_agreement":null},{"id":"W2119910218","doi":"10.1109/glocom.2007.855","title":"Reduced Complexity Distributed Base Station Processing in the Uplink of Cellular Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Base station; Computer science; Telecommunications link; Belief propagation; Computational complexity theory; Message passing; Multiuser detection; Distributed algorithm; Communication complexity; Cellular network; Algorithm; Distributed computing; Computer network; Decoding methods; Code division multiple access","score_opus":0.04323867279825794,"score_gpt":0.29676786262207483,"score_spread":0.2535291898238169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119910218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026489232,0.0001271996,0.9725557,0.00007999001,0.0000129903665,0.000014714567,0.000009710185,0.0002070012,0.0005034993],"genre_scores_gemma":[0.5860485,0.00018710317,0.41238394,0.00008214019,0.000033277327,0.00006920038,0.000043576758,0.000027706683,0.0011245445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932194,0.00023307363,0.000016759454,0.00007711768,0.00029775087,0.00005334048],"domain_scores_gemma":[0.99884915,0.00058412366,0.00009699308,0.00021562816,0.00022213266,0.000031863325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069237704,0.00051494926,0.0006189378,0.0002448105,0.00025731538,0.00059146056,0.0009234925,0.00077484443,0.0005467771],"category_scores_gemma":[0.0025481367,0.0002817156,0.0002930818,0.00041154493,0.00055331027,0.0006627192,0.00050729845,0.00081321003,0.00025952864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015548585,0.000063072715,0.00074094866,0.00006621743,0.00006042687,0.00014012255,0.00009936945,0.88199246,0.018302828,0.014003879,0.00062860886,0.08374663],"study_design_scores_gemma":[0.000009424468,0.00003055899,0.00006191711,0.0000015168976,0.000006100506,0.000020419886,0.0000040643945,0.99506503,0.0031188263,0.0014854567,0.00019339753,0.0000033433244],"about_ca_topic_score_codex":0.0020957573,"about_ca_topic_score_gemma":0.001993827,"teacher_disagreement_score":0.0020957573,"about_ca_system_score_codex":0.00040902392,"about_ca_system_score_gemma":0.0006994488,"threshold_uncertainty_score":0.0041671395},"labels":[],"label_agreement":null},{"id":"W2119912755","doi":"10.1109/tcomm.2010.08.080181","title":"On the Dynamics of Analog Min-Sum Iterative Decoders: An Analytical Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Mathematics; Piecewise linear function; Applied mathematics; Singularity; Algorithm; Computer science; Mathematical analysis","score_opus":0.05127028002457988,"score_gpt":0.3201092435319665,"score_spread":0.2688389635073866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119912755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109202236,0.0011924825,0.8313887,0.001381303,0.00008704979,0.000047984184,0.00009090493,0.00024318375,0.056366187],"genre_scores_gemma":[0.95719147,0.0011441684,0.030963233,0.00019847673,0.000053014595,0.00004043351,0.00004033307,0.000064092266,0.010304722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984276,0.0000440223,0.0000043214477,0.000017992403,0.00006575814,0.000025086836],"domain_scores_gemma":[0.9995234,0.00026146794,0.00005781697,0.000041828687,0.000085708285,0.000029869276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003445632,0.00038141315,0.00036050222,0.00056345726,0.00040472025,0.00081604614,0.0006626564,0.0006341898,0.003348402],"category_scores_gemma":[0.0024024518,0.00024192978,0.00030853332,0.0003604098,0.0013091611,0.0013870603,0.0008322682,0.0007925474,0.00045730808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003608125,0.000026696853,0.00032236,0.00007374591,0.000009446752,0.00016889078,0.0002517195,0.34857756,0.0058925655,0.6348893,0.0009258781,0.008825634],"study_design_scores_gemma":[0.0000032641524,0.0000128256415,0.0000836478,0.00001330754,0.0000032131265,0.000087546105,0.000037955448,0.89535254,0.00083816616,0.10263127,0.00092831027,0.0000080172],"about_ca_topic_score_codex":0.0010981513,"about_ca_topic_score_gemma":0.0007604764,"teacher_disagreement_score":0.003348402,"about_ca_system_score_codex":0.0009878795,"about_ca_system_score_gemma":0.0004446634,"threshold_uncertainty_score":0.0112015605},"labels":[],"label_agreement":null},{"id":"W2120166835","doi":"10.1109/t-wc.2008.071178","title":"A limited feedback precoding system with hierarchical codebook and linear receiver","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Codebook; Precoding; Grassmannian; Code word; Computer science; Algorithm; Linde–Buzo–Gray algorithm; Computational complexity theory; Mathematics; MIMO; Theoretical computer science; Decoding methods; Telecommunications; Beamforming; Combinatorics","score_opus":0.04011613423583032,"score_gpt":0.2612570450754191,"score_spread":0.22114091083958876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120166835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043983817,0.00046611534,0.9511289,0.00014548791,0.00009710458,0.00010662686,0.000110538225,0.0003698468,0.003591599],"genre_scores_gemma":[0.78144294,0.00033066745,0.21263096,0.00013061978,0.000063407,0.000107008564,0.00015602504,0.000016408667,0.0051219594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00010983345,0.00002723234,0.000097530945,0.00016310664,0.000049082115],"domain_scores_gemma":[0.99966085,0.000103931605,0.00003939817,0.000061654704,0.00010588944,0.000028149221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033720265,0.00037233374,0.00054964,0.00021880418,0.0003241409,0.0004912578,0.0007245599,0.00054193515,0.0013760148],"category_scores_gemma":[0.00085758965,0.0001878696,0.00021626384,0.00054600864,0.00037248782,0.0007811052,0.00043745158,0.0004224235,0.00048068538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077906647,0.0001548953,0.002097282,0.0005465147,0.00016297496,0.0013296276,0.0004421875,0.48843095,0.18057922,0.08533697,0.004328422,0.23581192],"study_design_scores_gemma":[0.000067813235,0.00021832256,0.0004036284,0.000013499313,0.000029477396,0.00035227428,0.000029313287,0.9791779,0.010976948,0.0060867365,0.0026100588,0.000034109828],"about_ca_topic_score_codex":0.004201683,"about_ca_topic_score_gemma":0.005197096,"teacher_disagreement_score":0.004201683,"about_ca_system_score_codex":0.0006717501,"about_ca_system_score_gemma":0.0009777108,"threshold_uncertainty_score":0.008354425},"labels":[],"label_agreement":null},{"id":"W2121218984","doi":"10.1109/glocom.2010.5684111","title":"An Improvement on the Soft Reliability-Based Iterative Majority-Logic Decoding Algorithm for LDPC Codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Computer science; Reliability (semiconductor); Sequential decoding; Berlekamp–Welch algorithm; Computation; Turbo code; Computational complexity theory; Theoretical computer science; Block code; Error floor","score_opus":0.01931366501169681,"score_gpt":0.29960765242170906,"score_spread":0.28029398741001227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121218984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012374907,0.00019470019,0.98460037,0.000119644894,0.00004512731,0.000043059885,0.000031558007,0.00058320136,0.0020074467],"genre_scores_gemma":[0.22558981,0.0003419496,0.76978415,0.00018815884,0.0000986471,0.00008699758,0.00015497256,0.00020209822,0.0035532298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863225,0.00034281588,0.00007147909,0.00018064964,0.0006926059,0.000080258564],"domain_scores_gemma":[0.9982986,0.00060855894,0.00010230996,0.00036156471,0.00058827666,0.000040729483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018045,0.00068408565,0.00067546364,0.0007219752,0.00036462865,0.00068660645,0.0011841411,0.00077946816,0.0012614646],"category_scores_gemma":[0.004580693,0.00027713724,0.00054072775,0.00048886007,0.0005215443,0.00113211,0.0012810554,0.0013434157,0.0009708988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042572359,0.000149956,0.0014834026,0.00023763451,0.00013326212,0.00021152731,0.0003181559,0.2298513,0.081035264,0.07243838,0.00289354,0.61082184],"study_design_scores_gemma":[0.000041491738,0.00015873162,0.00031887053,0.000025174797,0.00004063651,0.0002167418,0.000013269513,0.9478192,0.034806196,0.011809294,0.0047113835,0.00003906343],"about_ca_topic_score_codex":0.0010733211,"about_ca_topic_score_gemma":0.0011586087,"teacher_disagreement_score":0.0012614646,"about_ca_system_score_codex":0.00040256407,"about_ca_system_score_gemma":0.0010011394,"threshold_uncertainty_score":0.005384028},"labels":[],"label_agreement":null},{"id":"W2121891947","doi":"10.1109/vetecs.2005.1543475","title":"A Simple form for the Two-Dimensional Q-function Suitable for Performance Evaluation of Communication Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Function (biology); Range (aeronautics); Gaussian; Set (abstract data type); Mathematics; Expression (computer science); Rational function; Gaussian integral; Gaussian function; Applied mathematics; Discrete mathematics; Computer science; Pure mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.057526562928274294,"score_gpt":0.3282645456521245,"score_spread":0.2707379827238502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121891947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018126076,0.0005048366,0.98961776,0.00026795515,0.00021383855,0.000044988425,0.000050964372,0.00019112835,0.007295942],"genre_scores_gemma":[0.20784202,0.0026052122,0.7693433,0.0010061978,0.00097534596,0.000444452,0.00025219706,0.00069213024,0.016839154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989905,0.00029861848,0.00006906473,0.00014044518,0.000435678,0.00006570873],"domain_scores_gemma":[0.99881184,0.00045089508,0.00007105042,0.00021560714,0.00040987178,0.00004081744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019519597,0.0012677418,0.00078230264,0.0012511375,0.0005723594,0.0017829727,0.0015211594,0.0015779892,0.005945695],"category_scores_gemma":[0.0063597756,0.00028555578,0.00072439865,0.0014207797,0.0011924476,0.0030125969,0.0011477475,0.0021772347,0.0029738545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057353885,0.00009760021,0.00039741953,0.00040701675,0.00003392856,0.00031513924,0.0002528126,0.043556247,0.02660476,0.82795596,0.011362083,0.08895964],"study_design_scores_gemma":[0.000036081183,0.0001448367,0.00052569085,0.00011956123,0.00004036425,0.0009536986,0.0001079672,0.53089,0.009773168,0.40226576,0.05503558,0.00010725795],"about_ca_topic_score_codex":0.0005138213,"about_ca_topic_score_gemma":0.0005072385,"teacher_disagreement_score":0.005945695,"about_ca_system_score_codex":0.00066327717,"about_ca_system_score_gemma":0.00090757734,"threshold_uncertainty_score":0.019890308},"labels":[],"label_agreement":null},{"id":"W2122211813","doi":"10.1109/isit.2006.261768","title":"Windowed Erasure Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Erasure; Overhead (engineering); List decoding; Computer science; Discrete mathematics; Algorithm; Mathematics; Combinatorics; Theoretical computer science; Block code; Concatenated error correction code","score_opus":0.007420644047564374,"score_gpt":0.22362146089511578,"score_spread":0.2162008168475514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122211813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11443989,0.003608736,0.8658008,0.00049732334,0.00039410047,0.00020246739,0.0016084429,0.0012437395,0.012204508],"genre_scores_gemma":[0.688502,0.004271505,0.28485787,0.0003206248,0.00030543972,0.00038430348,0.0016983874,0.00021136299,0.01944849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991774,0.0001292129,0.00007466369,0.0002202188,0.0002637955,0.00013467498],"domain_scores_gemma":[0.99829787,0.0005941649,0.00026669705,0.00044904358,0.0003054881,0.00008680642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068559166,0.0005512523,0.00064138614,0.0006745578,0.0004669326,0.0012214064,0.0009391838,0.00069571525,0.004093974],"category_scores_gemma":[0.0035095133,0.00038606304,0.0005766312,0.000807962,0.0007761798,0.0023314196,0.0011213783,0.0012232758,0.0015337003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013330948,0.0001241532,0.0019882594,0.0005159526,0.00011950623,0.00089087256,0.00033358787,0.16394278,0.09863822,0.53894615,0.007027563,0.18613991],"study_design_scores_gemma":[0.00013921538,0.00045906327,0.001702217,0.00017260476,0.000081291786,0.0011656617,0.000120339966,0.6158288,0.10920811,0.21967666,0.051286478,0.00015956434],"about_ca_topic_score_codex":0.0010695125,"about_ca_topic_score_gemma":0.0012405709,"teacher_disagreement_score":0.004093974,"about_ca_system_score_codex":0.00057805784,"about_ca_system_score_gemma":0.0008056317,"threshold_uncertainty_score":0.013695717},"labels":[],"label_agreement":null},{"id":"W2122593894","doi":"10.1109/iscas.2005.1465805","title":"Multi-Gbit/sec Low Density Parity Check Decoders with Reduced Interconnect Complexity","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"CMC Microsystems","keywords":"Interconnection; Computer science; Low-density parity-check code; Gigabit; Decoding methods; CMOS; Variable (mathematics); Parallel computing; Broadcasting (networking); Electronic engineering; Algorithm; Mathematics; Engineering; Computer network; Telecommunications","score_opus":0.045506377648560546,"score_gpt":0.2880845913483494,"score_spread":0.24257821369978885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122593894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6748105,0.0009915387,0.29886603,0.00047122457,0.00009490313,0.00012596362,0.0004291514,0.010558091,0.013652572],"genre_scores_gemma":[0.696573,0.00022137715,0.28862,0.00016144452,0.00004790778,0.000115944174,0.0004986606,0.00021177894,0.013549924],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976486,0.00003357445,0.000015714435,0.000039838225,0.00010411058,0.000041794403],"domain_scores_gemma":[0.99955887,0.00013098663,0.000077605175,0.00009677749,0.000101669175,0.000034200166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018486544,0.0003313481,0.0004118895,0.00062066835,0.00033569304,0.00045312586,0.0008679087,0.00043730316,0.0040105293],"category_scores_gemma":[0.0007192283,0.0003258329,0.00018270095,0.00057065906,0.00024787226,0.0006991039,0.00048803852,0.00045254483,0.0012548628],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008134501,0.00026867364,0.0034123738,0.00034044957,0.00006727785,0.00047135417,0.0001750378,0.059029188,0.6647655,0.013862774,0.0051638447,0.25163007],"study_design_scores_gemma":[0.00020076794,0.0007623392,0.0043090554,0.000033536624,0.00008761422,0.0008143014,0.000048632992,0.3889214,0.58412945,0.0039413753,0.016698161,0.000053369917],"about_ca_topic_score_codex":0.0013082711,"about_ca_topic_score_gemma":0.0056415955,"teacher_disagreement_score":0.0040105293,"about_ca_system_score_codex":0.0007685276,"about_ca_system_score_gemma":0.0006017172,"threshold_uncertainty_score":0.013416529},"labels":[],"label_agreement":null},{"id":"W2123159049","doi":"10.1109/cicc.2005.1568652","title":"An 80-Mb/s 0.18-&amp;#x03BC;m CMOS analog min-sum iterative decoder for a (32,8,10) LDPC code","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CMOS; Low-density parity-check code; Subthreshold conduction; Decoding methods; Computer science; Turbo code; Electronic engineering; Analogue electronics; Electronic circuit; Transistor; Electrical engineering; Algorithm; Engineering; Voltage","score_opus":0.04047827573552259,"score_gpt":0.3311213446262393,"score_spread":0.2906430688907167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123159049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22417547,0.0018576992,0.7215583,0.0012150832,0.0005863575,0.0006213509,0.0011932093,0.009949472,0.038843103],"genre_scores_gemma":[0.626936,0.0006709211,0.34280938,0.0007006991,0.00012726114,0.0001680456,0.0005299348,0.00012560852,0.027932074],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980885,0.000019290892,0.0000109002385,0.000029924744,0.00010931683,0.000021833173],"domain_scores_gemma":[0.9997099,0.00007157356,0.000037473816,0.00003140702,0.00012291246,0.00002680954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023621216,0.0003156117,0.0002532795,0.00033104152,0.00038340598,0.00053861795,0.00093095587,0.00047066444,0.006271242],"category_scores_gemma":[0.0005965738,0.00015594786,0.00011550293,0.00030265524,0.00018335573,0.00062904414,0.00028537042,0.00036081838,0.0016194283],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047000984,0.00018317699,0.0013449664,0.000421245,0.00005335662,0.0004742915,0.00023142912,0.0038406071,0.7330404,0.013897436,0.008765775,0.23727721],"study_design_scores_gemma":[0.00015277028,0.0021095753,0.0023817704,0.00011784262,0.00015433453,0.0035242005,0.000103995844,0.07985097,0.80181265,0.0033433943,0.106356554,0.0000919949],"about_ca_topic_score_codex":0.00084325555,"about_ca_topic_score_gemma":0.0021257165,"teacher_disagreement_score":0.006271242,"about_ca_system_score_codex":0.00053347746,"about_ca_system_score_gemma":0.0006408988,"threshold_uncertainty_score":0.020979404},"labels":[],"label_agreement":null},{"id":"W2123330494","doi":"10.1109/lcomm.2003.822499","title":"Improving Belief Propagation on Graphs With Cycles","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Belief propagation; Factor graph; Multiplicative function; Decoding methods; Computer science; Algorithm; Reliability (semiconductor); Offset (computer science); Random variable; Mathematics; Statistics","score_opus":0.022298739402374534,"score_gpt":0.26110804394342946,"score_spread":0.23880930454105492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123330494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03179466,0.0004694843,0.9647919,0.00042059788,0.00005459741,0.000029067649,0.00006052535,0.00068980746,0.0016894329],"genre_scores_gemma":[0.6695341,0.0010457274,0.32506827,0.00037834403,0.00016925653,0.0001297162,0.0003020335,0.00018714649,0.0031854159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.0005704973,0.000060395545,0.00019800915,0.00035373596,0.00015669416],"domain_scores_gemma":[0.9900287,0.0074146176,0.00045078655,0.0008794573,0.0010628543,0.00016346862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831518,0.0010592641,0.0010950915,0.0014869169,0.0005635429,0.0011717567,0.001602452,0.0013473006,0.0012006521],"category_scores_gemma":[0.016882084,0.00065686094,0.00051444536,0.0015636106,0.0011623938,0.0031600492,0.0019754553,0.0013998275,0.00043451763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000210103,0.000044620938,0.0010626432,0.000118529344,0.00006771889,0.000093069524,0.00016262091,0.82949257,0.00275006,0.04208177,0.0022544232,0.1216618],"study_design_scores_gemma":[0.000011743819,0.00001549083,0.00006342554,0.000005474106,0.0000079626425,0.000011869554,0.000006343386,0.9783546,0.00078003376,0.020365894,0.00037159774,0.0000055796513],"about_ca_topic_score_codex":0.0068260785,"about_ca_topic_score_gemma":0.0048607998,"teacher_disagreement_score":0.0068260785,"about_ca_system_score_codex":0.0009453902,"about_ca_system_score_gemma":0.0011574682,"threshold_uncertainty_score":0.013572693},"labels":[],"label_agreement":null},{"id":"W2123380295","doi":"10.1109/tbc.2007.912849","title":"Combine LDPC Codes Over GF(q) With q-ary Modulations for Bandwidth Efficient Transmission","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique","funders":"","keywords":"Low-density parity-check code; Computer science; Additive white Gaussian noise; Turbo code; Forward error correction; Transmission (telecommunications); Error detection and correction; Digital Video Broadcasting; Bandwidth (computing); Bit error rate; Concatenated error correction code; Algorithm; Electronic engineering; Decoding methods; Channel (broadcasting); Block code; Telecommunications; Engineering","score_opus":0.02760566001082492,"score_gpt":0.25571391462508714,"score_spread":0.2281082546142622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123380295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07191905,0.0006198642,0.9231289,0.00022179453,0.00004255292,0.00006776257,0.000044334458,0.00030942136,0.0036463353],"genre_scores_gemma":[0.63882303,0.0005701645,0.3577372,0.00013809105,0.000046812576,0.00009479824,0.000084670806,0.00005570255,0.0024495604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935526,0.00025075214,0.000027992437,0.00006438687,0.00025567412,0.00004597513],"domain_scores_gemma":[0.9988531,0.00059447094,0.00019967771,0.00014352376,0.00017666642,0.000032525535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007819683,0.00052145234,0.00048914534,0.0005017548,0.00033337635,0.00059886597,0.00048204817,0.0006079667,0.0009973876],"category_scores_gemma":[0.0026430667,0.00026075885,0.00034760917,0.0008450888,0.0007150488,0.00080940797,0.0005492977,0.00042023757,0.00045532026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027213994,0.00013778635,0.0023476211,0.00024765878,0.00022931444,0.0003395858,0.00021055281,0.7854995,0.055825517,0.05292894,0.0009749545,0.1009863],"study_design_scores_gemma":[0.000021827056,0.00010501605,0.00023356226,0.000022783597,0.000030168912,0.00018818889,0.000015751242,0.9751863,0.0128527265,0.009720469,0.0016033918,0.000019835552],"about_ca_topic_score_codex":0.0010142274,"about_ca_topic_score_gemma":0.0017245149,"teacher_disagreement_score":0.0010142274,"about_ca_system_score_codex":0.0005361499,"about_ca_system_score_gemma":0.0005417908,"threshold_uncertainty_score":0.0041354895},"labels":[],"label_agreement":null},{"id":"W2123414183","doi":"10.1109/glocom.2006.79","title":"CTH08-5: Efficient Encoding and Termination of Low-Density Parity-Check Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Low-density parity-check code; Computer science; Algorithm; Convolutional code; Encoding (memory); Serial concatenated convolutional codes; Block code; Code (set theory); Computational complexity theory; Decoding methods; Linear code; Theoretical computer science; Artificial intelligence","score_opus":0.0077699166176391395,"score_gpt":0.2334236396745022,"score_spread":0.22565372305686304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123414183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06961058,0.0005912847,0.91009927,0.00023410522,0.00016054163,0.00024460073,0.000517118,0.0028114778,0.015731074],"genre_scores_gemma":[0.53500104,0.00044445295,0.44664752,0.0001483088,0.00008739803,0.0002155694,0.0017824565,0.00022286286,0.015450368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.00007896033,0.000025108464,0.00003377051,0.00023208593,0.00005461864],"domain_scores_gemma":[0.9993093,0.00018095926,0.00006876343,0.00015488116,0.00025593684,0.00003025226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062651234,0.00040097005,0.00032506033,0.00055209437,0.0003983775,0.0005642295,0.0006416307,0.00053921284,0.0020761073],"category_scores_gemma":[0.00168849,0.00011123885,0.0001850478,0.0005622949,0.00039865653,0.00044911163,0.0004732368,0.0005806437,0.00076601346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085089187,0.00015772373,0.0024252068,0.0003770495,0.00006110509,0.00075549295,0.00019276058,0.13381863,0.18541764,0.11724838,0.021667656,0.5370274],"study_design_scores_gemma":[0.000109596505,0.00033852932,0.0009193632,0.00004925779,0.000026078736,0.00060259254,0.000016552547,0.6974043,0.2592119,0.012674218,0.028604172,0.00004343189],"about_ca_topic_score_codex":0.0018319391,"about_ca_topic_score_gemma":0.0021595727,"teacher_disagreement_score":0.0020761073,"about_ca_system_score_codex":0.0006804019,"about_ca_system_score_gemma":0.0012432347,"threshold_uncertainty_score":0.006945312},"labels":[],"label_agreement":null},{"id":"W2123436405","doi":"10.1109/tsp.2011.2138699","title":"Stochastic Multiple Stream Decoding of Cortex Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Block code; Algorithm; Belief propagation; Hamming code; Stochastic computing; Berlekamp–Welch algorithm; Sequential decoding; Theoretical computer science; Concatenated error correction code","score_opus":0.046209581875526914,"score_gpt":0.27024279200051676,"score_spread":0.22403321012498983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123436405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084547885,0.00024250752,0.9095526,0.00024102956,0.00005889337,0.000035128625,0.00010719722,0.00044035228,0.0047743456],"genre_scores_gemma":[0.79597473,0.00036035106,0.19726606,0.00013843624,0.000047699825,0.000068449845,0.00018036542,0.00006257562,0.0059013255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995578,0.000102464415,0.00002759084,0.000054233224,0.00020791007,0.000049963368],"domain_scores_gemma":[0.9991523,0.0003013914,0.00010473581,0.00013011183,0.00027680927,0.000034662073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048998697,0.00032730834,0.00038306753,0.00036484824,0.000247014,0.00059896155,0.00039893802,0.00041858855,0.001084732],"category_scores_gemma":[0.0024105876,0.0001364367,0.00024683413,0.00042865422,0.00033303737,0.0005212106,0.0005856245,0.00045265615,0.00038365606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006362414,0.00006682693,0.0022172788,0.0002256633,0.000069737835,0.0005695379,0.00022382564,0.4071188,0.087749094,0.23875608,0.0029489996,0.25941795],"study_design_scores_gemma":[0.000019851837,0.00006981132,0.00028679884,0.000020314646,0.000011590069,0.0001919849,0.000015512362,0.9282599,0.045333177,0.023459163,0.0023180824,0.000013792678],"about_ca_topic_score_codex":0.0011232091,"about_ca_topic_score_gemma":0.0019239206,"teacher_disagreement_score":0.0011232091,"about_ca_system_score_codex":0.00047087914,"about_ca_system_score_gemma":0.0011241275,"threshold_uncertainty_score":0.00362885},"labels":[],"label_agreement":null},{"id":"W2123677459","doi":"10.1109/iscas.2006.1693323","title":"Encoder architecture with throughput over 10 Gbit/sec for quasi-cyclic LDPC codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Encoder; Computer science; Parallel computing; Throughput; Field-programmable gate array; Gate array; Parity-check matrix; Block code; Computer hardware; Decoding methods; Algorithm","score_opus":0.009375688097937472,"score_gpt":0.2511151520735027,"score_spread":0.24173946397556523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123677459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2672981,0.0016634795,0.6927273,0.0006692653,0.00019768941,0.000347432,0.0008397277,0.012919503,0.023337463],"genre_scores_gemma":[0.6846735,0.0007088052,0.3003607,0.00012611193,0.000057199348,0.000160968,0.0010320828,0.00017409472,0.012706536],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998721,0.000018890016,0.0000096683025,0.00001663049,0.000062039064,0.000020724277],"domain_scores_gemma":[0.99977416,0.000071997696,0.00003118245,0.000035685553,0.00007108422,0.000015941147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020326274,0.00026860036,0.00017195003,0.00041641013,0.00026974417,0.0003977557,0.00035070063,0.00038130645,0.0029171284],"category_scores_gemma":[0.00057078555,0.00016265466,0.00010122719,0.00023477583,0.00016126093,0.0005762933,0.00021707595,0.00035588568,0.001324138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006436889,0.00022277252,0.0031337012,0.00055207685,0.00005283798,0.0005524436,0.00039477376,0.035025764,0.53644276,0.04200374,0.0095326165,0.37144288],"study_design_scores_gemma":[0.00018244261,0.0007811514,0.0046368963,0.00009868752,0.00009393329,0.0013066152,0.00009632597,0.3555338,0.5597312,0.008770178,0.06866159,0.000107266394],"about_ca_topic_score_codex":0.0014379724,"about_ca_topic_score_gemma":0.002923073,"teacher_disagreement_score":0.0029171284,"about_ca_system_score_codex":0.00051861256,"about_ca_system_score_gemma":0.0007014454,"threshold_uncertainty_score":0.00975883},"labels":[],"label_agreement":null},{"id":"W2124026603","doi":"10.1109/isit.2003.1228090","title":"DC-free multimode error control block codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Decoding methods; Computer science; Concatenated error correction code; Block (permutation group theory); Error detection and correction; Multi-mode optical fiber; List decoding; Serial concatenated convolutional codes; Turbo code; Linear code; Algorithm; Mathematics; Telecommunications","score_opus":0.018385874720051668,"score_gpt":0.2652053799974953,"score_spread":0.24681950527744367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124026603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051505864,0.0013112599,0.9240057,0.0004700195,0.0004714044,0.00017655172,0.00038931257,0.0011443679,0.02052563],"genre_scores_gemma":[0.4228355,0.0009673815,0.53897893,0.00063904835,0.00026147722,0.00038473704,0.0005862059,0.00016458075,0.03518207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994795,0.000083173254,0.00003152268,0.000072988856,0.000256612,0.0000761373],"domain_scores_gemma":[0.99870455,0.00023463253,0.00014983465,0.0003196625,0.0005172356,0.000073908035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038523678,0.0004628175,0.00040425386,0.0007356808,0.00058944727,0.0007410457,0.0010178195,0.00070166873,0.0035949056],"category_scores_gemma":[0.001399365,0.00019447591,0.00022801831,0.000632733,0.0004766867,0.0009974227,0.00069482607,0.0008944137,0.0012393905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006269308,0.00011337077,0.0012015264,0.0003089684,0.00006183415,0.00026321874,0.00021967973,0.026077325,0.18514177,0.41885954,0.0074181906,0.35970753],"study_design_scores_gemma":[0.00014640244,0.00045779505,0.00095700973,0.00014507858,0.000073973984,0.00077003386,0.00005120262,0.33464274,0.45436448,0.09579528,0.11245955,0.00013643633],"about_ca_topic_score_codex":0.0014031022,"about_ca_topic_score_gemma":0.0027299968,"teacher_disagreement_score":0.0035949056,"about_ca_system_score_codex":0.0007411749,"about_ca_system_score_gemma":0.0009339004,"threshold_uncertainty_score":0.012026131},"labels":[],"label_agreement":null},{"id":"W2124026871","doi":"10.1109/tcomm.2008.050087","title":"Ldpc codes for non-coherent block fading channels with correlation: analysis and design","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Fading; Low-density parity-check code; Algorithm; Decoding methods; Block (permutation group theory); Computer science; Smoothing; Block code; Kalman filter; Electronic engineering; Mathematics; Engineering","score_opus":0.06159042362997631,"score_gpt":0.2916499387937162,"score_spread":0.2300595151637399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124026871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014321315,0.0008964473,0.9816036,0.00018716024,0.000028650074,0.00005303399,0.000083133236,0.0002369149,0.0025897974],"genre_scores_gemma":[0.5984228,0.0037105654,0.3902468,0.00018040324,0.00011482425,0.00044244152,0.00041799934,0.00017693618,0.006287214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00024951258,0.00003383662,0.00007378863,0.00038508925,0.00006865091],"domain_scores_gemma":[0.99708027,0.0015243836,0.00043765464,0.00026426255,0.00064937293,0.000044046526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083609036,0.000829392,0.00049032824,0.00080227625,0.00045800826,0.0009846822,0.00063242315,0.000791839,0.0015749572],"category_scores_gemma":[0.0044249045,0.00037173595,0.00032534494,0.0013130922,0.00072793284,0.0008044231,0.00059033977,0.0008159695,0.000656289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008597163,0.00004537651,0.0009652808,0.00020779448,0.00005063129,0.00014445484,0.00013067244,0.7954036,0.010085223,0.099361405,0.0013901734,0.0921293],"study_design_scores_gemma":[0.00001150233,0.000037262893,0.0001945312,0.00003594919,0.00001305532,0.000095970245,0.000009950242,0.97708863,0.004360446,0.01662001,0.0015160028,0.000016729824],"about_ca_topic_score_codex":0.0028330577,"about_ca_topic_score_gemma":0.004395649,"teacher_disagreement_score":0.0028330577,"about_ca_system_score_codex":0.0013091804,"about_ca_system_score_gemma":0.0021948144,"threshold_uncertainty_score":0.009498835},"labels":[],"label_agreement":null},{"id":"W2124523850","doi":"10.1109/acssc.2009.5470035","title":"On the application of BP decoding to convolutional and turbo codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Turbo code; Serial concatenated convolutional codes; Convolutional code; BCJR algorithm; Turbo equalizer; Computer science; Concatenated error correction code; Low-density parity-check code; Linear code; Algorithm; Sequential decoding; Theoretical computer science; Block code; Decoding methods","score_opus":0.015578092739733693,"score_gpt":0.27465818302043815,"score_spread":0.25908009028070444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124523850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058140997,0.0009715993,0.984201,0.00020818689,0.00014921103,0.000024189181,0.000022663293,0.00017728544,0.008431738],"genre_scores_gemma":[0.34384108,0.0071062054,0.63529783,0.00037147454,0.0006980997,0.00017686331,0.00014686499,0.00027359734,0.012088016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990094,0.00030449076,0.000038838534,0.00008980931,0.0004864099,0.000071090624],"domain_scores_gemma":[0.997414,0.0016207205,0.00009906699,0.00028039076,0.0005367455,0.000049101705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278103,0.0008137305,0.0006030446,0.0006934237,0.0004474534,0.0009930492,0.0007640906,0.0011974261,0.0013238884],"category_scores_gemma":[0.007633377,0.00034806711,0.00041147374,0.00096780487,0.0013704337,0.001422206,0.0010943115,0.0015125854,0.0009800638],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013819177,0.00005034718,0.0008117923,0.00023889914,0.000048658603,0.0003013719,0.00019568851,0.41201147,0.012518533,0.38067266,0.0023275714,0.19068478],"study_design_scores_gemma":[0.000009464021,0.000041977535,0.00014063618,0.000035823305,0.000011392155,0.0001159279,0.000008732586,0.87757045,0.006470313,0.11092417,0.004653625,0.000017529841],"about_ca_topic_score_codex":0.0019904568,"about_ca_topic_score_gemma":0.0013145455,"teacher_disagreement_score":0.0019904568,"about_ca_system_score_codex":0.0005297841,"about_ca_system_score_gemma":0.0007625315,"threshold_uncertainty_score":0.0059645176},"labels":[],"label_agreement":null},{"id":"W2125124709","doi":"10.1007/s12095-015-0134-9","title":"On encoding symbol degrees of array BP-XOR codes","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Luby transform code; Low-density parity-check code; Fountain code; Encoding (memory); Decoding methods; Exclusive or; Computer science; Bitwise operation; Belief propagation; Arithmetic; Tornado code; Binary number; Symbol (formal); Algorithm; Theoretical computer science; Mathematics; Error floor","score_opus":0.0674218556422158,"score_gpt":0.30376916118930675,"score_spread":0.23634730554709094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125124709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15417814,0.0009430266,0.79874474,0.0010299901,0.00044457443,0.0000827631,0.00042124212,0.0004989379,0.043656643],"genre_scores_gemma":[0.8048084,0.0017573289,0.17532301,0.00040556488,0.00038390784,0.00016203846,0.0003987068,0.0002715508,0.016489528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991762,0.0002922897,0.000048394002,0.00008579716,0.00029099334,0.00010637705],"domain_scores_gemma":[0.9981034,0.0011410442,0.00015818446,0.00024165722,0.00027974375,0.000076031974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157374,0.0007122593,0.0004355743,0.0009184132,0.0006239099,0.0013037472,0.0005709088,0.0005411833,0.003357293],"category_scores_gemma":[0.0052039,0.00027813224,0.00027334248,0.0012014254,0.0013008168,0.002158543,0.0014393596,0.0014046817,0.000936108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004014536,0.000039248,0.000672892,0.0001037631,0.000013647384,0.00008912683,0.00032055672,0.04188642,0.011308789,0.85268116,0.0023953894,0.09008757],"study_design_scores_gemma":[0.00004328503,0.000109416505,0.0005030234,0.000111456284,0.000026461297,0.00020299837,0.00010567786,0.22567661,0.024698768,0.7390533,0.009398521,0.000070514216],"about_ca_topic_score_codex":0.000742533,"about_ca_topic_score_gemma":0.00078321557,"teacher_disagreement_score":0.003357293,"about_ca_system_score_codex":0.0007504291,"about_ca_system_score_gemma":0.0007594697,"threshold_uncertainty_score":0.011231244},"labels":[],"label_agreement":null},{"id":"W2125332127","doi":"10.1109/tcomm.2004.838730","title":"Graph-Based Message-Passing Schedules for Decoding LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Decoding methods; Factor graph; Belief propagation; Additive white Gaussian noise; Algorithm; Message passing; Mathematics; Probabilistic logic; Computer science; Bipartite graph; Graph; Channel (broadcasting); Discrete mathematics; Parallel computing; Statistics","score_opus":0.05850431123779526,"score_gpt":0.3256316168387922,"score_spread":0.26712730560099696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125332127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030749457,0.00017926739,0.96696275,0.000077585886,0.000026366071,0.000098592136,0.000070077294,0.00034474707,0.0014911799],"genre_scores_gemma":[0.6121942,0.0005998246,0.38423043,0.00007534195,0.00006287508,0.0004111784,0.0002885618,0.0001506492,0.0019868796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00033380688,0.00004561387,0.000080540645,0.00022554,0.00006589535],"domain_scores_gemma":[0.9963194,0.00235757,0.00043358895,0.00037661617,0.00041681546,0.00009600515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014121829,0.00079330715,0.0005193739,0.00090209284,0.00047297703,0.00064442004,0.00086987455,0.0005100666,0.00091768935],"category_scores_gemma":[0.0076085515,0.0003072582,0.00047200397,0.0010072658,0.0008591671,0.00079478533,0.0004773365,0.0006635313,0.00033890625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001552717,0.000036580906,0.0004947459,0.000099443096,0.000024908473,0.00006119521,0.00014834807,0.86389846,0.004462978,0.08746345,0.0007819154,0.042372707],"study_design_scores_gemma":[0.00003369607,0.000111591,0.000089141526,0.000013719089,0.000013067694,0.000029540515,0.00001482349,0.96020025,0.0034023905,0.034831204,0.0012486895,0.000011947028],"about_ca_topic_score_codex":0.0023234896,"about_ca_topic_score_gemma":0.002601002,"teacher_disagreement_score":0.0023234896,"about_ca_system_score_codex":0.0011980793,"about_ca_system_score_gemma":0.0012684852,"threshold_uncertainty_score":0.008692741},"labels":[],"label_agreement":null},{"id":"W2126290044","doi":"10.1109/mwscas.2007.4488574","title":"3.2-Gb/s 1024-b rate-1/2 LDPC decoder chip using a flooding-type update-schedule algorithm","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Decoding methods; Algorithm; Parallel computing; Chip; Bottleneck; Clock rate; Node (physics); Computation; Flooding (psychology); Schedule; Real-time computing; Embedded system; Engineering; Telecommunications","score_opus":0.040401961208261956,"score_gpt":0.29870874074715914,"score_spread":0.2583067795388972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126290044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42617777,0.0005638642,0.54968077,0.0005384485,0.0001430361,0.00025765237,0.00045162212,0.008829847,0.013357021],"genre_scores_gemma":[0.63668615,0.00020372416,0.3528504,0.00013119684,0.000035097117,0.00011210511,0.0004495251,0.00011225027,0.009419616],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988735,0.000014704461,0.000008092836,0.000019267476,0.000055100656,0.000015518748],"domain_scores_gemma":[0.9998685,0.000030039877,0.000014669421,0.000023705303,0.000051732426,0.000011325124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015655349,0.00030089967,0.00024034179,0.00026611306,0.00022507658,0.00031854358,0.00050753524,0.00041450394,0.0016053604],"category_scores_gemma":[0.00038679576,0.0001625455,0.00013049463,0.00024344305,0.0001722055,0.00051703386,0.00018438292,0.00027775436,0.00054500153],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045203185,0.00010947009,0.001520476,0.00021430402,0.000056533383,0.00031922924,0.0001503237,0.023251686,0.8082758,0.009396487,0.004727922,0.1515258],"study_design_scores_gemma":[0.00018040853,0.0005574081,0.0021382354,0.00002594455,0.00006789118,0.00076664373,0.000029783467,0.28473812,0.6839523,0.0013916362,0.02608531,0.00006634075],"about_ca_topic_score_codex":0.0020197125,"about_ca_topic_score_gemma":0.0033343865,"teacher_disagreement_score":0.0020197125,"about_ca_system_score_codex":0.00045481726,"about_ca_system_score_gemma":0.0007117487,"threshold_uncertainty_score":0.0053704977},"labels":[],"label_agreement":null},{"id":"W2127204517","doi":"10.1109/tcomm.2004.838738","title":"Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Mathematics; Convergence (economics); Binary number; Computer science; Discrete mathematics; Arithmetic","score_opus":0.06376592848633332,"score_gpt":0.2991063240944776,"score_spread":0.2353403956081443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127204517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.406587,0.00081719575,0.5850883,0.00033218486,0.000042815194,0.00007890209,0.000056598095,0.00035371198,0.0066432436],"genre_scores_gemma":[0.9146738,0.0003767134,0.08316242,0.00005382065,0.00002438033,0.00008663359,0.00006629126,0.000082036175,0.0014738851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927765,0.00023997862,0.000034936915,0.00010590075,0.00025910634,0.000082445935],"domain_scores_gemma":[0.9908794,0.007096189,0.00052357506,0.0005024226,0.0008523152,0.00014610124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017376753,0.00035580544,0.00052430015,0.0007164188,0.00051193405,0.00094868685,0.00077918783,0.00083998527,0.00097575434],"category_scores_gemma":[0.017748907,0.00027690717,0.00037400023,0.00052129384,0.0014258674,0.0016545109,0.00073450536,0.0011226914,0.00023268751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025355295,0.0000795282,0.0043765446,0.00015399854,0.00004903386,0.00013472661,0.000560296,0.597047,0.017498232,0.3339552,0.0007735551,0.04511834],"study_design_scores_gemma":[0.000009262715,0.00003098672,0.00029985266,0.0000122728825,0.0000056853974,0.000056795205,0.000027795182,0.96531695,0.0046912204,0.029243566,0.0002946065,0.00001099788],"about_ca_topic_score_codex":0.000737221,"about_ca_topic_score_gemma":0.00051665405,"teacher_disagreement_score":0.0017376753,"about_ca_system_score_codex":0.0012891294,"about_ca_system_score_gemma":0.00062826613,"threshold_uncertainty_score":0.00935334},"labels":[],"label_agreement":null},{"id":"W2127421917","doi":"10.1109/tcomm.2004.836563","title":"On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":279,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Quantization (signal processing); Mathematics; Parity-check matrix; Belief propagation; Computer science","score_opus":0.054948146900187844,"score_gpt":0.34937265992529287,"score_spread":0.29442451302510503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127421917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04195786,0.0006222971,0.95329404,0.00014258908,0.00009566617,0.00009111891,0.000044499935,0.000830417,0.0029214877],"genre_scores_gemma":[0.25548518,0.00052095845,0.74158645,0.000105098545,0.000057720437,0.000105891224,0.00016393387,0.00009615739,0.0018786627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988323,0.0004216084,0.0000676762,0.000103904706,0.00050611567,0.0000684075],"domain_scores_gemma":[0.9979091,0.0010185065,0.00014190911,0.00039098674,0.00049867673,0.000040771214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014796406,0.00083336496,0.0005988985,0.00049853825,0.0004554346,0.0008915663,0.0011653656,0.0005893818,0.001430647],"category_scores_gemma":[0.005271513,0.0003021902,0.00037580688,0.0007745938,0.0006074358,0.0009205859,0.0006298729,0.0011603135,0.0005588564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093522976,0.0002210616,0.0022892894,0.00033338997,0.00020739305,0.00020205007,0.00027928472,0.3673942,0.06540892,0.04410826,0.0028048467,0.51581603],"study_design_scores_gemma":[0.00003402579,0.00025658,0.0003889636,0.000015547064,0.00003243097,0.00020407396,0.00002468917,0.94831663,0.04331989,0.0046588117,0.0027190147,0.000029302093],"about_ca_topic_score_codex":0.001895864,"about_ca_topic_score_gemma":0.0027995303,"teacher_disagreement_score":0.001895864,"about_ca_system_score_codex":0.00065520906,"about_ca_system_score_gemma":0.00086277135,"threshold_uncertainty_score":0.007825196},"labels":[],"label_agreement":null},{"id":"W2128599881","doi":"10.1109/ccece.2003.1226198","title":"Analog iterative decoding of error control codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Turbo code; Decoding methods; Serial concatenated convolutional codes; Turbo equalizer; List decoding; Sequential decoding; Concatenated error correction code; Turbo; Noisy-channel coding theorem; Computer engineering; Soft-decision decoder; Algorithm; Electronic engineering; Theoretical computer science; Computer hardware; Block code; Engineering","score_opus":0.027534139722979852,"score_gpt":0.3010743880959096,"score_spread":0.27354024837292973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128599881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019455884,0.0024972344,0.9483299,0.00028286636,0.00022146647,0.0000834289,0.00010731277,0.00067675865,0.028345106],"genre_scores_gemma":[0.5888936,0.004159872,0.37996498,0.00052415096,0.0002616864,0.00016664682,0.00025141472,0.000104865445,0.025672687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914,0.00017907773,0.000058909514,0.0000965911,0.00044662485,0.000078714555],"domain_scores_gemma":[0.9988035,0.0004974653,0.000096040145,0.00013972905,0.00043678432,0.00002643924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005068132,0.0004698992,0.00034624684,0.000777831,0.00039493424,0.0010915025,0.0006284263,0.0007071205,0.0030434928],"category_scores_gemma":[0.0038930634,0.00015765589,0.00021969683,0.0009131338,0.0005200615,0.0008023148,0.0005651669,0.0005384073,0.00097609183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032735494,0.000051616273,0.00095298025,0.00046073005,0.00005701562,0.00047345544,0.00031627787,0.12639979,0.05046718,0.3005651,0.004787494,0.51514095],"study_design_scores_gemma":[0.00007250146,0.00027941333,0.00063459686,0.00022207042,0.000060059876,0.0011505198,0.0000612462,0.724654,0.10946767,0.105588086,0.057748213,0.000061646795],"about_ca_topic_score_codex":0.0011532496,"about_ca_topic_score_gemma":0.0014465696,"teacher_disagreement_score":0.0030434928,"about_ca_system_score_codex":0.0006984913,"about_ca_system_score_gemma":0.0006929936,"threshold_uncertainty_score":0.010181546},"labels":[],"label_agreement":null},{"id":"W2128731965","doi":"10.1109/tip.2006.882030","title":"Progressive Transmission of Images Over Fading Channels Using Rate-Compatible LDPC Codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Rayleigh fading; Fading; Algorithm; Low-density parity-check code; Decoding methods; Mathematics; Computer science; Channel (broadcasting); Additive white Gaussian noise; Trellis modulation; Upper and lower bounds; Signal-to-noise ratio (imaging); Puncturing; Telecommunications; Image processing; Image compression; Artificial intelligence; Image (mathematics)","score_opus":0.01932132535462858,"score_gpt":0.29375981263359385,"score_spread":0.27443848727896525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128731965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14853147,0.0006773838,0.8453039,0.0002508353,0.00006270033,0.00014112177,0.00014464372,0.00088780455,0.00400022],"genre_scores_gemma":[0.75312644,0.000639538,0.24337366,0.000104913415,0.000063469444,0.00010093044,0.00016004132,0.000050342715,0.0023806277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.00007187408,0.000014986537,0.00004135722,0.00013674793,0.00003806207],"domain_scores_gemma":[0.9989724,0.00039783673,0.00014120425,0.0002668742,0.000181089,0.00004051894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044864352,0.00056799524,0.0003326826,0.00062457204,0.00041286892,0.00036757378,0.0005561779,0.0003804724,0.000874102],"category_scores_gemma":[0.0020382593,0.0001849776,0.0002449581,0.00052787096,0.00063504843,0.000794986,0.0007610799,0.0006193804,0.00026842984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006261389,0.00014212471,0.002205608,0.0004011353,0.00009243135,0.00091541524,0.0005253174,0.2378583,0.34433553,0.051731642,0.002088362,0.35907802],"study_design_scores_gemma":[0.00011389901,0.000415969,0.0011573933,0.00007226624,0.00008101922,0.000887227,0.00007845092,0.80439204,0.16930246,0.014099837,0.009314825,0.00008462415],"about_ca_topic_score_codex":0.0013010671,"about_ca_topic_score_gemma":0.0018960356,"teacher_disagreement_score":0.0013010671,"about_ca_system_score_codex":0.0003704258,"about_ca_system_score_gemma":0.00048736305,"threshold_uncertainty_score":0.0029241443},"labels":[],"label_agreement":null},{"id":"W2129582249","doi":"10.1109/bsc.2006.1644570","title":"When is a Message Decodable Over Fading Channels?","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Decoding methods; Code word; Computer science; A priori and a posteriori; Fading distribution; Coding (social sciences); Block (permutation group theory); Algorithm; Theoretical computer science; Block code; Channel code; Mathematics; Telecommunications; Rayleigh fading; Statistics; Combinatorics","score_opus":0.014723475106201563,"score_gpt":0.25285650312541247,"score_spread":0.2381330280192109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129582249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71951723,0.0009880085,0.26701716,0.0043508583,0.0000871026,0.00008488759,0.0007293929,0.0006205018,0.0066049057],"genre_scores_gemma":[0.98976725,0.00043750316,0.007736314,0.00014509948,0.000075181764,0.00004415196,0.0002315587,0.00008370935,0.001479376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816006,0.000458617,0.000106237145,0.00038274785,0.00045295418,0.000439316],"domain_scores_gemma":[0.94783145,0.041777983,0.004005669,0.00309191,0.0023748176,0.00091818214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003864685,0.00045370418,0.0011147069,0.001172236,0.0008206387,0.0021237037,0.0013314893,0.0025599855,0.0021745118],"category_scores_gemma":[0.06641034,0.0006074217,0.00049422623,0.001141806,0.0037784043,0.006590053,0.0012527944,0.0024383455,0.00046219653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020759131,0.0001589225,0.027672173,0.00055121304,0.00026043522,0.0018798758,0.0015958567,0.4609779,0.027562352,0.3825683,0.004413207,0.090283856],"study_design_scores_gemma":[0.00012157231,0.00020317617,0.00800499,0.00013613129,0.00007000344,0.00081394456,0.0005609493,0.6974737,0.016143907,0.2747926,0.0015487318,0.0001303854],"about_ca_topic_score_codex":0.0026151973,"about_ca_topic_score_gemma":0.0013828197,"teacher_disagreement_score":0.003864685,"about_ca_system_score_codex":0.0018040059,"about_ca_system_score_gemma":0.0010341106,"threshold_uncertainty_score":0.020438671},"labels":[],"label_agreement":null},{"id":"W2129729322","doi":"10.1109/bsc.2006.1644558","title":"Capacity-Approaching LDPC Codes with Low Error Floors for High-Speed Digital Communications","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; CMC Microsystems","keywords":"Low-density parity-check code; Computer science; Encoder; Permutation matrix; Error detection and correction; Algorithm; Forward error correction; Turbo code; Circulant matrix; Degree (music); Decoding methods; Electronic engineering; Computer engineering; Engineering","score_opus":0.028304377356601237,"score_gpt":0.255317386216757,"score_spread":0.22701300886015574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129729322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18161233,0.0019441328,0.8091537,0.00053000386,0.00006049643,0.00008687725,0.00010677322,0.0006430315,0.0058626626],"genre_scores_gemma":[0.7541974,0.0012748083,0.24185532,0.00010747269,0.000071814895,0.0001013305,0.00017368727,0.00008241868,0.0021357583],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996675,0.000101330865,0.000018275763,0.00003783137,0.00013786426,0.0000372403],"domain_scores_gemma":[0.9986191,0.0006846554,0.00021514471,0.0002264323,0.00019587376,0.000058914582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045181817,0.00043182765,0.00026213907,0.00042873944,0.0004586577,0.0005547913,0.00034180286,0.0004624162,0.00080087426],"category_scores_gemma":[0.0025919692,0.0002191466,0.00015919188,0.0006309713,0.00076191843,0.0006494144,0.00041407268,0.0006608643,0.00029682435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033276784,0.000114757175,0.0024907512,0.0007454859,0.00004235149,0.000512382,0.00042986628,0.32595587,0.32606173,0.15942957,0.0018245733,0.18205988],"study_design_scores_gemma":[0.00007518116,0.00041275687,0.0010153088,0.000082077626,0.000053993113,0.0008903246,0.00007659813,0.6776939,0.23566784,0.05996683,0.023988023,0.00007714193],"about_ca_topic_score_codex":0.0003602454,"about_ca_topic_score_gemma":0.0007239301,"teacher_disagreement_score":0.00080087426,"about_ca_system_score_codex":0.00051663973,"about_ca_system_score_gemma":0.0006584059,"threshold_uncertainty_score":0.0037484765},"labels":[],"label_agreement":null},{"id":"W2129754296","doi":"10.1364/jocn.3.000533","title":"Optical Front-End for Soft-Decision LDPC Codes in Optical Communication Systems","year":2011,"lang":"en","type":"article","venue":"Journal of Optical Communications and Networking","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Low-density parity-check code; Front and back ends; Optical communication; Forward error correction; Telecommunications; Computer network; Decoding methods; Optics; Physics; Operating system","score_opus":0.08691241819131754,"score_gpt":0.3193284694364109,"score_spread":0.23241605124509337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129754296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28982717,0.0009698538,0.69569224,0.00062005536,0.00011621708,0.00013247093,0.0001372549,0.0015614807,0.010943219],"genre_scores_gemma":[0.8804431,0.00021802686,0.11077664,0.00028239164,0.000050560935,0.000053909676,0.00008373329,0.000031079035,0.008060439],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.00008772877,0.000012947746,0.000038788803,0.0002703886,0.0000359917],"domain_scores_gemma":[0.99933296,0.00033055962,0.000087289714,0.000057353915,0.00017017682,0.00002167341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035563146,0.00034034124,0.00022186292,0.00034743937,0.00034342374,0.00084100035,0.0006930306,0.0006493274,0.0030198623],"category_scores_gemma":[0.0011671926,0.00019855832,0.00011636521,0.00020393501,0.00031195962,0.00052934274,0.0003714876,0.000510068,0.0010075229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012925728,0.00033173326,0.002059861,0.00039941008,0.00006492398,0.00044493802,0.00023893801,0.084929645,0.65247697,0.037545457,0.002654624,0.21756098],"study_design_scores_gemma":[0.0000990432,0.00063847314,0.0012176847,0.00006638364,0.000043786076,0.00032046417,0.00004543714,0.59228104,0.3895022,0.007415206,0.008327041,0.000043251028],"about_ca_topic_score_codex":0.00054595247,"about_ca_topic_score_gemma":0.0014178319,"teacher_disagreement_score":0.0030198623,"about_ca_system_score_codex":0.00056761724,"about_ca_system_score_gemma":0.00041945893,"threshold_uncertainty_score":0.010102451},"labels":[],"label_agreement":null},{"id":"W2129949766","doi":"10.1109/icc.2009.5198829","title":"Coded Pulse-Position Modulation for Free-Space Optical Communications","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pulse-position modulation; Computer science; Low-density parity-check code; Decoding methods; Coding (social sciences); Noisy-channel coding theorem; Constellation diagram; Algorithm; Figure of merit; Transmission (telecommunications); Modulation (music); Bit error rate; Parity bit; Electronic engineering; Telecommunications; Pulse-amplitude modulation; Mathematics; Pulse (music); Physics; Error floor; Detector; Engineering","score_opus":0.0330693738532716,"score_gpt":0.3100102803805992,"score_spread":0.2769409065273276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129949766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092835665,0.0045896824,0.87914205,0.001515012,0.0001817692,0.0000939345,0.00013641058,0.00040796766,0.021097513],"genre_scores_gemma":[0.7894109,0.0017752988,0.20472492,0.00018955281,0.000084407824,0.00009857561,0.0001059585,0.000033499728,0.003576811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.00004600641,0.000004963369,0.000015525498,0.00009329418,0.000012864108],"domain_scores_gemma":[0.99960893,0.00020330306,0.00004707205,0.000057829857,0.00007011996,0.000012833253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025479402,0.00021768716,0.00018083573,0.00027765986,0.00022720514,0.00037810495,0.00037963313,0.0005622003,0.0020947433],"category_scores_gemma":[0.001295612,0.000108781715,0.00011807267,0.00054327335,0.0004311446,0.00046045645,0.00035972943,0.00065867644,0.00040800966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018646318,0.00009759527,0.0007665285,0.0005538136,0.00003475522,0.00019836222,0.00016613418,0.18189038,0.13300669,0.42274264,0.0041708075,0.25618583],"study_design_scores_gemma":[0.00004180312,0.00022404392,0.00053168857,0.00009039391,0.00002669049,0.0002068119,0.000021135087,0.84254956,0.044309203,0.08956294,0.022396296,0.000039331713],"about_ca_topic_score_codex":0.0005758302,"about_ca_topic_score_gemma":0.0011910144,"teacher_disagreement_score":0.0020947433,"about_ca_system_score_codex":0.00055594044,"about_ca_system_score_gemma":0.00063533534,"threshold_uncertainty_score":0.007007599},"labels":[],"label_agreement":null},{"id":"W2130092083","doi":"10.1109/tcomm.2009.07.070619","title":"Identical-capacity channel decomposition for design of universal LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Code (set theory); Channel (broadcasting); Conjecture; Computer science; Regular polygon; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Telecommunications; Programming language","score_opus":0.07968733975742756,"score_gpt":0.3290297916985942,"score_spread":0.24934245194116664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130092083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022679476,0.00030685795,0.969177,0.00017840651,0.00003854972,0.000099651275,0.00020255765,0.00029801205,0.007019455],"genre_scores_gemma":[0.7159848,0.0006079442,0.27743044,0.00030296686,0.00008258249,0.00043324556,0.00055811985,0.00012340564,0.0044763875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907565,0.00032878984,0.00004261693,0.00016697668,0.00022737605,0.00015856551],"domain_scores_gemma":[0.9987103,0.00056430994,0.00012891612,0.00022635689,0.0002708432,0.00009930364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011821109,0.0009954197,0.0006732383,0.0007282034,0.00051592843,0.00092102325,0.0006409275,0.0007132541,0.003330519],"category_scores_gemma":[0.0034227236,0.00043988044,0.0005359376,0.0008403062,0.001047614,0.00092862995,0.001103302,0.0010693984,0.0006213413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033845825,0.00008559752,0.00055640837,0.00029693457,0.00004940143,0.00012318381,0.00016802165,0.7151192,0.018483654,0.1987614,0.004471436,0.06154637],"study_design_scores_gemma":[0.000026278853,0.00006618724,0.00010120039,0.000030742405,0.000014326342,0.000048568247,0.000025056956,0.9480444,0.0053017433,0.04407757,0.0022436718,0.000020237667],"about_ca_topic_score_codex":0.0017098514,"about_ca_topic_score_gemma":0.0019530654,"teacher_disagreement_score":0.003330519,"about_ca_system_score_codex":0.0013735043,"about_ca_system_score_gemma":0.0021401534,"threshold_uncertainty_score":0.011141717},"labels":[],"label_agreement":null},{"id":"W2130433054","doi":"10.1109/isit.2007.4557340","title":"Ordering Finite-State Markov Channels by Mutual Information","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mutual information; Markov chain; Decoding methods; Markov process; Computer science; Channel (broadcasting); Markov model; Channel capacity; Low-density parity-check code; Algorithm; Finite state; Mathematics; Theoretical computer science; Statistics; Telecommunications; Artificial intelligence","score_opus":0.008646976787450885,"score_gpt":0.2383433139510096,"score_spread":0.22969633716355872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130433054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05301827,0.00032000509,0.9395671,0.00025607293,0.000031450363,0.00007703515,0.00019247082,0.00022434643,0.006313374],"genre_scores_gemma":[0.8504888,0.00094841636,0.14422858,0.0001695533,0.0001547037,0.0002756051,0.00037970732,0.00015393927,0.003200655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958489,0.0016975122,0.00018145934,0.0004422627,0.0012379911,0.0005918984],"domain_scores_gemma":[0.9788759,0.016331134,0.0015823629,0.0015954521,0.0011450455,0.00047012273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037333996,0.00089207484,0.0012479579,0.0015193485,0.0010031095,0.0019089638,0.0010852267,0.0007680711,0.0025217636],"category_scores_gemma":[0.012854086,0.0007138766,0.00076159794,0.00185095,0.0034098804,0.0050697224,0.0019065966,0.0017274785,0.0003248125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021594492,0.000045162018,0.0010443345,0.000087976056,0.000036583922,0.0002187091,0.00023861745,0.2795712,0.0028909564,0.70135754,0.00063968636,0.013653203],"study_design_scores_gemma":[0.00001579319,0.0000380328,0.00020138883,0.00001851479,0.000011870965,0.00006814956,0.000026433085,0.5998381,0.002497438,0.39610574,0.0011428774,0.000035670735],"about_ca_topic_score_codex":0.001608082,"about_ca_topic_score_gemma":0.001680529,"teacher_disagreement_score":0.0037333996,"about_ca_system_score_codex":0.0020297533,"about_ca_system_score_gemma":0.0020320243,"threshold_uncertainty_score":0.019744337},"labels":[],"label_agreement":null},{"id":"W2131239166","doi":"10.1109/lcomm.2006.060570","title":"Stochastic decoding of LDPC codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Berlekamp–Welch algorithm; Algorithm; Factor graph; List decoding; Sequential decoding; Code (set theory); Throughput; Theoretical computer science; Concatenated error correction code; Error floor; Block code; Telecommunications; Wireless","score_opus":0.029272283280820148,"score_gpt":0.2840308639770852,"score_spread":0.25475858069626506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131239166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009122904,0.00011234165,0.9869112,0.000092869304,0.000034637025,0.000030651434,0.00008433764,0.00040634384,0.0032046405],"genre_scores_gemma":[0.48456144,0.0007114657,0.5062662,0.00027395785,0.00012940366,0.00024168985,0.00061819167,0.0002650801,0.0069326847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978808,0.0005820406,0.00009608979,0.00021089021,0.0010875028,0.00014270458],"domain_scores_gemma":[0.99791306,0.0009910809,0.00016308909,0.0003562251,0.0005118588,0.00006458414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276216,0.0005485344,0.00076665106,0.00069540803,0.0006335585,0.00085134536,0.00062915386,0.00073891744,0.0010120195],"category_scores_gemma":[0.006525315,0.00032396545,0.0005337417,0.0008370417,0.00083648,0.0006061208,0.0010470434,0.0010415144,0.0007166035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016383722,0.000041978,0.00072831166,0.00018349211,0.000078680314,0.00024025816,0.0001928749,0.5577887,0.03150052,0.27041692,0.002667063,0.13599733],"study_design_scores_gemma":[0.000014655551,0.000025535664,0.00011677602,0.000019791874,0.0000074507816,0.00011183972,0.000006824544,0.94288504,0.012861888,0.04064655,0.0032846844,0.000019035637],"about_ca_topic_score_codex":0.0020011417,"about_ca_topic_score_gemma":0.0022628994,"teacher_disagreement_score":0.0020011417,"about_ca_system_score_codex":0.0008481959,"about_ca_system_score_gemma":0.0017733477,"threshold_uncertainty_score":0.0061540604},"labels":[],"label_agreement":null},{"id":"W2131591365","doi":"10.1109/wescan.1988.27671","title":"A bit-serial architecture for VLSI Viterbi processor","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Viterbi algorithm; Viterbi decoder; Computer science; Trellis (graph); Constraint (computer-aided design); Decoding methods; Very-large-scale integration; Parallel computing; Chip; Computer hardware; Algorithm; Arithmetic; Embedded system; Mathematics; Telecommunications","score_opus":0.015707567142225716,"score_gpt":0.26654157531310085,"score_spread":0.25083400817087514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131591365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029976383,0.00082712824,0.9210725,0.00045641715,0.00022606285,0.00023374386,0.00048889004,0.008065833,0.038652975],"genre_scores_gemma":[0.30935872,0.0009747885,0.6168244,0.0006580092,0.00016568457,0.00031958136,0.0017300544,0.00034341888,0.06962533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985456,0.000018723284,0.000009448784,0.000034569865,0.000068000954,0.000014619442],"domain_scores_gemma":[0.99985576,0.000019219318,0.000010118436,0.000031473042,0.00007264731,0.000010754105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012884165,0.000340937,0.00018888875,0.00042525353,0.0003637263,0.0006409495,0.0009767443,0.00051775936,0.015671458],"category_scores_gemma":[0.00036419037,0.0002851042,0.00018680251,0.0005538785,0.00019290319,0.0007189863,0.00027668578,0.00054198166,0.006752431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003895126,0.00018453994,0.0012764934,0.00044377928,0.00007931804,0.00032506406,0.00014807202,0.06699992,0.27988786,0.07818267,0.036635917,0.5354469],"study_design_scores_gemma":[0.00016627299,0.0008004833,0.0017744058,0.00009621096,0.00010805494,0.0014981233,0.00004322513,0.59165037,0.19645637,0.023869807,0.18345617,0.00008047609],"about_ca_topic_score_codex":0.0015847839,"about_ca_topic_score_gemma":0.0023653428,"teacher_disagreement_score":0.015671458,"about_ca_system_score_codex":0.00046043404,"about_ca_system_score_gemma":0.0006712746,"threshold_uncertainty_score":0.05242628},"labels":[],"label_agreement":null},{"id":"W2131874223","doi":"10.1109/qbsc.2014.6841207","title":"Joint channel estimation and raptor decoding over fading channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Decoding methods; Channel (broadcasting); Channel state information; Computer science; Algorithm; Joint (building); Binary erasure channel; Channel capacity; Topology (electrical circuits); Mathematics; Telecommunications; Wireless; Engineering; Combinatorics","score_opus":0.025022257254696,"score_gpt":0.25875738059441444,"score_spread":0.23373512333971844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131874223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071621455,0.0008790195,0.9232315,0.00010933218,0.000027293918,0.000038956605,0.00007172669,0.0006363374,0.0033843438],"genre_scores_gemma":[0.7960409,0.00071716576,0.20144616,0.000047052436,0.00003402383,0.000038608207,0.00011939838,0.000075621916,0.0014810769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680746,0.0016092333,0.00008707617,0.00027650248,0.0009080661,0.0003116388],"domain_scores_gemma":[0.9930347,0.004829127,0.0004209513,0.0009799628,0.00066304376,0.00007218247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019225696,0.0010025153,0.0011109001,0.0011064296,0.0004365031,0.0010532291,0.0006870843,0.0010747915,0.0007666404],"category_scores_gemma":[0.012280005,0.00039269918,0.00045694076,0.0013095752,0.0011284917,0.0022615725,0.0009769952,0.00071103417,0.00030294913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021735477,0.00002454917,0.0006337923,0.00007831453,0.00007017954,0.00013254686,0.00009784174,0.9289676,0.0032815712,0.01589943,0.00032509014,0.05027176],"study_design_scores_gemma":[0.0000072111916,0.00004969889,0.00016895052,0.000007570782,0.000014451041,0.00012601304,0.000018171619,0.9913099,0.0038099724,0.004142072,0.00033237427,0.000013591132],"about_ca_topic_score_codex":0.0028354374,"about_ca_topic_score_gemma":0.0024695224,"teacher_disagreement_score":0.0028354374,"about_ca_system_score_codex":0.00053362903,"about_ca_system_score_gemma":0.0011161515,"threshold_uncertainty_score":0.010167599},"labels":[],"label_agreement":null},{"id":"W2132193819","doi":"10.1109/isplc.2006.247486","title":"LDPC Coding for Non-Uniform Power-Line Channels","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Coding (social sciences); Line code; Channel capacity; Decoding methods; Electronic engineering; Algorithm; Telecommunications; Channel (broadcasting); Mathematics; Bandwidth (computing); Engineering; Baseband; Statistics","score_opus":0.020628029727172266,"score_gpt":0.27588379940228347,"score_spread":0.2552557696751112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132193819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11083651,0.00097329245,0.8788753,0.00031178535,0.000044266897,0.000057711462,0.0001710391,0.00024674184,0.008483248],"genre_scores_gemma":[0.9134302,0.0011057496,0.0806641,0.000110493,0.0000566137,0.000100155,0.00018685365,0.000037157573,0.0043085003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994199,0.00017687005,0.00002968445,0.00008625961,0.00019676411,0.00009052137],"domain_scores_gemma":[0.99719477,0.0015979629,0.00035005537,0.0004908354,0.00031745317,0.000048961683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053480983,0.00038134024,0.00044036293,0.0005834242,0.0004904056,0.0007399388,0.00057689816,0.00059909717,0.0010221505],"category_scores_gemma":[0.0047193547,0.00018073231,0.00019493223,0.0009286193,0.0011153038,0.0009238995,0.00083963876,0.00076907163,0.00029733445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019050977,0.000038967217,0.0007871464,0.00026841293,0.000026203077,0.00044850804,0.0002195288,0.5431839,0.015937587,0.3710867,0.0015984323,0.06621411],"study_design_scores_gemma":[0.000021646894,0.00002852054,0.00029283148,0.000021922748,0.00000822514,0.0001310007,0.000018249073,0.9117736,0.005361116,0.080514215,0.0018132139,0.000015427862],"about_ca_topic_score_codex":0.0018702771,"about_ca_topic_score_gemma":0.001667464,"teacher_disagreement_score":0.0018702771,"about_ca_system_score_codex":0.00089207786,"about_ca_system_score_gemma":0.0008495941,"threshold_uncertainty_score":0.0064724684},"labels":[],"label_agreement":null},{"id":"W2132462735","doi":"10.1109/tmag.2006.880998","title":"A Note on &amp;#8220;Signal-to-Noise Ratio Mismatch for Low-Density Parity-Check Coded Magnetic Recording Channels&amp;#8221; by W. Tan and J. R. Cruz","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Signal-to-noise ratio (imaging); Gaussian; Channel (broadcasting); Physics; Algorithm; Computer science; Statistics; Mathematics; Telecommunications; Decoding methods; Quantum mechanics","score_opus":0.01921664586638091,"score_gpt":0.2614097044063069,"score_spread":0.24219305853992598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132462735","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033957303,0.013875096,0.84020877,0.038731325,0.0055548437,0.00012169268,0.00013915845,0.001575021,0.06583685],"genre_scores_gemma":[0.739621,0.0056050057,0.21391995,0.009310018,0.0021053306,0.00018065161,0.000087368404,0.00058970385,0.028581016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980971,0.00048519677,0.000088700814,0.00029463493,0.00091690983,0.000117568],"domain_scores_gemma":[0.99452543,0.004085583,0.0001642429,0.00048110101,0.0006841676,0.00005947582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027708153,0.00049128407,0.00059324066,0.00031425603,0.00065048784,0.0014811701,0.0013452735,0.0018917818,0.0034087123],"category_scores_gemma":[0.010429911,0.00030208187,0.00023926835,0.00044521905,0.0026193983,0.002675733,0.00094774185,0.0037803184,0.0012495237],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007995509,0.00010753118,0.001475972,0.00041899568,0.00006188815,0.0012664091,0.0007069517,0.017040888,0.068607256,0.7177893,0.038631223,0.15309414],"study_design_scores_gemma":[0.00009455574,0.0004687181,0.001175744,0.00025533242,0.000069895126,0.0018850334,0.00016485908,0.3045977,0.21704768,0.34008244,0.13394807,0.00020997002],"about_ca_topic_score_codex":0.00064973783,"about_ca_topic_score_gemma":0.0005528221,"teacher_disagreement_score":0.0034087123,"about_ca_system_score_codex":0.0010594749,"about_ca_system_score_gemma":0.00046348307,"threshold_uncertainty_score":0.014653623},"labels":[],"label_agreement":null},{"id":"W2132963830","doi":"10.1109/isit.2012.6284128","title":"On the girth of quasi cyclic protograph LDPC codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Low-density parity-check code; Tanner graph; Combinatorics; Mathematics; Discrete mathematics; Base (topology); Upper and lower bounds; Graph; Odd graph; Decoding methods; Algorithm; Line graph; 1-planar graph; Error floor","score_opus":0.024408641560638385,"score_gpt":0.2713044957439428,"score_spread":0.2468958541833044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132963830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68294585,0.0021338249,0.29730982,0.0008120955,0.00010078221,0.00004891748,0.00025984054,0.00031738367,0.016071519],"genre_scores_gemma":[0.9769057,0.0013897028,0.01964091,0.00009370112,0.00007678327,0.000040523882,0.0001252466,0.00007116668,0.0016563523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995042,0.00013957181,0.000014855876,0.00008635818,0.00015926853,0.0000956082],"domain_scores_gemma":[0.99472743,0.003950455,0.0003984658,0.00045564066,0.0002608141,0.00020726558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062457833,0.0004475914,0.00045571756,0.001177048,0.00043884513,0.00068586547,0.0005602815,0.0005300728,0.0012965817],"category_scores_gemma":[0.0064938725,0.00027370025,0.00028994045,0.0008141114,0.0015384093,0.0012746583,0.0010997296,0.0012490394,0.00026188104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005001408,0.0000862782,0.0069493623,0.00039717238,0.0000878537,0.0005159289,0.00079462247,0.5996768,0.05023987,0.28713033,0.00173225,0.051889356],"study_design_scores_gemma":[0.000028642384,0.00020869786,0.0035167574,0.0000966982,0.00004055458,0.00039432474,0.00013524214,0.6531719,0.015235749,0.32423458,0.0028811402,0.000055691813],"about_ca_topic_score_codex":0.00075763435,"about_ca_topic_score_gemma":0.0007556425,"teacher_disagreement_score":0.0012965817,"about_ca_system_score_codex":0.0007933623,"about_ca_system_score_gemma":0.00048257847,"threshold_uncertainty_score":0.0057563186},"labels":[],"label_agreement":null},{"id":"W2133071357","doi":"10.1109/lcomm.2006.1576565","title":"Rateless coding over fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Fountain code; Channel state information; Transmitter; Robustness (evolution); Coding (social sciences); Forward error correction; Computer network; Channel (broadcasting); Decoding methods; Binary erasure channel; Algorithm; Theoretical computer science; Channel capacity; Telecommunications; Block code; Wireless; Concatenated error correction code; Mathematics; Statistics","score_opus":0.03528169430475773,"score_gpt":0.2894447272929726,"score_spread":0.25416303298821485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133071357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021818928,0.00051702285,0.97232777,0.00028037786,0.00007546282,0.000048669146,0.000042570715,0.0002836374,0.004605609],"genre_scores_gemma":[0.78344095,0.0009981643,0.21173663,0.00018122116,0.00011711346,0.00014072486,0.000054158263,0.000058032845,0.003272945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00022666038,0.000017797593,0.000046758894,0.00017600722,0.0000965038],"domain_scores_gemma":[0.9987882,0.000558241,0.00012027684,0.00027749827,0.000218531,0.00003736404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096815487,0.00047653585,0.0004951792,0.00044837734,0.00047764825,0.00091793295,0.0012207673,0.0007938119,0.0011872584],"category_scores_gemma":[0.0031433126,0.00017303556,0.00038488253,0.00054359453,0.0010972954,0.0013890609,0.00065080816,0.0009954172,0.00035293304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009633959,0.000028868133,0.00024569995,0.000088803325,0.000026742795,0.00030918382,0.00016894053,0.4603592,0.009203664,0.49026996,0.0013011676,0.037901543],"study_design_scores_gemma":[0.00002509862,0.00007248246,0.00008086457,0.000029014844,0.000015270776,0.00017853422,0.000020181355,0.88896686,0.0039017352,0.101988286,0.0046919724,0.000029637999],"about_ca_topic_score_codex":0.0022295902,"about_ca_topic_score_gemma":0.0013754495,"teacher_disagreement_score":0.0022295902,"about_ca_system_score_codex":0.00066906953,"about_ca_system_score_gemma":0.00067879603,"threshold_uncertainty_score":0.005120158},"labels":[],"label_agreement":null},{"id":"W2133753259","doi":"10.1109/tbc.2011.2115010","title":"Improve the Performance of LDPC Coded QAM by Selective Bit Mapping in Terrestrial Broadcasting System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Low-density parity-check code; Decoding methods; Quadrature amplitude modulation; QAM; Computer science; Code word; Algorithm; Encoder; Binary number; Digital Video Broadcasting; Modulation (music); Orthogonal frequency-division multiplexing; Broadcasting (networking); Code (set theory); Bit error rate; Electronic engineering; Theoretical computer science; Telecommunications; Mathematics; Arithmetic; Computer network; Channel (broadcasting); Engineering; Physics","score_opus":0.031040483997324505,"score_gpt":0.23006244391805392,"score_spread":0.1990219599207294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133753259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44603994,0.0008465965,0.5395131,0.0003179465,0.000035946374,0.00004096718,0.000058480644,0.00074882037,0.0123981945],"genre_scores_gemma":[0.9342666,0.00031835263,0.063793324,0.000050787385,0.000011151487,0.000014326291,0.000044121098,0.000035486464,0.0014657564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997743,0.00005820496,0.000008228211,0.000027926724,0.00009347028,0.000037954058],"domain_scores_gemma":[0.9997249,0.00013396895,0.000031152053,0.000030318053,0.000069286296,0.000010470148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027552067,0.00046502863,0.00028208893,0.00028365178,0.00030797874,0.00030432592,0.0002745002,0.0004526413,0.0010467462],"category_scores_gemma":[0.0011608353,0.000090915724,0.00014450548,0.00041704395,0.0002907906,0.00051215,0.00034260508,0.00025311726,0.00036426244],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049786427,0.00008120473,0.005193912,0.0002354097,0.00007235846,0.0003229505,0.0004970983,0.419341,0.3807035,0.024370827,0.0011678085,0.16751601],"study_design_scores_gemma":[0.000025917105,0.0001368931,0.001006388,0.000012959412,0.00002484938,0.000149643,0.000033137738,0.9282177,0.06704119,0.0021693402,0.0011645504,0.000017368984],"about_ca_topic_score_codex":0.001779916,"about_ca_topic_score_gemma":0.002112397,"teacher_disagreement_score":0.001779916,"about_ca_system_score_codex":0.00039624472,"about_ca_system_score_gemma":0.0005236968,"threshold_uncertainty_score":0.0035390854},"labels":[],"label_agreement":null},{"id":"W2133860680","doi":"10.1109/pimrc.2008.4699528","title":"Comparison of decoding complexities for LDPC and convolutional self-doubly-orthogonal codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Low-density parity-check code; Serial concatenated convolutional codes; Convolutional code; Block code; Concatenated error correction code; Sequential decoding; Decoding methods; Computer science; Algorithm; Turbo code; Linear code; List decoding; Theoretical computer science","score_opus":0.10275085133302606,"score_gpt":0.3506003186623637,"score_spread":0.24784946732933763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133860680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6462396,0.003095538,0.3318896,0.0008615553,0.000076318356,0.0001817819,0.0011197987,0.0021835004,0.014352244],"genre_scores_gemma":[0.8388903,0.0022284093,0.15043217,0.00010955609,0.000055885328,0.00020962686,0.0017128878,0.000438809,0.0059222616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984592,0.00031332887,0.00008892783,0.00013010045,0.00076470745,0.00024368959],"domain_scores_gemma":[0.98258334,0.013814171,0.0007145305,0.0008912692,0.0018580481,0.0001385585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014481953,0.0006330202,0.0005618693,0.0014427444,0.0004943294,0.001283624,0.00085744425,0.0006879334,0.0025880802],"category_scores_gemma":[0.015077287,0.000354675,0.00048058917,0.0016441295,0.0005935995,0.002423769,0.000566262,0.00085010054,0.0005802465],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023404832,0.00014969302,0.006400515,0.0005899038,0.00018793033,0.00030431495,0.00045796632,0.6703632,0.058162242,0.037019223,0.0024493528,0.22157517],"study_design_scores_gemma":[0.000119912445,0.00026770544,0.0033128457,0.000045763725,0.000078114,0.00038458884,0.00017081691,0.9213934,0.06252916,0.009076575,0.0025540965,0.00006704659],"about_ca_topic_score_codex":0.0039559184,"about_ca_topic_score_gemma":0.008349455,"teacher_disagreement_score":0.0039559184,"about_ca_system_score_codex":0.0022061435,"about_ca_system_score_gemma":0.0028003878,"threshold_uncertainty_score":0.016006768},"labels":[],"label_agreement":null},{"id":"W2134430085","doi":"10.1109/isit.2012.6284047","title":"Jar decoding: LDPC coding theorems for binary input memoryless channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Decoding methods; Code word; List decoding; Algorithm; Sequential decoding; Binary symmetric channel; Binary number; Parity-check matrix; Computer science; Coding (social sciences); Channel (broadcasting); Mathematics; Discrete mathematics; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; Telecommunications; Statistics","score_opus":0.046487357939178825,"score_gpt":0.3056263787452568,"score_spread":0.259139020806078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134430085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004545735,0.0006436159,0.99008965,0.000264851,0.00007786427,0.000035689514,0.00013940797,0.0002197328,0.0039834636],"genre_scores_gemma":[0.31143206,0.0038295938,0.6718334,0.0010018428,0.0005432394,0.0004908003,0.0008490651,0.00038160553,0.009638323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799216,0.0007030964,0.00011116302,0.00025283472,0.00079857133,0.00014226024],"domain_scores_gemma":[0.9955973,0.0024351503,0.0003900871,0.00053890474,0.0009355303,0.000102966645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027639356,0.0010437847,0.0008736079,0.0017034676,0.00079249684,0.0019256015,0.0010342879,0.0014774048,0.0013531852],"category_scores_gemma":[0.011781584,0.000464627,0.00061472383,0.0016585807,0.0019860202,0.0027647233,0.0014415227,0.002982768,0.00091827806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016533834,0.000037935486,0.00042423562,0.00023863025,0.00002664123,0.0002606297,0.00024453911,0.102679476,0.006677519,0.82521534,0.004295048,0.059734643],"study_design_scores_gemma":[0.000026989284,0.000052255367,0.00014696445,0.0000513905,0.000012152257,0.0002086771,0.000021203597,0.6088845,0.008440271,0.37463,0.0074835196,0.000042033484],"about_ca_topic_score_codex":0.0017691803,"about_ca_topic_score_gemma":0.0011272174,"teacher_disagreement_score":0.0027639356,"about_ca_system_score_codex":0.0013581365,"about_ca_system_score_gemma":0.0013750992,"threshold_uncertainty_score":0.014617324},"labels":[],"label_agreement":null},{"id":"W2135626675","doi":"10.1109/lcomm.2010.08.100548","title":"Trapping Sets of Fountain Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Binary erasure channel; Low-density parity-check code; Computer science; Luby transform code; Raptor code; Decoding methods; Tornado code; Online codes; Binary number; Erasure; Fountain; Trapping; Algorithm; Channel (broadcasting); Theoretical computer science; Mathematics; Channel capacity; Error floor; Arithmetic; Telecommunications; Biology","score_opus":0.0342706017425371,"score_gpt":0.30884369090483943,"score_spread":0.27457308916230233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135626675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6802303,0.00082136487,0.2926092,0.00064038334,0.0001458429,0.00008048482,0.00020867218,0.0006423682,0.024621302],"genre_scores_gemma":[0.97762376,0.00016858296,0.017635873,0.00012268077,0.000023063723,0.000059460537,0.00008626683,0.00006112225,0.0042191274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992374,0.0001593647,0.00003319883,0.00008573059,0.00035067913,0.00013361813],"domain_scores_gemma":[0.997489,0.0012542751,0.00029611352,0.00043112377,0.00037697464,0.0001526342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043954892,0.00028802315,0.0005226351,0.0011183785,0.0014077567,0.0011509708,0.0008897031,0.0012260887,0.0020068763],"category_scores_gemma":[0.005428843,0.0002986134,0.0003092389,0.00057718495,0.0016780349,0.0013286555,0.0018208374,0.0011429503,0.00036281414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036399264,0.00008829733,0.002016064,0.00018036083,0.000058153793,0.00076669845,0.00077853596,0.110437796,0.047818292,0.79792607,0.0029978477,0.036568034],"study_design_scores_gemma":[0.000043553388,0.00014357734,0.0009011542,0.000051229974,0.000020647341,0.0007601089,0.00015411801,0.60879195,0.03842008,0.3457222,0.0048990864,0.00009226101],"about_ca_topic_score_codex":0.0010691121,"about_ca_topic_score_gemma":0.0007092073,"teacher_disagreement_score":0.0020068763,"about_ca_system_score_codex":0.00070150825,"about_ca_system_score_gemma":0.00042819846,"threshold_uncertainty_score":0.0067136884},"labels":[],"label_agreement":null},{"id":"W2135729755","doi":"10.1109/isit.2008.4595024","title":"Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Enumeration; Decoding methods; Computational complexity theory; Computer science; Alphabet; Monte Carlo method; Word error rate; Error detection and correction; Mathematics; Statistics; Discrete mathematics; Artificial intelligence","score_opus":0.02445612708339055,"score_gpt":0.2867652284832313,"score_spread":0.26230910139984076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135729755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384212,0.00020378255,0.91413236,0.00005746104,0.000008938044,0.00003099075,0.000062119994,0.0002966772,0.0013655276],"genre_scores_gemma":[0.72103155,0.0002661442,0.2775665,0.00003379799,0.000012737937,0.0001051351,0.00020621414,0.00008898422,0.0006889377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978083,0.0010684209,0.00010616123,0.00016875025,0.00076834037,0.00008006725],"domain_scores_gemma":[0.99046785,0.0071416544,0.00070043973,0.0007143664,0.0008952133,0.00008053627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118142,0.0007670084,0.0009172112,0.0014386312,0.0003318593,0.0012347273,0.0012135665,0.0007519868,0.00059257523],"category_scores_gemma":[0.020611938,0.00037015346,0.00039620942,0.00080338016,0.0010286106,0.0015407908,0.000900744,0.000767307,0.00034057786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018972452,0.000041046344,0.0021841296,0.000082540035,0.000037254267,0.00008667,0.00007143395,0.9303285,0.0091762645,0.022688774,0.00015724651,0.034956537],"study_design_scores_gemma":[0.0000061099636,0.000016923537,0.00023852031,0.000008970647,0.000003429861,0.000030099403,0.0000054622474,0.98912746,0.0067501464,0.0037160537,0.00008540613,0.000011379774],"about_ca_topic_score_codex":0.0011509631,"about_ca_topic_score_gemma":0.00090934493,"teacher_disagreement_score":0.002118142,"about_ca_system_score_codex":0.00091308553,"about_ca_system_score_gemma":0.00083300687,"threshold_uncertainty_score":0.011201918},"labels":[],"label_agreement":null},{"id":"W2135870687","doi":"10.1109/isit.2008.4595149","title":"Packet loss recovery codes based on Vandermonde matrices and shift operators","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Vandermonde matrix; Network packet; Computer science; Fountain code; Erasure; Algorithm; Erasure code; Online codes; Matrix (chemical analysis); Block code; Decoding methods; Theoretical computer science; Hamming code; Computer network","score_opus":0.01682331555000532,"score_gpt":0.24399508773808806,"score_spread":0.22717177218808274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135870687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513186,0.0008744706,0.94313055,0.00015398845,0.00005731897,0.00007975806,0.000090257825,0.00041551038,0.0038794037],"genre_scores_gemma":[0.558903,0.0015660288,0.43260753,0.00014655474,0.00007247406,0.00025789486,0.00023426951,0.000088820445,0.0061234697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994887,0.00013603819,0.00002531343,0.000045532943,0.00025148594,0.000052916497],"domain_scores_gemma":[0.9991715,0.00035217212,0.000118814416,0.00013108182,0.00019903477,0.000027417767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000469296,0.00044819555,0.00028874955,0.0007196163,0.00027451068,0.00051797676,0.00048337216,0.0004685078,0.0010042579],"category_scores_gemma":[0.0022108846,0.00020480409,0.00028962936,0.0007606431,0.00066214945,0.00073814293,0.0004841706,0.0007379463,0.0004035579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003639231,0.00006932554,0.0008994921,0.0002151536,0.000044823835,0.00024528304,0.000272276,0.3439004,0.061412856,0.4542667,0.0020124055,0.13629729],"study_design_scores_gemma":[0.00006209977,0.00024818332,0.0003710911,0.00005179374,0.000019930369,0.00030620024,0.00003309777,0.86004466,0.046844337,0.08299947,0.008960233,0.000058904203],"about_ca_topic_score_codex":0.0014709934,"about_ca_topic_score_gemma":0.0012552986,"teacher_disagreement_score":0.0014709934,"about_ca_system_score_codex":0.00042902806,"about_ca_system_score_gemma":0.00092812575,"threshold_uncertainty_score":0.0033595562},"labels":[],"label_agreement":null},{"id":"W2136318607","doi":"10.1109/newcas.2005.1496661","title":"Implementation and Error Performance Evaluation-of an Iterative Decoding Algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Acceleration; Decoding methods; Algorithm; Noise (video); Error detection and correction; Signal-to-noise ratio (imaging); Task (project management); Range (aeronautics); Sensitivity (control systems); SIGNAL (programming language); Computer engineering; Electronic engineering; Artificial intelligence; Engineering; Telecommunications","score_opus":0.046823231368200796,"score_gpt":0.3807374726851813,"score_spread":0.33391424131698055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136318607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30797717,0.00032148714,0.679656,0.00017185516,0.00011239109,0.00020815885,0.00019238533,0.0041767396,0.0071838396],"genre_scores_gemma":[0.6265123,0.00013874378,0.36765042,0.000062247425,0.000018241639,0.00011604866,0.00034996387,0.00027261907,0.0048794355],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843127,0.00025026215,0.000104209656,0.00019035766,0.0009010474,0.00012279575],"domain_scores_gemma":[0.99657,0.0010248112,0.00019338862,0.0006673438,0.0014749564,0.00006953212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126912,0.00059554924,0.00051645807,0.0006109687,0.0004050576,0.00079973985,0.00088581245,0.00096171163,0.0027215446],"category_scores_gemma":[0.006211256,0.00019084901,0.00025352932,0.0005072349,0.00031099154,0.0010191688,0.0004631988,0.0006324068,0.0012671509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014141392,0.00041552485,0.004194448,0.00030950797,0.0001390034,0.00031822803,0.00037691664,0.078601204,0.5515381,0.011253913,0.001768486,0.34967062],"study_design_scores_gemma":[0.00005619483,0.00082534394,0.0016351297,0.000016745453,0.00003836934,0.00049184845,0.000039402075,0.3228808,0.66856414,0.0007266803,0.0046847654,0.000040620125],"about_ca_topic_score_codex":0.0022122292,"about_ca_topic_score_gemma":0.0015604352,"teacher_disagreement_score":0.0027215446,"about_ca_system_score_codex":0.00065162894,"about_ca_system_score_gemma":0.0011283691,"threshold_uncertainty_score":0.00910449},"labels":[],"label_agreement":null},{"id":"W2137048573","doi":"10.1109/tcomm.2010.01.060685","title":"LDPC code design considerations for non-uniform channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Concatenated error correction code; Transmitter; Decoding methods; Computer science; Channel capacity; Channel (broadcasting); Theoretical computer science; Code (set theory); Block code; Linear code; Turbo code; Integer programming; Forward error correction; Algorithm; Telecommunications","score_opus":0.08745486694520799,"score_gpt":0.32500439269825104,"score_spread":0.23754952575304306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137048573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03865232,0.0006695597,0.95370466,0.00032124048,0.00003970096,0.00004546215,0.00008725807,0.00011836399,0.006361396],"genre_scores_gemma":[0.74469215,0.0014755348,0.24976301,0.00018795006,0.00008048723,0.0002054945,0.00014153431,0.000077995726,0.003375689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00042844328,0.00004518891,0.00011404769,0.00025335545,0.00008468397],"domain_scores_gemma":[0.99633056,0.0022368177,0.00032051222,0.00049750565,0.00054295926,0.000071609575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010418097,0.00046136652,0.000480904,0.0004632366,0.00037412235,0.00078971544,0.0005836416,0.00067679293,0.0013151636],"category_scores_gemma":[0.005901254,0.0002744366,0.00024304716,0.0007821736,0.00095546833,0.00088550616,0.00063942693,0.0007348862,0.00030732615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012566538,0.000035247776,0.00082131266,0.00023915195,0.000024880736,0.00020727712,0.00011183585,0.75364196,0.013041394,0.18480577,0.0009749079,0.045970608],"study_design_scores_gemma":[0.00001697191,0.000067377325,0.00016849095,0.000023645689,0.000010790214,0.00016414661,0.000020837138,0.9406141,0.0055487123,0.05109748,0.0022529785,0.000014484787],"about_ca_topic_score_codex":0.0007132857,"about_ca_topic_score_gemma":0.0010598424,"teacher_disagreement_score":0.0013151636,"about_ca_system_score_codex":0.0006293395,"about_ca_system_score_gemma":0.0009487854,"threshold_uncertainty_score":0.005509734},"labels":[],"label_agreement":null},{"id":"W2137345549","doi":"10.1109/ccece.2005.1556907","title":"Ancestor based survivor decision in M-algorithm convolutional decoding","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Additive white Gaussian noise; Path (computing); Computer science; Decoding methods; Noise (video); Convolutional code; Metric (unit); Channel (broadcasting); Artificial intelligence; Telecommunications; Computer network","score_opus":0.011173476000703467,"score_gpt":0.25162867860726224,"score_spread":0.24045520260655878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137345549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06905198,0.0002667844,0.9282021,0.000110216824,0.0000381855,0.000043214164,0.00004456684,0.0005117634,0.0017310882],"genre_scores_gemma":[0.5823051,0.00019311623,0.4147529,0.00009145126,0.000029478162,0.000044441094,0.0001051177,0.000041194886,0.002437233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944526,0.00014992677,0.000049283888,0.00009199797,0.0002000428,0.00006349346],"domain_scores_gemma":[0.99917185,0.00031030434,0.00010711647,0.00018030513,0.00019878977,0.000031718606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605532,0.00039961975,0.0004354651,0.00057670823,0.00038227494,0.0005533717,0.0007921824,0.0005871016,0.00077610585],"category_scores_gemma":[0.0022991695,0.00019948477,0.00024754633,0.000459834,0.00047751985,0.001106205,0.00087201933,0.0005312114,0.00023424256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007556226,0.000086158674,0.006349886,0.00013560531,0.00007543384,0.00037253872,0.00044925135,0.18961956,0.045010295,0.07916613,0.0018830498,0.6760964],"study_design_scores_gemma":[0.000034640707,0.00020381506,0.0007111328,0.000023097351,0.000027757453,0.00035309183,0.000028207261,0.94027007,0.04013409,0.015114425,0.0030694916,0.00003013514],"about_ca_topic_score_codex":0.0013948905,"about_ca_topic_score_gemma":0.0023866042,"teacher_disagreement_score":0.0013948905,"about_ca_system_score_codex":0.00051525905,"about_ca_system_score_gemma":0.0007725246,"threshold_uncertainty_score":0.003738463},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010481317734682657,"score_gpt":0.23217440628737365,"score_spread":0.221693088552691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137813581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013753279,0.00030011515,0.9946397,0.00018741563,0.00004641951,0.00003241241,0.00005070804,0.0003384231,0.0030294708],"genre_scores_gemma":[0.09721451,0.0014544204,0.8899047,0.0003530001,0.0002129934,0.00026433996,0.0005011199,0.00038135497,0.009713559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997072,0.0010544186,0.00016889193,0.00060724607,0.0008649807,0.00023246373],"domain_scores_gemma":[0.99563354,0.0022962196,0.0002382324,0.00083496154,0.00088538555,0.00011163705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030438993,0.0012958741,0.0014588465,0.0016786068,0.0010954504,0.0031831523,0.0020402817,0.0018277897,0.0073822895],"category_scores_gemma":[0.013949307,0.0007057065,0.00097416964,0.0029602337,0.0024730477,0.0056335633,0.0023680483,0.0023131708,0.0038030394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011787158,0.00003598303,0.0003748299,0.0001483916,0.00006952719,0.000071921364,0.00012270904,0.17886476,0.00095975125,0.54796886,0.007687894,0.26357746],"study_design_scores_gemma":[0.000029623396,0.00003263456,0.000079960504,0.000027846389,0.000022898586,0.00008280014,0.000024352485,0.43005735,0.0014118743,0.555389,0.012814963,0.00002676807],"about_ca_topic_score_codex":0.003172921,"about_ca_topic_score_gemma":0.0022294787,"teacher_disagreement_score":0.0073822895,"about_ca_system_score_codex":0.001256058,"about_ca_system_score_gemma":0.0021592837,"threshold_uncertainty_score":0.02469629},"labels":[],"label_agreement":null},{"id":"W2137892166","doi":"10.1109/isit.2010.5513605","title":"Lowering the error floor of LDPC codes using cyclic liftings","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Error floor; Decoding methods; Algorithm; Code (set theory); Concatenated error correction code; Degree (music); Mathematics; Degree distribution; Computer science; Channel (broadcasting); Block code; Combinatorics; Telecommunications","score_opus":0.024279361456860934,"score_gpt":0.29324177799465806,"score_spread":0.2689624165377971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137892166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27963692,0.0005505198,0.7126982,0.000253214,0.000087280634,0.00007131155,0.00010188445,0.00070534105,0.005895338],"genre_scores_gemma":[0.8710483,0.0003720697,0.1261233,0.00008541141,0.00004998389,0.00005496063,0.000111008485,0.00004785383,0.0021071346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996668,0.0000769465,0.000016371421,0.00003790614,0.00014582968,0.00005615708],"domain_scores_gemma":[0.9990109,0.000355056,0.00014494699,0.00024066551,0.00019363963,0.000054791934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031208544,0.000491266,0.00027259454,0.0005515077,0.00034245715,0.0003312224,0.00038732582,0.00031373848,0.0007425089],"category_scores_gemma":[0.0020087077,0.00016284274,0.00022932405,0.00048821396,0.00066968164,0.00040197562,0.00062404043,0.0005029617,0.00019843644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040102223,0.0001362925,0.0028235507,0.00029415396,0.00005996821,0.0005501072,0.00023358662,0.34596077,0.2582875,0.100652285,0.002025051,0.28857577],"study_design_scores_gemma":[0.000052784195,0.0002679718,0.0011613099,0.00003839685,0.000034117955,0.00039439922,0.00003914397,0.8437225,0.12345578,0.026883546,0.0039048782,0.00004522076],"about_ca_topic_score_codex":0.00072796096,"about_ca_topic_score_gemma":0.0011784111,"teacher_disagreement_score":0.0007425089,"about_ca_system_score_codex":0.00033555864,"about_ca_system_score_gemma":0.0007353191,"threshold_uncertainty_score":0.0024839044},"labels":[],"label_agreement":null},{"id":"W2137990712","doi":"10.1109/iscas.2005.1465635","title":"Architectures for ASIC Implementations of Low-Density Parity-Check Convolutional Encoders and Decoders","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Application-specific integrated circuit; Encoder; Low-density parity-check code; Computer science; Convolutional code; Decoding methods; Throughput; Realization (probability); Serial concatenated convolutional codes; Architecture; Parallel computing; Computer architecture; Computer hardware; Block code; Algorithm; Concatenated error correction code; Mathematics; Telecommunications","score_opus":0.01749115870873056,"score_gpt":0.3007548408460522,"score_spread":0.2832636821373216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137990712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15632503,0.0017986952,0.7992018,0.00073834,0.00042842032,0.00027969317,0.00034860865,0.0037685302,0.03711097],"genre_scores_gemma":[0.67043793,0.0010752692,0.3157133,0.00025062598,0.000100502104,0.00021395287,0.00044557897,0.00009409586,0.011668821],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997918,0.000033573182,0.000014775475,0.000025989602,0.00009581409,0.000038070037],"domain_scores_gemma":[0.99964285,0.00007185052,0.000036686382,0.00006633234,0.00016581258,0.000016551625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028881372,0.00036369168,0.00022104957,0.0004034698,0.0002929575,0.0008385569,0.0008714255,0.0004988674,0.0027808761],"category_scores_gemma":[0.0006971918,0.00019023148,0.00016204009,0.00043936772,0.0002848605,0.00066566997,0.00023078821,0.00050792476,0.0008948015],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055759004,0.00026440437,0.0020159092,0.0008521947,0.00011421039,0.0004537474,0.00027447386,0.080088094,0.3839645,0.28333583,0.014659871,0.2334191],"study_design_scores_gemma":[0.00019609489,0.00079366344,0.0011973078,0.00013542522,0.00017700144,0.00063377037,0.00010995596,0.42938608,0.43055066,0.031089833,0.10566992,0.000060263184],"about_ca_topic_score_codex":0.00071186264,"about_ca_topic_score_gemma":0.0017142269,"teacher_disagreement_score":0.0027808761,"about_ca_system_score_codex":0.0005741204,"about_ca_system_score_gemma":0.0005637591,"threshold_uncertainty_score":0.009302974},"labels":[],"label_agreement":null},{"id":"W2138519638","doi":"","title":"Turbo décodage de codes produits par un algorithme basé sur la propagation de croyance","year":2007,"lang":"fr","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Belief propagation; Decoding methods; Computer science; BCJR algorithm; BCH code; Berlekamp–Welch algorithm; Algorithm; Bit error rate; Serial concatenated convolutional codes; Turbo equalizer; Reed–Solomon error correction; Low-density parity-check code; Mathematics; Concatenated error correction code; Block code; Error floor","score_opus":0.020624283679259326,"score_gpt":0.2752411274662792,"score_spread":0.2546168437870199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138519638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033487767,0.000445518,0.9638699,0.00014939473,0.00007977922,0.000027915094,0.000034241355,0.00049648545,0.0014090448],"genre_scores_gemma":[0.3917985,0.0010900266,0.5958048,0.00018080379,0.000109828405,0.000113392125,0.00020095134,0.00021450994,0.010487238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00015872884,0.000039215338,0.0000948581,0.00036887865,0.00006295525],"domain_scores_gemma":[0.99793833,0.0011928655,0.00015072571,0.00022931956,0.00044752302,0.000041216015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010851631,0.0008409519,0.00071850716,0.0008464718,0.0004692683,0.00068462203,0.000860945,0.0010631356,0.0011422074],"category_scores_gemma":[0.0059388704,0.00032502253,0.0005299609,0.00072779617,0.00094540964,0.0014110651,0.0006395275,0.0011424213,0.0006648689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066988956,0.00007836677,0.0014965463,0.00024432404,0.0001403134,0.00045121653,0.00044013574,0.2965768,0.06445604,0.06990187,0.0024102977,0.56313425],"study_design_scores_gemma":[0.000035563648,0.00011409611,0.0002565268,0.000018664725,0.000027110851,0.00026123584,0.000015170697,0.94964117,0.040650744,0.0063855797,0.0025613094,0.00003288733],"about_ca_topic_score_codex":0.004598733,"about_ca_topic_score_gemma":0.0042783464,"teacher_disagreement_score":0.004598733,"about_ca_system_score_codex":0.00064909353,"about_ca_system_score_gemma":0.0011471469,"threshold_uncertainty_score":0.009143949},"labels":[],"label_agreement":null},{"id":"W2138551264","doi":"10.1109/jssc.2008.925402","title":"Power Reduction Techniques for LDPC Decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; CMOS; Parallel computing; Computer science; Decoding methods; Very-large-scale integration; Throughput; Overhead (engineering); Power (physics); Reduction (mathematics); Code (set theory); Subthreshold conduction; Computer hardware; Algorithm; Mathematics; Voltage; Embedded system; Electronic engineering; Transistor; Wireless; Electrical engineering; Telecommunications; Engineering","score_opus":0.03228159806211426,"score_gpt":0.2982665878258631,"score_spread":0.26598498976374885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138551264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06972815,0.0014306215,0.907843,0.00027822304,0.00005337319,0.00009383041,0.0001008404,0.0012986519,0.01917328],"genre_scores_gemma":[0.4960352,0.0018558914,0.4737686,0.00023500783,0.00007464043,0.00014576403,0.00036587528,0.00028903174,0.027230095],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998147,0.000025496496,0.000010556203,0.000027976475,0.00010614962,0.00001505796],"domain_scores_gemma":[0.9997596,0.00009709148,0.000027740693,0.000040958188,0.00006973943,0.000004810621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110790534,0.0005087531,0.00022279138,0.00043931662,0.00034124398,0.00043178006,0.00054106937,0.00027462584,0.0032817118],"category_scores_gemma":[0.0006488217,0.00020293894,0.0002322442,0.0005319227,0.00024715392,0.00047667354,0.00032975292,0.00037938272,0.0010223604],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001674507,0.00009390176,0.0006294612,0.00042195493,0.000053490352,0.0002385194,0.00031155196,0.057769857,0.4864745,0.044802804,0.0032032277,0.4058333],"study_design_scores_gemma":[0.00006153487,0.00033693816,0.0010448839,0.00006538045,0.00007153639,0.0008035804,0.00008052739,0.4849105,0.44915584,0.02533358,0.038101003,0.00003466536],"about_ca_topic_score_codex":0.0007016339,"about_ca_topic_score_gemma":0.0020077513,"teacher_disagreement_score":0.0032817118,"about_ca_system_score_codex":0.0005240386,"about_ca_system_score_gemma":0.00037742325,"threshold_uncertainty_score":0.010978401},"labels":[],"label_agreement":null},{"id":"W2138628599","doi":"10.1109/tit.2010.2094870","title":"Normal Factor Graphs and Holographic Transformations","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Factor graph; Factor (programming language); Discrete mathematics; Mathematics; Transformation (genetics); Intersection (aeronautics); Algebraic number; Holography; Combinatorics; Computer science; Algorithm; Decoding methods","score_opus":0.01763422653024705,"score_gpt":0.22108139237653862,"score_spread":0.20344716584629158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138628599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08097411,0.0007988451,0.83189726,0.0017791189,0.00025459522,0.00008482271,0.00024566232,0.00050235813,0.08346332],"genre_scores_gemma":[0.82781184,0.0012973535,0.14379431,0.0009817601,0.00035097965,0.00015023493,0.00040140285,0.0002751909,0.024936924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.0002518336,0.000046391717,0.0002235211,0.00028025027,0.00016051864],"domain_scores_gemma":[0.998382,0.00062280643,0.00017774943,0.00038688394,0.00032375994,0.00010686932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000760945,0.00037571535,0.00035707053,0.0010441213,0.00118638,0.0018523311,0.00079172396,0.0006964742,0.0056004366],"category_scores_gemma":[0.0029946861,0.00022769546,0.00062292116,0.001021857,0.0040634456,0.005532992,0.0014745418,0.0016390815,0.0007810512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004006339,0.0000041156327,0.00003954756,0.0000071751765,0.0000010309208,0.000017069418,0.000071585106,0.0004969225,0.00021747677,0.99504256,0.00029891025,0.0037994601],"study_design_scores_gemma":[0.0000033892243,0.0000069499533,0.00003232317,0.000005086013,0.0000022685097,0.00005495976,0.000056558165,0.0030499964,0.0005679762,0.9896231,0.006591876,0.0000054940238],"about_ca_topic_score_codex":0.0016920358,"about_ca_topic_score_gemma":0.0013086636,"teacher_disagreement_score":0.0056004366,"about_ca_system_score_codex":0.0012384104,"about_ca_system_score_gemma":0.000891069,"threshold_uncertainty_score":0.01873529},"labels":[],"label_agreement":null},{"id":"W2138681964","doi":"10.1109/tcomm.2009.02.060671","title":"A new framework for soft decision equalization in frequency selective MIMO channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Factor graph; MIMO; Equalization (audio); Computer science; Low-density parity-check code; Decoding methods; Algorithm; Computational complexity theory; Channel (broadcasting); Belief propagation; Multipath propagation; Adaptive equalizer; Multiuser detection; Bit error rate; Code division multiple access; Telecommunications","score_opus":0.04868654231185577,"score_gpt":0.3483338355548701,"score_spread":0.2996472932430143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138681964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057331973,0.00009084226,0.99812883,0.00004860294,0.000030711042,0.000008009361,0.000018713636,0.00006059848,0.0010403799],"genre_scores_gemma":[0.15539336,0.0011107678,0.83583266,0.00022640167,0.00033050092,0.00016626113,0.00014442386,0.000098403456,0.0066973376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957675,0.00010453776,0.000016748594,0.0000700349,0.00018808544,0.0000438713],"domain_scores_gemma":[0.99973863,0.00011433922,0.000022433947,0.000039228355,0.00007012558,0.000015298563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047026147,0.00078779313,0.0005881363,0.00047517347,0.0003662071,0.0008890031,0.0010744117,0.0007829048,0.002456628],"category_scores_gemma":[0.0010043465,0.00027803122,0.0006107489,0.00057750795,0.0008581329,0.0011218447,0.000821748,0.0011864868,0.00073331455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004706511,0.00004102149,0.00017991145,0.00012223348,0.000042296375,0.00017443103,0.000080444115,0.47827446,0.0104534095,0.42371958,0.0026668909,0.08419829],"study_design_scores_gemma":[0.000011724176,0.000035934772,0.000071958384,0.0000124832,0.000011094723,0.00007839883,0.000009938097,0.90939224,0.002068564,0.08186883,0.006423118,0.000015656455],"about_ca_topic_score_codex":0.0015420875,"about_ca_topic_score_gemma":0.0019675181,"teacher_disagreement_score":0.002456628,"about_ca_system_score_codex":0.0005081892,"about_ca_system_score_gemma":0.0009531644,"threshold_uncertainty_score":0.008218288},"labels":[],"label_agreement":null},{"id":"W2139132527","doi":"10.1109/allerton.2009.5394494","title":"LDGM-based codes for successive refinement","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm; Programming language; Theoretical computer science","score_opus":0.019470610140385935,"score_gpt":0.3014589788285326,"score_spread":0.2819883686881467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139132527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010772502,0.00031291312,0.98606944,0.00012274498,0.000034202792,0.0000463246,0.000036368707,0.00027658293,0.0023290107],"genre_scores_gemma":[0.40240398,0.00052392756,0.59377414,0.00016170988,0.000029994218,0.00012949541,0.000115639625,0.00006534168,0.0027957512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993462,0.0002125902,0.00002942244,0.00004581299,0.00032134188,0.000044657983],"domain_scores_gemma":[0.99892044,0.0004599009,0.000091963164,0.00026542196,0.00023718349,0.000025156682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948185,0.0003880437,0.00034868385,0.000559939,0.00033312247,0.0003967968,0.0007803701,0.0007048683,0.0013632852],"category_scores_gemma":[0.0045684054,0.00015712732,0.0003681447,0.0007624312,0.0007690841,0.0007426052,0.000996989,0.0009485924,0.00046282454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035068774,0.000059128346,0.0005473287,0.00032903702,0.00006711299,0.00028736654,0.00048245303,0.47629517,0.07158453,0.25418344,0.0023204833,0.19349322],"study_design_scores_gemma":[0.000052870844,0.00007191373,0.0001176658,0.000047960828,0.000015990105,0.00022572934,0.000017905662,0.9320738,0.0260513,0.033849128,0.0074436297,0.000032177275],"about_ca_topic_score_codex":0.0022124378,"about_ca_topic_score_gemma":0.0018895423,"teacher_disagreement_score":0.0022124378,"about_ca_system_score_codex":0.000791294,"about_ca_system_score_gemma":0.0008329371,"threshold_uncertainty_score":0.005741298},"labels":[],"label_agreement":null},{"id":"W2139199201","doi":"10.1109/wcnc.2008.51","title":"Packet Oriented Error Correcting Codes Using Vandermonde Matrices and Shift Operators","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Vandermonde matrix; Network packet; Computer science; Algorithm; Error detection and correction; Decoding methods; Packet generator; Link state packet; Processing delay; Overhead (engineering); Transmission delay; Arithmetic; Theoretical computer science; Mathematics; Computer network","score_opus":0.03887033956179556,"score_gpt":0.28802783810957694,"score_spread":0.24915749854778138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139199201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02079186,0.00022952558,0.9763867,0.000068070905,0.000037505884,0.0000717921,0.000024867064,0.00022403659,0.00216567],"genre_scores_gemma":[0.37377933,0.00064398564,0.6220863,0.00010307761,0.000049445483,0.00020704766,0.00009656889,0.000058138852,0.002976181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.00019255475,0.000037390866,0.000059554786,0.0002970116,0.000055045777],"domain_scores_gemma":[0.99915874,0.00028553017,0.00013885164,0.0001237933,0.00026797585,0.000025111165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582302,0.0005501303,0.00032576424,0.0006144658,0.0003371583,0.0005898162,0.00063391094,0.00047597158,0.0007162659],"category_scores_gemma":[0.0019097868,0.0002092417,0.00031150374,0.0005634994,0.0005983801,0.0006480387,0.0004238524,0.00048632958,0.00035423366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003117853,0.00008418874,0.0015149441,0.0002981868,0.000086587905,0.00021659366,0.0003349231,0.37544042,0.10195607,0.3258653,0.0013192538,0.19257171],"study_design_scores_gemma":[0.00007210403,0.0004232005,0.00034646125,0.000081567305,0.00005031541,0.00034681018,0.000044777153,0.8641962,0.08728004,0.034306217,0.012788298,0.000063975975],"about_ca_topic_score_codex":0.001152037,"about_ca_topic_score_gemma":0.0015241904,"teacher_disagreement_score":0.001152037,"about_ca_system_score_codex":0.0004553847,"about_ca_system_score_gemma":0.0011132996,"threshold_uncertainty_score":0.0033040047},"labels":[],"label_agreement":null},{"id":"W2140396799","doi":"10.1109/mcom.2011.5978428","title":"Myths and realities of rateless coding","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Realm; Decoding methods; Coding (social sciences); Principal (computer security); Online codes; Channel (broadcasting); Fountain code; Theoretical computer science; Block code; Algorithm; Telecommunications; Computer security; Concatenated error correction code; Mathematics; Statistics","score_opus":0.08560396432842812,"score_gpt":0.3034911939410803,"score_spread":0.2178872296126522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140396799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026174951,0.0814401,0.3559887,0.32952625,0.0074672084,0.00010345756,0.0003628403,0.00032635202,0.19861014],"genre_scores_gemma":[0.75231725,0.067339815,0.09270309,0.04342012,0.020508252,0.0007278934,0.00017201243,0.00037762974,0.02243401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915558,0.004509771,0.00032375037,0.0010602907,0.002217481,0.00033290283],"domain_scores_gemma":[0.96850866,0.02486241,0.0009854645,0.0032871945,0.0018715666,0.00048483463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013964645,0.0008275562,0.0007013381,0.00194228,0.002456191,0.00596424,0.0023533225,0.0051945057,0.0022215173],"category_scores_gemma":[0.030024461,0.0005839312,0.00075932645,0.0011008836,0.0480609,0.016895054,0.0033130664,0.015882166,0.0008991337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109392195,0.0000065791205,0.000048273465,0.00004249345,0.0000043692135,0.000022572602,0.00035941345,0.0006810907,0.000074941236,0.99253476,0.0019449395,0.0042695994],"study_design_scores_gemma":[0.000010883439,0.00001900647,0.000058648715,0.00010344283,0.0000036973213,0.0000837974,0.00014963654,0.0014743737,0.00017131536,0.9762263,0.021680329,0.000018663184],"about_ca_topic_score_codex":0.000855341,"about_ca_topic_score_gemma":0.0003862077,"teacher_disagreement_score":0.013964645,"about_ca_system_score_codex":0.0029112562,"about_ca_system_score_gemma":0.0016550842,"threshold_uncertainty_score":0.07385296},"labels":[],"label_agreement":null},{"id":"W2140405585","doi":"10.1109/sips.2007.4387554","title":"An Area-Efficient FPGA-Based Architecture for Fully-Parallel Stochastic LDPC Decoding","year":2007,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Field-programmable gate array; Berlekamp–Welch algorithm; Virtex; Throughput; Parallel computing; List decoding; Algorithm; Concatenated error correction code; Error floor; Computer hardware; Wireless; Telecommunications; Block code","score_opus":0.05856250830028428,"score_gpt":0.35254967257214515,"score_spread":0.2939871642718609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140405585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12278349,0.0010509163,0.8450184,0.00035175934,0.0002399266,0.0001639142,0.00043630943,0.009564989,0.02039035],"genre_scores_gemma":[0.58832437,0.00033899533,0.40273172,0.0001317611,0.000055810317,0.000083396975,0.0005655472,0.00009026552,0.0076781986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989974,0.00001931481,0.0000055799765,0.000017617222,0.000042397118,0.000015322596],"domain_scores_gemma":[0.99987805,0.00003179768,0.000016096172,0.00002541467,0.00004127597,0.000007410635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013247064,0.00026715276,0.00014029296,0.0002942785,0.00018279138,0.0003089248,0.0005263835,0.00023299185,0.0030291784],"category_scores_gemma":[0.00027543586,0.00012480572,0.00014518113,0.00025469225,0.00013866137,0.00032785267,0.00014729924,0.00024840908,0.0008636539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005394557,0.00010619773,0.0017042164,0.00036585893,0.00008862615,0.00036167382,0.00008643066,0.05664611,0.37379718,0.021085255,0.012408472,0.53281057],"study_design_scores_gemma":[0.00022613385,0.0012109863,0.0044990536,0.00007907462,0.000113102404,0.001759316,0.000040926152,0.54555494,0.34531787,0.0067030136,0.09441221,0.000083412466],"about_ca_topic_score_codex":0.0011217186,"about_ca_topic_score_gemma":0.0027074239,"teacher_disagreement_score":0.0030291784,"about_ca_system_score_codex":0.0003972133,"about_ca_system_score_gemma":0.00043878928,"threshold_uncertainty_score":0.0101335645},"labels":[],"label_agreement":null},{"id":"W2140435059","doi":"10.1109/wcnc.2004.1311467","title":"Quasiregular LDPC codes for space-time wireless transmission","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Block code; Coding gain; Computer science; Concatenated error correction code; Fading; Rayleigh fading; Turbo code; Algorithm; Electronic engineering; Space–time code; Tornado code; Antenna diversity; Forward error correction; Convolutional code; Antenna (radio); Decoding methods; Telecommunications; Engineering","score_opus":0.011857263714464208,"score_gpt":0.25508850456466226,"score_spread":0.24323124085019804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140435059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0767718,0.0016705494,0.9157625,0.0003279169,0.00006800275,0.000054091073,0.00013095165,0.0004944402,0.004719719],"genre_scores_gemma":[0.7680952,0.0015020333,0.22695914,0.00012707262,0.00008177679,0.00015311594,0.00022253774,0.00007543048,0.002783747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.00016927882,0.000020471538,0.000039082708,0.00016003552,0.00003115978],"domain_scores_gemma":[0.9985399,0.00075388834,0.00016893972,0.00029794432,0.00020222813,0.000037126636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004073488,0.00028215806,0.00025397446,0.0004369073,0.00027822214,0.00054394075,0.00035961063,0.00052900834,0.0007946376],"category_scores_gemma":[0.0025174865,0.00016501478,0.00017780157,0.00076342723,0.00082898117,0.0005032214,0.00041619723,0.0006892817,0.00027811527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018411227,0.000048715996,0.0012610236,0.000280373,0.000030096808,0.00019424455,0.00026004136,0.43443194,0.04176062,0.40364084,0.0021143423,0.11579364],"study_design_scores_gemma":[0.000027504093,0.00009624255,0.00035180367,0.000027363387,0.00001002681,0.00016004463,0.000017274355,0.88064325,0.015742242,0.096041076,0.0068582525,0.0000249213],"about_ca_topic_score_codex":0.0008812677,"about_ca_topic_score_gemma":0.0008154868,"teacher_disagreement_score":0.0008812677,"about_ca_system_score_codex":0.0006062964,"about_ca_system_score_gemma":0.0005722037,"threshold_uncertainty_score":0.0043990016},"labels":[],"label_agreement":null},{"id":"W2140508448","doi":"10.1109/vetecs.2008.249","title":"A New Approach for the Construction of Powerful LDPC Convolutional Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Low-density parity-check code; Turbo code; Convolutional code; Serial concatenated convolutional codes; Computer science; Orthogonality; Forward error correction; Tanner graph; Linear code; Algorithm; Theoretical computer science; Concatenated error correction code; Block code; Error floor; Discrete mathematics; Mathematics; Decoding methods","score_opus":0.03567444933081305,"score_gpt":0.26305555459900115,"score_spread":0.2273811052681881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140508448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009521605,0.00026992097,0.98321587,0.00010342308,0.00006991699,0.000056117227,0.000059151043,0.00025136303,0.006452524],"genre_scores_gemma":[0.18964246,0.0010503886,0.8019807,0.00014439794,0.0001031324,0.00019187575,0.00026898348,0.00009861349,0.006519456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996629,0.000059189315,0.00001706256,0.000046710833,0.00018540364,0.000028726654],"domain_scores_gemma":[0.9996593,0.0000975294,0.000031982516,0.0000922668,0.000092772636,0.00002627262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029202277,0.000427249,0.0003169647,0.0007032985,0.00048272737,0.0005326091,0.0005896779,0.00036507752,0.0014447724],"category_scores_gemma":[0.00090800767,0.0002257086,0.00038965308,0.00049697276,0.0007437358,0.0006583526,0.0011518773,0.0011701559,0.00060868566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081663355,0.00007844842,0.00060909736,0.0004570202,0.000047980317,0.00042329382,0.00023823313,0.033391375,0.13811435,0.62502277,0.0028728936,0.1986629],"study_design_scores_gemma":[0.00009791333,0.00032905902,0.0008141719,0.00014118318,0.00009371154,0.0023256037,0.000055739292,0.41182294,0.1674406,0.2898095,0.12693304,0.00013652138],"about_ca_topic_score_codex":0.0002938154,"about_ca_topic_score_gemma":0.0005307523,"teacher_disagreement_score":0.0014447724,"about_ca_system_score_codex":0.0003779116,"about_ca_system_score_gemma":0.00063356425,"threshold_uncertainty_score":0.004833281},"labels":[],"label_agreement":null},{"id":"W2140826318","doi":"10.1109/glocom.2009.5425510","title":"A Relaxed Half-Stochastic Iterative Decoder for LDPC Codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Computer science; Binary number; Node (physics); Representation (politics); Relaxation (psychology); Belief propagation; Code (set theory); Theoretical computer science; Mathematics; Arithmetic","score_opus":0.021291398461019143,"score_gpt":0.29779551588657366,"score_spread":0.27650411742555453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140826318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011468533,0.00010347571,0.9857869,0.000082466795,0.000022482945,0.000033865097,0.00007187917,0.00030508338,0.0021252236],"genre_scores_gemma":[0.19927517,0.00023270727,0.79549474,0.00015098225,0.000045078472,0.00011414163,0.00041803447,0.00013591701,0.0041332385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998858,0.00030958623,0.000061928644,0.000106110776,0.00060433353,0.000060097187],"domain_scores_gemma":[0.99892944,0.00041834018,0.00009613922,0.00025508847,0.000241623,0.00005939086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086302013,0.00044741758,0.0005531357,0.00037508085,0.0003608521,0.0007241064,0.0011415988,0.00063290313,0.0019526939],"category_scores_gemma":[0.0025405576,0.0003320821,0.00052139367,0.0004291637,0.00060049206,0.00081611495,0.0010085299,0.0010843585,0.0011230172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043992227,0.00010583922,0.00091823837,0.00023226535,0.00010334813,0.000242982,0.0002665926,0.4903326,0.09036801,0.18852149,0.0029345204,0.2255342],"study_design_scores_gemma":[0.000021573638,0.00008012041,0.000106764615,0.0000144372425,0.000011680324,0.00014986431,0.000007782799,0.9705645,0.015802085,0.009633357,0.003582458,0.000025523586],"about_ca_topic_score_codex":0.0009486172,"about_ca_topic_score_gemma":0.0013021898,"teacher_disagreement_score":0.0019526939,"about_ca_system_score_codex":0.00048284372,"about_ca_system_score_gemma":0.0013099324,"threshold_uncertainty_score":0.0065324306},"labels":[],"label_agreement":null},{"id":"W2141560267","doi":"10.1109/isit.2003.1228362","title":"Full cmos min-sum analog iterative decoder","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CMOS; Computer science; Electronic engineering; Engineering","score_opus":0.01792086971694833,"score_gpt":0.2675987714591154,"score_spread":0.24967790174216709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141560267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0350018,0.0015133886,0.8778621,0.00065137475,0.00036739343,0.00017696703,0.0016439761,0.006967711,0.07581542],"genre_scores_gemma":[0.61035484,0.0009876805,0.3382328,0.0009681379,0.00023105499,0.00015165462,0.0009435552,0.00018316624,0.04794714],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973017,0.000023731362,0.00001987028,0.00005303473,0.00014485393,0.000028312366],"domain_scores_gemma":[0.99972135,0.000056240377,0.00002211299,0.000053990912,0.0001313992,0.000014812385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001620727,0.00039779555,0.0003187268,0.00040141845,0.0004927128,0.0010937831,0.0009198573,0.00056503224,0.012913061],"category_scores_gemma":[0.00054754555,0.00023903509,0.00023650353,0.0003887693,0.00020750704,0.00083581475,0.00056754716,0.00048568376,0.0033610687],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065267266,0.00009526841,0.00088788616,0.00060939085,0.00008849186,0.0003571433,0.00020417682,0.039764807,0.17921898,0.078108825,0.02573692,0.6742754],"study_design_scores_gemma":[0.00012441367,0.00071277854,0.0015216974,0.00015071803,0.00014490602,0.0034993498,0.00009446101,0.42334634,0.35776362,0.043064583,0.16945046,0.00012670294],"about_ca_topic_score_codex":0.0008336246,"about_ca_topic_score_gemma":0.0020600597,"teacher_disagreement_score":0.012913061,"about_ca_system_score_codex":0.00052010437,"about_ca_system_score_gemma":0.00064350554,"threshold_uncertainty_score":0.043198466},"labels":[],"label_agreement":null},{"id":"W2141678038","doi":"10.1109/isit.2004.1365091","title":"Short-cycle-free interleaver design for increasing minimum squared euclidean distance","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Euclidean distance; Algorithm; Graph; Computer science; Mean squared error; Probability of error; Euclidean geometry; Minimum distance; Factor graph; Error detection and correction; Mathematics; Decoding methods; Theoretical computer science; Discrete mathematics; Statistics; Artificial intelligence","score_opus":0.032240943151400345,"score_gpt":0.2800949596242964,"score_spread":0.24785401647289607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141678038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029675521,0.0001626579,0.966614,0.0000643844,0.000030337489,0.000035435325,0.00003451159,0.00042575022,0.002957284],"genre_scores_gemma":[0.55421937,0.00028015857,0.44111347,0.00013337495,0.000033520053,0.0001184368,0.00012292808,0.00023360911,0.0037451496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929225,0.00013684871,0.00007003861,0.000120503144,0.00031086692,0.00006940045],"domain_scores_gemma":[0.997846,0.00074067625,0.00032611066,0.0003320818,0.00067072845,0.00008434119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043757504,0.00054443505,0.0003222214,0.0005400422,0.00031427253,0.0004919331,0.0006813003,0.00034610875,0.001969372],"category_scores_gemma":[0.0035686588,0.00020012201,0.0001689784,0.0005994036,0.00040726454,0.0009421616,0.0004579777,0.000625796,0.00049894117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069014356,0.0001557376,0.001630481,0.00033302914,0.000069763904,0.00023213777,0.00025695184,0.18806493,0.25748494,0.19029865,0.0030568969,0.35772645],"study_design_scores_gemma":[0.000096291995,0.00052951585,0.00073048,0.000059662554,0.000058407055,0.0004412268,0.000042884196,0.6513176,0.26176214,0.06725636,0.017638115,0.00006730264],"about_ca_topic_score_codex":0.0009135781,"about_ca_topic_score_gemma":0.0021962097,"teacher_disagreement_score":0.001969372,"about_ca_system_score_codex":0.0005178252,"about_ca_system_score_gemma":0.0008329751,"threshold_uncertainty_score":0.006588161},"labels":[],"label_agreement":null},{"id":"W2141851220","doi":"10.1109/iscc.1999.780949","title":"Joint source/channel soft Viterbi decoding","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Convolutional code; Viterbi decoder; Computer science; Decoding methods; Encoder; Algorithm; Sequential decoding; Viterbi algorithm; Soft-decision decoder; Turbo code; Soft output Viterbi algorithm; Distributed source coding; Redundancy (engineering); Theoretical computer science; Variable-length code; Block code","score_opus":0.030067722794816322,"score_gpt":0.2490076677951402,"score_spread":0.21893994500032388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141851220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007928005,0.00012295487,0.99025494,0.00006891547,0.000017817862,0.000067068555,0.000032895998,0.00024221907,0.0012651933],"genre_scores_gemma":[0.54680395,0.00024666614,0.44852546,0.00011371682,0.000044525183,0.0002624159,0.00015944747,0.000106455765,0.0037373106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984586,0.00046719814,0.00010946215,0.00019226197,0.0005856631,0.00018683587],"domain_scores_gemma":[0.9982828,0.00083180494,0.000179677,0.0002270613,0.00041594435,0.000062782456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019915816,0.0009162495,0.0014802451,0.0007747795,0.00051898917,0.0015413932,0.0011974125,0.0014059941,0.002714464],"category_scores_gemma":[0.0046207746,0.0005488843,0.000511556,0.0007339708,0.0011497292,0.0008937313,0.0015095492,0.0010623924,0.001238697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003010905,0.000059357935,0.0011404225,0.00019841248,0.00008561174,0.0001751719,0.00008811187,0.79590464,0.020882944,0.08064559,0.001165898,0.09935279],"study_design_scores_gemma":[0.000017638076,0.000038522125,0.000120810815,0.0000141638375,0.000012667475,0.00008584164,0.0000058464957,0.97861165,0.009320005,0.0111324275,0.0006231103,0.000017308079],"about_ca_topic_score_codex":0.00238306,"about_ca_topic_score_gemma":0.0031043417,"teacher_disagreement_score":0.002714464,"about_ca_system_score_codex":0.0013800465,"about_ca_system_score_gemma":0.0028912164,"threshold_uncertainty_score":0.010532618},"labels":[],"label_agreement":null},{"id":"W2141886216","doi":"10.1109/cwit.2007.375704","title":"Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Binary symmetric channel; Computer science; Parity bit; Binary number; Bit error rate; Error detection and correction; Crossover; Mathematics; Theoretical computer science; Arithmetic","score_opus":0.028329411632844147,"score_gpt":0.30951444901934444,"score_spread":0.2811850373865003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141886216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17085586,0.00013631975,0.827248,0.000042942433,0.00000822536,0.00004896553,0.00012259952,0.00035762182,0.0011794528],"genre_scores_gemma":[0.7952476,0.00022567547,0.20357029,0.00001685649,0.000010452597,0.00009738976,0.00018729523,0.00005758394,0.0005869553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998933,0.00041173378,0.000038744114,0.0001124735,0.00043599858,0.00006815444],"domain_scores_gemma":[0.9935743,0.004415001,0.0006432509,0.0005812157,0.0007119153,0.00007422828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016393929,0.0006571606,0.0006398835,0.0013666429,0.00032176185,0.0006844107,0.00070742593,0.00070084335,0.00046129597],"category_scores_gemma":[0.014910181,0.0003186651,0.00023937947,0.00063883304,0.0008853784,0.0010656482,0.00060298597,0.0006009401,0.00023962928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032578988,0.000049025908,0.0061737215,0.00009144112,0.0000422394,0.00011042008,0.00013220531,0.893379,0.022757914,0.017040607,0.00026596943,0.05963178],"study_design_scores_gemma":[0.00000632724,0.000015696161,0.0007884176,0.0000069239163,0.0000041650223,0.000032907992,0.0000058586866,0.98438895,0.011966794,0.0026748853,0.00009316211,0.000015866894],"about_ca_topic_score_codex":0.0025180518,"about_ca_topic_score_gemma":0.0015330316,"teacher_disagreement_score":0.0025180518,"about_ca_system_score_codex":0.0007558866,"about_ca_system_score_gemma":0.0007780982,"threshold_uncertainty_score":0.008670032},"labels":[],"label_agreement":null},{"id":"W2141997901","doi":"10.1109/wcnc.2007.138","title":"Rate-Compatible Punctured Systematic Repeat-Accumulate Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Puncturing; Low-density parity-check code; Turbo code; Concatenated error correction code; Additive white Gaussian noise; Serial concatenated convolutional codes; Algorithm; Linear code; Computer science; Block code; Raptor code; Forward error correction; Mathematics; Theoretical computer science; Decoding methods; Error floor; Channel (broadcasting); Telecommunications","score_opus":0.020306385443128665,"score_gpt":0.28431506656042055,"score_spread":0.26400868111729187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141997901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12105867,0.0011431224,0.868385,0.00022917765,0.000117413154,0.00009814878,0.00013644983,0.0007923382,0.008039604],"genre_scores_gemma":[0.7436685,0.0006886173,0.2508023,0.00017089884,0.00007373331,0.00010849532,0.00013762183,0.00007307222,0.0042767986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943656,0.0001531409,0.000037294318,0.00006168586,0.0002630895,0.000048245267],"domain_scores_gemma":[0.9985721,0.00042728437,0.00030087415,0.000344142,0.00029372986,0.0000616752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046573844,0.00048454714,0.0003408205,0.00037748207,0.00028548145,0.00044092536,0.0006691779,0.0005274251,0.0010785902],"category_scores_gemma":[0.0024836892,0.00017826314,0.00028581807,0.00039180732,0.00052209664,0.00057640625,0.0006249767,0.00047587176,0.00061906996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009549522,0.00012511223,0.0036018593,0.00067930995,0.00013037054,0.0023501827,0.0006891102,0.17631471,0.2566087,0.30656815,0.003422148,0.24855533],"study_design_scores_gemma":[0.0001438609,0.00092722365,0.0013037088,0.00017709745,0.000103709375,0.0053900806,0.0000724898,0.6546324,0.23506662,0.0726402,0.029367737,0.00017496829],"about_ca_topic_score_codex":0.00016586631,"about_ca_topic_score_gemma":0.00028908177,"teacher_disagreement_score":0.0010785902,"about_ca_system_score_codex":0.00020837165,"about_ca_system_score_gemma":0.00045037418,"threshold_uncertainty_score":0.0036081672},"labels":[],"label_agreement":null},{"id":"W2142122479","doi":"10.1109/glocom.2005.1577852","title":"Low-density parity-check convolutional codes applied to packet based communication systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Encoder; Convolutional code; Computer science; Serial concatenated convolutional codes; Network packet; Turbo code; Algorithm; Decoding methods; Communications system; Forward error correction; Block code; Theoretical computer science; Concatenated error correction code; Computer network","score_opus":0.027947130595222063,"score_gpt":0.2825641169939033,"score_spread":0.25461698639868124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142122479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03431302,0.0010084442,0.9575102,0.0002540632,0.00008783782,0.00004758579,0.000034407596,0.0002719082,0.0064725126],"genre_scores_gemma":[0.8521001,0.0023190472,0.14118186,0.00012318756,0.00007742256,0.00008066812,0.000054325195,0.000042763444,0.0040206383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996604,0.0001057948,0.000013171443,0.000028545903,0.00015721611,0.00003490876],"domain_scores_gemma":[0.99909544,0.0005782027,0.000059759717,0.00009106092,0.00016265645,0.000012809192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039087894,0.00038715545,0.0002678424,0.00039338914,0.0003073669,0.0005589688,0.0003266973,0.00057727686,0.00084277795],"category_scores_gemma":[0.0025810516,0.00017205942,0.00017249885,0.00061010284,0.000589297,0.00042692598,0.00040688404,0.0006253547,0.0002292764],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094617164,0.000032190517,0.0015469282,0.000296748,0.000035130724,0.00044659,0.00018494221,0.53304404,0.030711144,0.32800263,0.0013175417,0.10428759],"study_design_scores_gemma":[0.000008260781,0.000048681126,0.00024457093,0.000027720347,0.000016531074,0.00015037203,0.000012211962,0.9463013,0.012785841,0.03630754,0.004086664,0.000010256235],"about_ca_topic_score_codex":0.002635113,"about_ca_topic_score_gemma":0.0019748472,"teacher_disagreement_score":0.002635113,"about_ca_system_score_codex":0.0007952398,"about_ca_system_score_gemma":0.0008404376,"threshold_uncertainty_score":0.0057699084},"labels":[],"label_agreement":null},{"id":"W2142162318","doi":"10.1109/tit.2010.2046236","title":"Is SP BP?","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Unification; Constraint satisfaction problem; Probabilistic logic; Constraint (computer-aided design); Emphasis (telecommunications); Belief propagation; Notation; Computer science; Constraint satisfaction; Security token; Local consistency; Reduction (mathematics); Theoretical computer science; Algorithm; Factor graph; Mathematics; Discrete mathematics; Artificial intelligence; Decoding methods; Arithmetic; Programming language","score_opus":0.009486741150574348,"score_gpt":0.24544525729776595,"score_spread":0.2359585161471916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142162318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037004568,0.0009136637,0.85971403,0.024788044,0.0011089311,0.00017662269,0.00134823,0.0034841814,0.07146174],"genre_scores_gemma":[0.5727649,0.0022064578,0.3521242,0.008514035,0.002900453,0.0005710933,0.0040798886,0.002623997,0.054214995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949588,0.0011066784,0.00031263471,0.002013301,0.0009698193,0.0006387219],"domain_scores_gemma":[0.9864096,0.00786018,0.000748567,0.0029246102,0.0017163473,0.00034065594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002931843,0.0008500674,0.0017885299,0.0009924273,0.0019761021,0.005706554,0.0019891472,0.0026132404,0.01998136],"category_scores_gemma":[0.026007704,0.00081521296,0.001688154,0.0020038167,0.0029270689,0.008836265,0.0025433637,0.0043431385,0.007706907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028955808,0.00015330051,0.0022481675,0.00043789358,0.00020688535,0.00027829857,0.0005709611,0.010879289,0.0022829047,0.7264369,0.046992186,0.20922367],"study_design_scores_gemma":[0.000023219065,0.000024712937,0.00029090632,0.00002987102,0.000044096683,0.00025719468,0.00016088877,0.042103536,0.0014238502,0.94252455,0.013093195,0.000023967888],"about_ca_topic_score_codex":0.0036116745,"about_ca_topic_score_gemma":0.003227894,"teacher_disagreement_score":0.01998136,"about_ca_system_score_codex":0.001291297,"about_ca_system_score_gemma":0.0031563353,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2142486636","doi":"10.1109/tit.2005.846404","title":"On Factor Graphs and the Fourier Transform","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"","keywords":"Mathematics; Multiplicative function; Factor graph; Discrete mathematics; Duality (order theory); Convolutional code; Combinatorics; Cograph; Chordal graph; 1-planar graph; Algorithm; Graph","score_opus":0.007316594167935572,"score_gpt":0.22462673122805185,"score_spread":0.2173101370601163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142486636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08452472,0.0037565061,0.7857874,0.0026515806,0.0005774895,0.00006290399,0.00037232813,0.0003453282,0.12192172],"genre_scores_gemma":[0.77515376,0.0052781547,0.17447694,0.0016243409,0.0012707342,0.00018162311,0.0005669874,0.0004450214,0.04100246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00032366905,0.00003796236,0.00017768801,0.00022692596,0.00016828778],"domain_scores_gemma":[0.99827814,0.0008152429,0.00020783232,0.00022934996,0.00035021323,0.00011924134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013985172,0.0009488667,0.0005897403,0.0025792979,0.0014408646,0.0019524186,0.0007331864,0.0014503062,0.0058451346],"category_scores_gemma":[0.0043105828,0.00041548724,0.0010625989,0.0020831195,0.004476688,0.0049663056,0.0017234061,0.0024639913,0.0014219703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055271676,0.0000041448557,0.00004323061,0.000008577438,0.0000015581114,0.000027074499,0.00006450643,0.0011628178,0.00019438224,0.9949203,0.00038399073,0.0031838291],"study_design_scores_gemma":[0.0000017356014,0.0000050753906,0.00003687209,0.000007733263,0.000001224794,0.00003870712,0.000020790238,0.003754787,0.000114861636,0.9933066,0.0027059694,0.0000057075476],"about_ca_topic_score_codex":0.0023605814,"about_ca_topic_score_gemma":0.0011090507,"teacher_disagreement_score":0.0058451346,"about_ca_system_score_codex":0.0014984688,"about_ca_system_score_gemma":0.00057713984,"threshold_uncertainty_score":0.0195539},"labels":[],"label_agreement":null},{"id":"W2143319381","doi":"10.1109/acssc.2005.1600071","title":"Rateless Slepian-Wolf Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Decoding methods; Encoding (memory); Code (set theory); Algorithm; Theoretical computer science; Fountain code; Online codes; Block code; Linear code; Artificial intelligence; Programming language","score_opus":0.010189889358893414,"score_gpt":0.24192426116647095,"score_spread":0.23173437180757753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143319381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036688633,0.00054912735,0.9561233,0.0002447243,0.00007064493,0.000063080864,0.00013457779,0.00020816519,0.0059177135],"genre_scores_gemma":[0.665424,0.00066972757,0.3254918,0.0002540476,0.00014368276,0.00020018165,0.00024632228,0.00011253711,0.007457783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00029694263,0.00005849434,0.00012769591,0.00035951144,0.00008230479],"domain_scores_gemma":[0.9979826,0.00061157916,0.00038871038,0.0004057354,0.0005377605,0.00007358857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208917,0.00056640204,0.0006041261,0.0005586263,0.0002650933,0.00086949544,0.0008595065,0.00076755055,0.0013239552],"category_scores_gemma":[0.0038677682,0.0002738937,0.00026660392,0.000723185,0.0007963561,0.0011035994,0.00069751043,0.0010091051,0.00059710594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005484988,0.00007191135,0.0012645274,0.00026125342,0.00007663257,0.0002432204,0.00011456221,0.37973103,0.07053566,0.44990468,0.0032413697,0.0940066],"study_design_scores_gemma":[0.00004560037,0.00014814253,0.00020823495,0.000047260048,0.000017311415,0.00022023651,0.0000130285935,0.8758559,0.034252003,0.0846174,0.00453344,0.000041365627],"about_ca_topic_score_codex":0.000339009,"about_ca_topic_score_gemma":0.00030340845,"teacher_disagreement_score":0.0013239552,"about_ca_system_score_codex":0.00067455333,"about_ca_system_score_gemma":0.00077001535,"threshold_uncertainty_score":0.0053990483},"labels":[],"label_agreement":null},{"id":"W2144024329","doi":"10.1109/tsp.2008.929671","title":"Fully Parallel Stochastic LDPC Decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Field-programmable gate array; Parallel computing; Algorithm; Gate array; Clock rate; Throughput; FLOPS; Computer hardware; Wireless; Telecommunications; Chip","score_opus":0.03476306807681433,"score_gpt":0.2671225874347176,"score_spread":0.23235951935790328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144024329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15030129,0.0003125636,0.8270101,0.00026114247,0.00008638339,0.00012813452,0.0006587731,0.0040770513,0.017164556],"genre_scores_gemma":[0.73414665,0.0002629561,0.24979265,0.00020637005,0.00005744073,0.00015620652,0.0010404917,0.00017028429,0.014167016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00006243523,0.00003223492,0.00010799442,0.00022765728,0.000052485764],"domain_scores_gemma":[0.99955016,0.00010807733,0.00004170799,0.00009807957,0.00017482389,0.000027162332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000234078,0.0004415584,0.00044862082,0.0004671864,0.0003907493,0.00055518537,0.0005643239,0.00044966122,0.0030407377],"category_scores_gemma":[0.00069140806,0.00026253302,0.0003411916,0.0004984197,0.0002674229,0.0006177491,0.0005166078,0.00034959553,0.0011646553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073245255,0.00019434316,0.002126076,0.00025138387,0.00012515433,0.0003905354,0.0001855035,0.38436437,0.254051,0.05709382,0.008602417,0.29188296],"study_design_scores_gemma":[0.000054175962,0.0001328663,0.0007846102,0.000014041424,0.000022073624,0.0003507144,0.00001568805,0.90337086,0.076852135,0.009684657,0.008687689,0.00003052508],"about_ca_topic_score_codex":0.002047392,"about_ca_topic_score_gemma":0.0044330857,"teacher_disagreement_score":0.0030407377,"about_ca_system_score_codex":0.0006559107,"about_ca_system_score_gemma":0.001223626,"threshold_uncertainty_score":0.010172248},"labels":[],"label_agreement":null},{"id":"W2144611931","doi":"10.1109/tsp.2008.929337","title":"Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); McGill University","funders":"","keywords":"Decoding methods; List decoding; Berlekamp–Welch algorithm; Algorithm; Computer science; Sequential decoding; Block (permutation group theory); Block code; Mathematics; Theoretical computer science; Concatenated error correction code; Combinatorics","score_opus":0.02652388012649342,"score_gpt":0.2598790656467982,"score_spread":0.23335518552030476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144611931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08181042,0.00026818662,0.9098159,0.00031474835,0.00006280606,0.000056276866,0.00014385117,0.00042591014,0.0071019023],"genre_scores_gemma":[0.8640634,0.00040525547,0.13020171,0.00014742037,0.0000667723,0.00008191348,0.0002787871,0.00007253791,0.0046823123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.0005201061,0.000050084444,0.00009136957,0.0006115061,0.00012004234],"domain_scores_gemma":[0.9967434,0.0019972476,0.0002987489,0.00034178313,0.00055776123,0.00006109779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187514,0.00055063365,0.00051227596,0.00044483112,0.00040070276,0.0008877715,0.0005194403,0.0006427884,0.0014299693],"category_scores_gemma":[0.0055196034,0.00026533907,0.00033942182,0.00071584614,0.0007075611,0.0007625402,0.00077911397,0.0005503506,0.00049452594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004048859,0.000058614154,0.0013440792,0.00015317292,0.00007945013,0.0002520698,0.00015096454,0.77233064,0.02344241,0.13516776,0.0017896384,0.06482624],"study_design_scores_gemma":[0.00001442545,0.000048192393,0.00020692126,0.000012673311,0.000008610084,0.00008361451,0.000009883832,0.9728971,0.009975189,0.016125122,0.00060623436,0.000012055995],"about_ca_topic_score_codex":0.0023927914,"about_ca_topic_score_gemma":0.0039210296,"teacher_disagreement_score":0.0023927914,"about_ca_system_score_codex":0.00074951147,"about_ca_system_score_gemma":0.0013075001,"threshold_uncertainty_score":0.0059165955},"labels":[],"label_agreement":null},{"id":"W2144910324","doi":"10.1109/dcc.1992.227460","title":"Convolutional interpolative coding algorithms","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Encoder; Coding (social sciences); Computer science; Algorithm; Generalization; Theoretical computer science; Mathematics; Statistics","score_opus":0.02463550095341779,"score_gpt":0.2769062326984798,"score_spread":0.25227073174506204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144910324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055469726,0.00044386397,0.9880051,0.00009151243,0.000064782645,0.00005108519,0.00011975057,0.00069915236,0.0049777986],"genre_scores_gemma":[0.21519507,0.0010949171,0.7649059,0.0002309146,0.00007821718,0.00017106408,0.0006091685,0.00015002316,0.017564595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963224,0.00005385282,0.000025791744,0.00006335436,0.00016244549,0.000062341445],"domain_scores_gemma":[0.99947196,0.00018798915,0.00003926149,0.00013332233,0.00014849668,0.000018978864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027327,0.000582042,0.0004786795,0.0010596577,0.00040762906,0.00085503666,0.001152896,0.0008160842,0.004052001],"category_scores_gemma":[0.0018565014,0.00030766122,0.0004949395,0.0010073838,0.00059970847,0.0009656804,0.000941459,0.0010620995,0.0012827629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021516831,0.00006769067,0.00074677024,0.00020789575,0.00007023943,0.00014228771,0.00015774736,0.15434213,0.01743486,0.32109246,0.0065890527,0.49893373],"study_design_scores_gemma":[0.000028560364,0.00007591,0.0002758524,0.00006030007,0.00003803593,0.00020909272,0.000014017265,0.8855318,0.037350256,0.052023232,0.024358962,0.00003401341],"about_ca_topic_score_codex":0.0039275293,"about_ca_topic_score_gemma":0.0045926645,"teacher_disagreement_score":0.004052001,"about_ca_system_score_codex":0.0009735308,"about_ca_system_score_gemma":0.0010430387,"threshold_uncertainty_score":0.013555348},"labels":[],"label_agreement":null},{"id":"W2144916011","doi":"10.1109/tit.2015.2413780","title":"Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hamming distance; Hypercube; Discrete mathematics; Algorithm; Mathematics; Computer science; Permutation (music); Connection (principal bundle); Combinatorics","score_opus":0.042513704087232124,"score_gpt":0.2742095388981154,"score_spread":0.23169583481088327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144916011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093902856,0.00032291052,0.90214133,0.00025932663,0.000049351198,0.00007188053,0.00006934102,0.0004788013,0.0027041235],"genre_scores_gemma":[0.81518674,0.00021012362,0.1816523,0.00013403379,0.000049597667,0.00008197159,0.00010774017,0.0000730073,0.0025045958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980338,0.00043309788,0.00018484959,0.00039426755,0.0007799481,0.00017396637],"domain_scores_gemma":[0.995038,0.0021240637,0.0011450287,0.001110828,0.00045976086,0.00012237516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024881163,0.0006689675,0.0006443003,0.0006520831,0.0005599204,0.0011388507,0.0013937624,0.00070049113,0.0018050754],"category_scores_gemma":[0.008006683,0.00029860542,0.00034377817,0.00073578104,0.000941913,0.0023005535,0.0014349512,0.0010253271,0.00037983185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010836585,0.00019707129,0.0017238285,0.00038931577,0.0000727209,0.00031905674,0.00031987645,0.42187133,0.11664493,0.16113225,0.0015769629,0.29466894],"study_design_scores_gemma":[0.00004727958,0.0005767016,0.00039778044,0.000039773175,0.000033994696,0.00023934833,0.000058604615,0.8744498,0.08109353,0.039768595,0.0032519628,0.00004271427],"about_ca_topic_score_codex":0.00042006094,"about_ca_topic_score_gemma":0.00039000594,"teacher_disagreement_score":0.0024881163,"about_ca_system_score_codex":0.0009818494,"about_ca_system_score_gemma":0.00077602704,"threshold_uncertainty_score":0.013158619},"labels":[],"label_agreement":null},{"id":"W2145949855","doi":"10.1109/icc.2011.5962811","title":"Near Optimum Majority-Logic Based Decoding of Low-Density Parity-Check Codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Decoding methods; Parity-check matrix; Algorithm; Belief propagation; Berlekamp–Welch algorithm; List decoding; Computer science; Sequential decoding; Computation; Reliability (semiconductor); Parity bit; Block code; Measure (data warehouse); Computational complexity theory; Mathematics; Theoretical computer science; Concatenated error correction code; Error floor","score_opus":0.04596375382161072,"score_gpt":0.266575264689824,"score_spread":0.2206115108682133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145949855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05613909,0.00031950756,0.94019574,0.00016511806,0.000024995326,0.000029850402,0.00004644019,0.0003726741,0.0027066232],"genre_scores_gemma":[0.67205673,0.0002487844,0.32535654,0.00009929407,0.000034883433,0.00006341882,0.000107539054,0.00006582262,0.0019670269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987968,0.00047812404,0.000053181233,0.00015957924,0.00039369956,0.00011842738],"domain_scores_gemma":[0.99844956,0.00087596313,0.0001408156,0.00019663681,0.00030264005,0.00003433211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010051022,0.0005077372,0.0007812678,0.0006204604,0.00040710543,0.00072905613,0.00089500914,0.00077610917,0.00063387677],"category_scores_gemma":[0.0043753767,0.00027872287,0.00031883377,0.0005056151,0.0006906744,0.0009946622,0.0009001366,0.0006495385,0.00038931594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005806748,0.00007226945,0.0015359565,0.00016658813,0.00007267536,0.00024227741,0.00029841543,0.6657153,0.03559136,0.08361525,0.0014596707,0.21064949],"study_design_scores_gemma":[0.000021712423,0.000045069148,0.00016815745,0.000009705703,0.000009544911,0.00006902774,0.000010113531,0.9754454,0.011522615,0.012238675,0.00044736077,0.000012661303],"about_ca_topic_score_codex":0.0010310791,"about_ca_topic_score_gemma":0.0011981946,"teacher_disagreement_score":0.0010310791,"about_ca_system_score_codex":0.0005658045,"about_ca_system_score_gemma":0.00079909846,"threshold_uncertainty_score":0.005315542},"labels":[],"label_agreement":null},{"id":"W2146638301","doi":"10.1109/jssc.2006.883329","title":"A 0.18-&lt;tex&gt;$muhbox m$&lt;/tex&gt;CMOS Analog Min-Sum Iterative Decoder for a (32,8) Low-Density Parity-Check (LDPC) Code","year":2006,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Low-density parity-check code; CMOS; Soft-decision decoder; Computer science; Decoding methods; Coding gain; Chip; Electronic circuit; Electronic engineering; Analogue electronics; Turbo code; Algorithm; Electrical engineering; Telecommunications; Engineering","score_opus":0.027009546065417847,"score_gpt":0.29197127142526313,"score_spread":0.2649617253598453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146638301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1438719,0.0016106695,0.7751628,0.0011737942,0.0005925774,0.0005337532,0.0012087299,0.010728508,0.06511724],"genre_scores_gemma":[0.50803256,0.0007896886,0.4468753,0.0005003396,0.00013348898,0.0001637945,0.0006666523,0.00021261309,0.04262563],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982256,0.00001748848,0.000008554377,0.000030255735,0.000105952735,0.000015166256],"domain_scores_gemma":[0.99969745,0.0000629502,0.000047875325,0.00004327771,0.00012479947,0.000023718345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017850875,0.00025928652,0.00017384854,0.00027635915,0.00028754436,0.0006039816,0.0009275608,0.00038553932,0.006803058],"category_scores_gemma":[0.0005446811,0.00016527271,0.00014254896,0.0002861117,0.00021449367,0.0005983858,0.00026651472,0.00032363358,0.0022820712],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021246511,0.000111003326,0.0014354943,0.00037499442,0.00004560388,0.00038416515,0.00019579908,0.0047803465,0.7671348,0.022176713,0.014626229,0.18852243],"study_design_scores_gemma":[0.00008299378,0.0011595716,0.0022336717,0.00007750507,0.000112494985,0.0024966854,0.00007790272,0.07810963,0.76337546,0.0026780032,0.14952064,0.000075471486],"about_ca_topic_score_codex":0.0010287111,"about_ca_topic_score_gemma":0.0023609418,"teacher_disagreement_score":0.006803058,"about_ca_system_score_codex":0.0006972383,"about_ca_system_score_gemma":0.0006234109,"threshold_uncertainty_score":0.022758543},"labels":[],"label_agreement":null},{"id":"W2147643920","doi":"10.1109/phosst.2013.6614480","title":"A monolithic optical front-end for soft-decision error correction decoders","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Front and back ends; Computer science; Error detection and correction; Soft error; Front (military); Electronic engineering; Algorithm; Engineering; Mechanical engineering; Programming language","score_opus":0.022385843396224302,"score_gpt":0.28566964504763287,"score_spread":0.2632838016514086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147643920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5439187,0.0016835374,0.43252623,0.00088477577,0.0004530864,0.00021538438,0.0004374045,0.0029281548,0.016952746],"genre_scores_gemma":[0.8867663,0.00022099694,0.1033868,0.0003591819,0.000091969596,0.000053508917,0.00014116663,0.000056876568,0.008923151],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961543,0.000029914874,0.000009102247,0.00007617636,0.00022517011,0.00004414353],"domain_scores_gemma":[0.9996088,0.00013952667,0.00004725925,0.000044833345,0.000121888384,0.000037629165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758408,0.00043916568,0.00031841669,0.00025737841,0.0003539712,0.00090978167,0.0012493011,0.0011207024,0.0019476144],"category_scores_gemma":[0.00043340298,0.00034105775,0.00020671221,0.00016671317,0.0003598399,0.00081881555,0.00032334245,0.00048258767,0.001074795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002695004,0.000233166,0.0009065286,0.00012922806,0.000028081995,0.00020102963,0.000048726622,0.009612573,0.9590603,0.007869056,0.0011271037,0.020514661],"study_design_scores_gemma":[0.00007265708,0.0006025673,0.001568819,0.000020210344,0.00003682805,0.00031033778,0.000020478708,0.1639643,0.8235923,0.0012088894,0.008563141,0.000039399507],"about_ca_topic_score_codex":0.00043912232,"about_ca_topic_score_gemma":0.0010782753,"teacher_disagreement_score":0.0019476144,"about_ca_system_score_codex":0.00067417027,"about_ca_system_score_gemma":0.00038459976,"threshold_uncertainty_score":0.0065153837},"labels":[],"label_agreement":null},{"id":"W2147861990","doi":"10.1109/lcomm.2004.839612","title":"Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Turbo code; PEG ratio; Block code; Block (permutation group theory); Construct (python library); Simple (philosophy); Mathematics; Decoding methods; Telecommunications; Combinatorics; Computer network","score_opus":0.019341330794251294,"score_gpt":0.2719253126176138,"score_spread":0.2525839818233625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147861990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084950276,0.00027944372,0.90666234,0.0002404959,0.00007206495,0.00010519331,0.0001794847,0.00093261857,0.0065780287],"genre_scores_gemma":[0.42839634,0.00036377925,0.5664622,0.00012003239,0.000025901429,0.0001259786,0.00041911763,0.00011884187,0.0039677327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997528,0.00005813043,0.000014407115,0.000035651254,0.00010142305,0.00003750467],"domain_scores_gemma":[0.99936646,0.0001900971,0.0000622286,0.00022821985,0.00011605949,0.000036993486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031242572,0.0003935152,0.00039930615,0.0004919366,0.00035305502,0.00031277502,0.0005450947,0.0004967464,0.00084756094],"category_scores_gemma":[0.0014939316,0.00016084644,0.00028795094,0.00065516564,0.00057090825,0.0007288373,0.0010343657,0.00088980864,0.00034827623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047059116,0.0001576273,0.002240945,0.00032442049,0.00004797869,0.0006048691,0.00035730645,0.26707637,0.1495878,0.17571397,0.0052796626,0.39813843],"study_design_scores_gemma":[0.00007715913,0.00018516609,0.0006507043,0.00002565265,0.000027380016,0.0006006876,0.000038328963,0.8522188,0.08892177,0.040193737,0.0170085,0.000052041847],"about_ca_topic_score_codex":0.0006397579,"about_ca_topic_score_gemma":0.00078573177,"teacher_disagreement_score":0.00084756094,"about_ca_system_score_codex":0.0002473727,"about_ca_system_score_gemma":0.00048481996,"threshold_uncertainty_score":0.0028353333},"labels":[],"label_agreement":null},{"id":"W2148095386","doi":"10.1109/tcomm.2004.838718","title":"A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Noisy-channel coding theorem; Additive white Gaussian noise; Gaussian; Mathematics; Computer science; Variable (mathematics); Turbo code; Limit (mathematics); Code (set theory); Range (aeronautics); Node (physics); Convergence (economics); Random variable; White noise; Statistics; Error floor","score_opus":0.05692893816505234,"score_gpt":0.3093812915881105,"score_spread":0.25245235342305816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148095386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010509953,0.00009745061,0.98714894,0.000071246635,0.000017626271,0.000018306446,0.000046575475,0.00013056735,0.0019592894],"genre_scores_gemma":[0.41339743,0.000599157,0.5824735,0.00015012613,0.00004452553,0.00018323612,0.00020565809,0.00020037538,0.002745939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993741,0.00018011148,0.000033013483,0.00007211983,0.00030395394,0.0000367889],"domain_scores_gemma":[0.998379,0.00073270925,0.00019318395,0.00030305766,0.00035480666,0.000037290396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778793,0.00057742046,0.00066572294,0.0007688408,0.0004797205,0.00086872274,0.00048007112,0.00051795086,0.0011961978],"category_scores_gemma":[0.0038089894,0.0003993511,0.00048740135,0.00057328294,0.00081173325,0.0010121521,0.00064702757,0.0009975662,0.0004724816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003097642,0.000018385785,0.00065229763,0.00009003462,0.000019527717,0.00005072684,0.00007793548,0.884919,0.015876338,0.07175558,0.0007282838,0.025780866],"study_design_scores_gemma":[0.0000021479475,0.000009191897,0.000063755084,0.000005320182,0.0000025488368,0.000023582117,0.0000052903665,0.9861022,0.0030907474,0.009522501,0.0011641909,0.0000085505835],"about_ca_topic_score_codex":0.0011861658,"about_ca_topic_score_gemma":0.0010308174,"teacher_disagreement_score":0.0011961978,"about_ca_system_score_codex":0.00096123666,"about_ca_system_score_gemma":0.00086195004,"threshold_uncertainty_score":0.0069742203},"labels":[],"label_agreement":null},{"id":"W2148339888","doi":"10.1109/ccece.2007.123","title":"Reduced Complexity Belief Propagation Algorithm Based on Iterative Groupwise Multiuser Detection","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief propagation; Multiuser detection; Computer science; Algorithm; Iterative method; Computational complexity theory; Detector; Joint (building); Maximum a posteriori estimation; Function (biology); Mathematics; Maximum likelihood; Decoding methods; Engineering; Telecommunications","score_opus":0.02963010318101595,"score_gpt":0.28811298666699275,"score_spread":0.2584828834859768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148339888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022769538,0.000060363138,0.99675983,0.00007409578,0.000024128807,0.000012526148,0.000008626281,0.00021870225,0.0005646624],"genre_scores_gemma":[0.1480382,0.00019065362,0.84935766,0.00013077054,0.00007453767,0.000120138975,0.00005420937,0.00008104919,0.0019527437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984915,0.00041529597,0.000050143175,0.00016699576,0.00076962716,0.000106418986],"domain_scores_gemma":[0.99702257,0.0016521062,0.00019319067,0.00041282218,0.0006428062,0.000076537144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001472109,0.0007864839,0.00089457,0.0007730802,0.00037153045,0.00095164037,0.0016732982,0.0011805276,0.0015222549],"category_scores_gemma":[0.006893182,0.0004022185,0.0006294562,0.0008047156,0.0007802589,0.0014845852,0.000960464,0.0018831383,0.0006616997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026730032,0.00015815136,0.0011656797,0.00017438343,0.00021030493,0.00018487642,0.00027777796,0.51827043,0.025488494,0.08660196,0.004035037,0.3631656],"study_design_scores_gemma":[0.000019163817,0.000042068925,0.000093383496,0.0000052545024,0.000014259361,0.000056625315,0.0000041633225,0.985391,0.0054397956,0.007780861,0.0011407663,0.000012700366],"about_ca_topic_score_codex":0.0020786459,"about_ca_topic_score_gemma":0.0018330152,"teacher_disagreement_score":0.0020786459,"about_ca_system_score_codex":0.00058281585,"about_ca_system_score_gemma":0.0010740979,"threshold_uncertainty_score":0.00778538},"labels":[],"label_agreement":null},{"id":"W2148475386","doi":"10.1109/cwit.2007.375702","title":"EXIT Charts of LDPC Codes over BIAWGN Channels with Imperfect Channel Estimation","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Node (physics); Low-density parity-check code; Channel (broadcasting); Variable (mathematics); Computer science; Algorithm; Imperfect; Code (set theory); Error detection and correction; Decoding methods; Topology (electrical circuits); Mathematics; Computer network; Engineering; Combinatorics","score_opus":0.01605071455085273,"score_gpt":0.272774747300609,"score_spread":0.2567240327497563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148475386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498221,0.00033165913,0.3347432,0.0002074439,0.000030690033,0.000059852875,0.00023679667,0.0010332527,0.013535074],"genre_scores_gemma":[0.98486775,0.00015816152,0.0121621415,0.000020209509,0.000009192919,0.0000372494,0.00013568753,0.00012373262,0.0024859237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995065,0.00013915228,0.000017895072,0.000047312493,0.00018750111,0.0001015898],"domain_scores_gemma":[0.997207,0.0013193405,0.00039162821,0.0002456571,0.000616905,0.00021952228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011016042,0.00068195025,0.00042971122,0.0011517286,0.00062140764,0.001309988,0.00049369625,0.00061907055,0.0016992512],"category_scores_gemma":[0.006370796,0.00022960956,0.00023615721,0.00060910784,0.0011683311,0.001200097,0.0008953472,0.0009353685,0.0004216758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006891502,0.00007818353,0.0035686607,0.00008326341,0.000025051308,0.0006567256,0.00052453583,0.692545,0.026864637,0.24695905,0.0014245823,0.026581159],"study_design_scores_gemma":[0.000019448145,0.000069241905,0.0006965652,0.000029668881,0.0000063812813,0.00011032571,0.000056160607,0.9481829,0.013823397,0.036100782,0.00087950483,0.000025568566],"about_ca_topic_score_codex":0.0012955804,"about_ca_topic_score_gemma":0.0006061711,"teacher_disagreement_score":0.0016992512,"about_ca_system_score_codex":0.0011750534,"about_ca_system_score_gemma":0.00061523024,"threshold_uncertainty_score":0.008525729},"labels":[],"label_agreement":null},{"id":"W2148484519","doi":"10.1109/icc.2005.1494402","title":"Gear-shift decoding for algorithms with varying complexity","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Soft-decision decoder; Algorithm; Berlekamp–Welch algorithm; Convergence (economics); Latency (audio); Computation; Concatenated error correction code; Telecommunications; Block code","score_opus":0.06260436054699992,"score_gpt":0.30793991541044874,"score_spread":0.24533555486344882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148484519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053364776,0.00026059567,0.9415012,0.00017568246,0.000022820772,0.000044351673,0.000030820902,0.0002691293,0.0043306528],"genre_scores_gemma":[0.6055816,0.00065575045,0.38837072,0.00015561692,0.00007301454,0.00018432988,0.00010644068,0.00017739143,0.0046951743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847454,0.00035774068,0.00012438177,0.00026618212,0.000613395,0.00016376078],"domain_scores_gemma":[0.9963219,0.0023587253,0.00031665002,0.0004044253,0.0005276184,0.00007072671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016091848,0.0006414601,0.0006132699,0.0010682569,0.00047657653,0.0013109953,0.000731349,0.00097608066,0.0015961424],"category_scores_gemma":[0.0142663075,0.00026636076,0.00049524126,0.0009880334,0.0016048705,0.0023172882,0.0010074155,0.0010571893,0.0005054368],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001933171,0.00004292816,0.00093464967,0.00012364543,0.00003195485,0.00018548213,0.00028433013,0.5244703,0.012388406,0.3706333,0.00089811295,0.08981352],"study_design_scores_gemma":[0.0000194039,0.000076398945,0.0001346434,0.000017380877,0.000012326625,0.00011201925,0.000027458753,0.8613753,0.011593164,0.124957584,0.0016541367,0.000020211683],"about_ca_topic_score_codex":0.0014810665,"about_ca_topic_score_gemma":0.0011275165,"teacher_disagreement_score":0.0016091848,"about_ca_system_score_codex":0.0012786229,"about_ca_system_score_gemma":0.0012839339,"threshold_uncertainty_score":0.009277105},"labels":[],"label_agreement":null},{"id":"W2148727093","doi":"10.1162/neco.2009.05-08-785","title":"A Binary Variable Model for Affinity Propagation","year":2009,"lang":"en","type":"article","venue":"Neural Computation","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Affinity propagation; Cluster analysis; Graphical model; Computer science; Variable (mathematics); Binary number; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Correlation clustering; Canopy clustering algorithm","score_opus":0.040368544366247726,"score_gpt":0.3017541364138341,"score_spread":0.2613855920475864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148727093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015267199,0.00013088832,0.99349606,0.00053647166,0.00010515497,0.0000406762,0.0001723079,0.00021733141,0.00377444],"genre_scores_gemma":[0.25936857,0.001089142,0.68199986,0.0012755067,0.00052092783,0.0010332038,0.0013611704,0.00046365368,0.052887954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977381,0.00074412895,0.00010496728,0.0005859557,0.0005915149,0.00023524193],"domain_scores_gemma":[0.99694103,0.001537969,0.00024190005,0.00046103416,0.000680625,0.00013744629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022051833,0.00094217516,0.0010819074,0.0016198346,0.0011385959,0.0025767696,0.0050296998,0.003369849,0.014473051],"category_scores_gemma":[0.010907943,0.0006977258,0.0010716511,0.0032764392,0.0019004307,0.0047452445,0.0021809174,0.0049071587,0.0050135185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055057724,0.000052860403,0.00040231508,0.00008095447,0.00003690962,0.00011113801,0.00012975668,0.13266651,0.0010325456,0.8113295,0.009478095,0.044624396],"study_design_scores_gemma":[0.000024712828,0.000025858199,0.0001226691,0.000019238607,0.0000174433,0.00010097897,0.000014739614,0.6882716,0.0005452688,0.30129036,0.009546576,0.000020589172],"about_ca_topic_score_codex":0.005213741,"about_ca_topic_score_gemma":0.0046051154,"teacher_disagreement_score":0.014473051,"about_ca_system_score_codex":0.0017184983,"about_ca_system_score_gemma":0.0014887778,"threshold_uncertainty_score":0.04841715},"labels":[],"label_agreement":null},{"id":"W2148782634","doi":"10.1109/isit.2007.4557391","title":"Constructing LDPC Codes by 2-Lifts","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Tanner graph; Binary erasure channel; Computer science; Code (set theory); Algorithm; Concatenated error correction code; Tornado code; Erasure code; Binary number; Linear code; Discrete mathematics; Set (abstract data type); Mathematics; Block code; Decoding methods; Error floor; Arithmetic; Channel capacity; Telecommunications","score_opus":0.011399966524061108,"score_gpt":0.26964079859294837,"score_spread":0.25824083206888726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148782634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2424283,0.00018655886,0.7515948,0.00016870802,0.00006696096,0.000085541345,0.00012055788,0.00047837885,0.004870171],"genre_scores_gemma":[0.79143214,0.0001797381,0.2049372,0.00011149596,0.000046626094,0.0001525205,0.00017997103,0.000090576796,0.0028696288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920255,0.0002458606,0.000046314944,0.000085710846,0.00030657696,0.00011291003],"domain_scores_gemma":[0.99878997,0.00038663295,0.0001486289,0.0003920498,0.00019111848,0.000091647635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068875705,0.00045197646,0.0005615138,0.00091840705,0.0004961686,0.00048762214,0.00039592283,0.00047393495,0.0010842377],"category_scores_gemma":[0.0029148017,0.00030079784,0.00063980883,0.00061608665,0.000837894,0.0005536766,0.0016619057,0.00082593807,0.00037117928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040258127,0.00013309644,0.0031037373,0.0002498054,0.00008325024,0.00051695417,0.00041122307,0.34593865,0.07084016,0.4125827,0.0024021273,0.16333573],"study_design_scores_gemma":[0.0000724934,0.00020124557,0.0009679905,0.000032884473,0.000021244145,0.0003400354,0.00003646664,0.8353726,0.028614428,0.12964363,0.004633065,0.0000639158],"about_ca_topic_score_codex":0.00049619935,"about_ca_topic_score_gemma":0.0005123128,"teacher_disagreement_score":0.0010842377,"about_ca_system_score_codex":0.0003283522,"about_ca_system_score_gemma":0.00050950993,"threshold_uncertainty_score":0.003642559},"labels":[],"label_agreement":null},{"id":"W2148926081","doi":"10.1109/isit.2003.1228310","title":"On partial ordering of markov modulated channels under ldpc decoding","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Decoding methods; Computer science; Markov process; Metric (unit); Channel (broadcasting); Binary number; Algorithm; Markov model; Low-density parity-check code; Code (set theory); Theoretical computer science; Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Arithmetic; Engineering; Statistics","score_opus":0.025536384861757102,"score_gpt":0.2698239063826605,"score_spread":0.2442875215209034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148926081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3750654,0.0006607219,0.605355,0.00034636445,0.0000702297,0.00010434339,0.000643698,0.00072774926,0.017026458],"genre_scores_gemma":[0.9423312,0.0007338633,0.05339746,0.000091326976,0.00006965656,0.00007196468,0.00059078686,0.00011607794,0.002597663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885416,0.00040773395,0.00004549922,0.00007571977,0.00036200095,0.000254889],"domain_scores_gemma":[0.99569666,0.0023374716,0.000499449,0.0006418276,0.0005913662,0.00023325846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010855404,0.000645147,0.0006025485,0.0007964066,0.00044974632,0.0010902341,0.00036133436,0.00038064583,0.0017768651],"category_scores_gemma":[0.0041655754,0.00021858381,0.00021334374,0.0010760757,0.0011963254,0.0012642111,0.0006977285,0.00054073037,0.0002578306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081231823,0.000072662326,0.001712534,0.00016800585,0.000025891679,0.00029205982,0.00018046438,0.50677603,0.025991686,0.41074547,0.0016125825,0.051610265],"study_design_scores_gemma":[0.00004506788,0.00016600454,0.0006896918,0.000032978653,0.000015357282,0.00012767546,0.000041717165,0.8386773,0.015726509,0.14271922,0.0017193307,0.000039153863],"about_ca_topic_score_codex":0.002231235,"about_ca_topic_score_gemma":0.0021456196,"teacher_disagreement_score":0.002231235,"about_ca_system_score_codex":0.0007903565,"about_ca_system_score_gemma":0.0015923801,"threshold_uncertainty_score":0.005944252},"labels":[],"label_agreement":null},{"id":"W2149029255","doi":"10.1109/mwscas.2009.5236145","title":"Application of active current mirrors to improve the speed of analog decoder circuits","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Current mirror; Electronic circuit; CMOS; Node (physics); Computer science; Capacitance; Topology (electrical circuits); Block diagram; Power (physics); Electronic engineering; Analogue electronics; Voltage; Block (permutation group theory); Electrical engineering; Transistor; Engineering; Physics; Mathematics","score_opus":0.02511931579981032,"score_gpt":0.31858345076922984,"score_spread":0.29346413496941953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149029255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6051654,0.00082581036,0.3762984,0.00028560398,0.0001271895,0.00013346034,0.00011347023,0.0025637024,0.0144869005],"genre_scores_gemma":[0.9374481,0.00020405703,0.060480926,0.000027779808,0.000013407354,0.000019064508,0.000025165198,0.000052890042,0.0017286909],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987566,0.000027659189,0.000010860756,0.000016369408,0.000050541636,0.000018917992],"domain_scores_gemma":[0.999363,0.00037570132,0.00006663988,0.00007587975,0.00010032311,0.000018568053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025557843,0.00036658868,0.00021180093,0.00026149082,0.00019906428,0.00049073924,0.00056132354,0.00037499057,0.0028816438],"category_scores_gemma":[0.0016652636,0.00016481413,0.00016678854,0.00024749796,0.00023841643,0.00090798683,0.0002842192,0.00034488394,0.00036860933],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005094218,0.00014331404,0.0030040832,0.00040923982,0.000082197854,0.00045720057,0.00031593398,0.19290906,0.6583887,0.05158152,0.0014786595,0.09072056],"study_design_scores_gemma":[0.00006969279,0.00040936185,0.00078748044,0.000026927579,0.00007640749,0.00032065468,0.000026786223,0.49731165,0.48539293,0.0052897264,0.010261318,0.000027223594],"about_ca_topic_score_codex":0.00038183533,"about_ca_topic_score_gemma":0.00049603166,"teacher_disagreement_score":0.0028816438,"about_ca_system_score_codex":0.0003487522,"about_ca_system_score_gemma":0.00028498025,"threshold_uncertainty_score":0.009640038},"labels":[],"label_agreement":null},{"id":"W2149258547","doi":"10.1109/tit.2010.2046244","title":"A Kraft-Type Sufficient Condition for the Existence of $D$-Ary Fix-Free Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code (set theory); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematics; Programming language","score_opus":0.012721158278693646,"score_gpt":0.261712197880996,"score_spread":0.24899103960230234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149258547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13771945,0.0005883063,0.8325463,0.002014754,0.00028737527,0.00029558773,0.0022466425,0.0014473383,0.022854336],"genre_scores_gemma":[0.784961,0.00072080706,0.1952884,0.00093372056,0.00030139388,0.0009642692,0.0027361675,0.0003443192,0.013749895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553645,0.0005650326,0.0003664548,0.0013054193,0.0011862983,0.001040317],"domain_scores_gemma":[0.9753238,0.013226449,0.0022000785,0.0027270315,0.005024224,0.001498267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027672523,0.0014951114,0.001953544,0.0024629028,0.0023799988,0.0026198593,0.002107701,0.002743897,0.008104042],"category_scores_gemma":[0.026281305,0.0012575944,0.0014702191,0.0022184935,0.0039870464,0.004109744,0.0038453648,0.0034092485,0.0036639052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008066755,0.00012482035,0.00184045,0.0004306251,0.000091368434,0.00063765346,0.00044378478,0.045690462,0.020967152,0.89272165,0.007074027,0.029171368],"study_design_scores_gemma":[0.00042497978,0.00056850875,0.0010436437,0.0002063617,0.0000774625,0.0014040158,0.0002769285,0.2581803,0.02718613,0.6963915,0.013959587,0.00028058043],"about_ca_topic_score_codex":0.0024129406,"about_ca_topic_score_gemma":0.002076808,"teacher_disagreement_score":0.008104042,"about_ca_system_score_codex":0.0019012223,"about_ca_system_score_gemma":0.0054899435,"threshold_uncertainty_score":0.027110755},"labels":[],"label_agreement":null},{"id":"W2149562977","doi":"10.1109/isit.2010.5513622","title":"Recursive convolutional codes for time-invariant LDPC convolutional codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Encoder; Low-density parity-check code; Turbo code; Serial concatenated convolutional codes; Computer science; Algorithm; Decoding methods; Linear code; Theoretical computer science; Block code; Mathematics","score_opus":0.01387577364850146,"score_gpt":0.2671057671950604,"score_spread":0.25322999354655895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149562977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037075333,0.0008591441,0.9434769,0.00019960587,0.0000880392,0.00009160218,0.00021388357,0.000637774,0.017357584],"genre_scores_gemma":[0.5330908,0.0013333731,0.45072573,0.00028500086,0.00008707285,0.00020516121,0.00046566734,0.00014386476,0.013663295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977154,0.00004326296,0.0000120152945,0.000037800757,0.000107236694,0.000028113971],"domain_scores_gemma":[0.9995976,0.00016028763,0.000052688145,0.00008875,0.00008606941,0.000014632281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018999293,0.0002700182,0.00016624758,0.00029757465,0.0002476488,0.0004420952,0.0004094201,0.00046692084,0.001971694],"category_scores_gemma":[0.001207597,0.00011141134,0.00021578024,0.00035362566,0.00050908956,0.0004391703,0.000338002,0.0005856655,0.00057535595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056690154,0.0000239715,0.00033091934,0.00016096274,0.00001383651,0.00020213082,0.00012465786,0.04428167,0.04346263,0.82716715,0.0019419378,0.08223349],"study_design_scores_gemma":[0.00004469064,0.00011888582,0.00091256207,0.00010849894,0.000046011148,0.0006947337,0.000038617374,0.57822424,0.063299105,0.28380617,0.07262782,0.00007855265],"about_ca_topic_score_codex":0.0015470203,"about_ca_topic_score_gemma":0.0027813073,"teacher_disagreement_score":0.001971694,"about_ca_system_score_codex":0.0005873599,"about_ca_system_score_gemma":0.00060756324,"threshold_uncertainty_score":0.006595969},"labels":[],"label_agreement":null},{"id":"W2149936524","doi":"10.1109/vetecs.2005.1543578","title":"Asymptotic Performance Analysis of LDPC codes with Channel Estimation Error","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Channel (broadcasting); Computer science; Decoding methods; Turbo code; Error floor; Mathematics; Block code; Telecommunications","score_opus":0.014833330541588148,"score_gpt":0.25808444371018757,"score_spread":0.24325111316859943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149936524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1903681,0.0015272235,0.79955167,0.0006278969,0.000046152145,0.000056343957,0.000135553,0.0006695935,0.007017481],"genre_scores_gemma":[0.96688676,0.0007628367,0.030317027,0.00007562253,0.00004312636,0.00007495357,0.00018508511,0.00012096702,0.0015336808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973622,0.000980054,0.00007222624,0.00022212861,0.0010361241,0.0003272692],"domain_scores_gemma":[0.9668201,0.025118079,0.0019821196,0.0017494288,0.0039963927,0.00033378392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971768,0.0008669474,0.0007603713,0.0013565918,0.0006274431,0.001353276,0.0008879187,0.0011852093,0.0012786692],"category_scores_gemma":[0.051444244,0.0004647986,0.00036594275,0.0010510299,0.002256475,0.0023068541,0.0016594573,0.0014549702,0.00031132737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016370481,0.000025697374,0.002569886,0.00009508125,0.00004666067,0.00012901473,0.00016017327,0.92639863,0.0043085925,0.054264836,0.0004256037,0.011412122],"study_design_scores_gemma":[0.0000041113817,0.000019324565,0.00026700768,0.000012353893,0.00000581174,0.000032830056,0.000012540496,0.9911542,0.0014740375,0.0069273696,0.00008144657,0.000008899821],"about_ca_topic_score_codex":0.0043890825,"about_ca_topic_score_gemma":0.0018195932,"teacher_disagreement_score":0.0043890825,"about_ca_system_score_codex":0.0023347603,"about_ca_system_score_gemma":0.0017658931,"threshold_uncertainty_score":0.021004975},"labels":[],"label_agreement":null},{"id":"W2150279634","doi":"10.1109/isit.2004.1365299","title":"On the dynamics of continuous -time analog iterative decoding","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Successive over-relaxation; Asynchronous communication; Relaxation (psychology); Algorithm; Computer science; Iterative method; Belief propagation; Mathematics; Mathematical optimization; Local convergence; Telecommunications","score_opus":0.010627046938924627,"score_gpt":0.24311513247426877,"score_spread":0.23248808553534414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150279634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062038805,0.0007284411,0.9215885,0.0009022923,0.0000806485,0.000038661747,0.00008455929,0.00014880711,0.014389221],"genre_scores_gemma":[0.91063553,0.0014327486,0.075534075,0.00021239564,0.00008388989,0.00014913759,0.000121078265,0.00012987696,0.01170119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996625,0.0001160942,0.000011956081,0.000058672027,0.00010176275,0.000048978385],"domain_scores_gemma":[0.9982376,0.0012381837,0.00018350208,0.00008291375,0.00019337297,0.00006438611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079859147,0.0005213704,0.0005382167,0.00054794655,0.00040597204,0.00078877195,0.0007799114,0.0008911514,0.0029794727],"category_scores_gemma":[0.00590127,0.0003857331,0.00046807234,0.00049360754,0.0020366246,0.0018996088,0.0007826236,0.0011062424,0.00035693473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050858125,0.000012688186,0.00036816113,0.00005956945,0.000012586469,0.0000935922,0.00014727688,0.68986624,0.002273447,0.29939595,0.00064185937,0.0070777256],"study_design_scores_gemma":[0.000006744496,0.000011122022,0.00006090597,0.000007795586,0.000003268674,0.00002186111,0.000014233098,0.9628399,0.0003603298,0.036137428,0.0005296586,0.000006618917],"about_ca_topic_score_codex":0.0042137946,"about_ca_topic_score_gemma":0.0022817836,"teacher_disagreement_score":0.0042137946,"about_ca_system_score_codex":0.0011995421,"about_ca_system_score_gemma":0.0008231021,"threshold_uncertainty_score":0.009967387},"labels":[],"label_agreement":null},{"id":"W2150494733","doi":"10.1109/lcomm.2004.825728","title":"On Construction of Rate-Compatible Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Low-density parity-check code; Mathematics; Algorithm; Decoding methods","score_opus":0.026675926263548474,"score_gpt":0.2780708074728517,"score_spread":0.2513948812093032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150494733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045226462,0.00030980687,0.94821215,0.000115170624,0.000041414198,0.00008138255,0.000067819834,0.00020711089,0.0057387324],"genre_scores_gemma":[0.5047185,0.000753061,0.4908448,0.00011421908,0.000065058164,0.00021226713,0.00025202066,0.00010167065,0.0029384901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.00015943739,0.000022205726,0.000057677196,0.0002232799,0.00006544995],"domain_scores_gemma":[0.999363,0.00023560257,0.00007862482,0.0001828441,0.00010137035,0.000038542905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729816,0.00040382554,0.0003595066,0.0006883948,0.00055377214,0.0006175705,0.0005928077,0.0004601815,0.00086476514],"category_scores_gemma":[0.0019809362,0.0002791609,0.0004982385,0.00044033566,0.0009222395,0.00064369175,0.0011333681,0.0008709954,0.00044682084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010286753,0.000043679647,0.0007507018,0.00016455799,0.000016042999,0.00043645132,0.0002912903,0.06959845,0.03285781,0.84340364,0.00085835793,0.05147619],"study_design_scores_gemma":[0.000082256665,0.00030405392,0.00049221184,0.00010340613,0.000033246015,0.0008384608,0.00008101591,0.5149485,0.07756577,0.38150015,0.023962565,0.00008836684],"about_ca_topic_score_codex":0.00032144084,"about_ca_topic_score_gemma":0.00025961874,"teacher_disagreement_score":0.0008729816,"about_ca_system_score_codex":0.0003744317,"about_ca_system_score_gemma":0.00063419377,"threshold_uncertainty_score":0.0046168566},"labels":[],"label_agreement":null},{"id":"W2150888855","doi":"10.1109/iccsc.2008.17","title":"LDPC Coded Wireless Networks with Adaptive Spectral Efficiency","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Low-density parity-check code; Computer science; Spectral efficiency; Forward error correction; Turbo code; Code rate; Encoder; Algorithm; Transmission (telecommunications); Electronic engineering; Rayleigh fading; Decoding methods; Gate array; Channel (broadcasting); Fading; Field-programmable gate array; Telecommunications; Computer hardware; Engineering","score_opus":0.017528721914131285,"score_gpt":0.2212794762848571,"score_spread":0.20375075437072582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150888855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11720483,0.0006885795,0.8754333,0.00021616984,0.000028451797,0.00007835531,0.000083533145,0.0008361153,0.005430704],"genre_scores_gemma":[0.77127105,0.000533258,0.22411245,0.000115816154,0.000024670677,0.00015973013,0.00009980987,0.000042673066,0.0036405725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995079,0.00015795584,0.000024135503,0.000054601096,0.00020219378,0.000053128326],"domain_scores_gemma":[0.99885213,0.00050939625,0.0001684813,0.00020919599,0.00023268917,0.00002809551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051120407,0.00036086823,0.00031205898,0.0005098731,0.00027920055,0.0004702104,0.00051546074,0.00047145988,0.00058328407],"category_scores_gemma":[0.0026758716,0.00016733189,0.00012267985,0.00073487114,0.0006223091,0.0006827361,0.00048719536,0.0004943447,0.00027303773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004018973,0.000114026996,0.0013986217,0.0002527934,0.000047611695,0.0004277291,0.000349081,0.5314829,0.11708958,0.111969896,0.0020995298,0.23436634],"study_design_scores_gemma":[0.00005901545,0.00007455301,0.0003627311,0.000035748657,0.000022376891,0.00017655863,0.0000151444565,0.93246853,0.04487055,0.016627772,0.005258929,0.000028099961],"about_ca_topic_score_codex":0.0013893633,"about_ca_topic_score_gemma":0.001521652,"teacher_disagreement_score":0.0013893633,"about_ca_system_score_codex":0.0006590334,"about_ca_system_score_gemma":0.0005364024,"threshold_uncertainty_score":0.0047816634},"labels":[],"label_agreement":null},{"id":"W2151311633","doi":"10.1109/spawc.2005.1505886","title":"Error performance of coded modulation systems based on LDPC codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Decoding methods; Computer science; Bit error rate; Fading; Turbo code; Concatenated error correction code; Serial concatenated convolutional codes; Modulation (music); Theoretical computer science; Mathematics; Telecommunications; Block code; White noise","score_opus":0.02325095397226322,"score_gpt":0.2644190945370642,"score_spread":0.24116814056480096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151311633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59841543,0.0033563576,0.38163155,0.0005308666,0.00010490794,0.00006648092,0.00027665033,0.0005395099,0.01507823],"genre_scores_gemma":[0.98581684,0.00053560367,0.012244591,0.000050672083,0.000025921301,0.00003479026,0.0001123052,0.000027842669,0.0011514922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729806,0.0009421749,0.00009829052,0.00022233938,0.0011209896,0.00031813403],"domain_scores_gemma":[0.98594576,0.010356875,0.0008711114,0.0008089199,0.0018989308,0.00011837339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218978,0.0010044962,0.0009466936,0.00093118474,0.0007107642,0.00147927,0.0006580474,0.0014159245,0.0011305145],"category_scores_gemma":[0.016402848,0.00031286388,0.00023843505,0.0010214486,0.0014173925,0.0018728497,0.001456088,0.00075879873,0.0003620324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065159105,0.00004652767,0.001883213,0.00016631275,0.00007752597,0.00019355808,0.00020446713,0.9140728,0.014542096,0.040880874,0.0003730574,0.026908012],"study_design_scores_gemma":[0.000023197123,0.000115200724,0.00048448963,0.00003604059,0.000017682734,0.00008558599,0.000020023868,0.97812974,0.011522117,0.009186553,0.00034695995,0.000032367392],"about_ca_topic_score_codex":0.0027988234,"about_ca_topic_score_gemma":0.0012893351,"teacher_disagreement_score":0.0027988234,"about_ca_system_score_codex":0.0014124137,"about_ca_system_score_gemma":0.000983738,"threshold_uncertainty_score":0.011735201},"labels":[],"label_agreement":null},{"id":"W2151900023","doi":"10.1109/lcomm.2009.082047","title":"Error performances of multi shift-register convolutional self-doubly-orthogonal codes","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Algorithm; Sequential decoding; Computer science; Serial concatenated convolutional codes; List decoding; Encoder; Turbo code; Berlekamp–Welch algorithm; Concatenated error correction code; Theoretical computer science; Block code","score_opus":0.053560968813009764,"score_gpt":0.3154537368189577,"score_spread":0.26189276800594796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151900023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92515635,0.0003363861,0.06909783,0.00007592208,0.000013133474,0.000012704209,0.0000758633,0.00019434547,0.0050374735],"genre_scores_gemma":[0.99298865,0.00011289891,0.0060164244,0.000010212506,0.0000058913433,0.000008871967,0.00005315358,0.000017571689,0.0007863123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918705,0.00014906167,0.000041015854,0.00007852983,0.0004116502,0.00013276013],"domain_scores_gemma":[0.9958125,0.0023081382,0.00064584264,0.00045459604,0.0007021729,0.000076647266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146089,0.00049825676,0.00036748932,0.0006435341,0.0003115952,0.0007402449,0.000530959,0.00066005386,0.0006373686],"category_scores_gemma":[0.004477463,0.00014383106,0.00020842411,0.0004935001,0.0008186709,0.00077523885,0.0006317297,0.00035737193,0.0002005103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014976407,0.00013470779,0.008680373,0.0001708421,0.00009810711,0.00036759744,0.00035810776,0.64300114,0.203016,0.083582856,0.0005264461,0.058566183],"study_design_scores_gemma":[0.000010127529,0.00015691204,0.000947424,0.000010914666,0.000012804044,0.00009702879,0.00001609848,0.9110068,0.08434634,0.003118544,0.00025283956,0.000024195371],"about_ca_topic_score_codex":0.0011574388,"about_ca_topic_score_gemma":0.0010746814,"teacher_disagreement_score":0.0011574388,"about_ca_system_score_codex":0.00070147216,"about_ca_system_score_gemma":0.00051320967,"threshold_uncertainty_score":0.005089581},"labels":[],"label_agreement":null},{"id":"W2152004013","doi":"10.1109/spawc.2005.1506272","title":"The factor graph EM algorithm: applications for LDPC codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Factor graph; Low-density parity-check code; Computer science; Algorithm; Decoding methods; Fading; Block code; Message passing; Tanner graph; Factor (programming language); Error floor; Coding (social sciences); Channel code; Theoretical computer science; Mathematics; Parallel computing","score_opus":0.018850338839188362,"score_gpt":0.2906385783450119,"score_spread":0.27178823950582354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152004013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000582693,0.00029372107,0.9976484,0.00015288689,0.000026421008,0.000019722424,0.000042685715,0.0003556193,0.00087785424],"genre_scores_gemma":[0.03186439,0.0009801117,0.9630968,0.00016993319,0.000077586286,0.00014716819,0.00026804963,0.00030295918,0.0030928724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930525,0.00032163595,0.000040151786,0.00012114607,0.00017579208,0.00003601944],"domain_scores_gemma":[0.9974003,0.0018031592,0.00013605463,0.0002567614,0.00035134808,0.000052469044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013221501,0.001372989,0.0010208479,0.0013707256,0.000596154,0.00088389445,0.0012158748,0.0020645906,0.004245141],"category_scores_gemma":[0.0086111585,0.00058993,0.0005616321,0.0021064659,0.0010860059,0.0017503501,0.0015439336,0.0019324089,0.0023319388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012452537,0.000049870632,0.0005592572,0.00026142632,0.00006355762,0.00019618889,0.00017025902,0.42223153,0.0040046703,0.16043739,0.008766073,0.40313527],"study_design_scores_gemma":[0.000019416915,0.000017045286,0.00007760539,0.00003861106,0.000008144217,0.00015249403,0.000018728726,0.851863,0.002485295,0.13484626,0.010448685,0.000024702027],"about_ca_topic_score_codex":0.0022846002,"about_ca_topic_score_gemma":0.002069421,"teacher_disagreement_score":0.004245141,"about_ca_system_score_codex":0.00077756564,"about_ca_system_score_gemma":0.0009534514,"threshold_uncertainty_score":0.014201403},"labels":[],"label_agreement":null},{"id":"W2152165958","doi":"10.1109/isit.2011.6034270","title":"Design of irregular quasi-cyclic protograph codes with low error floors","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Computer science; Waterfall; Turbo code; Error floor; Code (set theory); Encoder; Decoding methods; Binary number; Block code; Theoretical computer science; Channel (broadcasting); Mathematics; Telecommunications; Arithmetic","score_opus":0.036799252236856636,"score_gpt":0.24896601713527916,"score_spread":0.2121667648984225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152165958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14160472,0.00023376259,0.8547238,0.0001675753,0.000044665034,0.000057567057,0.000115988485,0.00046077298,0.0025912218],"genre_scores_gemma":[0.7103086,0.00026734357,0.28735372,0.00008053057,0.000029712859,0.000110098066,0.00020439381,0.000061955034,0.0015836622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997714,0.00007608303,0.000012528244,0.000032324864,0.00007694479,0.00003073613],"domain_scores_gemma":[0.99911386,0.00026878,0.00019542452,0.00020724062,0.00015947879,0.00005520609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886056,0.0002875622,0.0002655238,0.00041713894,0.00024581345,0.00027315048,0.0004454133,0.00031542758,0.0006398701],"category_scores_gemma":[0.0013524045,0.00019388084,0.0002197731,0.00044216285,0.00048993697,0.00032790675,0.00049066043,0.00039668163,0.00024199668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048113262,0.00008651377,0.0030678832,0.00054501486,0.00007919961,0.000491945,0.0004246491,0.39706552,0.2202433,0.15940243,0.0022588181,0.21585354],"study_design_scores_gemma":[0.000068091904,0.0004464471,0.0010123063,0.000035575187,0.000030172061,0.00062971446,0.00005041717,0.8846744,0.07475039,0.02868732,0.009564829,0.000050388277],"about_ca_topic_score_codex":0.00027576456,"about_ca_topic_score_gemma":0.00049077434,"teacher_disagreement_score":0.0006398701,"about_ca_system_score_codex":0.00028187546,"about_ca_system_score_gemma":0.0006014323,"threshold_uncertainty_score":0.002140522},"labels":[],"label_agreement":null},{"id":"W2152382476","doi":"10.1109/tcomm.2009.10.080005","title":"Comments on successive relaxation for decoding of LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Additive white Gaussian noise; Code word; Belief propagation; Binary number; Relaxation (psychology); Computer science; Bit error rate; Mathematics; Frequency domain; Channel (broadcasting); Arithmetic; Telecommunications","score_opus":0.054695428228613424,"score_gpt":0.3447178290045503,"score_spread":0.2900224007759369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152382476","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011729538,0.01944779,0.57687324,0.22517237,0.051573955,0.00038141262,0.0016250133,0.0014710713,0.111725576],"genre_scores_gemma":[0.3756494,0.028309068,0.29110426,0.1258369,0.07646167,0.0013467969,0.0013408529,0.0028291603,0.09712183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99451905,0.0025493125,0.00032764755,0.0004751827,0.0019200499,0.00020872119],"domain_scores_gemma":[0.98350835,0.012247494,0.00049265433,0.00084256515,0.0027702735,0.00013868656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052555823,0.0009771897,0.00081177655,0.0009295333,0.0012161928,0.00123319,0.0021880632,0.0029709407,0.010125129],"category_scores_gemma":[0.040913377,0.00041409084,0.0011516502,0.0014247098,0.0027614317,0.0025487999,0.001059846,0.006469531,0.0038315372],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047652645,0.00003298749,0.00048920506,0.0011508694,0.000084329426,0.0011137383,0.00074778235,0.03623128,0.003885288,0.613752,0.26351383,0.07852208],"study_design_scores_gemma":[0.00013268564,0.0003100328,0.000972229,0.00070580834,0.000056274712,0.00085029955,0.00020510636,0.12989502,0.009079221,0.40056676,0.45701182,0.00021473142],"about_ca_topic_score_codex":0.0046920637,"about_ca_topic_score_gemma":0.0016340533,"teacher_disagreement_score":0.010125129,"about_ca_system_score_codex":0.0018509148,"about_ca_system_score_gemma":0.0010455836,"threshold_uncertainty_score":0.03387195},"labels":[],"label_agreement":null},{"id":"W2152519332","doi":"10.1109/isspa.2007.4555406","title":"Lossless source coding using repeat-accumulate codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Lossless compression; Convolutional code; Algorithm; Data compression ratio; Block code; Compression (physics); Code rate; Linear code; Code (set theory); Concatenated error correction code; Theoretical computer science; Data compression; Decoding methods; Image compression; Artificial intelligence; Physics","score_opus":0.04782711716561696,"score_gpt":0.32762438555715495,"score_spread":0.279797268391538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152519332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08255939,0.00043532648,0.91086644,0.00018316458,0.000035107176,0.00006428884,0.000103507824,0.0011124469,0.0046403683],"genre_scores_gemma":[0.79914767,0.00045013585,0.19675407,0.00006566866,0.000035525187,0.000084226675,0.00012190658,0.00007213061,0.0032686305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.00014689434,0.00002201744,0.000048990114,0.00024252641,0.00003817516],"domain_scores_gemma":[0.9982614,0.00077937444,0.00025023226,0.00031328588,0.00036417675,0.000031504325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081877457,0.0005427227,0.000326854,0.0005312364,0.00020947545,0.00055330445,0.0005838947,0.00053055404,0.0007197655],"category_scores_gemma":[0.0039237253,0.00017416994,0.00022461201,0.00051368785,0.00045913126,0.0008073439,0.00049549626,0.00044129352,0.00037679228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041239485,0.00006055055,0.0012790813,0.00022007925,0.000067211724,0.00033933128,0.00021198773,0.67278755,0.07958109,0.109721445,0.0014833387,0.13383585],"study_design_scores_gemma":[0.000020387872,0.00007249377,0.0002921304,0.000026936437,0.000013732381,0.0001253487,0.0000065211298,0.94659793,0.039373204,0.011716378,0.0017368201,0.0000181439],"about_ca_topic_score_codex":0.0012621778,"about_ca_topic_score_gemma":0.0011136221,"teacher_disagreement_score":0.0012621778,"about_ca_system_score_codex":0.00066725217,"about_ca_system_score_gemma":0.00040503033,"threshold_uncertainty_score":0.0048413277},"labels":[],"label_agreement":null},{"id":"W2152977866","doi":"10.1109/glocom.2010.5683799","title":"Lowering Error Floors Using Dithered Belief Propagation","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Western Canada Research Grid","keywords":"Dither; Belief propagation; Decoding methods; Algorithm; Limit (mathematics); Node (physics); Propagation of uncertainty; Computer science; Channel (broadcasting); Low-density parity-check code; Word error rate; Mathematics; Artificial intelligence; Computer vision; Telecommunications; Engineering","score_opus":0.023945362223246308,"score_gpt":0.28408892794720186,"score_spread":0.2601435657239556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152977866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032025322,0.00019884964,0.9653377,0.00014249331,0.000028468456,0.000019986172,0.000027780885,0.00067647925,0.0015429506],"genre_scores_gemma":[0.5804181,0.00026919154,0.41577268,0.00013404655,0.000035172383,0.000056447254,0.000067943605,0.0000980123,0.0031484743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992193,0.00013981949,0.000037779373,0.00010582985,0.000397237,0.000100010955],"domain_scores_gemma":[0.9965581,0.0019120706,0.00036688408,0.00053374446,0.00056440925,0.000064735665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077108527,0.0007848102,0.00051156525,0.0009165503,0.0004057706,0.0009913018,0.0010892992,0.00088417996,0.0017164839],"category_scores_gemma":[0.0051291278,0.00038628207,0.00031201346,0.0007489713,0.00079011783,0.0015292873,0.0008822146,0.0010523199,0.00042849203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038328467,0.00014884736,0.0012271855,0.00017712831,0.0000859679,0.00019370212,0.00017382896,0.6176497,0.054118574,0.042766977,0.0013937909,0.28168097],"study_design_scores_gemma":[0.000025523457,0.00008376661,0.00019375612,0.000011294459,0.0000173946,0.000072157294,0.000012428871,0.9600228,0.031049395,0.007693472,0.00079830445,0.00001968966],"about_ca_topic_score_codex":0.0021927913,"about_ca_topic_score_gemma":0.003449261,"teacher_disagreement_score":0.0021927913,"about_ca_system_score_codex":0.00058890646,"about_ca_system_score_gemma":0.00092499127,"threshold_uncertainty_score":0.005742252},"labels":[],"label_agreement":null},{"id":"W2153246012","doi":"10.1109/isit.1993.748702","title":"An Adaptive Transmission Scheme for Meteor-Burst Communication","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheme (mathematics); Transmission rate; Coding (social sciences); Transmission (telecommunications); Meteor (satellite); Variable (mathematics); Electronic engineering; Power (physics); Real-time computing; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.03311774685304494,"score_gpt":0.31437383745925995,"score_spread":0.28125609060621504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153246012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2665625,0.00044870656,0.7281724,0.0001854314,0.00009120766,0.000111629066,0.000047743866,0.00048138772,0.0038989638],"genre_scores_gemma":[0.93213904,0.00011615899,0.06694794,0.000034682456,0.0000136253575,0.000034791577,0.000017722226,0.000011419796,0.00068465737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985826,0.000050649756,0.0000081023845,0.000017047025,0.00004946457,0.00001648219],"domain_scores_gemma":[0.9995925,0.0001627051,0.000061579456,0.00006624169,0.000085725405,0.000031289914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033734945,0.00022364422,0.00020404744,0.00017904624,0.00024117736,0.00029135533,0.0006402724,0.0003592642,0.0007766311],"category_scores_gemma":[0.0016708823,0.000088201174,0.00012915654,0.00019121003,0.00024799258,0.00033093203,0.000314539,0.0003723128,0.00014489691],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011957772,0.0001692734,0.004990442,0.00032510347,0.00009396864,0.0008112448,0.00036969568,0.44877273,0.24321765,0.0735783,0.0015642155,0.22491153],"study_design_scores_gemma":[0.000056351888,0.00025209802,0.0005587223,0.000013606344,0.000026668857,0.00027614404,0.000023818557,0.97289014,0.01722159,0.006780198,0.0018701848,0.00003046687],"about_ca_topic_score_codex":0.00057261257,"about_ca_topic_score_gemma":0.00039105653,"teacher_disagreement_score":0.0007766311,"about_ca_system_score_codex":0.00021598092,"about_ca_system_score_gemma":0.00022828869,"threshold_uncertainty_score":0.0025980473},"labels":[],"label_agreement":null},{"id":"W2153505774","doi":"10.1109/tcomm.2013.012913.110340","title":"Stochastic Decoding of LDPC Codes over GF(q)","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Code word; Computational complexity theory; List decoding; Computer science; Galois theory; Mathematics; Block code; Concatenated error correction code; Discrete mathematics","score_opus":0.03690478225068595,"score_gpt":0.29877855041684437,"score_spread":0.2618737681661584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153505774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08535616,0.00015808741,0.910216,0.00014426895,0.00001968949,0.000060758935,0.00011273846,0.00048124496,0.003451042],"genre_scores_gemma":[0.70419705,0.00029259888,0.29192954,0.00010214404,0.000026589281,0.00008956022,0.00035235038,0.000104660794,0.0029054664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998735,0.00037204914,0.00007402386,0.000112143294,0.0005944154,0.00011231475],"domain_scores_gemma":[0.9977374,0.0011702207,0.00027112567,0.00034822623,0.0004268081,0.00004621723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865941,0.00038085197,0.00040676614,0.00041976155,0.00040068955,0.00063064275,0.00049575727,0.00040928452,0.00066828565],"category_scores_gemma":[0.0048596216,0.00021354461,0.0002726686,0.0006276515,0.0005484889,0.0006054427,0.00065455935,0.0004950464,0.00027482255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029783294,0.00006253259,0.0019031672,0.00019740743,0.0000629957,0.00016030755,0.0001950287,0.744656,0.037270773,0.10119362,0.0011925987,0.11280774],"study_design_scores_gemma":[0.000016587313,0.000042529744,0.0002379387,0.000013119593,0.0000059804433,0.00007816116,0.000011575438,0.9707817,0.015520489,0.012391229,0.0008917287,0.000008974678],"about_ca_topic_score_codex":0.003042276,"about_ca_topic_score_gemma":0.0049859467,"teacher_disagreement_score":0.003042276,"about_ca_system_score_codex":0.00074031093,"about_ca_system_score_gemma":0.0021424692,"threshold_uncertainty_score":0.006049156},"labels":[],"label_agreement":null},{"id":"W2154004095","doi":"10.1109/icc.2006.254906","title":"Procedures for Efficient Iterative Decoding of Orthogonal Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Sequential decoding; Decoding methods; Concatenation (mathematics); Computer science; List decoding; Algorithm; Serial concatenated convolutional codes; Belief propagation; Concatenated error correction code; Berlekamp–Welch algorithm; Interleaving; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.08670520343720678,"score_gpt":0.366594295161755,"score_spread":0.27988909172454823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154004095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013841402,0.00006506824,0.99599874,0.000027110023,0.000019298648,0.00008593179,0.000065073575,0.00085579633,0.0014987943],"genre_scores_gemma":[0.044916384,0.00025782,0.9509088,0.000065195316,0.00003267735,0.00051691034,0.0004498095,0.0003607239,0.0024916967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981823,0.00033483206,0.00020318471,0.00019768454,0.00091788755,0.00016406373],"domain_scores_gemma":[0.9975624,0.0007591677,0.00017494243,0.0005891489,0.00083429884,0.000079998594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012576514,0.0011416972,0.0007137981,0.0013085159,0.00080541027,0.001067711,0.0012227555,0.00085597904,0.0052294196],"category_scores_gemma":[0.0054686936,0.0005805505,0.00073593814,0.0011273565,0.0007085442,0.0010268776,0.0018462832,0.001780743,0.0046497067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026126925,0.00017824714,0.00067807944,0.0004623216,0.000084780535,0.0004926482,0.0004924806,0.075950675,0.110983774,0.18899304,0.008064323,0.61335844],"study_design_scores_gemma":[0.00015086967,0.00033377038,0.000611663,0.00016566853,0.00006148677,0.0014419891,0.00011741497,0.53645885,0.24696179,0.16510409,0.048396297,0.00019615586],"about_ca_topic_score_codex":0.0010177676,"about_ca_topic_score_gemma":0.00163109,"teacher_disagreement_score":0.0052294196,"about_ca_system_score_codex":0.00060135144,"about_ca_system_score_gemma":0.0019499924,"threshold_uncertainty_score":0.017494142},"labels":[],"label_agreement":null},{"id":"W2154165522","doi":"10.1109/tcomm.2009.11.070210","title":"Waterfall Performance Analysis of Finite-Length LDPC Codes on Symmetric Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Binary symmetric channel; Code word; Mathematics; Channel (broadcasting); Channel capacity; Waterfall; Block code; Computer science; Telecommunications","score_opus":0.04406269363340806,"score_gpt":0.29347941317687143,"score_spread":0.24941671954346337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154165522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4920294,0.00054258405,0.5041676,0.000104353916,0.000010062092,0.0000463376,0.00018699825,0.0004777108,0.0024349405],"genre_scores_gemma":[0.98849225,0.0001813379,0.010824734,0.0000100397365,0.0000063695943,0.000029512903,0.000074110496,0.000028440782,0.0003532325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.0002937345,0.000030399171,0.000078122655,0.00029193546,0.0001378026],"domain_scores_gemma":[0.99485636,0.0033492846,0.00071551197,0.00047967755,0.0005090985,0.00009001432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010819127,0.0006177842,0.0005732163,0.00089304394,0.00030679716,0.0004942512,0.00069348677,0.0005635719,0.00064571906],"category_scores_gemma":[0.007089699,0.000284194,0.00037774,0.00077244325,0.0012176625,0.0013635053,0.0005824618,0.00055691926,0.00017472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085517284,0.00001246348,0.00090733264,0.00003456377,0.000020472695,0.00016943262,0.00006463789,0.9712362,0.008374043,0.013789286,0.000118826516,0.005187173],"study_design_scores_gemma":[0.0000016306966,0.00001752255,0.00025116664,0.000003320643,0.0000020900316,0.000029711133,0.000005653325,0.9943499,0.0021163207,0.003180346,0.000035723027,0.000006659695],"about_ca_topic_score_codex":0.0033924454,"about_ca_topic_score_gemma":0.0014228948,"teacher_disagreement_score":0.0033924454,"about_ca_system_score_codex":0.0012116665,"about_ca_system_score_gemma":0.00073756,"threshold_uncertainty_score":0.0087913275},"labels":[],"label_agreement":null},{"id":"W2154208380","doi":"10.1109/iscas.2007.378837","title":"FPGA Implementation of LDPC Decoders Based on Joint Row-column Decoding Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Decoding methods; Field-programmable gate array; Computer science; Low-density parity-check code; Algorithm; Parallel computing; Sequential decoding; List decoding; Gate array; Column (typography); Joint (building); Throughput; Routing (electronic design automation); Computer hardware; Embedded system; Concatenated error correction code; Computer network; Engineering; Wireless; Telecommunications; Block code","score_opus":0.025306907548853782,"score_gpt":0.32069819741948435,"score_spread":0.29539128987063057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154208380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12605347,0.0007611086,0.84795135,0.0001875873,0.00018756224,0.00023673735,0.00038292282,0.00963711,0.014602161],"genre_scores_gemma":[0.42618832,0.000361257,0.563842,0.00012148904,0.000044106244,0.0001028909,0.0006171612,0.00015726498,0.0085654855],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980944,0.00003381226,0.000014615241,0.000026788337,0.00008536666,0.000029990186],"domain_scores_gemma":[0.999819,0.000053640808,0.000015651776,0.000032490643,0.00006685913,0.000012401759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014403569,0.00041887118,0.00033785586,0.00046954417,0.0002673115,0.0005309218,0.0004483389,0.00028751834,0.0030755452],"category_scores_gemma":[0.00046991554,0.00020438252,0.00016764076,0.0003257633,0.00014110464,0.00029148927,0.00019233182,0.00030533847,0.0010971178],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006927784,0.00016675878,0.0024467008,0.00035098792,0.0001247003,0.00053402863,0.00014369379,0.110719144,0.31423002,0.01754107,0.009482347,0.5435677],"study_design_scores_gemma":[0.0001867015,0.00044853956,0.0019545057,0.000050264458,0.000065100656,0.00091655995,0.00002848388,0.6483351,0.31431523,0.0018030151,0.03183408,0.00006245153],"about_ca_topic_score_codex":0.0025613764,"about_ca_topic_score_gemma":0.0043993024,"teacher_disagreement_score":0.0030755452,"about_ca_system_score_codex":0.00037361748,"about_ca_system_score_gemma":0.0005912407,"threshold_uncertainty_score":0.010288715},"labels":[],"label_agreement":null},{"id":"W2154227688","doi":"","title":"Linear Response for Approximate Inference","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Belief propagation; Inference; Algorithm; Approximate inference; Factor graph; Computer science; Graph; Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence; Decoding methods","score_opus":0.03924093114696837,"score_gpt":0.3249770939864753,"score_spread":0.2857361628395069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154227688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012704143,0.00040734114,0.9956399,0.00042671972,0.00007065538,0.00002696558,0.00006990518,0.0006097631,0.0014783327],"genre_scores_gemma":[0.28512302,0.0017134068,0.6978567,0.0011202974,0.00056584773,0.00076579937,0.00092884764,0.0004933326,0.011432689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592376,0.0020948604,0.0001303021,0.00059744617,0.0010169868,0.00023663211],"domain_scores_gemma":[0.9877194,0.009267833,0.00037674909,0.0015340485,0.0010145352,0.0000874405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003515652,0.0010550749,0.0013262402,0.0010768777,0.0006280545,0.0018161875,0.0018971404,0.0021827943,0.01032828],"category_scores_gemma":[0.030308517,0.0005437179,0.000734232,0.0023600133,0.0015103653,0.0025551515,0.00195737,0.0030085237,0.004086222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038435558,0.00008653124,0.0006108985,0.0004292569,0.00016542038,0.00017077853,0.00013877575,0.4004709,0.0035674777,0.27328104,0.0150665175,0.30562797],"study_design_scores_gemma":[0.000025233132,0.000027758726,0.000087725406,0.000022152828,0.000013008962,0.000043801196,0.000015847561,0.88519436,0.0014426344,0.10906854,0.0040427935,0.000016147449],"about_ca_topic_score_codex":0.004409521,"about_ca_topic_score_gemma":0.0027595442,"teacher_disagreement_score":0.01032828,"about_ca_system_score_codex":0.0012619891,"about_ca_system_score_gemma":0.0014783322,"threshold_uncertainty_score":0.03455156},"labels":[],"label_agreement":null},{"id":"W2154590881","doi":"10.1109/ccece.2007.343","title":"Quantitative Evaluation of Low Density Parity Check Convolutional Code Encoder and Decoder Algorithms for the XInC MIMD Multithreaded Microprocessor","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; MIMD; Low-density parity-check code; Encoder; Microprocessor; Parallel computing; Algorithm; Convolutional code; Decoding methods; Computer hardware","score_opus":0.09775413545252984,"score_gpt":0.3820416279055111,"score_spread":0.28428749245298124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154590881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70509857,0.0015291084,0.28366497,0.00010394853,0.00006840588,0.00019312651,0.00038542712,0.002288323,0.0066680675],"genre_scores_gemma":[0.90260005,0.00022479672,0.09531473,0.000025819849,0.0000116131605,0.00008027063,0.00041033703,0.00009660644,0.0012357837],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882656,0.00026801758,0.0000637881,0.000106203304,0.00068565074,0.00004979814],"domain_scores_gemma":[0.9957487,0.0018230911,0.00034513226,0.0004924058,0.0015297773,0.0000609222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011092336,0.0003251276,0.00025863174,0.0007911944,0.00023737736,0.00041743752,0.0005487208,0.000244977,0.0012853342],"category_scores_gemma":[0.007105957,0.00010308502,0.00011135484,0.0006437043,0.0003001647,0.0008755023,0.00027180222,0.00023266088,0.00015492667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021067623,0.00026640604,0.01595399,0.0007702138,0.00012262927,0.00014071914,0.00014753669,0.23893012,0.33436,0.012000976,0.0018683659,0.3933322],"study_design_scores_gemma":[0.000039977112,0.0012829966,0.0072497847,0.000023100138,0.00004371179,0.00018142274,0.000045793837,0.64359933,0.3433976,0.00090972485,0.0031957212,0.00003082985],"about_ca_topic_score_codex":0.0008828944,"about_ca_topic_score_gemma":0.0011449967,"teacher_disagreement_score":0.0012853342,"about_ca_system_score_codex":0.00092287804,"about_ca_system_score_gemma":0.00043001465,"threshold_uncertainty_score":0.006695926},"labels":[],"label_agreement":null},{"id":"W2154612888","doi":"10.1109/lcomm.2008.080713","title":"LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Ergodic theory; Channel (broadcasting); Binary symmetric channel; Channel code; Binary number; Algorithm; Computer science; List decoding; Mathematics; Low-density parity-check code; Sequential decoding; Linear programming; Joint (building); Coding (social sciences); Channel capacity; Telecommunications; Concatenated error correction code; Block code; Statistics; Arithmetic; Engineering; Mathematical analysis","score_opus":0.09762366274818501,"score_gpt":0.3042148243508912,"score_spread":0.20659116160270619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154612888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028412601,0.00079458795,0.9638289,0.0005239337,0.00005540163,0.000027364476,0.00009927298,0.00011265677,0.006145264],"genre_scores_gemma":[0.739614,0.0019095206,0.25047567,0.00022389018,0.00021014774,0.00020865598,0.00023145766,0.00010891014,0.007017759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00059110875,0.000051094008,0.0001468819,0.00040647626,0.00009076495],"domain_scores_gemma":[0.9948319,0.00391385,0.00037784214,0.00038533812,0.0004252595,0.000065783715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016539705,0.000642748,0.00066468545,0.00066046853,0.00047663494,0.0015294345,0.00069005927,0.0011693337,0.0012095977],"category_scores_gemma":[0.0074543008,0.00026313946,0.00034459456,0.0011647774,0.0019562412,0.0020943775,0.0012640782,0.0019319629,0.00038942357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014700386,0.000038726343,0.00045782063,0.00016691978,0.000024450595,0.00019733961,0.00015348603,0.46472993,0.0037975716,0.48873156,0.0012705494,0.04028478],"study_design_scores_gemma":[0.0000064059145,0.000023651455,0.000058131245,0.000011020053,0.000004414392,0.000055463082,0.000013815415,0.90992916,0.002187203,0.086958535,0.0007404263,0.000011750647],"about_ca_topic_score_codex":0.0009227234,"about_ca_topic_score_gemma":0.00072117953,"teacher_disagreement_score":0.0016539705,"about_ca_system_score_codex":0.0008915433,"about_ca_system_score_gemma":0.0011398391,"threshold_uncertainty_score":0.008747101},"labels":[],"label_agreement":null},{"id":"W2154993501","doi":"10.1109/tcomm.2012.100912.120503","title":"Message-Passing Algorithms for Counting Short Cycles in a Graph","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Message passing; Algorithm; Computer science; Computational complexity theory; Graph theory; Matrix multiplication; Graph; Theoretical computer science; Mathematics; Combinatorics; Parallel computing","score_opus":0.08365801311970401,"score_gpt":0.3494965390896761,"score_spread":0.2658385259699721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154993501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002725198,0.000115589886,0.9957748,0.00005499321,0.000026188558,0.00006744241,0.0000422575,0.0006424237,0.00055114285],"genre_scores_gemma":[0.068247095,0.00041137048,0.927599,0.000081864986,0.00009368813,0.00038747257,0.0003156532,0.00017021027,0.0026935313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786407,0.0006050911,0.0001964458,0.00035638106,0.0007487528,0.00022934753],"domain_scores_gemma":[0.9945773,0.002290587,0.00068968826,0.001077602,0.0011732709,0.00019155732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018026559,0.0018278499,0.0011088225,0.003394455,0.0012028448,0.002094264,0.0026830265,0.0014307302,0.0032308302],"category_scores_gemma":[0.009092033,0.00062392594,0.00094068254,0.0036167211,0.0011396577,0.0041604755,0.0017616944,0.0019251253,0.0013998728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034782113,0.00015350255,0.0012188654,0.0003355577,0.00010837314,0.00014110305,0.0004688258,0.2445532,0.01224116,0.21273994,0.0069516944,0.52073985],"study_design_scores_gemma":[0.000060332317,0.00013091534,0.0002171693,0.00005150874,0.000042772066,0.00019242703,0.00006489475,0.8270379,0.014681497,0.14785846,0.009609111,0.000053054428],"about_ca_topic_score_codex":0.0026126239,"about_ca_topic_score_gemma":0.0031145036,"teacher_disagreement_score":0.003394455,"about_ca_system_score_codex":0.0015327156,"about_ca_system_score_gemma":0.0021088377,"threshold_uncertainty_score":0.011120677},"labels":[],"label_agreement":null},{"id":"W2155310412","doi":"10.1109/cwit.2007.375722","title":"A rateless coding and modulation scheme for unknown Gaussian channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Additive white Gaussian noise; Computer science; Coding (social sciences); Modulation (music); Algorithm; Transmission (telecommunications); Throughput; Decoding methods; Theoretical computer science; Electronic engineering; Gaussian; Computer network; Telecommunications; Mathematics; Wireless; Channel (broadcasting); Physics; Statistics; Engineering","score_opus":0.029550212674871686,"score_gpt":0.2999985307845953,"score_spread":0.27044831810972364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155310412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03889173,0.0007843405,0.9570527,0.0002937568,0.000058758917,0.000058318838,0.000052426996,0.00017008928,0.0026377782],"genre_scores_gemma":[0.774983,0.00070297776,0.22100022,0.00013794418,0.00009468738,0.00012467615,0.00006172671,0.000021097088,0.002873751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917525,0.00030043922,0.00003612331,0.000079561796,0.00032805395,0.00008062911],"domain_scores_gemma":[0.99832445,0.0008297908,0.00028703944,0.00027891772,0.00023216073,0.00004756608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013870497,0.0005392188,0.00054576254,0.00040314646,0.0004020124,0.00070688,0.0010702545,0.0009979707,0.0006591499],"category_scores_gemma":[0.004014034,0.0002313372,0.00033047612,0.00058620167,0.0009745697,0.0010839124,0.0008425119,0.00077107863,0.00024245905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003973272,0.00007222636,0.00063279737,0.00036129556,0.00007854563,0.0006111755,0.00045897957,0.56111187,0.042351972,0.2887776,0.0017485133,0.10339781],"study_design_scores_gemma":[0.000038926457,0.00015476353,0.00012046746,0.000028335458,0.000036257366,0.000322722,0.00001686745,0.96374255,0.0074572987,0.02582737,0.002225871,0.000028511218],"about_ca_topic_score_codex":0.00067452434,"about_ca_topic_score_gemma":0.000662831,"teacher_disagreement_score":0.0013870497,"about_ca_system_score_codex":0.0004983458,"about_ca_system_score_gemma":0.0006538128,"threshold_uncertainty_score":0.007335484},"labels":[],"label_agreement":null},{"id":"W2155425567","doi":"10.1109/glocom.2004.1377969","title":"Comparison between continuous-time asynchronous and discrete-time synchronous iterative decoding","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Asynchronous communication; Decoding methods; Successive over-relaxation; Algorithm; Low-density parity-check code; Computer science; Relaxation (psychology); Iterative method; Benchmark (surveying); Mathematics; Local convergence; Telecommunications","score_opus":0.013571096075324864,"score_gpt":0.29133763097152116,"score_spread":0.2777665348961963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155425567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43649322,0.00090964156,0.5405612,0.00036998047,0.00009916493,0.000062538486,0.000094173716,0.0007741574,0.020635867],"genre_scores_gemma":[0.9563019,0.00027004705,0.041814998,0.00005468364,0.000020909383,0.0000239634,0.00007282115,0.00004892815,0.0013916689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992067,0.0002743465,0.000027553991,0.00007632063,0.00034244847,0.0000727011],"domain_scores_gemma":[0.9959662,0.0027976464,0.00018330188,0.00048434103,0.00047334784,0.00009514148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013909579,0.0003070397,0.00032627213,0.00047978334,0.00023320389,0.0006025008,0.0007050628,0.00060706347,0.0013476876],"category_scores_gemma":[0.007987058,0.00010937584,0.00017520481,0.0005328272,0.00060447166,0.0011986581,0.00041309986,0.0003516437,0.00019219524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010388788,0.00011697912,0.002149252,0.00014147727,0.000047780944,0.0001057276,0.00012001388,0.83342993,0.018431948,0.06253617,0.00069123943,0.08119069],"study_design_scores_gemma":[0.000023270759,0.00011105703,0.00025812347,0.0000048059223,0.000008747633,0.000038424416,0.000017026583,0.9898072,0.0060543898,0.003184715,0.00048526318,0.000006976429],"about_ca_topic_score_codex":0.0017936944,"about_ca_topic_score_gemma":0.0018585632,"teacher_disagreement_score":0.0017936944,"about_ca_system_score_codex":0.0008438862,"about_ca_system_score_gemma":0.0007741105,"threshold_uncertainty_score":0.0073562264},"labels":[],"label_agreement":null},{"id":"W2155465895","doi":"10.1109/tcsi.2005.859773","title":"Low-voltage CMOS circuits for analog iterative decoders","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta Hospital; Alberta Hospital Edmonton","funders":"","keywords":"CMOS; Low voltage; Computer science; Electronic engineering; Decoding methods; Analogue electronics; Voltage; Turbo; Electrical engineering; Electronic circuit; Engineering; Telecommunications","score_opus":0.017272220720885356,"score_gpt":0.26086003257884977,"score_spread":0.2435878118579644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155465895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058056217,0.0038557511,0.88922346,0.0013338482,0.0006749852,0.0002617274,0.00034162783,0.0032830804,0.04296934],"genre_scores_gemma":[0.60408044,0.0018635974,0.37243494,0.0009260816,0.0002862218,0.00016860438,0.00024044668,0.00011923356,0.019880455],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997162,0.00003259238,0.000019292931,0.000032642587,0.00017498307,0.000024308883],"domain_scores_gemma":[0.99942315,0.00016135137,0.00007953169,0.000054249555,0.00026161183,0.00002005261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017853566,0.0003818046,0.0001717339,0.0003628577,0.00038369963,0.0009278888,0.0008482113,0.0005725526,0.005098686],"category_scores_gemma":[0.0016056631,0.00017251134,0.00015150553,0.0004157642,0.0002866933,0.00075210223,0.00035335994,0.00055156316,0.0015542413],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022480894,0.00010132402,0.0011215146,0.00061653636,0.000042785403,0.00037100908,0.00025395528,0.013211295,0.5692942,0.10350531,0.0097344965,0.30152273],"study_design_scores_gemma":[0.00014112769,0.0011628597,0.0014375926,0.0002714668,0.00013587021,0.0020789858,0.000117014024,0.13712989,0.66393536,0.03207103,0.1614123,0.00010650814],"about_ca_topic_score_codex":0.000588581,"about_ca_topic_score_gemma":0.0018222487,"teacher_disagreement_score":0.005098686,"about_ca_system_score_codex":0.0007469356,"about_ca_system_score_gemma":0.00050465285,"threshold_uncertainty_score":0.017056823},"labels":[],"label_agreement":null},{"id":"W2155605600","doi":"10.1109/tcomm.2011.022811.090261","title":"Efficient LLR Calculation for Non-Binary Modulations over Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Binary number; Measure (data warehouse); Computation; Convexity; Algorithm; Mathematics; Piecewise linear function; Computer science; Applied mathematics; Mathematical analysis; Decoding methods","score_opus":0.07647538349100345,"score_gpt":0.3129384104109315,"score_spread":0.23646302691992804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155605600","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064282194,0.00020291637,0.9905629,0.00012983069,0.000017711352,0.00002330426,0.000055432363,0.0006349376,0.0019448238],"genre_scores_gemma":[0.27764815,0.00079160806,0.71679956,0.00015789445,0.000055995875,0.00011596176,0.000328121,0.00051077385,0.0035919237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846363,0.00044030498,0.00011433213,0.000106266016,0.00074888975,0.00012652467],"domain_scores_gemma":[0.99659485,0.0019720423,0.000280265,0.00068075204,0.0004259737,0.00004606473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192504,0.0010099155,0.0008698799,0.0009345359,0.0003249779,0.0017966459,0.0008059661,0.0005381846,0.0040685646],"category_scores_gemma":[0.012227456,0.00032516418,0.00043938908,0.0009867512,0.0006307548,0.0022859103,0.0009776917,0.0013109953,0.0019775266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022758941,0.000056483626,0.0010544253,0.00040261823,0.00006657398,0.00026746668,0.00022489404,0.5925761,0.03894233,0.119004615,0.0039354446,0.24324143],"study_design_scores_gemma":[0.000011619696,0.000045110475,0.00027486277,0.000033014043,0.000012896788,0.00018150575,0.000025096893,0.9436668,0.020289151,0.033173025,0.0022664508,0.000020423018],"about_ca_topic_score_codex":0.00086148403,"about_ca_topic_score_gemma":0.0017152441,"teacher_disagreement_score":0.0040685646,"about_ca_system_score_codex":0.0009973862,"about_ca_system_score_gemma":0.0010749989,"threshold_uncertainty_score":0.013610661},"labels":[],"label_agreement":null},{"id":"W2155798828","doi":"10.1109/issse.2007.4294459","title":"Error-Correcting Codes for Dynamic Spectrum Allocation in Cognitive Radio Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Computer science; Coding (social sciences); Spectrum (functional analysis); Channel code; Algorithm; Theoretical computer science; Computer network; Telecommunications; Decoding methods; Wireless; Mathematics; Statistics","score_opus":0.024969321970346983,"score_gpt":0.3148715629012869,"score_spread":0.28990224093093997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155798828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019606726,0.0047824685,0.96389693,0.0015580527,0.00031041878,0.000059951963,0.00012112848,0.0003297462,0.009334571],"genre_scores_gemma":[0.83125985,0.007220784,0.1524509,0.0005605617,0.00055516546,0.00025207302,0.00018385719,0.0000838965,0.0074330377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989717,0.00034748242,0.00004206154,0.00011177061,0.0003975459,0.00012951627],"domain_scores_gemma":[0.997382,0.0016188695,0.00025284887,0.00035836006,0.00034276614,0.000045065837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381545,0.00074957643,0.000698423,0.0008654861,0.0006414103,0.0011384696,0.0012901938,0.0019087538,0.0016422496],"category_scores_gemma":[0.0068240776,0.00035507826,0.0004742897,0.0011169944,0.0016218718,0.001536981,0.001050639,0.0016947936,0.00040420395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069119815,0.00004746111,0.00031652284,0.00016796522,0.000038633625,0.0002814406,0.00015459744,0.35681728,0.0034192277,0.5920257,0.0039242096,0.04273785],"study_design_scores_gemma":[0.00002411023,0.000039044367,0.00011623715,0.000057274607,0.000019540186,0.00014753231,0.00002369141,0.73085505,0.0014621554,0.26113957,0.0060840603,0.000031777014],"about_ca_topic_score_codex":0.0033511273,"about_ca_topic_score_gemma":0.0029768876,"teacher_disagreement_score":0.0033511273,"about_ca_system_score_codex":0.0013258139,"about_ca_system_score_gemma":0.0015838185,"threshold_uncertainty_score":0.009619534},"labels":[],"label_agreement":null},{"id":"W2155981314","doi":"10.1109/tcomm.2011.121410.100281","title":"Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Metric (unit); Algorithm; Bit error rate; Scaling; Clipping (morphology); Theoretical computer science; Mathematics","score_opus":0.03668611409472764,"score_gpt":0.29146219594098866,"score_spread":0.254776081846261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155981314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0694213,0.00090327865,0.9238784,0.00032964753,0.00010120743,0.00006211332,0.00006338601,0.00066765124,0.004572975],"genre_scores_gemma":[0.5836036,0.00048093553,0.4137071,0.00013939914,0.000053304684,0.000059509814,0.00008136944,0.000082169536,0.0017926564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782526,0.0007128751,0.00014642467,0.00017045696,0.0010231262,0.00012187773],"domain_scores_gemma":[0.99421704,0.0023875441,0.0008473641,0.0013523553,0.0010796909,0.000115926414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719554,0.0010175088,0.0006908519,0.0008409434,0.0003661989,0.0009360103,0.0008940076,0.0009314456,0.0009827727],"category_scores_gemma":[0.014694898,0.00021610556,0.0002566301,0.0017819903,0.000979928,0.001860744,0.0014809368,0.00091776234,0.0005016307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006642378,0.000107790474,0.004017156,0.00035781873,0.000108920656,0.00055622257,0.00040938586,0.42277277,0.08260205,0.21199676,0.0019632052,0.27444372],"study_design_scores_gemma":[0.000016146958,0.00012954768,0.0004839708,0.000035100926,0.000020775638,0.0004822067,0.000025597936,0.90783405,0.06406234,0.024115862,0.0027509332,0.000043496202],"about_ca_topic_score_codex":0.0004911705,"about_ca_topic_score_gemma":0.0006043487,"teacher_disagreement_score":0.001719554,"about_ca_system_score_codex":0.0009610088,"about_ca_system_score_gemma":0.0005443873,"threshold_uncertainty_score":0.00909394},"labels":[],"label_agreement":null},{"id":"W2156063738","doi":"10.1109/tcsii.2007.905328","title":"Block-Interlaced LDPC Decoders With Reduced Interconnect Complexity","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interlacing; Low-density parity-check code; Computer science; Parallel computing; Throughput; Block (permutation group theory); Overhead (engineering); Code (set theory); Decoding methods; Computer hardware; Algorithm; Mathematics; Wireless; Telecommunications","score_opus":0.047377810620053945,"score_gpt":0.2525374696660671,"score_spread":0.20515965904601316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156063738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0603318,0.001035005,0.9259637,0.00028633288,0.00011403175,0.00027468457,0.0003857462,0.0032456147,0.008363066],"genre_scores_gemma":[0.26704958,0.0009509885,0.7150566,0.0002669891,0.00008306959,0.00036045333,0.00069081126,0.0001976825,0.015343887],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977344,0.00003603968,0.000017734743,0.000033894983,0.00011167485,0.000027226473],"domain_scores_gemma":[0.9995333,0.00008061678,0.00009246127,0.000105911065,0.00016304803,0.000024684512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018572995,0.0004974669,0.0004141092,0.0004794021,0.00031324025,0.0004975093,0.00092833623,0.0005771451,0.0026535315],"category_scores_gemma":[0.00065464794,0.00036136538,0.0002515765,0.00059584505,0.00023054189,0.0007087012,0.00035976167,0.00066854496,0.001456518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004990699,0.00023172106,0.0012750014,0.0006904401,0.00015992709,0.00049834844,0.00029626102,0.05778565,0.56698143,0.05107627,0.009002384,0.3115035],"study_design_scores_gemma":[0.00019954193,0.0011511594,0.0016417709,0.000072194285,0.00014958633,0.0016582238,0.00003416069,0.5304645,0.3961807,0.006665553,0.061684508,0.00009824716],"about_ca_topic_score_codex":0.001152733,"about_ca_topic_score_gemma":0.0036900206,"teacher_disagreement_score":0.0026535315,"about_ca_system_score_codex":0.00069414533,"about_ca_system_score_gemma":0.000995551,"threshold_uncertainty_score":0.008876979},"labels":[],"label_agreement":null},{"id":"W2156078113","doi":"10.1109/iscas.2008.4542111","title":"A 600-Mb/s encoder and decoder for low-density parity-check convolutional codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Soft-decision decoder; Computer science; Convolutional code; Throughput; Low-density parity-check code; Decoding methods; Code rate; Computer hardware; Parity bit; Algorithm; Real-time computing; Electronic engineering; Engineering; Telecommunications; Wireless","score_opus":0.027811985292443445,"score_gpt":0.2647599867677619,"score_spread":0.23694800147531847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156078113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46534893,0.0006097433,0.5110999,0.0003723484,0.00015000498,0.000613075,0.001779007,0.0076964367,0.012330445],"genre_scores_gemma":[0.752388,0.00017045888,0.238394,0.00009345829,0.000016182761,0.00021770732,0.0009881081,0.00013850782,0.0075935707],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997594,0.00002159528,0.000013736919,0.000030479303,0.00014764932,0.000027212825],"domain_scores_gemma":[0.9996662,0.0000659461,0.000028234843,0.000057236197,0.00015384764,0.000028533439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789733,0.00027760715,0.00026336336,0.00032215996,0.00031471057,0.00025245617,0.00052642165,0.00030359335,0.0038393892],"category_scores_gemma":[0.0009912367,0.00019879892,0.0000809569,0.00036285428,0.00012764471,0.00037007104,0.0002079269,0.00036669965,0.0012675009],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005939016,0.00020231417,0.002818686,0.0003507612,0.0000369502,0.00041427262,0.00014790628,0.01785269,0.8014799,0.014734739,0.0071162484,0.15425166],"study_design_scores_gemma":[0.0001248628,0.0007360181,0.0041222745,0.000034554574,0.000043976586,0.00072575314,0.00002035225,0.1722969,0.7920552,0.0017782693,0.028005367,0.000056594716],"about_ca_topic_score_codex":0.0012004805,"about_ca_topic_score_gemma":0.0023721738,"teacher_disagreement_score":0.0038393892,"about_ca_system_score_codex":0.00050208205,"about_ca_system_score_gemma":0.00091963157,"threshold_uncertainty_score":0.012844086},"labels":[],"label_agreement":null},{"id":"W2156541068","doi":"10.1109/tcomm.2009.06.070048","title":"Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Low-density parity-check code; Decoding methods; Binary number; Algorithm; Code (set theory); Discrete mathematics; Parity (physics); Mathematics; Word error rate; Computer science; Combinatorics; Statistics; Arithmetic; Artificial intelligence; Physics","score_opus":0.053480811009255086,"score_gpt":0.32590949501043415,"score_spread":0.27242868400117903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156541068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31728575,0.0002933683,0.6776155,0.0002506031,0.000024371946,0.000054816595,0.00016823139,0.00046476544,0.0038425333],"genre_scores_gemma":[0.9325389,0.00029043245,0.06544276,0.000041825442,0.000019208324,0.0000661486,0.00022965984,0.000038011673,0.0013330467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919313,0.00037965272,0.00003176499,0.00006704062,0.00024583156,0.000082512575],"domain_scores_gemma":[0.99660134,0.0024657978,0.0002803783,0.00025464175,0.00033978524,0.000057989037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011313624,0.0005718019,0.00054109306,0.00091665867,0.00028777527,0.0007573586,0.000700984,0.0005917791,0.0005839148],"category_scores_gemma":[0.009120594,0.00034573555,0.00024053552,0.0007983959,0.00060767034,0.0011254117,0.0009307811,0.00054428977,0.00027718215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003209546,0.000046662226,0.0026357386,0.00008463373,0.000024549008,0.000115203,0.00007732542,0.92128766,0.010396446,0.028489169,0.0004468258,0.036074776],"study_design_scores_gemma":[0.0000039987685,0.000006104649,0.00016853443,0.0000048335246,0.0000013833284,0.000009173643,0.0000031508002,0.99485993,0.0019984131,0.0028873899,0.00005193229,0.0000052611013],"about_ca_topic_score_codex":0.0030840016,"about_ca_topic_score_gemma":0.002336704,"teacher_disagreement_score":0.0030840016,"about_ca_system_score_codex":0.0008887021,"about_ca_system_score_gemma":0.0011800554,"threshold_uncertainty_score":0.0064480305},"labels":[],"label_agreement":null},{"id":"W2156765092","doi":"10.1109/spawc.2003.1318929","title":"Good LDPC codes over GF(q) for bandwidth efficient transmission","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Concordia University","funders":"","keywords":"Low-density parity-check code; Column (typography); Additive white Gaussian noise; Parity-check matrix; Mathematics; Matrix (chemical analysis); Algorithm; Bandwidth (computing); Code (set theory); Computer science; Mathematical optimization; Channel (broadcasting); Decoding methods; Telecommunications","score_opus":0.01439165561669654,"score_gpt":0.2699928952676424,"score_spread":0.2556012396509459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156765092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04437937,0.00043936554,0.95101666,0.00031230276,0.00002545262,0.000038600618,0.000048006084,0.00014285177,0.0035974088],"genre_scores_gemma":[0.6243077,0.0010951282,0.3705768,0.0001944943,0.00006512421,0.000118197284,0.00014782793,0.00014517593,0.0033496385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994887,0.00015970852,0.00002085175,0.000059689926,0.00020713972,0.000063773376],"domain_scores_gemma":[0.9991788,0.00040976753,0.0001245474,0.00015127458,0.00010197965,0.000033575514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085227547,0.00061040407,0.00062397023,0.00045683383,0.0004203117,0.0006187883,0.0003888599,0.00067517237,0.0010797576],"category_scores_gemma":[0.003012203,0.00026261163,0.00029494503,0.00071305904,0.00093601964,0.0011912085,0.00058845896,0.0007800764,0.00039550144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011449154,0.00003598213,0.0008372853,0.00022126522,0.000045298068,0.00019693948,0.0001411665,0.71644115,0.047183733,0.18035688,0.001146105,0.05327974],"study_design_scores_gemma":[0.000031851338,0.0000825819,0.0002963162,0.00003813372,0.000025414163,0.00019983192,0.000029207591,0.87784344,0.017514616,0.09953002,0.004386078,0.000022536733],"about_ca_topic_score_codex":0.0007978266,"about_ca_topic_score_gemma":0.0012588049,"teacher_disagreement_score":0.0010797576,"about_ca_system_score_codex":0.00054598495,"about_ca_system_score_gemma":0.00079427083,"threshold_uncertainty_score":0.0045073032},"labels":[],"label_agreement":null},{"id":"W2157326316","doi":"10.1093/comjnl/bxu021","title":"Application of Simple Power Analysis to Stream Ciphers Constructed Using Feedback Shift Registers","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Stream cipher; Simple (philosophy); Power (physics); Library science; Cryptography; Algorithm; Philosophy","score_opus":0.013943070150374909,"score_gpt":0.27038009865218887,"score_spread":0.25643702850181394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157326316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25515842,0.0004923119,0.73985,0.00016687375,0.0000382777,0.00017297108,0.000052281604,0.0010670396,0.0030017719],"genre_scores_gemma":[0.8877799,0.0002331096,0.1105069,0.000039787352,0.000025282809,0.000048869508,0.000028917277,0.00005979993,0.0012774997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992112,0.00025098777,0.00004710163,0.00010882908,0.00033736142,0.000044542307],"domain_scores_gemma":[0.99688977,0.0019997787,0.00036532021,0.0005441008,0.0001730763,0.000027990885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289662,0.00075657916,0.00049746473,0.0008663607,0.00022377816,0.0004397656,0.00039837294,0.00043990184,0.0015895859],"category_scores_gemma":[0.004560367,0.0002664329,0.00043685047,0.00040737598,0.0010180061,0.0011139791,0.00066079316,0.0005024928,0.00025159738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011285985,0.00020428396,0.0059084725,0.0006026659,0.00024444342,0.00078595255,0.00037243677,0.20223732,0.35925433,0.035195038,0.00089590036,0.3931705],"study_design_scores_gemma":[0.000075482356,0.00066081295,0.0025626237,0.000037157806,0.00005726197,0.0007755886,0.00004693233,0.7025606,0.2648101,0.025754215,0.0026183806,0.000040897845],"about_ca_topic_score_codex":0.00017968124,"about_ca_topic_score_gemma":0.00021076486,"teacher_disagreement_score":0.0015895859,"about_ca_system_score_codex":0.00041454268,"about_ca_system_score_gemma":0.0002538544,"threshold_uncertainty_score":0.0053177476},"labels":[],"label_agreement":null},{"id":"W2157587788","doi":"10.1109/isit.2008.4595148","title":"Coding over an erasure channel with a large alphabet size","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Decoding methods; Binary erasure channel; Channel (broadcasting); Erasure code; Separable space; Alphabet; Coding (social sciences); Discrete mathematics; Mathematics; Algorithm; Computer science; Combinatorics; Statistics; Channel capacity; Telecommunications","score_opus":0.02183221334595005,"score_gpt":0.25514921662737156,"score_spread":0.23331700328142152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157587788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30330807,0.0021417013,0.67849135,0.001218531,0.00015325568,0.00006851051,0.0002958888,0.0002600062,0.014062662],"genre_scores_gemma":[0.9674422,0.0017991407,0.025807234,0.00010928306,0.00014057255,0.00008463849,0.00012323297,0.00004120488,0.004452498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00027839484,0.000027744212,0.000112007045,0.00022654027,0.00022667901],"domain_scores_gemma":[0.9889552,0.009042825,0.0008319632,0.00043474327,0.00059931463,0.00013585598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001429934,0.0007877658,0.00080085406,0.00095819915,0.0007658756,0.0012844335,0.0008976506,0.0010921698,0.0013261903],"category_scores_gemma":[0.0065502836,0.00032513318,0.0003995127,0.0014355923,0.0019056512,0.0020532238,0.00097602716,0.0012212244,0.00020965509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024131559,0.00006215805,0.00090336293,0.00024358198,0.000037038262,0.0007911917,0.00023138012,0.61874944,0.007993448,0.35377377,0.0012447815,0.01572851],"study_design_scores_gemma":[0.00002960199,0.000068238536,0.00027046452,0.000049076974,0.000019660007,0.0001740212,0.00005709378,0.91309524,0.0031265859,0.08210776,0.0009765778,0.000025542126],"about_ca_topic_score_codex":0.0022274188,"about_ca_topic_score_gemma":0.0014810468,"teacher_disagreement_score":0.0022274188,"about_ca_system_score_codex":0.001381047,"about_ca_system_score_gemma":0.0012418866,"threshold_uncertainty_score":0.010020196},"labels":[],"label_agreement":null},{"id":"W2157877316","doi":"10.1109/tcomm.2010.03.080456","title":"Index assignment optimization for joint source-channel MAP decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Algorithm; List decoding; Simulated annealing; Hamming distance; Computer science; Sequential decoding; Assignment problem; Gaussian; Markov chain; Mathematical optimization; Mathematics; Statistics; Concatenated error correction code; Block code; Maximum likelihood","score_opus":0.04814961760117752,"score_gpt":0.2931908962022027,"score_spread":0.24504127860102515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157877316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022323616,0.00016234814,0.9752151,0.00011746947,0.000014788923,0.000022666587,0.000044973163,0.00017718965,0.0019218044],"genre_scores_gemma":[0.6301982,0.00028538614,0.36542445,0.000080136015,0.00003866833,0.00009823603,0.00014181079,0.00012193382,0.0036112815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991725,0.00033552016,0.000038764454,0.00013858435,0.0002322631,0.00008242956],"domain_scores_gemma":[0.9990507,0.00061409385,0.00010761459,0.00008775569,0.000108584994,0.00003122125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999198,0.0006573093,0.000789346,0.0004442887,0.00036692695,0.000775697,0.0005684548,0.0006879105,0.0015407725],"category_scores_gemma":[0.004027171,0.00029950181,0.000265618,0.00090092595,0.0007411597,0.0011670942,0.001070672,0.00070150226,0.00039549958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017345851,0.000053320327,0.00036723373,0.000090766014,0.000031627154,0.0000671656,0.0001388702,0.8703697,0.011199216,0.041677117,0.0011096052,0.0747219],"study_design_scores_gemma":[0.000011644652,0.000028722396,0.00008062704,0.0000050479007,0.000006179877,0.000029792658,0.000013300715,0.97761506,0.004984569,0.016734863,0.00048266503,0.0000074601503],"about_ca_topic_score_codex":0.0010942229,"about_ca_topic_score_gemma":0.0011681836,"teacher_disagreement_score":0.0015407725,"about_ca_system_score_codex":0.0007921495,"about_ca_system_score_gemma":0.0012212942,"threshold_uncertainty_score":0.0057474375},"labels":[],"label_agreement":null},{"id":"W2157927886","doi":"10.1109/tit.2014.2334657","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Node (physics); Variable (mathematics); Set (abstract data type); Characterization (materials science); Tanner graph; Graph; Class (philosophy); Simple (philosophy); Code (set theory); Discrete mathematics; Combinatorics; Decoding methods; Mathematics; Theoretical computer science; Algorithm; Error floor; Statistics","score_opus":0.006652840438808025,"score_gpt":0.21760076857416752,"score_spread":0.2109479281353595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157927886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67242455,0.0003840217,0.3108873,0.00024039486,0.000032327647,0.00010826852,0.00052698195,0.00025764853,0.015138452],"genre_scores_gemma":[0.96185213,0.0002778713,0.032892153,0.00010527419,0.00005067917,0.00010998006,0.00059605786,0.000091377755,0.0040244344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960035,0.00006610369,0.000023805524,0.00011634578,0.00011541724,0.00007796075],"domain_scores_gemma":[0.9976376,0.0012121279,0.00044563206,0.00022234384,0.00026879835,0.00021349508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032191494,0.00031635427,0.00039417786,0.0013687036,0.00079807866,0.00093235297,0.0006504516,0.00050424534,0.0030356988],"category_scores_gemma":[0.0027883267,0.00031239178,0.0005432343,0.00077371224,0.0013472718,0.0014965379,0.0008997362,0.0009001619,0.00026822087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016024723,0.00010646118,0.008101442,0.00022003234,0.000037203798,0.0005739607,0.0010402929,0.05642751,0.026800647,0.8776255,0.0016088341,0.027297804],"study_design_scores_gemma":[0.000038809296,0.000186898,0.0056003453,0.00008355081,0.00004101026,0.0011087352,0.00042745937,0.35339454,0.014741874,0.6169753,0.0073347352,0.000066630935],"about_ca_topic_score_codex":0.0007893115,"about_ca_topic_score_gemma":0.0006191036,"teacher_disagreement_score":0.0030356988,"about_ca_system_score_codex":0.00064751273,"about_ca_system_score_gemma":0.00039154894,"threshold_uncertainty_score":0.01015538},"labels":[],"label_agreement":null},{"id":"W2157945138","doi":"10.1109/icc.2008.228","title":"A Class of Low-Density Parity-Check Convolutional Codes Based on Difference Families","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Generator matrix; Low-density parity-check code; Tanner graph; Hamming code; Linear code; Parity-check matrix; Serial concatenated convolutional codes; Concatenated error correction code; Turbo code; Decoding methods; Mathematics; Algorithm; Convolutional code; Raptor code; Additive white Gaussian noise; Sequential decoding; Discrete mathematics; Block code; Computer science; Statistics; White noise","score_opus":0.02609623870009068,"score_gpt":0.24579868943190675,"score_spread":0.21970245073181607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157945138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35815507,0.0005313701,0.6217951,0.00036410536,0.0000904702,0.00015710341,0.00030600946,0.00035145206,0.018249342],"genre_scores_gemma":[0.9081806,0.00040031743,0.08671822,0.00010338584,0.00005068059,0.00014044646,0.00032972157,0.000040562805,0.004036217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997576,0.000041802672,0.000011204608,0.0000385213,0.000109067136,0.000041894542],"domain_scores_gemma":[0.9992735,0.00032729746,0.00009985245,0.00010235051,0.00014417474,0.000052878215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002733219,0.00024555015,0.00028555034,0.00072426576,0.0006231427,0.0006385661,0.0003740225,0.00034293006,0.001176858],"category_scores_gemma":[0.0012920328,0.00015440666,0.00031996437,0.00039650602,0.00094014226,0.0005324221,0.0005592939,0.0006714406,0.00024237836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021271552,0.000073716525,0.0027469895,0.00013177724,0.000016030086,0.0004552638,0.0001738365,0.057135884,0.032602977,0.8338017,0.0015592482,0.071089834],"study_design_scores_gemma":[0.00010173878,0.00031235765,0.0028068628,0.00007137827,0.000035186917,0.0021807668,0.00007671864,0.54339504,0.037203293,0.38946608,0.024244845,0.000105789964],"about_ca_topic_score_codex":0.00054675544,"about_ca_topic_score_gemma":0.00045944605,"teacher_disagreement_score":0.001176858,"about_ca_system_score_codex":0.0006532002,"about_ca_system_score_gemma":0.00064977317,"threshold_uncertainty_score":0.004739344},"labels":[],"label_agreement":null},{"id":"W2158083640","doi":"10.1109/lcomm.2008.080597","title":"Stability analysis of an improved min-sum decoder","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Algorithm; Scaling; Sequential decoding; Code (set theory); Linear code; Stability (learning theory); Block code; Mathematics; Set (abstract data type)","score_opus":0.06365815239553399,"score_gpt":0.30744223798587444,"score_spread":0.24378408559034045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158083640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06641395,0.00030575471,0.922119,0.00039876564,0.000048147383,0.000039546758,0.00010178861,0.00033281374,0.010240305],"genre_scores_gemma":[0.87705976,0.00030957276,0.11384891,0.00012481399,0.000061376246,0.00007456595,0.00013982476,0.000100787714,0.008280474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943465,0.00015876113,0.00002150318,0.00008063266,0.00025369108,0.000050829556],"domain_scores_gemma":[0.99869305,0.00064185564,0.00009777162,0.00012732539,0.00039632944,0.000043748572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081709656,0.00048174037,0.000570484,0.0004584239,0.00035369056,0.00075926055,0.0007136773,0.00073961244,0.001988944],"category_scores_gemma":[0.003308461,0.00030259264,0.00041388822,0.0003933897,0.0006624148,0.000641738,0.0007712098,0.0007278843,0.0006525963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023906525,0.00002782229,0.00097464374,0.00009339529,0.000051817926,0.00021743652,0.00022458743,0.8025888,0.037276015,0.12589584,0.0013651191,0.031045455],"study_design_scores_gemma":[0.000003451098,0.000009432128,0.000048480553,0.0000021903402,0.0000032383261,0.000028462384,0.0000031422755,0.99395436,0.0026440118,0.0030639968,0.00023530338,0.0000040093078],"about_ca_topic_score_codex":0.002255764,"about_ca_topic_score_gemma":0.00120798,"teacher_disagreement_score":0.002255764,"about_ca_system_score_codex":0.0011985896,"about_ca_system_score_gemma":0.0009977482,"threshold_uncertainty_score":0.008696437},"labels":[],"label_agreement":null},{"id":"W2158511475","doi":"10.1109/isit.2004.1365311","title":"Low-density parity-check codes with fast decoding convergence speed","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Erasure; List decoding; Parity-check matrix; Binary erasure channel; Sequential decoding; Algorithm; Erasure code; Tornado code; Concatenated error correction code; Error floor; Block code; Channel capacity; Computer network; Channel (broadcasting)","score_opus":0.016865756050648304,"score_gpt":0.25139519712434866,"score_spread":0.23452944107370036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158511475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09032072,0.00077701546,0.90135556,0.00043053782,0.0000617583,0.00007666669,0.00006756649,0.00050442107,0.0064057424],"genre_scores_gemma":[0.7173559,0.0005869135,0.27869198,0.0001490461,0.000072495735,0.00019496943,0.000108947475,0.000076452474,0.002763287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947697,0.0001638119,0.00002331088,0.00004835431,0.00023996354,0.00004763353],"domain_scores_gemma":[0.99769706,0.0012802925,0.00020932348,0.00024511517,0.00051177404,0.000056475175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007417271,0.0004055999,0.00048367548,0.0005398559,0.00045673674,0.00071138015,0.0005314101,0.0006581295,0.00097066705],"category_scores_gemma":[0.005116403,0.00024504872,0.00017171081,0.00048699454,0.000634279,0.0006248483,0.0006110432,0.00087989203,0.00052765943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006419428,0.00015018276,0.002951819,0.00069262786,0.000082732295,0.0003486001,0.0003441131,0.35225305,0.13102944,0.29567775,0.0027682954,0.21305944],"study_design_scores_gemma":[0.000060538376,0.00011395241,0.00030919135,0.000043089694,0.000025150663,0.00020582232,0.000017320632,0.926425,0.040519748,0.028256154,0.003993489,0.000030479297],"about_ca_topic_score_codex":0.00068939605,"about_ca_topic_score_gemma":0.0010624288,"teacher_disagreement_score":0.00097066705,"about_ca_system_score_codex":0.00049219595,"about_ca_system_score_gemma":0.0009652321,"threshold_uncertainty_score":0.0039226413},"labels":[],"label_agreement":null},{"id":"W2158681102","doi":"10.1109/isit.1997.613026","title":"Graph theoretic construction of generalized product codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Bipartite graph; Computer science; Tanner graph; Factor graph; Decoding methods; Girth (graph theory); Theoretical computer science; Product (mathematics); Low-density parity-check code; Graph; Block code; Algorithm; Discrete mathematics; Combinatorics; Concatenated error correction code; Mathematics","score_opus":0.019166676272125777,"score_gpt":0.2382040712021471,"score_spread":0.2190373949300213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158681102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087930426,0.00034026665,0.8826255,0.0005841488,0.00017635402,0.00012034664,0.0002113338,0.0005630843,0.027448494],"genre_scores_gemma":[0.5542847,0.000596842,0.43237144,0.0003972084,0.00009355127,0.00028028857,0.00042727657,0.00035152712,0.011197076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945146,0.0001746435,0.000015387215,0.000089007386,0.00020136475,0.0000681291],"domain_scores_gemma":[0.99907887,0.00032108073,0.000063882704,0.00018900455,0.00020562026,0.00014157678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045000858,0.000505346,0.00046757195,0.00085509976,0.00089986646,0.0010015205,0.0008992039,0.00059603335,0.0027370905],"category_scores_gemma":[0.0015029159,0.00040809409,0.0005331989,0.00073205883,0.0017311499,0.0015414371,0.002166797,0.0017214778,0.000673143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024927818,0.000020015552,0.00019651202,0.00006447127,0.000010814852,0.0001596547,0.0001579154,0.009255527,0.0044193114,0.97192615,0.0013552026,0.012409482],"study_design_scores_gemma":[0.00002580473,0.000066990484,0.00021734808,0.00003716696,0.000019962268,0.00046354148,0.000087964756,0.07287718,0.009046569,0.9001448,0.01697162,0.000041073043],"about_ca_topic_score_codex":0.000524188,"about_ca_topic_score_gemma":0.00064913253,"teacher_disagreement_score":0.0027370905,"about_ca_system_score_codex":0.00048580393,"about_ca_system_score_gemma":0.0008516825,"threshold_uncertainty_score":0.009156525},"labels":[],"label_agreement":null},{"id":"W2159957399","doi":"10.1109/isit.2002.1023619","title":"On embedded scalable code stream of minimum expected distortion for variable rate channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Scalability; Computer science; Merge (version control); Algorithm; Exponential function; Tree (set theory); sort; Weighting; Code (set theory); Mathematics; Theoretical computer science; Parallel computing; Combinatorics","score_opus":0.021053304798847306,"score_gpt":0.26942901289115606,"score_spread":0.24837570809230874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159957399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061462298,0.00044104588,0.93539035,0.00021871981,0.000027127022,0.000044197808,0.0001228087,0.00030560832,0.0019878603],"genre_scores_gemma":[0.69237524,0.000987451,0.300461,0.00012586544,0.000079137426,0.00012834228,0.00037478164,0.00018537669,0.0052827415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994579,0.000107270855,0.000023975092,0.000077589415,0.00026836482,0.00006496255],"domain_scores_gemma":[0.9985172,0.0009109827,0.00017120491,0.0001259555,0.00021984613,0.00005481878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955823,0.0006976341,0.0008641721,0.00045085142,0.00030687964,0.0007923617,0.0006997972,0.0006409639,0.001655639],"category_scores_gemma":[0.003868904,0.00021325059,0.00024250272,0.0011216091,0.0008529075,0.0018886719,0.0008749362,0.00067133637,0.00022907778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024541016,0.00003453642,0.00033086914,0.00013075853,0.000025517002,0.0001560181,0.0000875648,0.8157332,0.016489198,0.11563483,0.0017331425,0.049398858],"study_design_scores_gemma":[0.000016733917,0.000039504434,0.000060995382,0.000007906533,0.000005660916,0.00003549069,0.000010487887,0.9704871,0.004944617,0.023825288,0.00055938447,0.0000068919985],"about_ca_topic_score_codex":0.0020351463,"about_ca_topic_score_gemma":0.001775285,"teacher_disagreement_score":0.0020351463,"about_ca_system_score_codex":0.0010149485,"about_ca_system_score_gemma":0.0010006559,"threshold_uncertainty_score":0.007363975},"labels":[],"label_agreement":null},{"id":"W2160152395","doi":"10.1109/isit.2003.1228117","title":"Importance sampling for SPICE-level verification of analog decoders","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Spice; Computer science; Sampling (signal processing); Decoding methods; Analogue electronics; Electronic engineering; Sample and hold; Electronic circuit; Computer engineering; Algorithm; Engineering; Electrical engineering; Telecommunications","score_opus":0.11103262679631304,"score_gpt":0.331249713185116,"score_spread":0.22021708638880294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160152395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042106126,0.00016080165,0.95521575,0.00007871489,0.000025065247,0.00006096925,0.000031053332,0.0006217014,0.0016997204],"genre_scores_gemma":[0.83762646,0.00014400396,0.16133857,0.00006947312,0.000018087474,0.00007846305,0.00006312998,0.00007858519,0.0005832202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979955,0.00068336347,0.00010704455,0.00009941556,0.0009996808,0.00011501983],"domain_scores_gemma":[0.9951821,0.0029968866,0.0002901642,0.0008925956,0.000575787,0.00006247379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020140575,0.0005354679,0.00036129975,0.0008941738,0.00041073555,0.00080839393,0.0009118119,0.0004426995,0.0017441788],"category_scores_gemma":[0.013445448,0.00029974233,0.00037722342,0.00034962685,0.0008570489,0.0015294033,0.0006027952,0.00074007036,0.00020401164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007901681,0.00013903054,0.0035860331,0.00037886624,0.00006420285,0.00037944657,0.0002860318,0.5131358,0.09203706,0.21042386,0.0010593522,0.17772017],"study_design_scores_gemma":[0.000025198644,0.00011284646,0.00027248374,0.000020514133,0.000010623923,0.00008483659,0.000010405777,0.91947365,0.059058253,0.019835487,0.001082584,0.000013185119],"about_ca_topic_score_codex":0.0008421282,"about_ca_topic_score_gemma":0.001322732,"teacher_disagreement_score":0.0020140575,"about_ca_system_score_codex":0.00095802656,"about_ca_system_score_gemma":0.00086931646,"threshold_uncertainty_score":0.010651469},"labels":[],"label_agreement":null},{"id":"W2160765938","doi":"10.1109/bsc.2008.4563210","title":"FPGA implementation of variants of min-sum algorithm","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Field-programmable gate array; Computer science; Low-density parity-check code; Throughput; Decoding methods; Algorithm; Parallel computing; Block (permutation group theory); Computer hardware; Mathematics","score_opus":0.026132065868507467,"score_gpt":0.30204609815618966,"score_spread":0.2759140322876822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160765938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24056645,0.0011839154,0.7212826,0.00020395809,0.00015287836,0.00016298793,0.00031134582,0.006828363,0.029307518],"genre_scores_gemma":[0.6109226,0.00034758146,0.38076985,0.0000945627,0.000031866086,0.000062114406,0.00033119833,0.00011235597,0.0073277634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998062,0.000034714412,0.00001536887,0.000030811632,0.0000760785,0.000036883343],"domain_scores_gemma":[0.9998233,0.00005388016,0.000017598193,0.000035924393,0.00005845503,0.000010891854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578111,0.00034597924,0.00024939797,0.0004951676,0.00024770523,0.00054315996,0.0006028334,0.00021828349,0.0043338984],"category_scores_gemma":[0.00054179155,0.00014763659,0.0001628651,0.00036495886,0.00014803172,0.00036206987,0.00017849992,0.0002652417,0.00089654495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000913851,0.00012737533,0.002659239,0.0003521745,0.00009425626,0.0004092807,0.0001748884,0.10222966,0.12283672,0.026286896,0.006383242,0.7375324],"study_design_scores_gemma":[0.00020848586,0.0007050595,0.0025812876,0.000060338687,0.000060045473,0.0013618877,0.00009564624,0.666986,0.28670523,0.0058519314,0.035327516,0.000056588975],"about_ca_topic_score_codex":0.0013115997,"about_ca_topic_score_gemma":0.0024034933,"teacher_disagreement_score":0.0043338984,"about_ca_system_score_codex":0.0003495334,"about_ca_system_score_gemma":0.00043197686,"threshold_uncertainty_score":0.014498293},"labels":[],"label_agreement":null},{"id":"W2160767871","doi":"10.1109/icassp.2009.4959645","title":"Tracking Forecast Memories in stochastic decoders","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Decorrelation; Application-specific integrated circuit; Stochastic computing; Implementation; Channel (broadcasting); Tracking (education); Stochastic process; Algorithm; Computer engineering; Parallel computing; Real-time computing; Embedded system; Computer network; Mathematics; Statistics; Programming language","score_opus":0.021741285769514673,"score_gpt":0.27638689359139873,"score_spread":0.25464560782188406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160767871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08388698,0.00031106974,0.91152215,0.00013861324,0.000063695385,0.00003288901,0.00006252163,0.0007903781,0.003191775],"genre_scores_gemma":[0.80527943,0.00028292168,0.18972161,0.00023370962,0.000054754106,0.00005121782,0.00008160672,0.00006569114,0.004229004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975365,0.00005230254,0.00001858192,0.000040376435,0.000098703036,0.000036392637],"domain_scores_gemma":[0.99948764,0.0002195416,0.00008369655,0.00009037301,0.00009582889,0.000023037568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034981305,0.00024935897,0.00026366784,0.00022804351,0.00025530564,0.00052507385,0.00060385873,0.00045781225,0.0014136463],"category_scores_gemma":[0.0014485678,0.0001570755,0.00014714203,0.00028523986,0.00039901905,0.0010269515,0.0004374464,0.0005105766,0.00033908463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010873729,0.00010803539,0.0021470787,0.00023923708,0.000070106544,0.00030559668,0.00028641097,0.24731606,0.20283355,0.19362903,0.0029379656,0.34903952],"study_design_scores_gemma":[0.000042077507,0.00026649935,0.00036207776,0.00003065422,0.000033739943,0.0002400278,0.000032330812,0.7546346,0.22021034,0.017253924,0.006856428,0.00003732649],"about_ca_topic_score_codex":0.0006367123,"about_ca_topic_score_gemma":0.0011311361,"teacher_disagreement_score":0.0014136463,"about_ca_system_score_codex":0.00028539682,"about_ca_system_score_gemma":0.00043597555,"threshold_uncertainty_score":0.004729092},"labels":[],"label_agreement":null},{"id":"W2160879932","doi":"10.1109/icc.2009.5199457","title":"Short-Length Raptor Codes for Mobile Free-Space Optical Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Raptor code; Fountain code; Forward error correction; Network packet; Jitter; Transmitter; Real-time computing; Computer network; Decoding methods; Base station; Channel (broadcasting); Telecommunications; Concatenated error correction code; Block code","score_opus":0.021558665795740506,"score_gpt":0.29337275480468983,"score_spread":0.2718140890089493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160879932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26102188,0.00257413,0.7278072,0.00039126727,0.0000844664,0.00012217966,0.0001599589,0.0006869844,0.0071518063],"genre_scores_gemma":[0.86003405,0.0009908555,0.1370457,0.000056145007,0.000025678744,0.00014821315,0.00007406761,0.0000456582,0.0015796833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995308,0.00020362128,0.000018195984,0.000030187255,0.00017223644,0.000044915178],"domain_scores_gemma":[0.9979831,0.0012810804,0.00029372796,0.00016708382,0.00024826732,0.000026707137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063859194,0.00041221103,0.00032320747,0.00038038354,0.00042831295,0.00041842734,0.00042267988,0.00075069664,0.0011265514],"category_scores_gemma":[0.0028038532,0.00021843087,0.00030734547,0.0003798503,0.0004768844,0.00061490346,0.00023294253,0.0004474338,0.00027388247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016284114,0.00003931169,0.00059753424,0.00017113096,0.00003859916,0.00024591258,0.00016517963,0.92031157,0.019041732,0.03610706,0.00073682016,0.022382312],"study_design_scores_gemma":[0.00002317938,0.00013202812,0.00018377864,0.000021404043,0.000017122957,0.00013492443,0.00001668383,0.97834307,0.011276111,0.008222489,0.0016106652,0.00001857267],"about_ca_topic_score_codex":0.0011127993,"about_ca_topic_score_gemma":0.0011641834,"teacher_disagreement_score":0.0011265514,"about_ca_system_score_codex":0.00040632917,"about_ca_system_score_gemma":0.00059755234,"threshold_uncertainty_score":0.0037686825},"labels":[],"label_agreement":null},{"id":"W2160947970","doi":"10.1109/cwit.2009.5069538","title":"Cross-layer Raptor coding for broadcasting over wireless channels with memory","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Computer science; Raptor code; Online codes; Fountain code; Decoding methods; Binary erasure channel; Computer network; Erasure code; Forward error correction; Tornado code; Network packet; Luby transform code; Wireless; Relay; Channel (broadcasting); Concatenated error correction code; Algorithm; Telecommunications; Channel capacity; Block code","score_opus":0.03203331859845021,"score_gpt":0.3097929057934915,"score_spread":0.2777595871950413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160947970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26594973,0.003182269,0.72517794,0.000403813,0.000043212494,0.000049241193,0.000075405485,0.000591692,0.004526752],"genre_scores_gemma":[0.942735,0.0008014881,0.05545526,0.00006133065,0.000020374076,0.00004077608,0.000033960983,0.000022343045,0.0008295406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960536,0.00017138591,0.000016438531,0.00003137769,0.00012849954,0.0000469773],"domain_scores_gemma":[0.998027,0.001364068,0.00019068604,0.00020267029,0.00019352348,0.00002189073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084398716,0.00031701213,0.00042771542,0.0003978037,0.00038422304,0.0004941085,0.00043745886,0.0005393172,0.00064514915],"category_scores_gemma":[0.0041013877,0.0001971995,0.00026255904,0.00051136245,0.00050769537,0.0008504522,0.0004931185,0.00043764134,0.00011858776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002602826,0.00006402572,0.0012718175,0.0002173913,0.00010807901,0.000308306,0.00025198332,0.82518345,0.02798483,0.058247097,0.0012900895,0.08481264],"study_design_scores_gemma":[0.000012218347,0.000088278946,0.00019608003,0.000009631261,0.000023802388,0.00013669925,0.000014841725,0.9842174,0.008521631,0.006141194,0.000626033,0.0000121430385],"about_ca_topic_score_codex":0.0013781033,"about_ca_topic_score_gemma":0.0018289518,"teacher_disagreement_score":0.0013781033,"about_ca_system_score_codex":0.00043977436,"about_ca_system_score_gemma":0.00061178126,"threshold_uncertainty_score":0.004463494},"labels":[],"label_agreement":null},{"id":"W2161331137","doi":"10.1109/lcomm.2008.080260","title":"Decoding with Early Termination for Raptor Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Raptor code; List decoding; Computer science; Sequential decoding; Fountain code; Algorithm; Berlekamp–Welch algorithm; Online codes; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.05489997568744488,"score_gpt":0.2923545659697088,"score_spread":0.23745459028226396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161331137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020217236,0.00044486273,0.9766815,0.000079764584,0.00003439825,0.000046939862,0.000017467497,0.00040400206,0.0020738193],"genre_scores_gemma":[0.29880515,0.000730041,0.697472,0.00015176935,0.000078004894,0.00013118831,0.000119971875,0.0001378314,0.0023740267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983241,0.0007155547,0.00009342143,0.00012793427,0.0006383648,0.00010062479],"domain_scores_gemma":[0.9952443,0.0027210356,0.0003822816,0.0009553965,0.00062020496,0.00007668752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017033191,0.00060703827,0.0007131589,0.00064434356,0.00045256063,0.00079381006,0.00073094934,0.0010104848,0.00074173737],"category_scores_gemma":[0.00807187,0.00027286884,0.00038072473,0.00054233713,0.0008472597,0.0012382529,0.0009853898,0.0014508428,0.0006722657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086001935,0.00013640372,0.0012607302,0.00038530817,0.00006948673,0.0006973926,0.0006232431,0.29358768,0.1360367,0.161937,0.0022921285,0.4021139],"study_design_scores_gemma":[0.00007271857,0.00034487303,0.00024114714,0.000068506204,0.000032173746,0.00076483586,0.00002762911,0.8489486,0.105391115,0.03664808,0.0074118953,0.00004848006],"about_ca_topic_score_codex":0.0002683234,"about_ca_topic_score_gemma":0.0003249525,"teacher_disagreement_score":0.0017033191,"about_ca_system_score_codex":0.00036815787,"about_ca_system_score_gemma":0.0007430458,"threshold_uncertainty_score":0.00900811},"labels":[],"label_agreement":null},{"id":"W2162344044","doi":"10.1109/tcomm.2010.04.090007","title":"Coded multipulse pulse-position modulation for free-space optical communications","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pulse-position modulation; Computer science; Electronic engineering; Bandwidth (computing); Coding (social sciences); Modulation (music); Pulse-amplitude modulation; Transmission (telecommunications); Optical communication; Binary number; Constellation; Algorithm; Telecommunications; Pulse (music); Mathematics; Engineering; Physics","score_opus":0.04177386960490998,"score_gpt":0.3161985241301165,"score_spread":0.27442465452520654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162344044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10679408,0.0022172618,0.876917,0.0011517168,0.00018375453,0.00005712893,0.00007697713,0.0002612346,0.0123408735],"genre_scores_gemma":[0.85519326,0.0010158565,0.14135408,0.00018827108,0.000071226954,0.000050880797,0.000055556524,0.000020131914,0.0020506908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000045361237,0.0000054765874,0.000015964786,0.00009066699,0.000016034197],"domain_scores_gemma":[0.99935955,0.00033468136,0.00006360583,0.000114801216,0.00010988079,0.000017507944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030231956,0.00017576065,0.00017684292,0.00023399833,0.00021118288,0.0004218871,0.00048604733,0.0004942304,0.0014567558],"category_scores_gemma":[0.0015993721,0.0000906669,0.00011790818,0.00033130485,0.00033270416,0.0006340581,0.00036075752,0.00053156767,0.0002586236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028495412,0.00009415815,0.0010791427,0.00054513826,0.00004368305,0.00020610368,0.0002664429,0.20456709,0.11804966,0.3777383,0.0026681009,0.29445717],"study_design_scores_gemma":[0.000024197088,0.00019298731,0.00035861402,0.00005403708,0.000022353179,0.00016675463,0.000033416287,0.89981675,0.03889032,0.050797515,0.009616459,0.00002663061],"about_ca_topic_score_codex":0.00046189898,"about_ca_topic_score_gemma":0.0009094423,"teacher_disagreement_score":0.0014567558,"about_ca_system_score_codex":0.00041210474,"about_ca_system_score_gemma":0.0005162196,"threshold_uncertainty_score":0.004873395},"labels":[],"label_agreement":null},{"id":"W2163509114","doi":"10.1109/icassp.2011.5946819","title":"Hardware architectures for successive cancellation decoding of polar codes","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":254,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Single antenna interference cancellation; Logarithm; Coding (social sciences); Throughput; Sequential decoding; List decoding; Polar; Multiplication (music); Algorithm; Arithmetic; Parallel computing; Computer hardware; Concatenated error correction code; Block code; Telecommunications; Mathematics","score_opus":0.04115868825466009,"score_gpt":0.30534244460520504,"score_spread":0.264183756350545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163509114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058233652,0.0008347172,0.92156214,0.0003860317,0.00019145772,0.00010083226,0.00010873244,0.0025850947,0.015997311],"genre_scores_gemma":[0.565187,0.0009382574,0.42161867,0.00029586122,0.00014901884,0.00015210036,0.00035591418,0.000110201465,0.01119302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.00008165449,0.000027657798,0.00005160607,0.00022123886,0.000066999026],"domain_scores_gemma":[0.9993662,0.0002092945,0.000073492745,0.00010836807,0.00021360409,0.000028965513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037190077,0.0006032509,0.00029245156,0.00065620645,0.00052885886,0.0007993162,0.0009292681,0.00050377066,0.0039312],"category_scores_gemma":[0.0016287155,0.0002944626,0.00025131903,0.0006723342,0.0005625616,0.0009718979,0.0007401437,0.00083421945,0.0015367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084932306,0.0001553271,0.0010153085,0.0004087764,0.000061484185,0.00038874403,0.0003284958,0.15491693,0.23777647,0.17008892,0.008984182,0.42502603],"study_design_scores_gemma":[0.00016639789,0.00054625154,0.0007093799,0.000078345154,0.000052286363,0.00052480627,0.000096525844,0.70973223,0.20089582,0.058962736,0.02816428,0.000070988914],"about_ca_topic_score_codex":0.0014567822,"about_ca_topic_score_gemma":0.0025123581,"teacher_disagreement_score":0.0039312,"about_ca_system_score_codex":0.0006855933,"about_ca_system_score_gemma":0.0009842812,"threshold_uncertainty_score":0.013151169},"labels":[],"label_agreement":null},{"id":"W2163704728","doi":"10.1109/ccece.2005.1557399","title":"Performance evaluation of LDPC codes in the presence of ISI with application to 10Gbase-T ethernet","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Low-density parity-check code; Additive white Gaussian noise; Computer science; Algorithm; Forward error correction; Serial concatenated convolutional codes; Concatenated error correction code; Turbo code; Theoretical computer science; Decoding methods; Electronic engineering; Computer network; Channel (broadcasting); Block code; Engineering","score_opus":0.02095212821227232,"score_gpt":0.2917291532299468,"score_spread":0.2707770250176745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163704728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800618,0.00037962612,0.016364578,0.00014712945,0.000014625223,0.000022349366,0.000065411325,0.00020964065,0.0027347784],"genre_scores_gemma":[0.9972331,0.00011762451,0.0023014436,0.000012587193,0.0000048984743,0.000006506565,0.00004049861,0.00000887324,0.00027447363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857104,0.00047723684,0.000062644336,0.00010536776,0.0005142928,0.00026945476],"domain_scores_gemma":[0.9887344,0.00825742,0.00073540455,0.00043353238,0.0016430266,0.00019618485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013892574,0.00057147694,0.0005499893,0.0008474462,0.00069356017,0.00065955054,0.0004229727,0.0009053684,0.00072180864],"category_scores_gemma":[0.009746067,0.0001694148,0.00020680821,0.0013257924,0.00088626205,0.0007265221,0.00054674246,0.00044406048,0.00010292786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010128843,0.00007864528,0.0073416424,0.00013502136,0.00006860877,0.00048594546,0.00017166014,0.95033115,0.022951474,0.0039630276,0.0002456279,0.0132144075],"study_design_scores_gemma":[0.000027848691,0.0004226942,0.0021334116,0.000018437468,0.00004101511,0.00021365542,0.000066758534,0.96531206,0.030682862,0.00079922675,0.0002515338,0.00003060054],"about_ca_topic_score_codex":0.009909463,"about_ca_topic_score_gemma":0.0046445588,"teacher_disagreement_score":0.009909463,"about_ca_system_score_codex":0.0016607344,"about_ca_system_score_gemma":0.0008870169,"threshold_uncertainty_score":0.019703567},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012693858256569409,"score_gpt":0.25261944954217297,"score_spread":0.23992559128560356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163750149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2333541,0.0014734134,0.746804,0.00090122427,0.000050119677,0.00007562601,0.00023227168,0.00020727584,0.016901946],"genre_scores_gemma":[0.9711051,0.0010352379,0.023702595,0.00010302822,0.00004472357,0.000082134844,0.00015600253,0.0000651119,0.003705993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995939,0.00013310596,0.000011132566,0.000030631683,0.00016948486,0.000061858176],"domain_scores_gemma":[0.9968214,0.0023374332,0.00023556771,0.00012550785,0.00042306056,0.000057094985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096579915,0.000626079,0.00053762906,0.0012951752,0.00050684606,0.00093734276,0.0007493186,0.00087956723,0.0013653934],"category_scores_gemma":[0.0066859755,0.00031114934,0.00048617684,0.00077430526,0.0015310519,0.0011280623,0.00070221897,0.00097228406,0.0002513473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005889255,0.000017467044,0.00089264166,0.000075816526,0.000021439391,0.00019962977,0.00015095541,0.7547358,0.0042770375,0.23356654,0.00056751847,0.0054362714],"study_design_scores_gemma":[0.0000024317817,0.0000071515014,0.0001568759,0.000009499369,0.0000034303982,0.00003370447,0.000010354669,0.96445537,0.00091275125,0.034205202,0.00019410702,0.000009152128],"about_ca_topic_score_codex":0.0045565916,"about_ca_topic_score_gemma":0.0025682417,"teacher_disagreement_score":0.0045565916,"about_ca_system_score_codex":0.001605391,"about_ca_system_score_gemma":0.0013497479,"threshold_uncertainty_score":0.011647999},"labels":[],"label_agreement":null},{"id":"W2164202165","doi":"10.1109/bsc.2006.1644556","title":"Hard-Decision Performance of LDPC Codes on Binary Symmetric Channels with Small Crossover Probabilities","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Crossover; Binary symmetric channel; Decoding methods; Algorithm; Binary number; Computer science; Mathematics; Channel (broadcasting); Arithmetic; Telecommunications","score_opus":0.0224396753275394,"score_gpt":0.2306175262063822,"score_spread":0.2081778508788428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164202165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61664253,0.0014893246,0.3603921,0.00054898404,0.000072935654,0.00009182093,0.00048616558,0.00089357345,0.019382728],"genre_scores_gemma":[0.9861794,0.00032783006,0.012026137,0.00004750966,0.000018938812,0.000042156946,0.00013018932,0.000044575983,0.0011832102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978383,0.0007295496,0.00008113372,0.00021238727,0.00074282737,0.00039574128],"domain_scores_gemma":[0.9801012,0.016149953,0.0010272105,0.0013150866,0.0011889726,0.00021751979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030745205,0.0010995703,0.00084804324,0.0010141337,0.00067182764,0.0015583483,0.0006395988,0.0011848464,0.0019273958],"category_scores_gemma":[0.01899504,0.00033779553,0.00025837592,0.0008856753,0.0018760588,0.001806663,0.001235406,0.0009750875,0.0004649874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011190347,0.00009449729,0.002034552,0.00022131015,0.0000510081,0.00029578814,0.00028805932,0.8744908,0.02056028,0.06532132,0.00088048447,0.03464286],"study_design_scores_gemma":[0.000037503334,0.00009372656,0.00047508185,0.00003670731,0.000010069627,0.000063172694,0.000028644692,0.9701001,0.012786588,0.016098779,0.00023631468,0.000033409324],"about_ca_topic_score_codex":0.0036323452,"about_ca_topic_score_gemma":0.0020590394,"teacher_disagreement_score":0.0036323452,"about_ca_system_score_codex":0.0017157985,"about_ca_system_score_gemma":0.0012759635,"threshold_uncertainty_score":0.01625985},"labels":[],"label_agreement":null},{"id":"W2164267613","doi":"10.1109/mwscas.2009.5236155","title":"A flexible hardware encoder for systematic low-density parity-check codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Encoder; Computer science; Stratix; Low-density parity-check code; Verilog; Computer hardware; Throughput; Speedup; WiMAX; Encoding (memory); Embedded system; Parallel computing; Field-programmable gate array; Decoding methods; Algorithm; Telecommunications; Operating system; Wireless","score_opus":0.022681207383623808,"score_gpt":0.2896233517288204,"score_spread":0.2669421443451966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164267613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032370236,0.00042816775,0.9613622,0.00011053712,0.00012782824,0.00010358305,0.00015438526,0.001334551,0.0040085334],"genre_scores_gemma":[0.47415152,0.00043007816,0.5200903,0.00013904336,0.00007553935,0.0001578138,0.00039687628,0.00013370256,0.0044251997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967396,0.000053017997,0.000020628351,0.000035417776,0.00018383097,0.00003307757],"domain_scores_gemma":[0.99947625,0.00018696279,0.00005427474,0.00013458428,0.00013107978,0.000016873448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037497844,0.00030964956,0.00021205412,0.0004436099,0.00037190877,0.00039367107,0.0005585004,0.00026250823,0.0016910118],"category_scores_gemma":[0.0011891259,0.00017824631,0.00020499752,0.00041224874,0.00035752577,0.0005073485,0.00045714117,0.0004939001,0.0005450851],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040341154,0.00008303515,0.0013885734,0.00047651667,0.000045074576,0.0006621513,0.00025815555,0.055565618,0.23522174,0.13035567,0.005415631,0.57012445],"study_design_scores_gemma":[0.00022259101,0.00094237,0.0017034052,0.0001759304,0.0001398416,0.0017980686,0.00006151532,0.54875386,0.34696236,0.038396955,0.060698498,0.00014463982],"about_ca_topic_score_codex":0.0005603304,"about_ca_topic_score_gemma":0.0009842986,"teacher_disagreement_score":0.0016910118,"about_ca_system_score_codex":0.00024095166,"about_ca_system_score_gemma":0.00060048746,"threshold_uncertainty_score":0.005657017},"labels":[],"label_agreement":null},{"id":"W2164397492","doi":"10.1109/icc.2007.156","title":"Lowering Error Floor of LDPC Codes Using a Joint Row-Column Decoding Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; CMC Microsystems","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Algorithm; Joint (building); Factor graph; Computer science; Tanner graph; List decoding; Sequential decoding; Field-programmable gate array; Bit error rate; Error detection and correction; Parity bit; Error floor; Concatenated error correction code; Computer hardware; Block code; Engineering","score_opus":0.049781706275790816,"score_gpt":0.3129137856972331,"score_spread":0.2631320794214423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164397492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06684545,0.0001903085,0.9291737,0.00012645427,0.00002951709,0.000029654104,0.00006345877,0.0014921171,0.00204942],"genre_scores_gemma":[0.513642,0.00015256825,0.4827839,0.000060877006,0.00002286112,0.00006593242,0.0001678145,0.000113822185,0.0029902265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.00012218516,0.00003420598,0.00007300505,0.00030210044,0.000047519345],"domain_scores_gemma":[0.99904543,0.00039110714,0.000086405096,0.00018501631,0.00025599814,0.000035950674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367585,0.00054148235,0.0004514845,0.00049453345,0.000337481,0.0006052479,0.00046198707,0.00049331924,0.00097630994],"category_scores_gemma":[0.0018447328,0.00023187073,0.00023030066,0.0004779422,0.0003997148,0.0006649573,0.00060395745,0.0005479935,0.0004480407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042661745,0.0001482755,0.0021666207,0.00014708564,0.00007684964,0.00018971718,0.00014245592,0.44195905,0.15190299,0.025526658,0.0023495355,0.37496418],"study_design_scores_gemma":[0.000020420546,0.000051341165,0.00030684605,0.0000065297627,0.000014736098,0.000094486444,0.0000055196692,0.9473865,0.049220223,0.001980229,0.00090222375,0.000010979308],"about_ca_topic_score_codex":0.0017145266,"about_ca_topic_score_gemma":0.00258948,"teacher_disagreement_score":0.0017145266,"about_ca_system_score_codex":0.00035640923,"about_ca_system_score_gemma":0.00092028815,"threshold_uncertainty_score":0.0034090877},"labels":[],"label_agreement":null},{"id":"W2164549584","doi":"10.1109/phosst.2011.6000076","title":"Ultra-narrow-spacing Tb/s long haul transmission using soft LDPC decoding with Gaussian processes","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Gaussian; Compensation (psychology); Transmission (telecommunications); Nonlinear system; Algorithm; Spectral efficiency; Electronic engineering; Coding (social sciences); Gaussian process; Mathematics; Telecommunications; Physics; Engineering; Statistics","score_opus":0.04862969363828516,"score_gpt":0.26197184456361733,"score_spread":0.21334215092533215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164549584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96768427,0.00017385237,0.02974534,0.000059338887,0.000008515006,0.000008975038,0.000023712533,0.00016955774,0.0021264467],"genre_scores_gemma":[0.9937355,0.000050415652,0.0057834475,0.0000070764677,0.0000036984857,0.0000035332955,0.000010503361,0.0000056286585,0.00040017735],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998271,0.00004355545,0.000005222501,0.000019517805,0.00007194262,0.000032592452],"domain_scores_gemma":[0.99956435,0.00020000656,0.00008322484,0.0000531519,0.00007382198,0.000025464551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032742912,0.00024109046,0.00024511883,0.00018102844,0.00026774104,0.00039308064,0.00029141005,0.00036916812,0.0005940741],"category_scores_gemma":[0.00054909434,0.00009421325,0.00009056398,0.00028703353,0.0004641414,0.00038850214,0.00023608605,0.00020364102,0.000140844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000904089,0.00022287955,0.005329722,0.00019211369,0.00005998385,0.00054889446,0.0003336543,0.106733754,0.8430112,0.011100819,0.00037308666,0.03118982],"study_design_scores_gemma":[0.000049279184,0.0005620562,0.0026832146,0.000018322842,0.000031169515,0.00020619707,0.000060054517,0.59577465,0.39813343,0.0016948318,0.0007571932,0.000029708537],"about_ca_topic_score_codex":0.00076522666,"about_ca_topic_score_gemma":0.0011186928,"teacher_disagreement_score":0.00076522666,"about_ca_system_score_codex":0.00027475785,"about_ca_system_score_gemma":0.00020779354,"threshold_uncertainty_score":0.001993537},"labels":[],"label_agreement":null},{"id":"W2165217364","doi":"10.1109/dcc.2009.12","title":"Policy Allocation for Transmission of Embedded Bit Streams over Noisy Channels with Feedback","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Transmission (telecommunications); Channel (broadcasting); Rayleigh fading; Forward error correction; Automatic repeat request; Computer network; Bit error rate; Hybrid automatic repeat request; Algorithm; Real-time computing; Fading; Decoding methods; Telecommunications","score_opus":0.013060414831171043,"score_gpt":0.28365586504830953,"score_spread":0.2705954502171385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165217364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045091305,0.00019528643,0.9537675,0.0000944548,0.000028273653,0.00005074945,0.000014005833,0.00030699614,0.0004514656],"genre_scores_gemma":[0.8780936,0.00012897723,0.12099024,0.000044503766,0.000023664192,0.000074354575,0.000021459091,0.000032801127,0.0005904938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991074,0.00034543063,0.000060563325,0.000102230304,0.00027079333,0.0001135883],"domain_scores_gemma":[0.99718106,0.0018362727,0.00036363973,0.00018245082,0.00033521248,0.00010141503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176083,0.0004299556,0.00079020625,0.00040702155,0.00043633042,0.0006300882,0.0007198886,0.0005365691,0.0006025528],"category_scores_gemma":[0.0056157587,0.00026396994,0.00020834306,0.00031641396,0.00072133384,0.000768043,0.0005873909,0.0006136798,0.00014697853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070425874,0.00014099744,0.0012763442,0.00013895943,0.00005150156,0.0002108111,0.00029969472,0.8064214,0.024248352,0.018733975,0.0009309972,0.14684284],"study_design_scores_gemma":[0.000018961138,0.00004853866,0.00009919239,0.000005177728,0.000006351682,0.00004271031,0.000011224014,0.99384815,0.0036755304,0.0020367033,0.00019917842,0.000008311053],"about_ca_topic_score_codex":0.0009706851,"about_ca_topic_score_gemma":0.000770704,"teacher_disagreement_score":0.0015176083,"about_ca_system_score_codex":0.0007693586,"about_ca_system_score_gemma":0.0010408182,"threshold_uncertainty_score":0.008026004},"labels":[],"label_agreement":null},{"id":"W2165839667","doi":"10.1109/tcsii.2005.850742","title":"Soft-bit decoding of regular low-density parity-check codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Belief propagation; Parity bit; Low-density parity-check code; Algorithm; Sequential decoding; List decoding; Berlekamp–Welch algorithm; Computer science; Parity (physics); Bit (key); Point (geometry); Mathematics; Arithmetic; Concatenated error correction code; Error floor; Physics; Block code","score_opus":0.020873732377118297,"score_gpt":0.24056303855863004,"score_spread":0.21968930618151175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165839667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023505023,0.0001969251,0.9722811,0.00016606147,0.00006202318,0.000025182504,0.00007225433,0.00032806254,0.0033634873],"genre_scores_gemma":[0.61084825,0.000507096,0.3824825,0.00015291307,0.00007920009,0.00009375779,0.00024071349,0.000096355754,0.005499298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993579,0.00015682568,0.000030614996,0.00006137202,0.00033336456,0.000060036105],"domain_scores_gemma":[0.99872524,0.0006153978,0.00012584125,0.00021590079,0.00028754075,0.000030113575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069858145,0.00048293947,0.00043640513,0.00057014014,0.00034405192,0.0010386088,0.00080240425,0.0007322127,0.0014204964],"category_scores_gemma":[0.004952044,0.00020494591,0.00027613502,0.0006558173,0.000755199,0.0009369101,0.0006483411,0.00087407866,0.00078355044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003564098,0.0000771859,0.0008125069,0.00024325395,0.00005932118,0.00036060828,0.00020710718,0.4621623,0.046185095,0.25901693,0.0027035126,0.22781567],"study_design_scores_gemma":[0.000010056935,0.000033491386,0.00011108729,0.000013986033,0.00000701513,0.00010524256,0.000008367857,0.9578627,0.011287789,0.029447157,0.0011002983,0.000012790915],"about_ca_topic_score_codex":0.0011449204,"about_ca_topic_score_gemma":0.0012349208,"teacher_disagreement_score":0.0014204964,"about_ca_system_score_codex":0.00059031614,"about_ca_system_score_gemma":0.00078460464,"threshold_uncertainty_score":0.00475204},"labels":[],"label_agreement":null},{"id":"W2166478505","doi":"10.1109/tcomm.2007.910589","title":"Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Bit error rate; Parity bit; Error detection and correction; Binary number; Computer science; Mathematics; Arithmetic","score_opus":0.04991802552880289,"score_gpt":0.3278226457086265,"score_spread":0.27790462017982365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166478505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17082587,0.00014661648,0.82741535,0.000043308388,0.00000889824,0.000047296187,0.00012101647,0.00036851366,0.0010231212],"genre_scores_gemma":[0.80729616,0.00023992886,0.19153121,0.000016338392,0.000011416744,0.00009817902,0.00019425733,0.000051634477,0.0005607631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.00047399994,0.00004499507,0.00012197312,0.00045467124,0.000073459196],"domain_scores_gemma":[0.99226284,0.005467298,0.00073269074,0.0006650095,0.0007861254,0.00008608653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017722035,0.0006895505,0.0006792021,0.0013319117,0.00032207675,0.0006944881,0.00076167815,0.00074943894,0.00045883132],"category_scores_gemma":[0.016185991,0.00033076896,0.0002643704,0.0006139591,0.0009619289,0.0011793262,0.0006285989,0.0006083434,0.00023120886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031134835,0.000042348478,0.004619724,0.000084601335,0.00003990617,0.00010889653,0.000112954374,0.91320896,0.01870821,0.014123998,0.00020803601,0.04843108],"study_design_scores_gemma":[0.000005819491,0.000015412037,0.0006051732,0.0000069066195,0.000003883633,0.000030382549,0.0000053035096,0.98690367,0.010100327,0.0022325292,0.00007553001,0.00001493511],"about_ca_topic_score_codex":0.0027014934,"about_ca_topic_score_gemma":0.001622702,"teacher_disagreement_score":0.0027014934,"about_ca_system_score_codex":0.000828136,"about_ca_system_score_gemma":0.0008386576,"threshold_uncertainty_score":0.009372473},"labels":[],"label_agreement":null},{"id":"W2166485816","doi":"10.1109/isit.2013.6620214","title":"Bit-error resilient index assignment for multiple description scalar quantizers","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hamming distance; Permutation (music); Algorithm; Hamming code; Hamming bound; Redundancy (engineering); Computer science; Discrete mathematics; Mathematics; Combinatorics; Decoding methods; Block code","score_opus":0.038176760983897634,"score_gpt":0.2725904852969572,"score_spread":0.23441372431305954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166485816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100026526,0.00040250577,0.89486915,0.0003249185,0.0000694062,0.00010405252,0.00012041388,0.0011079571,0.0029750725],"genre_scores_gemma":[0.7554205,0.00020594406,0.24010497,0.00018882583,0.00005658544,0.000094775874,0.00021973746,0.00010930631,0.0035993133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997785,0.00044929166,0.0002055444,0.00035915815,0.0010024187,0.00019849527],"domain_scores_gemma":[0.99607146,0.0014477087,0.00080011354,0.0011483526,0.00040864438,0.00012384114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027120213,0.00075796834,0.0007265522,0.0007660058,0.00068088877,0.0011928339,0.0014226963,0.00073910435,0.002425386],"category_scores_gemma":[0.0067529045,0.00033953754,0.000394129,0.0008126914,0.00086592283,0.002351937,0.0016593831,0.0011403614,0.0006146187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016677866,0.0002809039,0.0021886472,0.00042992254,0.00010405694,0.00048000453,0.0003933181,0.28137803,0.1519331,0.1245946,0.0027248207,0.43382484],"study_design_scores_gemma":[0.00008125086,0.0006742077,0.0005681403,0.000045820612,0.000044233162,0.0003434346,0.000055779718,0.8359757,0.12321004,0.03464943,0.004291146,0.000060804072],"about_ca_topic_score_codex":0.00058083056,"about_ca_topic_score_gemma":0.00062592747,"teacher_disagreement_score":0.0027120213,"about_ca_system_score_codex":0.0010652498,"about_ca_system_score_gemma":0.0009881905,"threshold_uncertainty_score":0.014342725},"labels":[],"label_agreement":null},{"id":"W2166527432","doi":"10.1109/tcomm.2012.030712.110086","title":"Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Encoder; Binary number; Channel (broadcasting); Computer science; Decoding methods; Binary code; Turbo code; Block code; Concatenated error correction code; Mathematics; Topology (electrical circuits); Telecommunications; Arithmetic; Combinatorics","score_opus":0.05597118724263235,"score_gpt":0.29642800139864084,"score_spread":0.2404568141560085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166527432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2357046,0.00015695534,0.7609681,0.00018332813,0.000033410837,0.00005567849,0.00010317569,0.00040959264,0.0023852624],"genre_scores_gemma":[0.81914407,0.00015608229,0.17926913,0.00006303054,0.000020192798,0.000081500155,0.00012235533,0.000041351457,0.0011022581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000059436272,0.00000981411,0.000025641819,0.000059502287,0.000029491886],"domain_scores_gemma":[0.99935097,0.00020192562,0.00015390359,0.00013954376,0.00010486828,0.00004876396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025922965,0.00026415422,0.00025328915,0.0003455278,0.00024039429,0.0002445159,0.00037204847,0.00027780203,0.0004805894],"category_scores_gemma":[0.0010646168,0.00017824801,0.00021541372,0.00037108694,0.0004934895,0.0002919089,0.00047882547,0.00034180595,0.00016872997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004328933,0.0000875717,0.0024825144,0.0003048844,0.000053666456,0.00043387723,0.00030997267,0.5681492,0.19680706,0.08925523,0.0014258968,0.14025721],"study_design_scores_gemma":[0.000050198083,0.00032097203,0.0006733158,0.000019525958,0.000016250511,0.00026964833,0.000034752793,0.9361037,0.04367011,0.01535408,0.0034552712,0.000032123124],"about_ca_topic_score_codex":0.00039154594,"about_ca_topic_score_gemma":0.0006290421,"teacher_disagreement_score":0.0004805894,"about_ca_system_score_codex":0.0002991434,"about_ca_system_score_gemma":0.00057418464,"threshold_uncertainty_score":0.0021704435},"labels":[],"label_agreement":null},{"id":"W2166929058","doi":"10.1109/isit.2007.4557093","title":"On the Design of Raptor Codes for Binary-Input Gaussian Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Raptor code; EXIT chart; Computer science; Additive white Gaussian noise; Binary number; Channel (broadcasting); Turbo code; Code (set theory); Forward error correction; Decoding methods; Algorithm; Binary code; Theoretical computer science; Concatenated error correction code; Telecommunications; Block code; Mathematics; Arithmetic; Programming language","score_opus":0.045732648973679665,"score_gpt":0.2946688164348223,"score_spread":0.2489361674611426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166929058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011107063,0.0012104391,0.9839925,0.00016255735,0.000043703847,0.00004832544,0.000045431076,0.0001909133,0.0031991377],"genre_scores_gemma":[0.39454812,0.0038958914,0.5973581,0.00025381916,0.0002652118,0.00022498285,0.00018662837,0.00012536543,0.0031418332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978132,0.0011641572,0.000083150764,0.00015788212,0.00066382997,0.000117664546],"domain_scores_gemma":[0.99455196,0.0039133127,0.00045222853,0.00024673349,0.00076454086,0.00007128045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026308817,0.0010655721,0.0007547426,0.0009869952,0.00045588458,0.0010211719,0.0007091039,0.001187673,0.0009833865],"category_scores_gemma":[0.0090505,0.00043329308,0.00039511482,0.0009889515,0.0011150732,0.0012756973,0.00075184816,0.0010133489,0.00044650858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043257538,0.000057802674,0.00088409707,0.0006300408,0.00009684401,0.00034982426,0.0004095008,0.65125924,0.014649743,0.15803242,0.003244614,0.16995326],"study_design_scores_gemma":[0.000040106042,0.00023648454,0.000163754,0.00010825709,0.000030351708,0.00039277412,0.000040508698,0.92301506,0.015418207,0.055167537,0.005341621,0.000045364475],"about_ca_topic_score_codex":0.00049243995,"about_ca_topic_score_gemma":0.00046383418,"teacher_disagreement_score":0.0026308817,"about_ca_system_score_codex":0.00050626154,"about_ca_system_score_gemma":0.00072244834,"threshold_uncertainty_score":0.013913572},"labels":[],"label_agreement":null},{"id":"W2166944067","doi":"10.1109/itw.2009.5351440","title":"Multiple description coding based on LDGM codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rate distortion; Coding (social sciences); Binary number; Algorithm; Computer science; Shannon–Fano coding; Generator matrix; Theoretical computer science; Mathematics; Discrete mathematics; Variable-length code; Decoding methods; Statistics; Arithmetic","score_opus":0.03332029928815157,"score_gpt":0.26510596510399637,"score_spread":0.2317856658158448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166944067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023214152,0.00058828946,0.97118896,0.00031756528,0.000047758997,0.00007894202,0.00016703329,0.00048751308,0.0039096884],"genre_scores_gemma":[0.6288545,0.00060182967,0.3638039,0.00029560726,0.00007169486,0.0002131097,0.00045488984,0.00007824815,0.0056261844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992872,0.0002159821,0.000030587296,0.0000803925,0.0003171472,0.00006868752],"domain_scores_gemma":[0.9985978,0.0006341915,0.0001284337,0.00035163696,0.0002550079,0.000032898737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071841205,0.0004059124,0.0005480515,0.0007157302,0.000347269,0.0005975495,0.00091586506,0.00055197836,0.0018904876],"category_scores_gemma":[0.0033234954,0.0001795569,0.00024769604,0.00097448565,0.00061572035,0.0012649568,0.001194267,0.0008364888,0.0005211244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000521878,0.00008973078,0.0006696613,0.0003131885,0.00004150037,0.0004342632,0.00021627572,0.29341218,0.031572584,0.29289672,0.004279671,0.37555236],"study_design_scores_gemma":[0.000052668882,0.0000869267,0.00016532974,0.00003466177,0.00001131523,0.00017464615,0.000015503654,0.92685276,0.013792072,0.053608686,0.0051760534,0.00002942032],"about_ca_topic_score_codex":0.002107601,"about_ca_topic_score_gemma":0.0018631864,"teacher_disagreement_score":0.002107601,"about_ca_system_score_codex":0.00083511096,"about_ca_system_score_gemma":0.00078524306,"threshold_uncertainty_score":0.006324291},"labels":[],"label_agreement":null},{"id":"W2167038527","doi":"10.1109/lcomm.2004.827438","title":"Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Binary number; Sequential decoding; Theoretical computer science; Mathematics; Concatenated error correction code; Error floor; Block code; Arithmetic","score_opus":0.034253676307169266,"score_gpt":0.293368421581066,"score_spread":0.2591147452738968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167038527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19456588,0.00032553228,0.7968092,0.00012265317,0.000055714205,0.000062333485,0.00006187059,0.0006631377,0.0073336954],"genre_scores_gemma":[0.70198303,0.00015274278,0.2949028,0.000083654166,0.000020209105,0.00004447944,0.00010520659,0.000067751476,0.0026401684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942327,0.0002217575,0.000031416468,0.000075407464,0.00018612834,0.00006209419],"domain_scores_gemma":[0.9979551,0.0011829542,0.00017953821,0.00035160992,0.00026862012,0.00006222214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698096,0.00037021452,0.0003872204,0.00038941248,0.00025431323,0.000673323,0.00080675865,0.0004716568,0.0009567003],"category_scores_gemma":[0.0031506678,0.00016460854,0.00026131785,0.00057237776,0.0007324025,0.0008062464,0.0006059671,0.00055284135,0.00028477955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075522054,0.00014493779,0.005017909,0.00022807284,0.0001969655,0.0002903358,0.00043681974,0.4820171,0.07032702,0.13785931,0.0016468277,0.3010795],"study_design_scores_gemma":[0.000027841674,0.00008086807,0.00041457813,0.000007944841,0.000014343999,0.00012400982,0.000024389263,0.9476599,0.034975495,0.015791038,0.0008640043,0.00001560871],"about_ca_topic_score_codex":0.0010549286,"about_ca_topic_score_gemma":0.0014276305,"teacher_disagreement_score":0.0010549286,"about_ca_system_score_codex":0.00051377283,"about_ca_system_score_gemma":0.0005105481,"threshold_uncertainty_score":0.003727734},"labels":[],"label_agreement":null},{"id":"W2167220150","doi":"10.1109/newcas.2014.6934013","title":"An encoder/decoder with throughput over Gigabits/sec for rate-compatible LDPC codes with wide code rates","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université Laval","funders":"Chinese Academy of Sciences","keywords":"Low-density parity-check code; Computer science; Encoder; Code rate; Parallel computing; Throughput; Linear code; Decoding methods; Algorithm; Block code; Telecommunications; Wireless","score_opus":0.015873933318353843,"score_gpt":0.28776917521724416,"score_spread":0.2718952418988903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167220150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08799203,0.0009426172,0.8928655,0.00040131627,0.00017852138,0.00023200057,0.00041945148,0.0074031157,0.009565367],"genre_scores_gemma":[0.42360625,0.00046781337,0.56496435,0.00020023667,0.0000847111,0.00016079619,0.0005487853,0.0002490027,0.009718],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959916,0.000046625526,0.00003369089,0.00008418294,0.00019170118,0.000044653272],"domain_scores_gemma":[0.9995035,0.00012483037,0.000068113935,0.00011168388,0.00016781974,0.000024064424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048626098,0.0005939495,0.00043565157,0.0005612727,0.000492253,0.0006347876,0.0005002085,0.0006257115,0.0028752158],"category_scores_gemma":[0.0012186796,0.00031254787,0.00020675399,0.00046167715,0.00030102592,0.0007763366,0.00047553465,0.000853168,0.0018329691],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007529794,0.00021341702,0.0031822433,0.0005123117,0.00009867262,0.0007390418,0.00030666086,0.050339837,0.4862049,0.045495976,0.007746905,0.40440714],"study_design_scores_gemma":[0.00009694664,0.00024271486,0.0012779377,0.00006131942,0.00008708501,0.0013113723,0.00005332841,0.45137104,0.5023223,0.0074266987,0.035686206,0.000063083724],"about_ca_topic_score_codex":0.0011476956,"about_ca_topic_score_gemma":0.0014566407,"teacher_disagreement_score":0.0028752158,"about_ca_system_score_codex":0.0005210526,"about_ca_system_score_gemma":0.0010093873,"threshold_uncertainty_score":0.009618521},"labels":[],"label_agreement":null},{"id":"W2167390843","doi":"10.1109/isit.1998.708677","title":"Acyclic Tanner graphs and two-level decoding of linear block codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; Computer science; Block code; Block (permutation group theory); Directed acyclic graph; List decoding; Linear code; Code (set theory); Combinatorics; Concatenated error correction code; Mathematics; Discrete mathematics; Algorithm","score_opus":0.05528422640267773,"score_gpt":0.2823440253638278,"score_spread":0.22705979896115008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167390843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0697573,0.00036109888,0.9147123,0.0002565633,0.00007927385,0.00006608296,0.00028955,0.0008248252,0.013653017],"genre_scores_gemma":[0.6684053,0.00071021164,0.31313866,0.00030720813,0.000057811892,0.00015168653,0.00048139127,0.00020460182,0.016543202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996463,0.000097069744,0.000025739888,0.00006290845,0.00010407947,0.00006393813],"domain_scores_gemma":[0.9993544,0.00027802974,0.000092312664,0.00014436088,0.000098844925,0.00003199762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021322213,0.00029189527,0.00020631406,0.00079501176,0.00041415187,0.00074287446,0.00046074795,0.00049642334,0.0019590997],"category_scores_gemma":[0.001431021,0.00021577632,0.0003103228,0.0008152914,0.00065849157,0.0006365903,0.00046724762,0.000681051,0.00060602947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012321623,0.00005641934,0.00057146896,0.00016410393,0.000026224068,0.00029726833,0.0003428961,0.079816796,0.03215704,0.7669687,0.0022208046,0.117255054],"study_design_scores_gemma":[0.000024224466,0.000072484334,0.0006598468,0.000050022798,0.000025541716,0.00027407106,0.000058880698,0.2480952,0.036296543,0.7019624,0.012423062,0.000057701105],"about_ca_topic_score_codex":0.00224056,"about_ca_topic_score_gemma":0.004425446,"teacher_disagreement_score":0.00224056,"about_ca_system_score_codex":0.0005226997,"about_ca_system_score_gemma":0.0005316455,"threshold_uncertainty_score":0.006553769},"labels":[],"label_agreement":null},{"id":"W2167983808","doi":"10.1109/atc.2008.4760552","title":"A comparison between BP, log-likelihood and max log-likelihood decoding algorithms of LDPC codes based on EXIT chart and EXIT trajectories methods","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Low-density parity-check code; EXIT chart; Algorithm; Turbo code; Decoding methods; Additive white Gaussian noise; Concatenated error correction code; Serial concatenated convolutional codes; Computer science; Mathematics; Statistics; Block code; White noise","score_opus":0.06998552101348758,"score_gpt":0.36238298813641634,"score_spread":0.29239746712292874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167983808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037381094,0.0011350003,0.9565582,0.00014259497,0.000051092575,0.000033527598,0.00008734464,0.00096897467,0.0036421728],"genre_scores_gemma":[0.48926938,0.0018339233,0.50319016,0.00011527278,0.000051243973,0.00014871442,0.00066277897,0.0005027567,0.0042257397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860674,0.0004540883,0.00007793981,0.00015009085,0.0006068126,0.000104385435],"domain_scores_gemma":[0.9960932,0.0022353935,0.00023395767,0.00031396933,0.0010175401,0.000106038606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015319634,0.0008088209,0.00071536674,0.0012863647,0.0005194207,0.0011307234,0.0009605409,0.0010099496,0.0012443827],"category_scores_gemma":[0.009586914,0.00024734205,0.00049755815,0.0012847803,0.00071699143,0.002174006,0.00070327,0.0012474195,0.00044109963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006105329,0.00006777193,0.0025617385,0.00019894428,0.00007094863,0.00010220246,0.00023831821,0.7127253,0.008985934,0.050564658,0.0015629089,0.22231069],"study_design_scores_gemma":[0.000008639574,0.000044181685,0.00035023794,0.000013048989,0.0000073027504,0.000070829745,0.000019690875,0.98805714,0.006635016,0.004136955,0.00064048136,0.000016522925],"about_ca_topic_score_codex":0.003522215,"about_ca_topic_score_gemma":0.0016806688,"teacher_disagreement_score":0.003522215,"about_ca_system_score_codex":0.0011080883,"about_ca_system_score_gemma":0.0018618664,"threshold_uncertainty_score":0.008101881},"labels":[],"label_agreement":null},{"id":"W2168074781","doi":"10.1109/icupc.1996.562703","title":"The information theoretic reliability function for multipath fading channels with diversity","year":2002,"lang":"en","type":"article","venue":"Proceedings of ICUPC - 5th International Conference on Universal Personal Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Multipath propagation; Rayleigh fading; Computer science; Fading distribution; Diversity scheme; Channel state information; Channel (broadcasting); Additive white Gaussian noise; Electronic engineering; Telecommunications; Wireless; Mathematics; Engineering","score_opus":0.06514360773840192,"score_gpt":0.2792782533334072,"score_spread":0.2141346455950053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168074781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1137299,0.004081779,0.8692206,0.0009508879,0.00008661488,0.000041562318,0.00020359788,0.00021908495,0.011465993],"genre_scores_gemma":[0.9626151,0.0037112713,0.029666778,0.00015559755,0.00023028572,0.00012488302,0.00022989183,0.00009417932,0.0031720507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987808,0.00042039886,0.000051524927,0.00009936161,0.00045009685,0.00019779195],"domain_scores_gemma":[0.992331,0.005084786,0.00070804515,0.00057038566,0.0011754012,0.00013035549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031003333,0.00088711455,0.00082759245,0.0014769153,0.0004417683,0.0013622151,0.0009227682,0.0008045768,0.0011457638],"category_scores_gemma":[0.013777574,0.0004065814,0.00056113984,0.0009877947,0.0021039154,0.0022914927,0.0010396205,0.0011450883,0.00053050445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087680724,0.000017911114,0.00091752043,0.00016227418,0.000037194575,0.00022917142,0.0003157924,0.5611669,0.0027992018,0.418873,0.0016068661,0.013786474],"study_design_scores_gemma":[0.000008878644,0.000044051405,0.00052340137,0.0000493119,0.000015454225,0.00018332884,0.000050157625,0.7951912,0.0010725214,0.20146406,0.0013656013,0.000032072723],"about_ca_topic_score_codex":0.0016739953,"about_ca_topic_score_gemma":0.0005273218,"teacher_disagreement_score":0.0031003333,"about_ca_system_score_codex":0.0016503565,"about_ca_system_score_gemma":0.0010826426,"threshold_uncertainty_score":0.016396344},"labels":[],"label_agreement":null},{"id":"W2168404597","doi":"10.1109/tsp.2005.863032","title":"Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Low-density parity-check code; Computer science; Parity bit; Coding gain; Channel (broadcasting); Forward error correction; Decoding methods; Code rate; Bit error rate; Turbo code; Coding (social sciences); Viterbi decoder; Mathematics; Telecommunications; Statistics","score_opus":0.013394605727694029,"score_gpt":0.22823314156844732,"score_spread":0.2148385358407533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168404597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11946552,0.00093240134,0.8715252,0.00017853682,0.000104216415,0.000264064,0.00021053058,0.0016992124,0.0056203143],"genre_scores_gemma":[0.6480391,0.00047865516,0.34413114,0.00008832286,0.00007043641,0.00018402623,0.00037384257,0.00008484067,0.006549492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00008524043,0.000022012977,0.00004726127,0.00033029562,0.000044774206],"domain_scores_gemma":[0.999323,0.00014364129,0.00007072271,0.00013019476,0.00029684132,0.000035529072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955728,0.0005387684,0.00037732863,0.0009935986,0.00025367754,0.00046711936,0.0005982461,0.0004867922,0.0014733543],"category_scores_gemma":[0.0016080729,0.00020751514,0.00029041714,0.0009209356,0.00041534033,0.0005972699,0.0007338295,0.00057934964,0.00062074966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016262138,0.00028088447,0.0026395714,0.00041156707,0.00015382409,0.00048273845,0.00019471928,0.113291934,0.35920638,0.026801921,0.0041474425,0.49076277],"study_design_scores_gemma":[0.00018508981,0.0004286714,0.0016515655,0.00004976729,0.00009873669,0.0007948377,0.000039784492,0.6638751,0.32074755,0.004504323,0.0075514987,0.00007302221],"about_ca_topic_score_codex":0.0013954146,"about_ca_topic_score_gemma":0.002645514,"teacher_disagreement_score":0.0014733543,"about_ca_system_score_codex":0.00034284865,"about_ca_system_score_gemma":0.00067570346,"threshold_uncertainty_score":0.004928887},"labels":[],"label_agreement":null},{"id":"W2168794720","doi":"10.1109/cwit.2009.5069516","title":"On the correlation between error weights and syndrome weights for belief propagation decoding of LDPC codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Decoding methods; Low-density parity-check code; Code word; Algorithm; List decoding; Berlekamp–Welch algorithm; Belief propagation; Correlation; Weight distribution; Computer science; Error detection and correction; Mathematics; Sequential decoding; Concatenated error correction code; Error floor; Block code","score_opus":0.026741235917051617,"score_gpt":0.27504498960556,"score_spread":0.24830375368850838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168794720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074963,0.00025666013,0.92366916,0.00012794556,0.000018549059,0.000024370956,0.00004167537,0.00019665326,0.00070210313],"genre_scores_gemma":[0.78137136,0.00069073716,0.21580803,0.00007882374,0.00007623032,0.00010743158,0.00026728932,0.0002240412,0.0013761147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975696,0.00085291447,0.000085123924,0.00023521027,0.0011046818,0.00015243412],"domain_scores_gemma":[0.973942,0.021559237,0.0017082251,0.0011399891,0.0014964811,0.00015415206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004171217,0.00095852744,0.0005835735,0.0008177419,0.0004527794,0.0009140714,0.0007501653,0.00065333716,0.00076581386],"category_scores_gemma":[0.039787404,0.00059615774,0.0004182824,0.0012668322,0.00116324,0.0023266764,0.00092663727,0.0014418887,0.00019071877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039732634,0.000066067274,0.004558661,0.00014757826,0.00010214865,0.00017430792,0.00016705052,0.86513567,0.012373676,0.04878604,0.00045863428,0.06763289],"study_design_scores_gemma":[0.0000055297824,0.000031605243,0.00055111165,0.000008615765,0.000014168221,0.00003763628,0.0000052347636,0.99003065,0.0038422884,0.00534248,0.00011965931,0.000011002069],"about_ca_topic_score_codex":0.0021027764,"about_ca_topic_score_gemma":0.0024559235,"teacher_disagreement_score":0.004171217,"about_ca_system_score_codex":0.0012385348,"about_ca_system_score_gemma":0.0015135859,"threshold_uncertainty_score":0.022059798},"labels":[],"label_agreement":null},{"id":"W2168883560","doi":"10.1109/pv.2010.5706813","title":"Forward Error Protection for low-delay packet video","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure code; Forward error correction; Erasure; Network packet; Error detection and correction; Burst error; Online codes; Real-time computing; Packet loss; Video quality; Luby transform code; Algorithm; Computer network; Decoding methods; Block code; Concatenated error correction code; Metric (unit)","score_opus":0.02150429341745777,"score_gpt":0.28081092769419813,"score_spread":0.2593066342767404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168883560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41592127,0.0012601573,0.5778334,0.00032784944,0.0000613091,0.00004061767,0.00007932625,0.00023812485,0.0042378185],"genre_scores_gemma":[0.97672164,0.0006947237,0.021533513,0.000022254259,0.000028949305,0.000017272643,0.000026180867,0.00002148328,0.000933928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999746,0.00006522572,0.000006784773,0.000026995236,0.0001140394,0.000040950286],"domain_scores_gemma":[0.9981425,0.0013313813,0.00017916838,0.0001224915,0.000190663,0.000033856664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000631408,0.0005359864,0.00033545066,0.00045825104,0.00026318437,0.00042905813,0.00044664115,0.00055871555,0.0006263171],"category_scores_gemma":[0.0034719063,0.00015426803,0.00028479585,0.00033531687,0.00062272325,0.00092219777,0.0003632826,0.00054070225,0.00010848607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012442275,0.000049811424,0.001079011,0.0001092443,0.000025292868,0.00015473765,0.00006592394,0.9207702,0.022878155,0.036712587,0.0002937979,0.017736848],"study_design_scores_gemma":[0.000006726193,0.000043929234,0.00010181099,0.0000041104554,0.000004109871,0.000037191454,0.000007152113,0.9913061,0.004781267,0.0035244585,0.00017962286,0.0000034722414],"about_ca_topic_score_codex":0.001539775,"about_ca_topic_score_gemma":0.0009364573,"teacher_disagreement_score":0.001539775,"about_ca_system_score_codex":0.0006184499,"about_ca_system_score_gemma":0.00064988586,"threshold_uncertainty_score":0.004487157},"labels":[],"label_agreement":null},{"id":"W2168970974","doi":"10.1109/isit.2010.5513792","title":"Unequal error protection rateless coding design for multimedia multicasting","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Multicast; Quality of service; Encoder; Computer network; Fountain code; Coding (social sciences); Code (set theory); Online codes; Raptor code; Forward error correction; Decoding methods; Theoretical computer science; Algorithm; Block code; Linear code; Mathematics","score_opus":0.09463830399280533,"score_gpt":0.32125726333478977,"score_spread":0.22661895934198445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168970974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015588708,0.00035590073,0.98254997,0.00009336581,0.000017091947,0.000023212679,0.000013337294,0.000060188664,0.0012981797],"genre_scores_gemma":[0.6197283,0.001063215,0.37682635,0.000108929904,0.000058879396,0.00014229538,0.00005394705,0.000047071408,0.0019709577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993154,0.00029506997,0.000026855347,0.00006561849,0.0002578203,0.00003930542],"domain_scores_gemma":[0.99904615,0.00047714572,0.00017605249,0.00009255132,0.00019083398,0.000017280621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009676149,0.00050665863,0.00038123978,0.00035790278,0.0001582419,0.00043955728,0.00070596044,0.00055251026,0.00054566894],"category_scores_gemma":[0.0029699001,0.00021897115,0.00024076519,0.00040034842,0.00047464765,0.00067135715,0.0003816434,0.0004766999,0.00018267361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009642196,0.000046116722,0.00053679623,0.0001712704,0.000042644322,0.00011373739,0.00010255629,0.805519,0.031900615,0.082967766,0.00077495584,0.07772817],"study_design_scores_gemma":[0.000010957151,0.00007100474,0.000074990305,0.000011751664,0.000011827433,0.000055793895,0.0000062608506,0.9825784,0.008504816,0.007628624,0.0010379085,0.0000075202324],"about_ca_topic_score_codex":0.0004113737,"about_ca_topic_score_gemma":0.00047356647,"teacher_disagreement_score":0.0009676149,"about_ca_system_score_codex":0.00058788835,"about_ca_system_score_gemma":0.00057865184,"threshold_uncertainty_score":0.005117357},"labels":[],"label_agreement":null},{"id":"W2169105083","doi":"10.1109/isit.2008.4595097","title":"On the design of universal LDPC codes","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Channel capacity; Channel code; Decoding methods; Coding (social sciences); Channel (broadcasting); Binary erasure channel; Computer science; Regular polygon; Mathematics; Algorithm; Theoretical computer science; Topology (electrical circuits); Combinatorics; Telecommunications; Statistics","score_opus":0.056479898770168624,"score_gpt":0.26724138436754397,"score_spread":0.21076148559737534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169105083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01582187,0.00092920783,0.97884536,0.00019772536,0.000030737407,0.00004640205,0.000060698865,0.0001865667,0.0038814817],"genre_scores_gemma":[0.55774367,0.002379268,0.4350707,0.00022688704,0.000090251764,0.00030525227,0.00019548816,0.00010427149,0.003884248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987803,0.00057841494,0.00006138641,0.00018516276,0.00028816803,0.00010651404],"domain_scores_gemma":[0.99701,0.0018527773,0.00027082363,0.00036230116,0.00042607312,0.00007796574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015442506,0.0006771587,0.00075194635,0.0009320919,0.0006502043,0.00092571863,0.0007395599,0.00080099516,0.0009394291],"category_scores_gemma":[0.0075832848,0.00052532763,0.0003018084,0.001111747,0.0013758596,0.001184668,0.0013921612,0.00087613903,0.00030653665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001347142,0.000031721425,0.00084812246,0.000316472,0.000040495397,0.00014342113,0.00024426891,0.52142626,0.008429641,0.34332752,0.0022498087,0.12280752],"study_design_scores_gemma":[0.000023858394,0.000047999692,0.000089770896,0.000062108105,0.000013855192,0.000107349006,0.00002717448,0.88536227,0.004516768,0.10552094,0.0042108237,0.000017193704],"about_ca_topic_score_codex":0.0012033415,"about_ca_topic_score_gemma":0.0014111849,"teacher_disagreement_score":0.0015442506,"about_ca_system_score_codex":0.00097410515,"about_ca_system_score_gemma":0.0013313493,"threshold_uncertainty_score":0.008166909},"labels":[],"label_agreement":null},{"id":"W2169212840","doi":"10.1109/isit.2008.4595096","title":"New sequences of capacity achieving LDPC code ensembles over the binary erasure channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Binary erasure channel; Binary number; Combinatorics; Code (set theory); Algorithm; Discrete mathematics; Set (abstract data type); Computer science; Channel (broadcasting); Mathematics; Channel capacity; Arithmetic; Programming language","score_opus":0.054964552912988,"score_gpt":0.2633269201887086,"score_spread":0.20836236727572063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169212840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31267372,0.0016478888,0.6650284,0.0005623393,0.00037006213,0.00014212335,0.0003984587,0.0005424571,0.018634565],"genre_scores_gemma":[0.799387,0.0010092224,0.19116668,0.00033084184,0.0001892541,0.00019744599,0.000625981,0.0001105631,0.0069829603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993869,0.00018670181,0.00004765141,0.000083845174,0.00022727581,0.00006753636],"domain_scores_gemma":[0.9984281,0.00047636713,0.00019505828,0.00024180593,0.00051948364,0.00013918175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056825596,0.0005591356,0.00038692929,0.0005457503,0.0004566157,0.0005178272,0.0005441881,0.00054847426,0.0012470079],"category_scores_gemma":[0.0032465174,0.00019811487,0.00025559327,0.00044690797,0.0005720101,0.0009648289,0.0007626252,0.0009404531,0.00040717697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074323756,0.0001778529,0.0024474328,0.0003777929,0.00007900466,0.0006952625,0.00049468223,0.21910906,0.11774527,0.5305423,0.0035966714,0.123991385],"study_design_scores_gemma":[0.000071107504,0.000544887,0.0014035635,0.00013057896,0.000047338723,0.0011760313,0.00010475666,0.7759418,0.07062488,0.130821,0.019021653,0.000112414506],"about_ca_topic_score_codex":0.00033537985,"about_ca_topic_score_gemma":0.00063884794,"teacher_disagreement_score":0.0012470079,"about_ca_system_score_codex":0.00039159993,"about_ca_system_score_gemma":0.0005891414,"threshold_uncertainty_score":0.0041716695},"labels":[],"label_agreement":null},{"id":"W2170320990","doi":"10.1109/ismvl.2007.53","title":"Survey of Stochastic Computation on Factor Graphs","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Factor graph; Computation; Computer science; Decoding methods; Low-density parity-check code; Theoretical computer science; Graph; Representation (politics); Algorithm; Digital electronics; Factor (programming language); Electronic circuit","score_opus":0.04524962904147683,"score_gpt":0.31382081610231305,"score_spread":0.2685711870608362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170320990","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094834715,0.07332153,0.8760004,0.0012375244,0.0004947172,0.00006951105,0.0003474442,0.0005155054,0.038529936],"genre_scores_gemma":[0.34099898,0.24056618,0.39462766,0.0011819255,0.0028180312,0.00035124941,0.0011582264,0.0006131714,0.017684583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992091,0.00022838356,0.0000667248,0.00014646952,0.00028734969,0.00006210374],"domain_scores_gemma":[0.9987457,0.0007969451,0.000057271416,0.000158177,0.00020508059,0.00003676591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074519444,0.00079811475,0.0013416186,0.0018963912,0.00054809486,0.001542805,0.0009955931,0.0009314349,0.00349336],"category_scores_gemma":[0.0029589885,0.0005413606,0.000978626,0.0038819774,0.0011588753,0.0024791546,0.00097145117,0.0011515552,0.0010439616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004785366,0.00004336825,0.0004975451,0.0013046955,0.000059834198,0.000086926506,0.00012540621,0.060549065,0.001621467,0.733826,0.007593069,0.19424464],"study_design_scores_gemma":[0.000019754125,0.00008481753,0.000431872,0.0003246265,0.000039141265,0.00033502534,0.00004518264,0.24406558,0.0021684647,0.6390372,0.11338408,0.00006422471],"about_ca_topic_score_codex":0.0017768313,"about_ca_topic_score_gemma":0.0011771355,"teacher_disagreement_score":0.00349336,"about_ca_system_score_codex":0.0011003058,"about_ca_system_score_gemma":0.0012337269,"threshold_uncertainty_score":0.011686504},"labels":[],"label_agreement":null},{"id":"W2170449768","doi":"10.1109/newcas.2007.4487987","title":"A new encoder implementation for low-density parity-check convolutional codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Low-density parity-check code; Computer science; Serial concatenated convolutional codes; Convolutional code; Turbo code; Field-programmable gate array; Raptor code; Concatenated error correction code; Block code; Parallel computing; Algorithm; Computer hardware; Decoding methods; Error floor","score_opus":0.023396453824629924,"score_gpt":0.3371124920444329,"score_spread":0.313716038219803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170449768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07953929,0.00054305064,0.90626085,0.00022210662,0.00032569692,0.00022767796,0.00036216615,0.0037733538,0.008745803],"genre_scores_gemma":[0.47227654,0.0004865467,0.51425296,0.0001826182,0.000106108964,0.00016000842,0.00082521234,0.00009451353,0.011615543],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998166,0.000019418589,0.000013176617,0.000025730873,0.000100625315,0.00002442878],"domain_scores_gemma":[0.9996904,0.00006232409,0.00002133666,0.00005965291,0.00014877296,0.000017518267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018324563,0.00032049164,0.00023791821,0.0003061768,0.00023783497,0.00039759043,0.0005761448,0.00028541285,0.0030352483],"category_scores_gemma":[0.000637628,0.00014258895,0.00013970719,0.00023270393,0.00015287574,0.00059704314,0.0002814351,0.0004729766,0.00067107374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050125184,0.0001571892,0.0022016421,0.00043185725,0.000079515325,0.00065274263,0.00012585873,0.023845386,0.39094043,0.037523065,0.008805057,0.534736],"study_design_scores_gemma":[0.00022238061,0.00104738,0.003053674,0.00008888732,0.00013707242,0.0027467003,0.000043837637,0.41867828,0.51068294,0.004457689,0.058755506,0.000085588064],"about_ca_topic_score_codex":0.0009590614,"about_ca_topic_score_gemma":0.0026449615,"teacher_disagreement_score":0.0030352483,"about_ca_system_score_codex":0.00032391172,"about_ca_system_score_gemma":0.0007057068,"threshold_uncertainty_score":0.01015389},"labels":[],"label_agreement":null},{"id":"W2170470734","doi":"10.1109/lcomm.2008.080977","title":"Robust LDPC decoding using irregular decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Robustness (evolution); Computer science; Algorithm; Channel code; Channel (broadcasting); Error detection and correction; Minification; Forward error correction; Parity bit; Convergence (economics); Code (set theory); Telecommunications","score_opus":0.1719205382265378,"score_gpt":0.3057297130795647,"score_spread":0.1338091748530269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170470734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025909029,0.000107127074,0.9720149,0.00008395312,0.000013463947,0.000020408334,0.000049288297,0.00038844082,0.0014134742],"genre_scores_gemma":[0.63327587,0.0002292334,0.3638748,0.00006757109,0.000045041765,0.00007672479,0.0002372964,0.00015753944,0.002035849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982743,0.00061195577,0.00014260532,0.00028225218,0.0005629506,0.00012589485],"domain_scores_gemma":[0.9964212,0.0017455933,0.0005014773,0.00077249546,0.00046104105,0.00009826865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017696426,0.0007637299,0.0008593447,0.0007314818,0.00030193906,0.0009006878,0.0005903181,0.00078275823,0.00068261963],"category_scores_gemma":[0.0075628073,0.00034609964,0.0004221659,0.0007996339,0.00086327054,0.0010453375,0.0015102273,0.00083182345,0.0004296213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027308596,0.000031717234,0.00072270643,0.00007144045,0.00005634174,0.00011252395,0.00008387308,0.87116796,0.030230485,0.03780514,0.00044204353,0.059002742],"study_design_scores_gemma":[0.0000117729705,0.000034685614,0.00009892571,0.000005938351,0.0000066732996,0.000046905872,0.0000046612654,0.9772828,0.013073809,0.008768112,0.0006524939,0.000013126836],"about_ca_topic_score_codex":0.00073189003,"about_ca_topic_score_gemma":0.00059039943,"teacher_disagreement_score":0.0017696426,"about_ca_system_score_codex":0.00055913423,"about_ca_system_score_gemma":0.0007095102,"threshold_uncertainty_score":0.009358883},"labels":[],"label_agreement":null},{"id":"W2170518693","doi":"10.1109/newcas.2004.1359065","title":"On low power shift register hardware realizations for convolutional encoders and decoders","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Shift register; Computer science; Encoder; Convolutional code; Decoding methods; Field-programmable gate array; Computer hardware; Coding (social sciences); Dissipation; Power (physics); Linear feedback shift register; Algorithm; Parallel computing; Electronic engineering; Chip; Engineering; Mathematics; Telecommunications","score_opus":0.03053235459895815,"score_gpt":0.27730021329306664,"score_spread":0.2467678586941085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170518693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06047576,0.0031510366,0.9063384,0.00035180408,0.00019024669,0.00010997862,0.00011396184,0.0012195416,0.028049184],"genre_scores_gemma":[0.5145974,0.0030236144,0.46620598,0.00022152415,0.00017330723,0.00016456186,0.0003287865,0.00016007332,0.015124738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977285,0.000055628327,0.000018917957,0.000026846537,0.000098212164,0.000027480275],"domain_scores_gemma":[0.9998191,0.00008882335,0.000021790547,0.00003300331,0.000030750616,0.0000065486824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019644284,0.00050777255,0.00018376985,0.00044371965,0.00025562473,0.00064364757,0.0005122208,0.00039684784,0.003727537],"category_scores_gemma":[0.0007275701,0.00025646767,0.0002256914,0.0004862433,0.00035220198,0.0007941857,0.000261278,0.00072021043,0.0009939048],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029775774,0.000082395374,0.00049198105,0.00053276814,0.000043020653,0.00045009973,0.00020141687,0.057143107,0.1290612,0.49085525,0.0053948006,0.3154463],"study_design_scores_gemma":[0.00016456087,0.0009285802,0.0011522857,0.00033655428,0.000117043426,0.0015033586,0.000099815115,0.45304126,0.20595561,0.21534586,0.1212768,0.00007828096],"about_ca_topic_score_codex":0.00035961336,"about_ca_topic_score_gemma":0.0012498564,"teacher_disagreement_score":0.003727537,"about_ca_system_score_codex":0.0003417786,"about_ca_system_score_gemma":0.00028395807,"threshold_uncertainty_score":0.012469828},"labels":[],"label_agreement":null},{"id":"W2170582506","doi":"10.1109/cicc.2007.4405773","title":"A 3.3-Gbps bit-serial block-interlaced min-sum LDPC decoder in 0.13-&amp;#x003BC;m CMOS","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; CMOS; Decoding methods; Computer science; Block (permutation group theory); Parallel computing; Code (set theory); Power (physics); Computer hardware; Electronic engineering; Algorithm; Mathematics; Engineering; Physics","score_opus":0.0218937448327013,"score_gpt":0.29278654523926434,"score_spread":0.27089280040656305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170582506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55497396,0.001037021,0.40538523,0.000653563,0.00020930597,0.00037739624,0.0011481737,0.010427303,0.025788084],"genre_scores_gemma":[0.6889512,0.0005319155,0.2908451,0.00024024567,0.000035863726,0.00010076012,0.00050529535,0.00023650577,0.018553132],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989355,0.000010484105,0.0000043696996,0.000022623217,0.00005249597,0.000016517153],"domain_scores_gemma":[0.9998312,0.00003792116,0.00002223257,0.000022042732,0.00006780284,0.000018653694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013513662,0.00031785588,0.00031937772,0.00025698388,0.0003632637,0.00041649508,0.0008077691,0.00059851905,0.0026200798],"category_scores_gemma":[0.00026854532,0.00022648726,0.00019228873,0.0004018381,0.00021391446,0.00037737898,0.00020677253,0.0004354533,0.0016752755],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015887676,0.000049864087,0.0005676192,0.0001365702,0.00002789809,0.0003637322,0.000115928415,0.0024214888,0.96490645,0.00225606,0.0016715708,0.027323881],"study_design_scores_gemma":[0.00006619587,0.00060334854,0.0020609777,0.00002670701,0.000060095015,0.0013860081,0.00003183615,0.04713653,0.9321238,0.0005576731,0.015909577,0.00003721061],"about_ca_topic_score_codex":0.0025036607,"about_ca_topic_score_gemma":0.0063652503,"teacher_disagreement_score":0.0026200798,"about_ca_system_score_codex":0.000492764,"about_ca_system_score_gemma":0.0007654458,"threshold_uncertainty_score":0.008764982},"labels":[],"label_agreement":null},{"id":"W2170949687","doi":"10.1109/allerton.2010.5706885","title":"Relaxed half-stochastic decoding of LDPC codes over GF(q)","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Low-density parity-check code; Code word; Computational complexity theory; Algorithm; Sequential decoding; List decoding; Binary number; Block code; Theoretical computer science; Concatenated error correction code; Mathematics; Arithmetic","score_opus":0.012801818383365414,"score_gpt":0.2710050599793,"score_spread":0.2582032415959346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170949687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20423354,0.00019159997,0.7905024,0.00014926148,0.000016041506,0.00006475624,0.00012469647,0.0006507671,0.004066915],"genre_scores_gemma":[0.5882923,0.00023840847,0.40753067,0.00008568797,0.000018030096,0.00008518021,0.0003506178,0.00010629407,0.0032928071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910504,0.00029859837,0.000048377362,0.00006574974,0.00040895335,0.000073208874],"domain_scores_gemma":[0.99838257,0.0008114346,0.00020267871,0.00030805674,0.00024705182,0.000048132242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801927,0.00032745377,0.0004907196,0.00032813443,0.00022819683,0.00040054598,0.0005834269,0.0003496117,0.00089599245],"category_scores_gemma":[0.0032526227,0.00026927318,0.00035456073,0.00043673557,0.00061256834,0.0006547939,0.0006972359,0.000622704,0.00036985328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006128849,0.000081003134,0.0013633907,0.00027812266,0.00009398124,0.0002090947,0.00033361136,0.6823544,0.108383894,0.054073278,0.0011760093,0.15104032],"study_design_scores_gemma":[0.000026878068,0.00010503547,0.0002971508,0.000011349912,0.000008459544,0.00010087098,0.000016171094,0.9623132,0.03081649,0.0054147122,0.0008766707,0.000012929142],"about_ca_topic_score_codex":0.002047172,"about_ca_topic_score_gemma":0.0033204106,"teacher_disagreement_score":0.002047172,"about_ca_system_score_codex":0.00042864017,"about_ca_system_score_gemma":0.0014665122,"threshold_uncertainty_score":0.0046550035},"labels":[],"label_agreement":null},{"id":"W2171060285","doi":"10.1109/tsp.2011.2163630","title":"Delayed Stochastic Decoding of LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; CMOS; Algorithm; Engineering; Electrical engineering","score_opus":0.048352323945649145,"score_gpt":0.2754522703981205,"score_spread":0.22709994645247134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171060285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024944555,0.0001814041,0.97040975,0.00008998965,0.000078433266,0.0000432133,0.00013445334,0.0006096502,0.0035086127],"genre_scores_gemma":[0.5472621,0.0004980922,0.44126013,0.00015999006,0.00009093036,0.00016734624,0.0006724806,0.00014728984,0.009741714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00015617679,0.000040584942,0.00011397731,0.0003198747,0.000074245705],"domain_scores_gemma":[0.9989617,0.0003333834,0.000094351126,0.00016559075,0.00039947065,0.0000455986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004146666,0.00047943884,0.00045565196,0.00043143507,0.00039620732,0.0007664096,0.00066451955,0.000427202,0.0014158235],"category_scores_gemma":[0.0019574882,0.00021710657,0.00033007626,0.0005083045,0.00044524367,0.00049982127,0.00056234235,0.00058385363,0.00050991663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052779436,0.00007037352,0.0011681657,0.00026418766,0.000055294575,0.00030762376,0.00012195363,0.45378673,0.12755908,0.17478524,0.0043021957,0.23705131],"study_design_scores_gemma":[0.000034465036,0.000071096285,0.00018009631,0.00001284212,0.000012311703,0.00011509676,0.000006059614,0.93166536,0.04496074,0.015249365,0.0076725464,0.00001999805],"about_ca_topic_score_codex":0.0022319676,"about_ca_topic_score_gemma":0.0027577812,"teacher_disagreement_score":0.0022319676,"about_ca_system_score_codex":0.0009702085,"about_ca_system_score_gemma":0.0017293239,"threshold_uncertainty_score":0.0070394278},"labels":[],"label_agreement":null},{"id":"W2171506231","doi":"10.1109/newcas.2008.4606368","title":"High-speed design of adaptive LDPC codes for wireless networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"CMC Microsystems","keywords":"Low-density parity-check code; Computer science; Encoder; Raptor code; Turbo code; Forward error correction; Field-programmable gate array; Throughput; Wireless; Parallel computing; Decoding methods; Computer hardware; Algorithm; Telecommunications; Error floor","score_opus":0.05169035640162291,"score_gpt":0.2605132376263041,"score_spread":0.20882288122468118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171506231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03839901,0.00059056375,0.95657754,0.00010109138,0.000050983654,0.00009279763,0.000033740613,0.0004619858,0.0036922754],"genre_scores_gemma":[0.55228364,0.0006851033,0.44381362,0.0000876321,0.000043386288,0.00021917209,0.00010305938,0.000065708875,0.00269869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977833,0.000053149997,0.000013003297,0.000035217454,0.00009592187,0.000024392253],"domain_scores_gemma":[0.9995701,0.00012942181,0.00007213033,0.000051869665,0.00015862266,0.000017978578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033924,0.0003347742,0.00019528644,0.00044049328,0.000332806,0.000363151,0.00050946913,0.0002971066,0.0009902054],"category_scores_gemma":[0.0011198961,0.00018899323,0.00013065874,0.00034740873,0.0002822646,0.00040299972,0.0002984429,0.0003743275,0.0002860806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029038815,0.00008710846,0.001814054,0.00034515272,0.000059542795,0.00024057785,0.00025141033,0.35688463,0.16967759,0.09181283,0.0025620689,0.37597468],"study_design_scores_gemma":[0.00006058532,0.00015194238,0.00039127137,0.000033820714,0.000030542404,0.00019977517,0.000025790216,0.8870333,0.07949178,0.014150532,0.018402655,0.000028018361],"about_ca_topic_score_codex":0.00071284804,"about_ca_topic_score_gemma":0.0012257845,"teacher_disagreement_score":0.0009902054,"about_ca_system_score_codex":0.0005092206,"about_ca_system_score_gemma":0.0006245009,"threshold_uncertainty_score":0.0036946535},"labels":[],"label_agreement":null},{"id":"W2171959735","doi":"10.1109/iscas.2011.5937931","title":"Hardware implementation challenges of modern error control decoders","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Implementation; Error detection and correction; State (computer science); Power consumption; Computer engineering; Control (management); Decoding methods; Power (physics); Computer architecture; Software engineering; Telecommunications; Artificial intelligence; Algorithm","score_opus":0.07422298446778364,"score_gpt":0.3131736898366762,"score_spread":0.23895070536889257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171959735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051053736,0.021109961,0.9012593,0.005177357,0.0005048699,0.00014671982,0.00014055394,0.0021625196,0.018445006],"genre_scores_gemma":[0.46213388,0.024916315,0.49414352,0.0016587673,0.0009991592,0.00022038142,0.00027454522,0.00025541688,0.015397951],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858874,0.0002703579,0.0001126525,0.00012240621,0.0008043863,0.000101475714],"domain_scores_gemma":[0.9976489,0.001171641,0.00016523253,0.000365706,0.0006063109,0.00004229672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018624912,0.0006062785,0.00069036183,0.00068095524,0.0005205716,0.0019999621,0.0014775166,0.0012905366,0.0033409044],"category_scores_gemma":[0.0046615833,0.00051897997,0.00033905427,0.0006243727,0.00085238914,0.0032431507,0.00093708374,0.0017101674,0.0015828724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002395146,0.00010404869,0.0012299034,0.0016685555,0.000107168446,0.00034347348,0.0004162102,0.049105633,0.08049056,0.3095459,0.008368229,0.5483808],"study_design_scores_gemma":[0.00018097612,0.0011046448,0.0016887332,0.0007895388,0.00020859782,0.003485129,0.00039968616,0.35059947,0.18372093,0.23930892,0.21829228,0.00022117024],"about_ca_topic_score_codex":0.00044926512,"about_ca_topic_score_gemma":0.00066923664,"teacher_disagreement_score":0.0033409044,"about_ca_system_score_codex":0.0007628821,"about_ca_system_score_gemma":0.0011447585,"threshold_uncertainty_score":0.011176407},"labels":[],"label_agreement":null},{"id":"W2172112304","doi":"10.1109/cwit.2011.5872112","title":"A new approach for FEC decoding based on the BP algorithm in LTE and WiMAX systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Serial concatenated convolutional codes; Turbo code; Algorithm; Sequential decoding; Low-density parity-check code; Convolutional code; List decoding; Decoding methods; Concatenated error correction code; WiMAX; Belief propagation; BCJR algorithm; Theoretical computer science; Computer engineering; Wireless; Block code; Telecommunications","score_opus":0.07169890838744371,"score_gpt":0.25997947490911283,"score_spread":0.18828056652166913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172112304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004409672,0.00043637044,0.9927471,0.000108192085,0.00007166155,0.000017375354,0.00001393563,0.00017869854,0.0020169753],"genre_scores_gemma":[0.21527825,0.0012353936,0.77564305,0.00018110813,0.00016880603,0.00008974554,0.000085794534,0.00008219217,0.0072357194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00007839043,0.00001882275,0.00006326723,0.00014877423,0.000025167812],"domain_scores_gemma":[0.9997657,0.00006614496,0.000019863863,0.000041372692,0.00009453554,0.000012379912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036818825,0.00043912316,0.0004049462,0.00047422753,0.00033348284,0.0005701448,0.0004763456,0.00077223754,0.00078370573],"category_scores_gemma":[0.0012639668,0.00021665847,0.0002262259,0.0005035172,0.0006025835,0.0007587547,0.00042046976,0.00085749576,0.00040504365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013752098,0.00007088445,0.00064263446,0.00017164797,0.000053126667,0.00027468588,0.00020925976,0.17455436,0.052837353,0.20180662,0.002910409,0.5663315],"study_design_scores_gemma":[0.000016588181,0.00007653915,0.0004007971,0.000037770063,0.000020920808,0.0003082331,0.000014150583,0.9154006,0.032511003,0.040207285,0.010970609,0.000035459234],"about_ca_topic_score_codex":0.0017612057,"about_ca_topic_score_gemma":0.00161334,"teacher_disagreement_score":0.0017612057,"about_ca_system_score_codex":0.00036811436,"about_ca_system_score_gemma":0.00075251906,"threshold_uncertainty_score":0.003501892},"labels":[],"label_agreement":null},{"id":"W2172206609","doi":"10.1109/icc.2008.841","title":"A Comparison of Rateless Codes at Short Block Lengths","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Raptor code; Computer science; Block code; Algorithm; Fountain code; Concatenated error correction code; Turbo code; Quadrature amplitude modulation; Luby transform code; Decoding methods; Bit error rate","score_opus":0.06357247183179326,"score_gpt":0.33819052833990004,"score_spread":0.2746180565081068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172206609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8084053,0.007271193,0.16722614,0.00047480263,0.00026363088,0.00021442155,0.0008567629,0.0010684323,0.014219317],"genre_scores_gemma":[0.95903015,0.0014600949,0.03764558,0.000078714205,0.000041115993,0.00011761009,0.00048784958,0.00007169964,0.0010670761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778384,0.0005877312,0.00016260272,0.000224978,0.000997471,0.00024345648],"domain_scores_gemma":[0.9867612,0.0081907585,0.0010300414,0.0014151093,0.0023348972,0.0002680126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021396677,0.0006759469,0.0005644559,0.0014495199,0.00045200897,0.0007538753,0.0006944213,0.0007907825,0.001014499],"category_scores_gemma":[0.012672447,0.00016457574,0.0003090497,0.001427625,0.0006638963,0.0014934145,0.0005360224,0.00053557556,0.00023645053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038003728,0.00030289835,0.006925423,0.000776458,0.0002243577,0.0005553388,0.00040953897,0.6636409,0.0719573,0.050478466,0.0025282754,0.19840077],"study_design_scores_gemma":[0.00016146158,0.0026053346,0.0059261587,0.00012401716,0.00013917717,0.0008554532,0.00019607277,0.8771252,0.089778274,0.0154209435,0.00753299,0.00013489615],"about_ca_topic_score_codex":0.0021057674,"about_ca_topic_score_gemma":0.0013400919,"teacher_disagreement_score":0.0021396677,"about_ca_system_score_codex":0.001043989,"about_ca_system_score_gemma":0.0010016474,"threshold_uncertainty_score":0.011315823},"labels":[],"label_agreement":null},{"id":"W2180055743","doi":"10.1109/pacrim.2015.7334871","title":"Design and evaluation of stochastic FIR filters","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stochastic computing; Computer science; Redundancy (engineering); Triple modular redundancy; Finite impulse response; Retiming; Modular design; Binary number; Fault tolerance; Multiplexer; Algorithm; Electronic engineering; Multiplexing; Mathematics; Engineering; Arithmetic; Distributed computing; Telecommunications","score_opus":0.14451452762999947,"score_gpt":0.33747005223824583,"score_spread":0.19295552460824636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180055743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31041166,0.0004720622,0.68084437,0.0001570239,0.00004767795,0.00009712805,0.00015270394,0.0007235057,0.007093901],"genre_scores_gemma":[0.8881548,0.00013429997,0.11017871,0.000029459781,0.000012625719,0.000051735293,0.00007018046,0.000018335206,0.0013497979],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994941,0.00007088101,0.000032339263,0.000078085875,0.00027787188,0.000046823803],"domain_scores_gemma":[0.9994773,0.00014798288,0.00012252707,0.000057558158,0.00017859132,0.000016081744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049497746,0.00031459777,0.0002603708,0.00031072157,0.00019081608,0.00039722482,0.00037956217,0.00036176416,0.0011684824],"category_scores_gemma":[0.0012377471,0.00014580083,0.00023684742,0.00023954567,0.00017496524,0.00035351526,0.00014844432,0.00016227698,0.00018759824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044360303,0.000098422744,0.0028042204,0.000317853,0.00008696228,0.00021360071,0.000080816084,0.4154577,0.42130175,0.019512905,0.0007251251,0.13895702],"study_design_scores_gemma":[0.00004443252,0.0010497172,0.0026119838,0.00002326543,0.00005275335,0.00034723507,0.000023667126,0.77011585,0.21780232,0.002319843,0.005583211,0.000025665859],"about_ca_topic_score_codex":0.0006933302,"about_ca_topic_score_gemma":0.00089708844,"teacher_disagreement_score":0.0011684824,"about_ca_system_score_codex":0.00060314516,"about_ca_system_score_gemma":0.00050559244,"threshold_uncertainty_score":0.0043761134},"labels":[],"label_agreement":null},{"id":"W2182209980","doi":"10.1109/tcomm.2015.2477082","title":"An Incremental Redundancy Hybrid ARQ Scheme via Puncturing and Extending of Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Hybrid automatic repeat request; Algorithm; Computer science; Automatic repeat request; Redundancy (engineering); Polar code; Polar; Coding (social sciences); Error detection and correction; Decoding methods; Forward error correction; Mathematics; Transmission (telecommunications); Telecommunications","score_opus":0.05324886164437508,"score_gpt":0.3161911413478035,"score_spread":0.2629422797034284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182209980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048667658,0.00035441303,0.9467818,0.00013067566,0.000080384954,0.00007629517,0.000077819255,0.000481231,0.003349687],"genre_scores_gemma":[0.58848095,0.00040653962,0.40776393,0.00020901703,0.00007404766,0.00012213216,0.00012827422,0.000053433803,0.0027616997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.0001489503,0.000027909104,0.00007244595,0.00015715283,0.00005555234],"domain_scores_gemma":[0.9987889,0.00035485587,0.0001740059,0.0003781516,0.00024291326,0.00006129679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559273,0.0005679555,0.00042417197,0.00041792728,0.000465106,0.00053883286,0.00079540623,0.00045244175,0.00093125884],"category_scores_gemma":[0.0017190686,0.00020553143,0.0003404266,0.0005376842,0.00070437643,0.00088593154,0.0011940673,0.000813693,0.00049549603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010354348,0.00014492297,0.0023054834,0.00040751268,0.00009401438,0.0015883897,0.0006888302,0.151368,0.29785103,0.19221202,0.0031384353,0.34916583],"study_design_scores_gemma":[0.00015468072,0.0010114654,0.0012343277,0.00008777147,0.00009847448,0.0026702012,0.00011972421,0.7568432,0.17053954,0.047457162,0.019612918,0.0001705551],"about_ca_topic_score_codex":0.00019753465,"about_ca_topic_score_gemma":0.00016729248,"teacher_disagreement_score":0.00093125884,"about_ca_system_score_codex":0.00018816775,"about_ca_system_score_gemma":0.00039441336,"threshold_uncertainty_score":0.0034689307},"labels":[],"label_agreement":null},{"id":"W2185775229","doi":"10.1109/cns.2015.7346824","title":"Reliable and secure communications over Gaussian wiretap channel using HARQ LDPC codes and error contamination","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Eavesdropping; Low-density parity-check code; Decoding methods; Computer network; Forward error correction; Channel (broadcasting); Error detection and correction; Retransmission; Network packet; Real-time computing; Algorithm","score_opus":0.07407778221569615,"score_gpt":0.32322419420839843,"score_spread":0.24914641199270227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185775229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27632642,0.00072549185,0.71725476,0.00026472448,0.000026832024,0.00003457037,0.00007100201,0.00021291009,0.0050833477],"genre_scores_gemma":[0.9726504,0.00043981866,0.025848506,0.00002853201,0.000017179105,0.000023645185,0.000026295727,0.000015039172,0.000950518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867874,0.0004066807,0.000038140755,0.000116195944,0.0006271802,0.00013314691],"domain_scores_gemma":[0.9964186,0.0020732286,0.0006253966,0.00041795598,0.00041000274,0.000054796717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078734476,0.0004661568,0.00047125857,0.0005264673,0.00037476883,0.00083812873,0.00035823477,0.0005746577,0.00038242002],"category_scores_gemma":[0.0039863084,0.00025309,0.00021713038,0.00078713323,0.0016384677,0.0012138971,0.00084512105,0.0005932876,0.00013598731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042903426,0.000053901218,0.002005847,0.00020927713,0.000050844355,0.0011387825,0.00045021833,0.61741155,0.09161608,0.25179985,0.0005325011,0.034302067],"study_design_scores_gemma":[0.000014410845,0.00010925905,0.0004463386,0.00001703035,0.000013801467,0.0002749734,0.000053153122,0.9571425,0.019963128,0.02101886,0.0009208931,0.000025727744],"about_ca_topic_score_codex":0.0010161947,"about_ca_topic_score_gemma":0.00067727204,"teacher_disagreement_score":0.0010161947,"about_ca_system_score_codex":0.00058424997,"about_ca_system_score_gemma":0.0006085049,"threshold_uncertainty_score":0.0042390227},"labels":[],"label_agreement":null},{"id":"W2186877820","doi":"10.1109/sips.2015.7345007","title":"A 638 Mbps low-complexity rate 1/2 polar decoder on FPGAs","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stratix; Computer science; Field-programmable gate array; Polar code; Decoding methods; Latency (audio); Throughput; Virtex; Polar; Low latency (capital markets); Code (set theory); Parallel computing; Algorithm; Computer hardware; Wireless; Computer network; Telecommunications","score_opus":0.08779290814709344,"score_gpt":0.30752215435660996,"score_spread":0.2197292462095165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186877820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36764964,0.0010107639,0.534238,0.0006853927,0.00041150925,0.00037755154,0.0009726096,0.01839564,0.0762589],"genre_scores_gemma":[0.72938794,0.00044319817,0.23814535,0.00029686213,0.00005052943,0.00011262546,0.00081118476,0.00030091451,0.030451449],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997956,0.000024239114,0.000011451407,0.000027068294,0.00010336002,0.000038321963],"domain_scores_gemma":[0.9998246,0.000049464226,0.000017313969,0.000030415576,0.00006367252,0.00001458661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016416714,0.0003972434,0.00023492696,0.0004201232,0.00024874634,0.00050852087,0.00040037875,0.00026177417,0.0084463535],"category_scores_gemma":[0.00050763536,0.00014659936,0.00011513191,0.00037011836,0.0001544389,0.00049527787,0.00023232482,0.00037761126,0.0025489926],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013634494,0.00020212556,0.0024529723,0.00034738675,0.000057747693,0.0011736733,0.0002467392,0.056051433,0.41210648,0.026590193,0.021649864,0.47775784],"study_design_scores_gemma":[0.00028408392,0.0010854905,0.003383833,0.00011135156,0.00006252181,0.0017218168,0.00013032091,0.28654778,0.600683,0.0047955145,0.10109641,0.00009793733],"about_ca_topic_score_codex":0.0022971653,"about_ca_topic_score_gemma":0.0035976465,"teacher_disagreement_score":0.0084463535,"about_ca_system_score_codex":0.0004526346,"about_ca_system_score_gemma":0.00065375294,"threshold_uncertainty_score":0.02825588},"labels":[],"label_agreement":null},{"id":"W2198664117","doi":"","title":"Convergence Speed and Throughput of Analog Iterative Decoders for Low-Density Parity-Check (LDPC) Codes","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Throughput; Algorithm; Computer science; Very-large-scale integration; Constant (computer programming); Convergence (economics); Sequential decoding; Mathematics; Telecommunications; Block code; Wireless; Embedded system","score_opus":0.024417623004413372,"score_gpt":0.275463680157515,"score_spread":0.25104605715310163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198664117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64580154,0.001409286,0.3410526,0.00034653972,0.000050414925,0.00008349444,0.00019632792,0.0006621885,0.010397698],"genre_scores_gemma":[0.9570135,0.00046017076,0.040330987,0.000043409655,0.00002268744,0.00006653548,0.000121872945,0.00009073713,0.0018500139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847704,0.0004181972,0.00006544962,0.00016578735,0.00070126477,0.00017219225],"domain_scores_gemma":[0.98381674,0.012424705,0.00078796275,0.000797159,0.0020178994,0.00015541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027395214,0.00048965146,0.0005252603,0.0011821666,0.0004948322,0.001133818,0.0006471457,0.0006534857,0.001292509],"category_scores_gemma":[0.026596183,0.0002837332,0.00026801456,0.0009034313,0.0010926728,0.0016774508,0.0006705048,0.0006740283,0.00032436286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007016814,0.000086057975,0.007511481,0.00019528465,0.00006842622,0.00021913726,0.0003458441,0.8569306,0.03551248,0.042268813,0.0007012546,0.055458907],"study_design_scores_gemma":[0.000022959244,0.00011163068,0.0015950772,0.00002856602,0.000023404351,0.00013218888,0.00004722203,0.9589226,0.03108164,0.0075849057,0.00042859846,0.00002131824],"about_ca_topic_score_codex":0.0017744445,"about_ca_topic_score_gemma":0.0016376778,"teacher_disagreement_score":0.0027395214,"about_ca_system_score_codex":0.0017161621,"about_ca_system_score_gemma":0.0013004657,"threshold_uncertainty_score":0.014488161},"labels":[],"label_agreement":null},{"id":"W22073543","doi":"","title":"Designing Very Good Low-Density Parity-Check Codes for the Gilbert-Elliott Channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Channel (broadcasting); Parity bit; Computational complexity theory; Computer science; Mathematics; Theoretical computer science; Telecommunications","score_opus":0.032048569948530364,"score_gpt":0.26676741964448886,"score_spread":0.2347188496959585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22073543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07002264,0.00020293165,0.9282813,0.00013220892,0.000014874369,0.00005818227,0.000031834225,0.00021722216,0.0010388531],"genre_scores_gemma":[0.6833717,0.00031531215,0.31516036,0.00009616812,0.000017280052,0.00011446972,0.00006744954,0.000031373886,0.00082590955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944717,0.00024595784,0.00002266919,0.000052079035,0.00016646896,0.00006565256],"domain_scores_gemma":[0.9983779,0.001001474,0.00018593542,0.00022248866,0.00016589632,0.000046296274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162912,0.0005865121,0.00057348324,0.00046388194,0.00040851734,0.0006061612,0.0007310619,0.00096206635,0.00044678955],"category_scores_gemma":[0.0059409654,0.00033425883,0.00023531815,0.0004428918,0.0009429892,0.00089456583,0.0009255837,0.00064818765,0.00023626439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043232352,0.00009471209,0.0027111196,0.00031408024,0.0000969781,0.00040258325,0.000442683,0.66558653,0.06823084,0.16517952,0.0010285634,0.09548002],"study_design_scores_gemma":[0.000044412103,0.00008339358,0.00022205184,0.000019282033,0.000019506442,0.00017894086,0.000025486608,0.9463377,0.029703517,0.02217271,0.0011671253,0.000025825108],"about_ca_topic_score_codex":0.0008040177,"about_ca_topic_score_gemma":0.0012880218,"teacher_disagreement_score":0.0012162912,"about_ca_system_score_codex":0.0005316553,"about_ca_system_score_gemma":0.00064041774,"threshold_uncertainty_score":0.0064324737},"labels":[],"label_agreement":null},{"id":"W2209689234","doi":"10.1109/wscnis.2015.7368289","title":"Reliable and secure regions for the Gaussian wiretap channel using LDPC codes with granular HARQ","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Low-density parity-check code; Decoding methods; Eavesdropping; Computer network; Granularity; Forward error correction; Channel (broadcasting); Algorithm; Real-time computing","score_opus":0.058086898646280215,"score_gpt":0.2797152373708019,"score_spread":0.22162833872452167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209689234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29837835,0.0010487528,0.69206214,0.000286435,0.00002239931,0.000053742115,0.00020964636,0.00031596253,0.00762261],"genre_scores_gemma":[0.97661364,0.00041499283,0.02191926,0.0000235645,0.0000143446605,0.00003086473,0.00004706004,0.00003398684,0.0009023722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925,0.000214944,0.000020835956,0.0000834368,0.00030726093,0.00012357376],"domain_scores_gemma":[0.99598986,0.0025390072,0.0007194607,0.000356002,0.0003013077,0.000094281146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007471706,0.00063749705,0.0004467608,0.00064819126,0.0005037486,0.0010666416,0.0004999016,0.00054700044,0.0009406315],"category_scores_gemma":[0.0043746745,0.00031914152,0.0002942757,0.000624204,0.001990472,0.0014386347,0.0009654693,0.00088100194,0.0002225082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045951412,0.000037044483,0.0007927972,0.00014924386,0.000028564891,0.00061474333,0.00039485356,0.72044754,0.035950687,0.22650838,0.00048150145,0.014135085],"study_design_scores_gemma":[0.000015235364,0.00006592271,0.00033515104,0.000018666009,0.000010255576,0.00018606232,0.00006170946,0.9486655,0.011177673,0.038798276,0.0006288713,0.00003676479],"about_ca_topic_score_codex":0.0017079341,"about_ca_topic_score_gemma":0.0009423349,"teacher_disagreement_score":0.0017079341,"about_ca_system_score_codex":0.0010417739,"about_ca_system_score_gemma":0.00065945246,"threshold_uncertainty_score":0.007558584},"labels":[],"label_agreement":null},{"id":"W2230831824","doi":"10.1109/jsac.2015.2504299","title":"Fast List Decoders for Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"University of California, San Diego; École Polytechnique Fédérale de Lausanne; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Center for Advanced Study, University of Illinois at Urbana-Champaign; David and Lucile Packard Foundation; National Science Foundation","keywords":"Decoding methods; List decoding; Polar code; Sequential decoding; Concatenated error correction code; Low-density parity-check code; Berlekamp–Welch algorithm; Code (set theory)","score_opus":0.0810445107494296,"score_gpt":0.3521803789829451,"score_spread":0.2711358682335155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230831824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014271933,0.0005084407,0.97675574,0.00017615788,0.00012306296,0.00008962135,0.00014774881,0.0027136991,0.005213575],"genre_scores_gemma":[0.16991785,0.0007682266,0.8189715,0.00023818259,0.00013248921,0.0001995651,0.0005673845,0.0003098424,0.0088949725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00010113148,0.00004498982,0.000056679703,0.00024231254,0.000060150465],"domain_scores_gemma":[0.9979323,0.0008217864,0.000223599,0.00026981297,0.0006945596,0.000057960588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059173827,0.0006772217,0.0004248593,0.0013377799,0.00080253195,0.0013822437,0.0007138777,0.0007190072,0.004649034],"category_scores_gemma":[0.0037343754,0.00028545616,0.00033569336,0.001137896,0.00053130905,0.001401032,0.0011252423,0.0009403524,0.0033423144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008366941,0.00012668523,0.0015708383,0.00046331095,0.000051198203,0.00036525328,0.00043675012,0.11041067,0.093272336,0.11921126,0.01193561,0.6613194],"study_design_scores_gemma":[0.00016729975,0.0003441999,0.00046784364,0.00013104074,0.00004912415,0.0005308187,0.00010542601,0.7557401,0.17072286,0.042144977,0.029498294,0.00009793797],"about_ca_topic_score_codex":0.0015385016,"about_ca_topic_score_gemma":0.002646163,"teacher_disagreement_score":0.004649034,"about_ca_system_score_codex":0.00072856754,"about_ca_system_score_gemma":0.0015273591,"threshold_uncertainty_score":0.01555258},"labels":[],"label_agreement":null},{"id":"W2243444140","doi":"","title":"Design of LDPC codes for BP algorithm with channel estimation error","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Channel (broadcasting); Computer science; Error floor; Error detection and correction; Decoding methods; Telecommunications","score_opus":0.029839977122241887,"score_gpt":0.2731340310799741,"score_spread":0.24329405395773218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243444140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011943756,0.0004757347,0.98337597,0.00019296925,0.00006148024,0.00008567706,0.00008973211,0.00040349484,0.003371274],"genre_scores_gemma":[0.37383106,0.0009245701,0.619765,0.00020674516,0.00009808709,0.00039885964,0.00029667685,0.000113565555,0.0043654926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00014001293,0.000030485933,0.00009580971,0.0001886239,0.00005921237],"domain_scores_gemma":[0.9990049,0.0003252963,0.000092599774,0.0000979585,0.0004350999,0.000044031367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046556132,0.00073006004,0.0005835996,0.0007589607,0.00071219343,0.00084994675,0.0006981818,0.0010323909,0.0017770572],"category_scores_gemma":[0.0023304394,0.00040692225,0.0003314568,0.0008267967,0.0004417087,0.0005091065,0.0005758181,0.0007716645,0.0007888761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051358115,0.00012138877,0.0022321916,0.0006378401,0.00014494422,0.00042197865,0.0004158631,0.4075597,0.10123158,0.09999429,0.0045773196,0.38214943],"study_design_scores_gemma":[0.00007941716,0.00018334176,0.00062178593,0.00009126148,0.00006345271,0.00042705407,0.000033859975,0.92257863,0.04558517,0.020723827,0.00955814,0.00005405409],"about_ca_topic_score_codex":0.003113583,"about_ca_topic_score_gemma":0.0035467176,"teacher_disagreement_score":0.003113583,"about_ca_system_score_codex":0.0008767053,"about_ca_system_score_gemma":0.0022235508,"threshold_uncertainty_score":0.0063610077},"labels":[],"label_agreement":null},{"id":"W2255068814","doi":"","title":"Adaptive Maximum-Likelihood Decoding Algorithms for Linear Block Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Algorithm; Sequential decoding; Computer science; Reliability (semiconductor); Set (abstract data type); List decoding; Maximum likelihood; Block (permutation group theory); Mathematics; Block code; Statistics; Concatenated error correction code","score_opus":0.02924909723364527,"score_gpt":0.2835833592004743,"score_spread":0.254334261966829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255068814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013520769,0.00056572835,0.99598795,0.00013067239,0.000029714276,0.00002594542,0.000053246444,0.0002988395,0.0015558163],"genre_scores_gemma":[0.06603624,0.0012794838,0.9265334,0.00015327171,0.00014485368,0.0002452732,0.00028040292,0.00012556526,0.005201576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991555,0.00027798844,0.000047323043,0.00008916757,0.00038545177,0.000044572967],"domain_scores_gemma":[0.99847656,0.00093751936,0.00012226077,0.00016804221,0.00026984507,0.00002579007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082563073,0.00061929156,0.00048330144,0.0007843845,0.00032631503,0.00097036053,0.0010609335,0.0010956925,0.0035215588],"category_scores_gemma":[0.005164962,0.0003388607,0.00027810282,0.0011684507,0.0004844167,0.0012767726,0.0009468063,0.0013583468,0.0027373182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013412532,0.000049127415,0.00043846667,0.00025157264,0.00003363186,0.00009882417,0.00017182544,0.2409964,0.007553758,0.20076856,0.007328856,0.5421749],"study_design_scores_gemma":[0.000036484198,0.00003808118,0.000120856115,0.000041005813,0.000009079418,0.000107571745,0.000010919132,0.8883575,0.0038174777,0.09701355,0.010423944,0.000023506285],"about_ca_topic_score_codex":0.0012571124,"about_ca_topic_score_gemma":0.0017299332,"teacher_disagreement_score":0.0035215588,"about_ca_system_score_codex":0.00058672176,"about_ca_system_score_gemma":0.00082947535,"threshold_uncertainty_score":0.011780798},"labels":[],"label_agreement":null},{"id":"W2272169855","doi":"","title":"Performance of Turbo Codes using MLSE-Based Early Stopping and Path Ambiguity Checking for Inputs Quantized to 4 Bits","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Path (computing); Ambiguity; Computer science; Turbo; Algorithm; Mathematics; Decoding methods; Computer network; Engineering","score_opus":0.037007421167126846,"score_gpt":0.28214479112872465,"score_spread":0.2451373699615978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272169855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8743629,0.0019087904,0.10577957,0.0012398263,0.00029950967,0.00011365286,0.0006089433,0.0024133478,0.0132733965],"genre_scores_gemma":[0.98329735,0.00019916848,0.014034145,0.00012304515,0.000026744583,0.000031590538,0.00019274178,0.00008329924,0.0020119534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961628,0.001354792,0.00021326466,0.00031923718,0.0010010543,0.00094878935],"domain_scores_gemma":[0.98366606,0.010899233,0.0008809652,0.0009721294,0.0031711012,0.000410434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039420445,0.0014153322,0.0013208883,0.0010454765,0.0012148087,0.001710979,0.0010376326,0.0022592808,0.005685446],"category_scores_gemma":[0.017429242,0.00053717755,0.00052961573,0.001064772,0.0016211662,0.0016878889,0.0017606323,0.001097134,0.00060936157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011728427,0.00027340773,0.007121297,0.00046635864,0.0003952043,0.0005877984,0.00043658895,0.8524606,0.036897913,0.015312975,0.0022149268,0.072104536],"study_design_scores_gemma":[0.00019618864,0.0008716087,0.002223947,0.00010888044,0.000117220545,0.00025388552,0.000101506805,0.9410489,0.050068833,0.0040805414,0.00080575305,0.00012276469],"about_ca_topic_score_codex":0.010853982,"about_ca_topic_score_gemma":0.010294931,"teacher_disagreement_score":0.010853982,"about_ca_system_score_codex":0.0020654593,"about_ca_system_score_gemma":0.0041446392,"threshold_uncertainty_score":0.02158159},"labels":[],"label_agreement":null},{"id":"W2288938106","doi":"10.1109/acssc.2015.7421292","title":"Hardware based projection onto the parity polytope and probability simplex","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simplex; Polytope; Parity (physics); Computer science; Simplex algorithm; Artificial intelligence; Mathematics; Combinatorics; Algorithm; Linear programming; Physics","score_opus":0.07263706122117215,"score_gpt":0.31058300180079024,"score_spread":0.2379459405796181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288938106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004458977,0.000047364494,0.99271786,0.000044033306,0.000032818312,0.000029350053,0.000018189345,0.0006437809,0.0020076765],"genre_scores_gemma":[0.085128404,0.00023297043,0.9109857,0.000039906325,0.000043646913,0.00014248709,0.000108349675,0.00031310055,0.0030053065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00022737344,0.000041048494,0.00013204684,0.0004607675,0.000069661684],"domain_scores_gemma":[0.9987853,0.0005063958,0.00007505981,0.00035758794,0.0002249224,0.00005083714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061040587,0.0008056728,0.000549766,0.0005581388,0.00051352923,0.0012758437,0.0009440027,0.0005002798,0.0064049014],"category_scores_gemma":[0.004086573,0.00042082244,0.00067769433,0.0006971449,0.0009605433,0.0012232454,0.0019035193,0.0014558114,0.0019454234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018931307,0.000072050636,0.0009067334,0.00029246593,0.000052641582,0.0001825474,0.00021727984,0.2911579,0.02786422,0.1540951,0.0044256975,0.52054405],"study_design_scores_gemma":[0.000031667045,0.000105916406,0.0003072551,0.000024304107,0.000010822736,0.00025109068,0.00004788878,0.92803955,0.022691121,0.037993573,0.010466118,0.000030708212],"about_ca_topic_score_codex":0.001443725,"about_ca_topic_score_gemma":0.0014459753,"teacher_disagreement_score":0.0064049014,"about_ca_system_score_codex":0.00051513925,"about_ca_system_score_gemma":0.0013094777,"threshold_uncertainty_score":0.021426558},"labels":[],"label_agreement":null},{"id":"W2290407458","doi":"10.1109/acssc.2015.7421362","title":"List sphere decoding of polar codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; List decoding; Computer science; Algorithm; Polar; Channel (broadcasting); Sequential decoding; Error detection and correction; Code (set theory); RADIUS; Concatenated error correction code; Telecommunications; Block code; Computer network; Set (abstract data type); Physics","score_opus":0.0457929425344709,"score_gpt":0.2930524106788921,"score_spread":0.24725946814442118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290407458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02077899,0.0005984885,0.9701671,0.00015445756,0.000110344794,0.000056810928,0.00013993925,0.0009573912,0.0070365006],"genre_scores_gemma":[0.36335534,0.0018458226,0.6208941,0.00026513098,0.00016168627,0.00013314164,0.0009015367,0.00031995968,0.012123378],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.00020444272,0.000063640306,0.00009073639,0.00035551676,0.00011470942],"domain_scores_gemma":[0.9980869,0.0007090402,0.00018319183,0.00027230842,0.0006766112,0.00007184233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055922277,0.0007503125,0.0006292675,0.0011096917,0.00064956234,0.0013723263,0.00062357605,0.0006883164,0.0026752686],"category_scores_gemma":[0.0038323868,0.00024466746,0.00034574416,0.0012683257,0.0008258003,0.001210811,0.0015627719,0.00081658864,0.0025023262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010885168,0.00007774079,0.0017511799,0.00050323334,0.000048947295,0.0005906083,0.00056810596,0.17969503,0.08907026,0.21651003,0.010649864,0.49944654],"study_design_scores_gemma":[0.000060424154,0.00019235234,0.00037467276,0.00007710831,0.000018720279,0.0005154463,0.00011245597,0.8062977,0.12479993,0.052429188,0.015061318,0.000060600512],"about_ca_topic_score_codex":0.0017722963,"about_ca_topic_score_gemma":0.0013256769,"teacher_disagreement_score":0.0026752686,"about_ca_system_score_codex":0.0006475531,"about_ca_system_score_gemma":0.0013365523,"threshold_uncertainty_score":0.008949637},"labels":[],"label_agreement":null},{"id":"W2291994344","doi":"10.1109/tmag.2015.2487683","title":"Acceleration of the Finite-Element Gaussian Belief Propagation Solver Using Minimum Residual Techniques","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Finite element method; Solver; Residual; Computer science; Gaussian; Convergence (economics); Scalability; Belief propagation; Mathematical optimization; Acceleration; Mixed finite element method; Minification; Applied mathematics; Extended finite element method; Algorithm; Mathematics; Physics; Decoding methods; Classical mechanics","score_opus":0.053913902528935694,"score_gpt":0.2858637344355446,"score_spread":0.2319498319066089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291994344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00424126,0.000054965043,0.9936109,0.00006981424,0.00002377506,0.000015830672,0.000016126747,0.0006245662,0.00134279],"genre_scores_gemma":[0.15638863,0.00014265093,0.8399488,0.000094948184,0.00003077106,0.00009428929,0.00013817119,0.0002705511,0.0028911384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995154,0.0001364493,0.00001741458,0.00003841465,0.00025080956,0.00004152295],"domain_scores_gemma":[0.998531,0.00081521145,0.000091545786,0.00014939232,0.00036635465,0.000046522164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010197428,0.0006592419,0.0007323397,0.0004773831,0.00031286807,0.0005861525,0.001512728,0.000963837,0.002963336],"category_scores_gemma":[0.0033491866,0.0002914887,0.00044259508,0.00057189155,0.00051473355,0.0007737797,0.00082335086,0.0016926861,0.00090753805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001502778,0.00010312093,0.00091433,0.0002044655,0.00006708569,0.00017287699,0.00017894057,0.7763968,0.016257932,0.033157565,0.0039821323,0.16841449],"study_design_scores_gemma":[0.0000051874954,0.000007289828,0.000027221206,0.0000027041494,0.0000021209007,0.000011485333,0.0000044623275,0.99691063,0.0016044547,0.0008312299,0.0005905342,0.0000027508179],"about_ca_topic_score_codex":0.004886273,"about_ca_topic_score_gemma":0.0051597334,"teacher_disagreement_score":0.004886273,"about_ca_system_score_codex":0.0003419047,"about_ca_system_score_gemma":0.0012649682,"threshold_uncertainty_score":0.009913325},"labels":[],"label_agreement":null},{"id":"W2293887361","doi":"10.1109/lcomm.2016.2517142","title":"A Relaxed Min-Sum LDPC Decoder With Simplified Check Nodes","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Algorithm; Soft-decision decoder; Offset (computer science); Very-large-scale integration; Computation; Quantization (signal processing); Mathematics","score_opus":0.03398902868233804,"score_gpt":0.2744875879805364,"score_spread":0.24049855929819836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293887361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06235604,0.0003029076,0.9306916,0.00019889089,0.00006591948,0.000083344254,0.0002003157,0.000666989,0.0054339557],"genre_scores_gemma":[0.3128874,0.0002586897,0.6810781,0.0001586701,0.000037463415,0.000078530466,0.00045558548,0.00007403805,0.0049715615],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.000072727715,0.000022851817,0.00005263063,0.00019486793,0.000032942255],"domain_scores_gemma":[0.99961984,0.00009515868,0.000037797403,0.000112704205,0.000111226305,0.000023341732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025845846,0.00036619397,0.00038284005,0.00031815784,0.00027868143,0.00050346635,0.00076819153,0.0004053985,0.001413754],"category_scores_gemma":[0.0009846658,0.00025014978,0.0003426998,0.0004190311,0.00029874494,0.0006044872,0.00065223477,0.0008408529,0.00066809176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005972454,0.00009455356,0.0011123054,0.00031863814,0.00011052019,0.0005507721,0.00026417337,0.29980204,0.35570583,0.0860748,0.0037102117,0.25165895],"study_design_scores_gemma":[0.00006629209,0.0002444092,0.00040857244,0.00003051849,0.000050298928,0.000723304,0.00003353732,0.8783851,0.09932337,0.009185638,0.0115008205,0.00004813529],"about_ca_topic_score_codex":0.0014883328,"about_ca_topic_score_gemma":0.003290281,"teacher_disagreement_score":0.0014883328,"about_ca_system_score_codex":0.0003999088,"about_ca_system_score_gemma":0.0011682115,"threshold_uncertainty_score":0.0047295094},"labels":[],"label_agreement":null},{"id":"W2298088164","doi":"","title":"A New Method for Performance Evaluation of Bit Decoding Algorithms Using Statistics of the Log Likelihood Ratio","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Mathematics; Decoding methods; Monte Carlo method; Statistics; Entropy (arrow of time); Probability density function; Computer science","score_opus":0.05774418665687654,"score_gpt":0.3659152341061315,"score_spread":0.308171047449255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298088164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023528128,0.00031339543,0.99560463,0.000026967273,0.00005586076,0.00005233374,0.000071408234,0.0007576952,0.0007648579],"genre_scores_gemma":[0.098560326,0.0007318718,0.89688617,0.00007975091,0.0002176439,0.00050246855,0.00053567946,0.0006333687,0.0018527294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923248,0.0024128626,0.0003796056,0.00058907305,0.004147088,0.0001466116],"domain_scores_gemma":[0.98605794,0.009004118,0.0010338149,0.001722674,0.002020862,0.00016051215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038708888,0.0021932495,0.0021050991,0.0043997513,0.00051531184,0.0015333177,0.0015651949,0.0016599763,0.002962088],"category_scores_gemma":[0.027784066,0.00056605396,0.00090583786,0.0024217777,0.0009100235,0.0034363156,0.0015485524,0.0017954198,0.0015624646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081926305,0.00033570486,0.00352997,0.00078493875,0.0005509769,0.0002722614,0.0002704672,0.27999595,0.07354703,0.066343606,0.0057264646,0.56782347],"study_design_scores_gemma":[0.000042828073,0.00034665357,0.0010254021,0.00004394774,0.000060645336,0.0006015552,0.000019085886,0.9525379,0.0317224,0.006987915,0.0064917514,0.00011985742],"about_ca_topic_score_codex":0.00070161687,"about_ca_topic_score_gemma":0.00049333286,"teacher_disagreement_score":0.0043997513,"about_ca_system_score_codex":0.0009394407,"about_ca_system_score_gemma":0.00077336683,"threshold_uncertainty_score":0.020471454},"labels":[],"label_agreement":null},{"id":"W2299446443","doi":"10.1109/tit.2016.2523979","title":"Efficient Search of Girth-Optimal QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Girth (graph theory); Mathematics; Tanner graph; Block code; Concatenated error correction code; Combinatorics; Discrete mathematics; Block (permutation group theory); Upper and lower bounds; Linear code; Decoding methods; Algorithm","score_opus":0.011629056580062485,"score_gpt":0.24846695922497924,"score_spread":0.23683790264491675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299446443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7605171,0.0007404795,0.22996129,0.0003480451,0.000022130618,0.00012003457,0.00040889514,0.00038025432,0.007501754],"genre_scores_gemma":[0.84133315,0.00034691105,0.15544051,0.000104668245,0.000010147014,0.00010890887,0.0006641742,0.00006512275,0.0019264732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998448,0.000038293594,0.0000062500535,0.000026510683,0.00005589381,0.000028298064],"domain_scores_gemma":[0.9993487,0.0004195406,0.00007048092,0.00006469592,0.00006904483,0.000027390794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025376873,0.0002816654,0.00040196508,0.00064591144,0.00037117998,0.00033292882,0.00047569265,0.00045924328,0.0011887539],"category_scores_gemma":[0.0021256034,0.00026037602,0.00028619927,0.0004622003,0.00040025896,0.0005008989,0.0004585915,0.0003537794,0.00017714499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025551167,0.00012886491,0.005415519,0.00033336892,0.00006668002,0.0004181977,0.0002725324,0.80359554,0.04493917,0.048397686,0.002083094,0.09409372],"study_design_scores_gemma":[0.00004636164,0.000064961925,0.00073486025,0.000017294975,0.000012346107,0.000085544234,0.00005043554,0.97287375,0.006230727,0.018692248,0.0011822736,0.000009122473],"about_ca_topic_score_codex":0.0021581962,"about_ca_topic_score_gemma":0.0045073936,"teacher_disagreement_score":0.0021581962,"about_ca_system_score_codex":0.00054657075,"about_ca_system_score_gemma":0.0013056651,"threshold_uncertainty_score":0.004291296},"labels":[],"label_agreement":null},{"id":"W2301698642","doi":"10.1007/s11265-016-1173-y","title":"Fast Low-Complexity Decoders for Low-Rate Polar Codes","year":2016,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Computer science; Application-specific integrated circuit; Clock rate; Polar code; Latency (audio); Throughput; Code rate; Polar; Algorithm; CMOS; Field-programmable gate array; Efficient energy use; Word error rate; Bit error rate; Computer hardware; Electronic engineering; Telecommunications; Wireless; Electrical engineering; Physics; Engineering; Chip; Speech recognition","score_opus":0.03401375944202923,"score_gpt":0.285097868185592,"score_spread":0.2510841087435628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301698642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019993579,0.0009202391,0.9718621,0.00039715465,0.00020736709,0.00009990962,0.00027661384,0.001346477,0.004896464],"genre_scores_gemma":[0.266853,0.0015299888,0.71388555,0.00044264246,0.00032356847,0.0002986918,0.00083609327,0.00032377837,0.015506659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990202,0.00025954726,0.000060938724,0.000087367895,0.00045630918,0.000115544266],"domain_scores_gemma":[0.99733174,0.0016158181,0.00018327752,0.00026626978,0.00052695227,0.00007590446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010554565,0.0011017343,0.00087225944,0.0009066685,0.0006010652,0.001870287,0.00075037015,0.0010812326,0.0066965357],"category_scores_gemma":[0.005590712,0.0005078747,0.0003383113,0.0008662513,0.0005562733,0.0016173397,0.0014671779,0.0016633533,0.0039522694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018131781,0.00018158308,0.0014082146,0.0006012474,0.00013976828,0.0004951347,0.00039846665,0.13426588,0.099130884,0.16614865,0.015248884,0.58016807],"study_design_scores_gemma":[0.00022042484,0.00026148828,0.00052019197,0.00013772724,0.00006816439,0.000653453,0.00009247768,0.83885956,0.08571673,0.057045855,0.01632793,0.00009593332],"about_ca_topic_score_codex":0.0013637813,"about_ca_topic_score_gemma":0.003991804,"teacher_disagreement_score":0.0066965357,"about_ca_system_score_codex":0.00064409676,"about_ca_system_score_gemma":0.0017385565,"threshold_uncertainty_score":0.022402108},"labels":[],"label_agreement":null},{"id":"W2313149118","doi":"10.1109/itwksps.2010.5503171","title":"A message-passing algorithm for counting short cycles in a graph","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Message passing; Algorithm; Computer science; Graph; Combinatorics; Computational complexity theory; Mathematics; Theoretical computer science; Parallel computing","score_opus":0.028398898637941608,"score_gpt":0.309361538903159,"score_spread":0.2809626402652174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313149118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043822913,0.00009921026,0.9937571,0.00006479228,0.00003979551,0.00008604515,0.000061764295,0.0009800049,0.000529019],"genre_scores_gemma":[0.06633943,0.00021611618,0.9298599,0.00007908056,0.000074137286,0.00029574224,0.000387504,0.00018063799,0.002567452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980704,0.00044981253,0.00016529634,0.0004423349,0.00068881095,0.00018347484],"domain_scores_gemma":[0.99603623,0.001414849,0.00043417962,0.0010019663,0.0009413383,0.00017146331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015194266,0.0015798227,0.0013415152,0.0034035067,0.0014676165,0.0015886773,0.002754941,0.0015079611,0.0028318216],"category_scores_gemma":[0.0070316335,0.0006456594,0.0010120175,0.0029095197,0.0011716628,0.003231177,0.00172773,0.0017546345,0.0014137035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004813685,0.00020824022,0.001653037,0.0003345208,0.00016176215,0.00021022925,0.0004865699,0.16635314,0.025798956,0.096128926,0.007659083,0.7005241],"study_design_scores_gemma":[0.00012493256,0.00021364728,0.00040178618,0.000053750857,0.000070231144,0.00034875312,0.00007365828,0.8687332,0.029788328,0.08530589,0.014802966,0.00008284576],"about_ca_topic_score_codex":0.00323413,"about_ca_topic_score_gemma":0.0030673235,"teacher_disagreement_score":0.0034035067,"about_ca_system_score_codex":0.0012946208,"about_ca_system_score_gemma":0.0023451832,"threshold_uncertainty_score":0.009473383},"labels":[],"label_agreement":null},{"id":"W2313449680","doi":"10.1049/iet-com.2015.0624","title":"Cooperative jamming polar codes for multiple‐access wiretap channels","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Secrecy; Jamming; Computer network; Block code; Channel (broadcasting); Block (permutation group theory); Coding (social sciences); Upper and lower bounds; Polar code; Polar; Binary symmetric channel; Theoretical computer science; Algorithm; Decoding methods; Computer security; Mathematics; Channel capacity; Statistics","score_opus":0.0778249746291123,"score_gpt":0.35500888505475364,"score_spread":0.27718391042564133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313449680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030187044,0.0004611165,0.96501887,0.00017142313,0.000033196982,0.000035048124,0.000017640892,0.000053917123,0.004021767],"genre_scores_gemma":[0.7705387,0.0018214339,0.2221706,0.00014175792,0.00009065959,0.0001374556,0.00005592357,0.000035849363,0.0050076847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950993,0.00018599347,0.000014978505,0.000041607076,0.00018705898,0.000060440507],"domain_scores_gemma":[0.9982199,0.0012067044,0.0001748862,0.00014531548,0.00021907754,0.000034108845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079859374,0.0007839301,0.0004220711,0.0005574488,0.00029320535,0.0008258456,0.00047909032,0.00074480893,0.0007941959],"category_scores_gemma":[0.0027960248,0.00031360926,0.00035017324,0.00065137155,0.0010452465,0.0007373256,0.00093930465,0.0011268482,0.0002582774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018310235,0.000068027955,0.00047075708,0.00015771364,0.000043501866,0.00019148015,0.00028087277,0.6254182,0.01646662,0.31505725,0.00083655876,0.040825903],"study_design_scores_gemma":[0.000011777184,0.00006907434,0.00006118165,0.000012761016,0.000010976747,0.00006005278,0.000021435977,0.97404873,0.005722413,0.018616403,0.0013539906,0.000011242873],"about_ca_topic_score_codex":0.00072402356,"about_ca_topic_score_gemma":0.0006229084,"teacher_disagreement_score":0.0008258456,"about_ca_system_score_codex":0.0005632999,"about_ca_system_score_gemma":0.00063253794,"threshold_uncertainty_score":0.004223466},"labels":[],"label_agreement":null},{"id":"W2319292801","doi":"10.1109/tvlsi.2016.2535313","title":"Stochastic Circuit Design and Performance Evaluation of Vector Quantization for Different Error Measures","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Binary number; Computer science; Algorithm; Stochastic computing; Scalability; Vector quantization; Data compression; Norm (philosophy); Integrated circuit design; Mathematics; Computation; Arithmetic","score_opus":0.07401531795369443,"score_gpt":0.29079755000126484,"score_spread":0.2167822320475704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319292801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4975295,0.0013834696,0.4865025,0.00068541267,0.00024301228,0.0002914582,0.00043378424,0.0022050957,0.010725741],"genre_scores_gemma":[0.9187408,0.00021217875,0.07909997,0.000088150664,0.000026481186,0.00009553428,0.00017143902,0.000051274594,0.0015140944],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911624,0.00015677701,0.00006884798,0.00012904848,0.00044930243,0.000079829944],"domain_scores_gemma":[0.99869686,0.00040006178,0.00021024983,0.00014808522,0.0005181548,0.000026607575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006271875,0.00036272404,0.00025485596,0.00046850066,0.00023824985,0.0005664782,0.0008966919,0.00039710294,0.0018786544],"category_scores_gemma":[0.0023390495,0.000131441,0.00019463582,0.00057881203,0.0002468532,0.0007500016,0.00021777874,0.00027414478,0.0002335931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080609234,0.0002810456,0.0040757405,0.0007664058,0.00017250389,0.00026431214,0.00022133574,0.24754333,0.4591897,0.03366287,0.004497047,0.2485197],"study_design_scores_gemma":[0.00010657956,0.0019970466,0.0022724366,0.000049303773,0.0000800502,0.00035953248,0.00006424968,0.6335067,0.34916008,0.0028976456,0.009447763,0.000058594476],"about_ca_topic_score_codex":0.001489506,"about_ca_topic_score_gemma":0.001906406,"teacher_disagreement_score":0.0018786544,"about_ca_system_score_codex":0.00100264,"about_ca_system_score_gemma":0.0006763045,"threshold_uncertainty_score":0.0072746873},"labels":[],"label_agreement":null},{"id":"W2333338207","doi":"10.1049/iet-com.2015.0881","title":"Decoding schedule generating method for successive‐cancellation decoder of polar codes","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; University of Toronto; Harbin Institute of Technology; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Schedule; Polar; Algorithm; Sequential decoding; Arithmetic; Mathematics; Block code","score_opus":0.05541009581613126,"score_gpt":0.37748773701690597,"score_spread":0.3220776412007747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333338207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005331452,0.000069852744,0.9919911,0.00004197607,0.000035939214,0.000057466696,0.000046212925,0.00050659967,0.0019193181],"genre_scores_gemma":[0.18504086,0.0003249744,0.80725074,0.00009518451,0.00008357685,0.00022438001,0.00046890706,0.00017880181,0.0063325823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.000090750036,0.00002878747,0.000070946386,0.00024933313,0.000040650226],"domain_scores_gemma":[0.99947923,0.00015115348,0.000043672084,0.00007483953,0.00022977046,0.00002132064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034202906,0.00075412425,0.00033821166,0.0007811856,0.00052448036,0.00038845677,0.0005711948,0.00033320824,0.0036490993],"category_scores_gemma":[0.0014302124,0.00022700743,0.00041413627,0.00057767396,0.00029019738,0.00049746095,0.0005174675,0.00058348145,0.0011668624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040016577,0.00008263982,0.001025859,0.00026649213,0.0000440098,0.00036844084,0.00038002987,0.18583103,0.10245928,0.05317435,0.0065397867,0.649428],"study_design_scores_gemma":[0.00008494148,0.00017315737,0.00036095912,0.000022125516,0.000031492495,0.00042393978,0.00004690704,0.92323935,0.056796294,0.009893464,0.008885277,0.00004202066],"about_ca_topic_score_codex":0.0038011342,"about_ca_topic_score_gemma":0.004134178,"teacher_disagreement_score":0.0038011342,"about_ca_system_score_codex":0.0005037001,"about_ca_system_score_gemma":0.001846974,"threshold_uncertainty_score":0.012207389},"labels":[],"label_agreement":null},{"id":"W2337233433","doi":"10.1109/allerton.2015.7447062","title":"Second-order coding rate for m-class source-channel codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coding (social sciences); Variable-length code; Channel code; Computer science; Shannon–Fano coding; Code rate; Source code; Algorithm; Channel (broadcasting); Decoding methods; Mathematical optimization; Theoretical computer science; Mathematics; Telecommunications; Statistics","score_opus":0.05643314985709912,"score_gpt":0.29209994433528064,"score_spread":0.2356667944781815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337233433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03783931,0.0008274898,0.95037687,0.0003080824,0.000060161245,0.000078545396,0.00015462929,0.00023050599,0.01012441],"genre_scores_gemma":[0.76038545,0.000996817,0.22963414,0.0001561485,0.000071407405,0.0003875643,0.0003530919,0.00019405418,0.007821272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785966,0.0006685363,0.00006525469,0.00013525858,0.0009752689,0.00029595644],"domain_scores_gemma":[0.9923759,0.005298276,0.0005424343,0.0007348933,0.00092918804,0.000119374236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032921624,0.00094415614,0.00076468906,0.001213859,0.0006093128,0.0016447502,0.00086112623,0.0010820471,0.0032301855],"category_scores_gemma":[0.013075991,0.0003219561,0.0006512512,0.0011778348,0.0013436748,0.0014785491,0.0014085612,0.001618703,0.00088622235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022898012,0.00005333498,0.0013005186,0.00022237687,0.000039404276,0.00014243879,0.00021013498,0.66085863,0.011270425,0.2520255,0.0025326617,0.07111551],"study_design_scores_gemma":[0.000013035821,0.00005964294,0.00041860723,0.00003528736,0.000008352224,0.00020028159,0.00003711308,0.9476834,0.008485876,0.04143857,0.0015894101,0.000030379339],"about_ca_topic_score_codex":0.00217261,"about_ca_topic_score_gemma":0.0021834113,"teacher_disagreement_score":0.0032921624,"about_ca_system_score_codex":0.0019479342,"about_ca_system_score_gemma":0.0024158785,"threshold_uncertainty_score":0.017410815},"labels":[],"label_agreement":null},{"id":"W2342309445","doi":"10.22215/etd/2005-06505","title":"Iterative decoding in analog VLSI","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Decoding methods; Computer science; Sequential decoding; Very-large-scale integration; CMOS; Algorithm; Modular design; Electronic engineering; Iterative method; Block code; Engineering; Embedded system","score_opus":0.014943881389640602,"score_gpt":0.30839618869259194,"score_spread":0.29345230730295135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342309445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07358521,0.0023360155,0.87507534,0.0005967924,0.00021788462,0.0000615451,0.00014054883,0.0010352589,0.046951488],"genre_scores_gemma":[0.801247,0.0018973021,0.14290056,0.0002474231,0.0001292054,0.00006451315,0.00015290189,0.00011170093,0.05324935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.000065702,0.000013139648,0.00003594608,0.000110129884,0.000029215427],"domain_scores_gemma":[0.999728,0.00014438512,0.000016504266,0.000029437697,0.000072412884,0.000009234325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018512705,0.00025633932,0.00024285723,0.00033861786,0.00025500642,0.0008531867,0.00031677468,0.0004551896,0.003562746],"category_scores_gemma":[0.0012823232,0.00022333054,0.0001855188,0.00055411615,0.00033754826,0.00050422637,0.00041647424,0.0004106919,0.00083610264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018781854,0.00005321799,0.0011101693,0.00018847472,0.00006114346,0.00036229636,0.0002704357,0.52119637,0.035034478,0.19465508,0.0048529087,0.24202766],"study_design_scores_gemma":[0.000031930314,0.00008771994,0.0003723835,0.00004462914,0.000018342544,0.00024925798,0.000034846624,0.91017944,0.01509077,0.064198114,0.009673204,0.00001935604],"about_ca_topic_score_codex":0.0019782523,"about_ca_topic_score_gemma":0.0034141268,"teacher_disagreement_score":0.003562746,"about_ca_system_score_codex":0.0006931337,"about_ca_system_score_gemma":0.0007454594,"threshold_uncertainty_score":0.011918604},"labels":[],"label_agreement":null},{"id":"W2350415793","doi":"","title":"Performance research on a low rate of LDPC codes in LTE-advanced","year":2010,"lang":"en","type":"article","venue":"Electronic Test","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Low-density parity-check code; Turbo code; Serial concatenated convolutional codes; Concatenated error correction code; Computer science; Algorithm; Linear code; Construct (python library); Block code; Decoding methods; Computer engineering; Computer network","score_opus":0.020462714752594844,"score_gpt":0.3316735202436826,"score_spread":0.3112108054910877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350415793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21253592,0.0020913037,0.7694479,0.00047400437,0.00008758863,0.00007701415,0.00009536643,0.0007343263,0.0144565655],"genre_scores_gemma":[0.9330402,0.0009155184,0.06350637,0.000058057667,0.000035174417,0.000040831612,0.000090775335,0.000044677927,0.0022683158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986872,0.0004472549,0.000046451678,0.00016202051,0.00055238715,0.00010468386],"domain_scores_gemma":[0.99725467,0.0011455839,0.00017899228,0.0003335493,0.0010273845,0.000059743208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188954,0.0004910839,0.00028240297,0.0007693861,0.00052044756,0.00079969596,0.00042763838,0.0005887583,0.0010756719],"category_scores_gemma":[0.0046550306,0.00014742179,0.0002327698,0.00063203805,0.0006717156,0.0011816387,0.00046470383,0.0006503924,0.0003411563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011067919,0.00016423114,0.009899929,0.0005249375,0.00012746576,0.00047775733,0.00075781083,0.44203505,0.15753388,0.11292394,0.0024247332,0.2720234],"study_design_scores_gemma":[0.00003983962,0.00050500495,0.0021577957,0.00004578049,0.000047739977,0.00047370864,0.000078289486,0.90285975,0.080937415,0.0084275035,0.0043718102,0.000055234817],"about_ca_topic_score_codex":0.003320884,"about_ca_topic_score_gemma":0.0019223592,"teacher_disagreement_score":0.003320884,"about_ca_system_score_codex":0.0010280748,"about_ca_system_score_gemma":0.0008773566,"threshold_uncertainty_score":0.0074592233},"labels":[],"label_agreement":null},{"id":"W2360507978","doi":"","title":"Analysis of LDPC Code's Loops","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Low-density parity-check code; Code (set theory); Computer science; Algorithm; Programming language; Decoding methods","score_opus":0.017682843676637798,"score_gpt":0.2981243207320002,"score_spread":0.2804414770553624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2360507978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4828039,0.0013459098,0.4697956,0.00031710128,0.00005636125,0.00008221609,0.00050382246,0.0013049329,0.0437901],"genre_scores_gemma":[0.97523504,0.00032354885,0.015383196,0.00004203162,0.000026726175,0.000027974194,0.00021785192,0.00012380815,0.008619918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973935,0.00003786004,0.000006732731,0.000027265376,0.0001465959,0.000042271753],"domain_scores_gemma":[0.9986987,0.0007078531,0.00010787019,0.00011954258,0.00033946487,0.000026530548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019403972,0.00030639584,0.00026593957,0.0012669675,0.00043359306,0.0005324919,0.0003695521,0.00031128345,0.0033648708],"category_scores_gemma":[0.0022525555,0.000105065265,0.00029202164,0.0007247322,0.00040688174,0.00041755373,0.0002469132,0.0003272946,0.00035971604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038820115,0.00008204448,0.005253373,0.00031744092,0.000057179677,0.00063822704,0.00038029495,0.40915823,0.06157159,0.42959654,0.0033101707,0.08924677],"study_design_scores_gemma":[0.000009844781,0.000052011437,0.0023466141,0.000035186895,0.000026038984,0.00034667432,0.000025572535,0.904036,0.027441347,0.061194997,0.00446661,0.000019002662],"about_ca_topic_score_codex":0.0023216687,"about_ca_topic_score_gemma":0.0015354961,"teacher_disagreement_score":0.0033648708,"about_ca_system_score_codex":0.00085736054,"about_ca_system_score_gemma":0.0005772023,"threshold_uncertainty_score":0.011256576},"labels":[],"label_agreement":null},{"id":"W2371171758","doi":"","title":"Research on encode and decode of LDPC used to CMMB system and its performance analyses","year":2009,"lang":"en","type":"article","venue":"Application of Electronic Technique","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Low-density parity-check code; Coding (social sciences); Decoding methods; Algorithm; Code (set theory); MATLAB; ENCODE; Orthogonal frequency-division multiplexing; Encoding (memory); Computer hardware; Computer engineering; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.059398781221972625,"score_gpt":0.4037883663613553,"score_spread":0.34438958513938267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371171758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15627575,0.0054678307,0.80896205,0.00058827025,0.00010983535,0.00009897713,0.00013540109,0.00076929067,0.027592618],"genre_scores_gemma":[0.8781458,0.0038695182,0.10860055,0.00012172791,0.000086749955,0.00009484411,0.00017681874,0.00007098383,0.00883296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953854,0.00011246517,0.0000146901675,0.000057927897,0.00023087692,0.00004550326],"domain_scores_gemma":[0.9992969,0.00034143953,0.00005373719,0.000057858135,0.00023492558,0.000015177261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030179115,0.00049804023,0.0003496752,0.0008052284,0.00038425872,0.00048826396,0.00029676943,0.0005116608,0.0022924568],"category_scores_gemma":[0.0020902427,0.00016228286,0.00019617927,0.0008708141,0.0003647408,0.0008572437,0.00023429414,0.00041313292,0.0004173872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005942353,0.00011113063,0.00527599,0.00072290434,0.00012173983,0.00068081997,0.0008182979,0.26883227,0.14957665,0.20992525,0.004247325,0.35909337],"study_design_scores_gemma":[0.000029995832,0.00020429032,0.0012575241,0.000061868646,0.00004517467,0.00065246836,0.00007732003,0.9016692,0.07765582,0.010772631,0.007536886,0.00003677322],"about_ca_topic_score_codex":0.0035376977,"about_ca_topic_score_gemma":0.0027395699,"teacher_disagreement_score":0.0035376977,"about_ca_system_score_codex":0.00072266726,"about_ca_system_score_gemma":0.0006765772,"threshold_uncertainty_score":0.0076690316},"labels":[],"label_agreement":null},{"id":"W2394241195","doi":"","title":"A blind channel estimation method based on the code structure of LDPC codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Low-density parity-check code; Computer science; Algorithm; Additive white Gaussian noise; Decoding methods; Channel (broadcasting); Phase-shift keying; Concatenated error correction code; Bit error rate; Telecommunications; Block code","score_opus":0.0298192553826562,"score_gpt":0.32325274190794323,"score_spread":0.293433486525287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394241195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023712607,0.000097775526,0.9969049,0.00003319492,0.000024419625,0.000015649739,0.000014502436,0.00018844067,0.0003499263],"genre_scores_gemma":[0.15276289,0.00039279618,0.8439832,0.000094539464,0.0000734506,0.000108381544,0.00012399536,0.00008933164,0.0023714588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992849,0.00018566541,0.000033672368,0.00015253658,0.00030441326,0.000038813283],"domain_scores_gemma":[0.998976,0.00040208307,0.000107286534,0.00012892949,0.00035804766,0.000027601352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586178,0.00058308366,0.00066745473,0.0009673665,0.0006694915,0.0006883498,0.0005485033,0.00071677624,0.00093674724],"category_scores_gemma":[0.0029784348,0.0003141572,0.0003901889,0.00070115004,0.0007564224,0.0014899657,0.0005714102,0.0010680254,0.00040095893],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038990474,0.000105684856,0.0015982587,0.00039129215,0.00014107456,0.00016770985,0.00033778505,0.21628597,0.08492264,0.11163446,0.0032895391,0.58073574],"study_design_scores_gemma":[0.00003892969,0.00007255697,0.0005161093,0.000022018656,0.00003953445,0.0003548497,0.000020714679,0.9323479,0.04482555,0.017172106,0.0045046667,0.00008509094],"about_ca_topic_score_codex":0.0019697759,"about_ca_topic_score_gemma":0.001602748,"teacher_disagreement_score":0.0019697759,"about_ca_system_score_codex":0.00065011665,"about_ca_system_score_gemma":0.0014268162,"threshold_uncertainty_score":0.0047169924},"labels":[],"label_agreement":null},{"id":"W2398950016","doi":"","title":"High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming distance; Hamming code; Low-density parity-check code; Hamming(7,4); Product (mathematics); Discrete mathematics; Combinatorics; Block code; Geometry; Algorithm; Decoding methods","score_opus":0.02093137100839676,"score_gpt":0.23514890308547776,"score_spread":0.214217532077081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398950016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22868612,0.0020914343,0.71937895,0.00084576325,0.00028483177,0.00010167018,0.0005293989,0.001206622,0.046875235],"genre_scores_gemma":[0.89409083,0.0008277615,0.091642216,0.00016308515,0.0001136332,0.00008739139,0.00034876505,0.00016067331,0.012565648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990503,0.00026787166,0.0000518333,0.00011857928,0.00041520357,0.00009626591],"domain_scores_gemma":[0.9963678,0.0018617793,0.0003340157,0.0006956447,0.00054227,0.0001986001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075089553,0.0005482913,0.0005292267,0.001309264,0.00074303057,0.0013874295,0.0008687869,0.000740968,0.002970787],"category_scores_gemma":[0.006718298,0.00028778132,0.00029797637,0.00115675,0.0016087367,0.0014924991,0.0014903169,0.0012717897,0.00106499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022164083,0.00004378299,0.0010554374,0.00013298888,0.000024996783,0.00029188147,0.00025025872,0.03335166,0.0108206,0.9095083,0.003251069,0.041047383],"study_design_scores_gemma":[0.00006653547,0.00018376393,0.0007712106,0.000105360225,0.000033359855,0.00078760274,0.000065249485,0.2634274,0.020616053,0.6994651,0.014393561,0.000084773645],"about_ca_topic_score_codex":0.0008654869,"about_ca_topic_score_gemma":0.0011044466,"teacher_disagreement_score":0.002970787,"about_ca_system_score_codex":0.00097155996,"about_ca_system_score_gemma":0.0010268296,"threshold_uncertainty_score":0.00993824},"labels":[],"label_agreement":null},{"id":"W2403968605","doi":"","title":"Graph cuts is a max-product algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Mathematics; Fixed point; Graph; Discrete mathematics; Mathematical optimization; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.041114025923831544,"score_gpt":0.2516757869069481,"score_spread":0.21056176098311655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403968605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046865493,0.00013503339,0.98957,0.00049345556,0.000049282466,0.00009275303,0.0002358312,0.0009880025,0.0037490642],"genre_scores_gemma":[0.12918381,0.00019843875,0.8606067,0.00036247887,0.00009027891,0.00038219313,0.0011570383,0.00062498386,0.0073940153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783653,0.00071287225,0.00010759098,0.00069660967,0.00048808122,0.00015847445],"domain_scores_gemma":[0.996231,0.002347529,0.0002251967,0.0006253159,0.00047193194,0.000098953824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025369665,0.0015799882,0.0013773383,0.0012599342,0.0007590323,0.0021157186,0.0025776215,0.0025842292,0.010243849],"category_scores_gemma":[0.0115992315,0.0011591354,0.0011000219,0.0016143789,0.0016982073,0.0031346853,0.0020183779,0.0031307512,0.0027195043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003514468,0.00014417338,0.00062249915,0.00028811654,0.00013020284,0.000107313885,0.00023138609,0.427544,0.0019917113,0.24438167,0.020802626,0.3034048],"study_design_scores_gemma":[0.00005123977,0.000042152427,0.00008977479,0.000025432162,0.000018860777,0.000048903126,0.000027076863,0.78213495,0.0010918055,0.21274331,0.0037143305,0.000012166102],"about_ca_topic_score_codex":0.0034198654,"about_ca_topic_score_gemma":0.0039632656,"teacher_disagreement_score":0.010243849,"about_ca_system_score_codex":0.001741045,"about_ca_system_score_gemma":0.0021813337,"threshold_uncertainty_score":0.034269154},"labels":[],"label_agreement":null},{"id":"W2405226465","doi":"10.1109/icassp.2016.7472937","title":"Hardware implementation of FIR/IIR digital filters using integral stochastic computation","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Infinite impulse response; Stochastic computing; Computer science; Digital filter; Finite impulse response; 2D Filters; Latency (audio); Half-band filter; Algorithm; Filter (signal processing); Binary number; Computation; Mathematics; Arithmetic; Root-raised-cosine filter; Telecommunications","score_opus":0.030326830515041956,"score_gpt":0.32222742031179435,"score_spread":0.2919005897967524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405226465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300568,0.00034489253,0.9275764,0.00015765968,0.0000691386,0.00006260327,0.00006976931,0.0027080567,0.006005709],"genre_scores_gemma":[0.6277534,0.00017692642,0.36938155,0.00009915884,0.000038182498,0.000050097275,0.00012035167,0.000051474286,0.0023289055],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999729,0.00003022885,0.000021911002,0.000041027688,0.00014267371,0.000035216355],"domain_scores_gemma":[0.9997229,0.000068220106,0.00004324708,0.000068585934,0.00008180731,0.000015260963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023735766,0.00035706186,0.0002557376,0.00043952354,0.00035199622,0.0005027432,0.0006748649,0.00032801714,0.0020756302],"category_scores_gemma":[0.0007681813,0.00015407134,0.00028697198,0.0004443325,0.00026778824,0.00042982222,0.00028019949,0.00038719218,0.000504055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045551837,0.0001943364,0.0022777678,0.0002906416,0.00008867717,0.0003367241,0.0002465378,0.12354858,0.257946,0.06290245,0.0042117396,0.54750097],"study_design_scores_gemma":[0.00006334545,0.00043999605,0.001140038,0.00003468489,0.000043163986,0.0004832932,0.00002773064,0.8425397,0.13622974,0.0073636365,0.011603235,0.000031442716],"about_ca_topic_score_codex":0.0015355701,"about_ca_topic_score_gemma":0.0027911323,"teacher_disagreement_score":0.0020756302,"about_ca_system_score_codex":0.0005203315,"about_ca_system_score_gemma":0.0008517243,"threshold_uncertainty_score":0.0069437027},"labels":[],"label_agreement":null},{"id":"W2409452000","doi":"10.1109/tcomm.2017.2737018","title":"Continuous Transmission of Spatially Coupled LDPC Code Chains","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Instituto de Investigación Sanitaria Gregorio Marañón; National Science Foundation; Ministerio de Economía y Competitividad; Universidad Carlos III de Madrid","keywords":"Low-density parity-check code; Decoding methods; Transmission (telecommunications); Computer science; Encoding (memory); Code (set theory); Chain (unit); Concatenated error correction code; Algorithm; Theoretical computer science; Parallel computing; Telecommunications; Block code; Physics","score_opus":0.04624845525456713,"score_gpt":0.3185063007431408,"score_spread":0.2722578454885737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409452000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39332822,0.00037981372,0.5981436,0.0001889695,0.00007091514,0.00008225171,0.00008572979,0.00059758476,0.007122975],"genre_scores_gemma":[0.91025573,0.00012900562,0.08773956,0.000054312906,0.000019487918,0.000049158487,0.000047092653,0.000029514098,0.0016761957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997392,0.00007236821,0.000013670306,0.000045770033,0.000094501316,0.000034400855],"domain_scores_gemma":[0.9990951,0.00025284706,0.00015477989,0.0002467255,0.00018618366,0.00006441703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027904086,0.00030889033,0.00024888938,0.00027884435,0.00033800164,0.00036430953,0.00056362484,0.00034798103,0.0010569904],"category_scores_gemma":[0.00085789216,0.00016477358,0.0001564741,0.00035645594,0.0005560896,0.0004862723,0.0005652805,0.00042892256,0.00029196875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048203598,0.0001481623,0.0020415038,0.00023507506,0.000061038954,0.00066435186,0.00041817452,0.2499043,0.5824357,0.066060424,0.0011632626,0.09638592],"study_design_scores_gemma":[0.00003466279,0.0002301283,0.00032656646,0.000016934444,0.000023642231,0.00019999135,0.000028331528,0.86086214,0.12831654,0.0068016807,0.0031217423,0.00003766908],"about_ca_topic_score_codex":0.0005429529,"about_ca_topic_score_gemma":0.00075726805,"teacher_disagreement_score":0.0010569904,"about_ca_system_score_codex":0.00032203348,"about_ca_system_score_gemma":0.00033777347,"threshold_uncertainty_score":0.003535986},"labels":[],"label_agreement":null},{"id":"W2469220665","doi":"10.1109/tvt.2016.2591584","title":"Design of Generalized Concatenated Codes Based on Polar Codes With Very Short Outer Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Concatenated error correction code; Block code; Serial concatenated convolutional codes; Turbo code; Decoding methods; Algorithm; Linear code; Polar code; Polar; Coding gain; Computer science; Expander code; Mathematics; Theoretical computer science; Physics","score_opus":0.018732981820095723,"score_gpt":0.24432378364182777,"score_spread":0.22559080182173205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469220665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09167306,0.00047876613,0.9001028,0.00017694374,0.00008722646,0.00011789839,0.00013550221,0.00039443042,0.0068332944],"genre_scores_gemma":[0.6104268,0.00052416243,0.38513845,0.00015660892,0.000057424942,0.00020949457,0.00026252872,0.0000930478,0.0031315337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994165,0.00019101544,0.000046050616,0.000087942004,0.0001808779,0.00007768482],"domain_scores_gemma":[0.9987501,0.00031389095,0.00027450002,0.00019142167,0.00037615615,0.00009395926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004611085,0.00080894027,0.0005319983,0.00049930584,0.000401201,0.0006034945,0.00049961335,0.0004679044,0.00090016704],"category_scores_gemma":[0.0018892959,0.00030460776,0.0003749897,0.0006045624,0.0008427728,0.0006021131,0.0010847378,0.00061187777,0.0004534789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007039035,0.00007322932,0.0030768497,0.0004435496,0.0001360635,0.0012418089,0.00059524004,0.3969157,0.22056785,0.17733692,0.002666066,0.1962428],"study_design_scores_gemma":[0.00009760078,0.00080048625,0.0011240796,0.000112191556,0.000090887035,0.0010638734,0.00010495519,0.77043974,0.16415207,0.03917777,0.022717677,0.00011862295],"about_ca_topic_score_codex":0.00072976167,"about_ca_topic_score_gemma":0.0010297657,"teacher_disagreement_score":0.00090016704,"about_ca_system_score_codex":0.00048341296,"about_ca_system_score_gemma":0.000964131,"threshold_uncertainty_score":0.0035073757},"labels":[],"label_agreement":null},{"id":"W2483668669","doi":"10.1109/tcomm.2010.03.080011","title":"Dynamics of analog decoders for different message representation domains","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"","keywords":"Representation (politics); Computer science; Decoding methods; Message passing; Theoretical computer science; Electronic engineering; Domain (mathematical analysis); Algorithm; Parallel computing; Mathematics; Engineering","score_opus":0.03419981396875891,"score_gpt":0.3279826731685508,"score_spread":0.29378285919979186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483668669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22219987,0.00044162062,0.7412748,0.0007454399,0.000100064106,0.00007493362,0.00011572425,0.00019504188,0.034852467],"genre_scores_gemma":[0.93980056,0.00044503855,0.041985527,0.00018429183,0.00003970298,0.0000861911,0.000089902955,0.0000720416,0.017296817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.000054366243,0.000010973545,0.000041553856,0.00009045409,0.000043027583],"domain_scores_gemma":[0.99922,0.00041853116,0.00011985081,0.00007356761,0.00012437174,0.000043675293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977758,0.00035391806,0.00036149062,0.00043426646,0.00041840723,0.0010696949,0.0005285383,0.00084744464,0.0032963005],"category_scores_gemma":[0.0027809965,0.00026870027,0.00036058194,0.00026812215,0.0010869975,0.0016125728,0.00076785195,0.0010894041,0.00042193715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095133284,0.000057893398,0.00070152,0.00007476431,0.0000214704,0.00025946676,0.00038297527,0.27075183,0.024409369,0.6893277,0.0006775855,0.013240244],"study_design_scores_gemma":[0.000019959765,0.000030097244,0.00017268426,0.0000152068915,0.0000095152045,0.000104245424,0.000053842974,0.92865694,0.0060350327,0.06352809,0.00135409,0.000020304466],"about_ca_topic_score_codex":0.0014886212,"about_ca_topic_score_gemma":0.0011534244,"teacher_disagreement_score":0.0032963005,"about_ca_system_score_codex":0.00088438473,"about_ca_system_score_gemma":0.00049823255,"threshold_uncertainty_score":0.011027157},"labels":[],"label_agreement":null},{"id":"W2493986615","doi":"10.1109/lcomm.2016.2597226","title":"Coupling Information Transmission With Approximate Message-Passing","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Message passing; Computer science; Coupling (piping); Transmission (telecommunications); Information transmission; Computer network; Telecommunications; Theoretical computer science; Distributed computing; Materials science","score_opus":0.021551926895202692,"score_gpt":0.2557015308772711,"score_spread":0.2341496039820684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493986615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044145603,0.000039385606,0.9943387,0.000032433727,0.000010503544,0.000026262305,0.0000065714958,0.00018467348,0.00094701094],"genre_scores_gemma":[0.35444695,0.00017224925,0.64140403,0.000109464374,0.000049794868,0.00024834045,0.00007442892,0.00009658853,0.0033981935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998679,0.00041073287,0.00005687891,0.000120762255,0.0006180973,0.000114428025],"domain_scores_gemma":[0.9984945,0.0007453392,0.00016268516,0.00032355226,0.00023515683,0.00003865003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012836558,0.00093148113,0.00083637284,0.00064642815,0.0006216893,0.001128589,0.0012621381,0.0009520217,0.002612174],"category_scores_gemma":[0.0042498787,0.00033449664,0.00049937126,0.0008811577,0.00091487344,0.0013114567,0.00156742,0.0011775711,0.0012446584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040253866,0.0001330658,0.00080549053,0.00021803494,0.00009436877,0.00017331152,0.000394857,0.4827062,0.055342335,0.19885992,0.002080012,0.2587898],"study_design_scores_gemma":[0.0000145366175,0.000077799305,0.00004724215,0.000009292582,0.0000102042,0.000068773836,0.000011229429,0.9721605,0.014893308,0.0112017,0.0014903374,0.000015035639],"about_ca_topic_score_codex":0.0009133362,"about_ca_topic_score_gemma":0.0009311457,"teacher_disagreement_score":0.002612174,"about_ca_system_score_codex":0.00071329996,"about_ca_system_score_gemma":0.00083101646,"threshold_uncertainty_score":0.008738577},"labels":[],"label_agreement":null},{"id":"W2502872774","doi":"10.1017/cbo9781139034357.008","title":"Practical methods for MDC design","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Regina","funders":"","keywords":"Network packet; Computer science; Multiple description coding; Lossy compression; Coding (social sciences); Computer network; Linear network coding; Theoretical computer science; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.14222149009799834,"score_gpt":0.326849810220147,"score_spread":0.18462832012214864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502872774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002576164,0.00073575927,0.9906222,0.00014925728,0.000072780625,0.000039833474,0.0000531727,0.00018713469,0.007882262],"genre_scores_gemma":[0.036262896,0.0027595141,0.94499636,0.0003004991,0.00019523774,0.0005222591,0.00029809517,0.00047268067,0.014192527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.000615949,0.00010023714,0.000231173,0.00088175933,0.00009463988],"domain_scores_gemma":[0.996983,0.0018426189,0.00012417002,0.0004911774,0.0005126356,0.000046411384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021684244,0.0014952183,0.0008658304,0.0013725288,0.0007367953,0.0018327694,0.0016444345,0.0014810791,0.018381393],"category_scores_gemma":[0.008909451,0.0007652671,0.0009403116,0.0015738388,0.0017359954,0.0017818996,0.002246502,0.0030847918,0.0064457078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042253294,0.000037904807,0.0001571247,0.00041229944,0.00003326287,0.000062359315,0.00011088204,0.09236288,0.0027441648,0.6425568,0.012891046,0.24858901],"study_design_scores_gemma":[0.000046535337,0.000060573817,0.000078133984,0.00020351868,0.000021343949,0.00023105937,0.000044947465,0.41979542,0.004249468,0.49184787,0.08338258,0.000038579],"about_ca_topic_score_codex":0.0010314889,"about_ca_topic_score_gemma":0.0014761855,"teacher_disagreement_score":0.018381393,"about_ca_system_score_codex":0.0014615649,"about_ca_system_score_gemma":0.0016998055,"threshold_uncertainty_score":0.061491847},"labels":[],"label_agreement":null},{"id":"W2505549722","doi":"10.1109/icc.2016.7511551","title":"An efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Algorithm; Computer science; Search algorithm; Variable (mathematics); Simple (philosophy); Graph; Code (set theory); Decoding methods; Theoretical computer science; Mathematics; Error floor; Set (abstract data type)","score_opus":0.022556393708476122,"score_gpt":0.3030182334455154,"score_spread":0.28046183973703925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505549722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034802273,0.00022048815,0.96086895,0.000080242404,0.000018636654,0.00012721845,0.0000977403,0.0007681388,0.0030163482],"genre_scores_gemma":[0.2575344,0.00023176777,0.7375445,0.00009383806,0.000014788212,0.00029854654,0.00059542304,0.00012973038,0.003557051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997352,0.000054695654,0.000021135816,0.000050463404,0.00009896466,0.000039672464],"domain_scores_gemma":[0.9995054,0.00028030694,0.000040088653,0.00006122428,0.00009323398,0.000019871459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029364985,0.00046324648,0.00053362135,0.0009491824,0.00050190766,0.00043312748,0.0007906205,0.0005549973,0.0031193278],"category_scores_gemma":[0.0016377168,0.0002854077,0.00042626093,0.0007106094,0.00037091042,0.00095133757,0.0008654255,0.00050548447,0.0006141482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033368522,0.00015856208,0.002256793,0.0004200469,0.000107335334,0.00030912904,0.0003424797,0.3637797,0.031638227,0.048377156,0.0044763833,0.5478004],"study_design_scores_gemma":[0.00004497364,0.0000653992,0.00031355562,0.00001808238,0.000017959243,0.00015633549,0.000036510657,0.9768208,0.0075337435,0.012343755,0.0026322505,0.000016651884],"about_ca_topic_score_codex":0.0019913844,"about_ca_topic_score_gemma":0.0035974786,"teacher_disagreement_score":0.0031193278,"about_ca_system_score_codex":0.00047556974,"about_ca_system_score_gemma":0.0012299301,"threshold_uncertainty_score":0.010435164},"labels":[],"label_agreement":null},{"id":"W2507003164","doi":"10.1109/icc.2016.7511290","title":"Polar codes for noncoherent MIMO signalling","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; MIMO; Computer science; Wireless; Ergodic theory; Block code; Algorithm; Coding (social sciences); Turbo code; Polar; Fading; Grassmannian; Theoretical computer science; Electronic engineering; Telecommunications; Mathematics; Engineering; Channel (broadcasting)","score_opus":0.027240144108989877,"score_gpt":0.28152674275692746,"score_spread":0.25428659864793757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507003164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046614613,0.0010068069,0.9880618,0.00015688794,0.00009812282,0.00005066769,0.000042583386,0.00013800597,0.005783577],"genre_scores_gemma":[0.19019651,0.0033204579,0.79718107,0.0004643412,0.0002270879,0.00032877506,0.0001859567,0.00012039678,0.00797546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911195,0.0003102372,0.0000457637,0.00009237331,0.00037409156,0.000065632354],"domain_scores_gemma":[0.99866533,0.00058750476,0.00017581896,0.00027911435,0.0002444389,0.00004784141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006959736,0.000679873,0.00038354108,0.00074002205,0.0005590666,0.0010032663,0.0005323673,0.0007423727,0.0030186826],"category_scores_gemma":[0.002970908,0.0002667954,0.0002810527,0.00097102916,0.0010544474,0.00076127716,0.00097096537,0.0013756342,0.0014142765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014982207,0.000035237175,0.00026686306,0.00023727742,0.000015868241,0.00018392366,0.00023401888,0.049707446,0.035206076,0.734902,0.0026531157,0.17640842],"study_design_scores_gemma":[0.000073840434,0.00027027074,0.00042056543,0.00026321135,0.000035875415,0.0011719231,0.000108388835,0.40212646,0.078986704,0.43496454,0.08147247,0.000105742285],"about_ca_topic_score_codex":0.00031363618,"about_ca_topic_score_gemma":0.0005227054,"teacher_disagreement_score":0.0030186826,"about_ca_system_score_codex":0.0005469423,"about_ca_system_score_gemma":0.00084815023,"threshold_uncertainty_score":0.010098457},"labels":[],"label_agreement":null},{"id":"W2510608886","doi":"10.1109/iscas.2016.7538902","title":"Matrix reordering for efficient list sphere decoding of polar codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar code; Decoding methods; Computer science; List decoding; Algorithm; Generator matrix; Polar; Matrix (chemical analysis); Error detection and correction; Frame (networking); Sequential decoding; Code (set theory); Computational complexity theory; Parity-check matrix; Concatenated error correction code; Low-density parity-check code; Block code; Telecommunications","score_opus":0.017846644092506463,"score_gpt":0.29288846329802537,"score_spread":0.2750418192055189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510608886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037900776,0.00034882326,0.9543815,0.000212361,0.000108137836,0.00009260508,0.00014504083,0.0014518067,0.0053589502],"genre_scores_gemma":[0.34494212,0.0005349962,0.64689904,0.00021343195,0.000085691354,0.00010484636,0.0004959721,0.00017513189,0.006548737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999532,0.00011863543,0.00003263159,0.000039257666,0.00023102561,0.00004645294],"domain_scores_gemma":[0.9990878,0.0002960766,0.00009707658,0.00015820372,0.00032197285,0.000038946666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026825638,0.0005668714,0.00030230285,0.00062732527,0.00039902018,0.0006765656,0.0003961186,0.00034870845,0.0030308994],"category_scores_gemma":[0.0015783596,0.00017232195,0.0001970822,0.00081533805,0.0003741675,0.000574075,0.00059003406,0.00050838274,0.0018292981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007686554,0.0001076026,0.000813505,0.0002899441,0.000028350036,0.0005393523,0.00036741683,0.088030934,0.36402848,0.050152395,0.006440075,0.4884332],"study_design_scores_gemma":[0.0000612313,0.00031615768,0.0003962156,0.00003765055,0.000014334132,0.00074357097,0.00008854604,0.61360854,0.3548915,0.011508149,0.018283455,0.000050632378],"about_ca_topic_score_codex":0.0015275677,"about_ca_topic_score_gemma":0.0028680381,"teacher_disagreement_score":0.0030308994,"about_ca_system_score_codex":0.00040198752,"about_ca_system_score_gemma":0.0011619587,"threshold_uncertainty_score":0.010139346},"labels":[],"label_agreement":null},{"id":"W2511135871","doi":"10.1109/isit.2016.7541411","title":"Energy complexity of polar codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Polar; Coding (social sciences); Binary number; Upper and lower bounds; List decoding; Algorithm; Very-large-scale integration; Encoding (memory); Computer science; Probability of error; Block (permutation group theory); Block code; Discrete mathematics; Theoretical computer science; Mathematics; Arithmetic; Combinatorics; Concatenated error correction code; Statistics; Physics; Artificial intelligence","score_opus":0.041119772011202455,"score_gpt":0.2707083521516497,"score_spread":0.22958858014044722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511135871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5835654,0.0010894365,0.3513847,0.0024268113,0.00013230096,0.00009862651,0.0008853142,0.0003688839,0.060048494],"genre_scores_gemma":[0.9550583,0.00062494085,0.032250203,0.0002362142,0.00008211285,0.00013904404,0.0006318376,0.00013586118,0.01084171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989328,0.00024048217,0.000053407242,0.00012723866,0.00044527074,0.00020090587],"domain_scores_gemma":[0.9939937,0.004633151,0.000325729,0.0005505021,0.00039502583,0.000101814774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007190915,0.00034540545,0.0004428219,0.00064172,0.0005650583,0.0015100619,0.00072277995,0.00084024307,0.0058425665],"category_scores_gemma":[0.009004676,0.0002724672,0.00034960939,0.0008036075,0.001209812,0.0024311175,0.0010792433,0.0010327938,0.0006938051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004956588,0.000044341017,0.0013830996,0.0001350163,0.000021157819,0.00019343547,0.00017724281,0.23831476,0.010210901,0.70713913,0.0031919624,0.03869329],"study_design_scores_gemma":[0.000038382364,0.00007527505,0.0005594167,0.000025494539,0.000012921654,0.00016112291,0.00006148196,0.4947688,0.0056276135,0.4962342,0.0024126158,0.000022658363],"about_ca_topic_score_codex":0.001208087,"about_ca_topic_score_gemma":0.0012189576,"teacher_disagreement_score":0.0058425665,"about_ca_system_score_codex":0.0013698852,"about_ca_system_score_gemma":0.00094271207,"threshold_uncertainty_score":0.019545317},"labels":[],"label_agreement":null},{"id":"W2513998780","doi":"10.1109/iscas.2016.7538904","title":"A measure for the missed error detection probability for optimizing the forbidden symbol configuration in joint source-channel arithmetic codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Figure of merit; Algorithm; Channel (broadcasting); Computer science; Arithmetic; Coding (social sciences); Symbol (formal); Measure (data warehouse); Interval (graph theory); Probability of error; Mathematics; Statistics; Telecommunications; Combinatorics","score_opus":0.0722156458299947,"score_gpt":0.2753318161517408,"score_spread":0.2031161703217461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513998780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13900274,0.0018172343,0.854456,0.0002941634,0.000069923255,0.000072947325,0.00008720932,0.00045646552,0.0037433277],"genre_scores_gemma":[0.85813284,0.0003288991,0.14093716,0.000047735997,0.000025317944,0.00006349162,0.00005022859,0.000058025187,0.00035634902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985721,0.000512355,0.00006927031,0.00015278127,0.0005882617,0.000105165185],"domain_scores_gemma":[0.9894048,0.008107459,0.0008562089,0.00067322503,0.0008292625,0.00012913466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002719543,0.00091979816,0.00066227186,0.00151783,0.00044481605,0.0011009077,0.0009092244,0.0010422266,0.00078824675],"category_scores_gemma":[0.022346705,0.00021187405,0.00027265068,0.001030198,0.0009945257,0.0014105977,0.0006421693,0.0005836007,0.0001350386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000362819,0.00008377605,0.003103231,0.00019205813,0.000072430805,0.00012301616,0.00010144301,0.8576096,0.01799648,0.028556546,0.0007910685,0.09100748],"study_design_scores_gemma":[0.000012723702,0.00025219985,0.0011841779,0.000028923281,0.00002636352,0.00029373562,0.000029577599,0.9778755,0.013447607,0.006160308,0.00065027416,0.000038545124],"about_ca_topic_score_codex":0.00070266105,"about_ca_topic_score_gemma":0.00090349163,"teacher_disagreement_score":0.002719543,"about_ca_system_score_codex":0.0015422123,"about_ca_system_score_gemma":0.0010526262,"threshold_uncertainty_score":0.014382482},"labels":[],"label_agreement":null},{"id":"W2514571107","doi":"10.1109/isit.2016.7541754","title":"Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Algorithm; Low-density parity-check code; Computer science; Code (set theory); Mathematics; Discrete mathematics; Decoding methods","score_opus":0.017373410844210582,"score_gpt":0.26608376532919564,"score_spread":0.24871035448498507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514571107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109291926,0.00018465033,0.88335013,0.00025863777,0.000019206813,0.00020647694,0.00033300262,0.0007404639,0.005615613],"genre_scores_gemma":[0.53040373,0.00018194994,0.46274737,0.00015669022,0.000024256082,0.0003642702,0.0017177163,0.00019008384,0.004214018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.00011225903,0.000048350114,0.00013949974,0.00022020143,0.00009243595],"domain_scores_gemma":[0.9987575,0.0007085729,0.00011447031,0.00017436138,0.00018795853,0.00005712999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136849,0.0005486698,0.0006570118,0.00087881286,0.00066734495,0.0008687377,0.0009767825,0.0005958286,0.0028143197],"category_scores_gemma":[0.0028279016,0.00036373813,0.0006654559,0.00061958795,0.0006484122,0.0018446345,0.0014760252,0.0011053723,0.0004264704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006378519,0.00033340792,0.005385467,0.0006966059,0.000120353805,0.00041507042,0.0008536545,0.34235856,0.062259328,0.21687935,0.0072444417,0.362816],"study_design_scores_gemma":[0.000060517228,0.00010748199,0.0005971492,0.000033656994,0.000028488555,0.0002454927,0.00012367929,0.8908184,0.016205063,0.08792747,0.0038213741,0.00003121161],"about_ca_topic_score_codex":0.0015003277,"about_ca_topic_score_gemma":0.0022700767,"teacher_disagreement_score":0.0028143197,"about_ca_system_score_codex":0.0008453251,"about_ca_system_score_gemma":0.0014485754,"threshold_uncertainty_score":0.009414852},"labels":[],"label_agreement":null},{"id":"W2514995321","doi":"10.1109/isit.2016.7541674","title":"Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Decoding methods; BCH code; Component (thermodynamics); List decoding; Sequential decoding; Computer science; Binary symmetric channel; Algorithm; Berlekamp–Welch algorithm; Code (set theory); Binary number; Concatenated error correction code; Theoretical computer science; Low-density parity-check code; Block code; Mathematics; Arithmetic; Physics","score_opus":0.025547701492905202,"score_gpt":0.29349926266752124,"score_spread":0.26795156117461605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514995321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08146693,0.00044423845,0.9075226,0.00023771975,0.000041398627,0.000040718383,0.000060460945,0.00020663794,0.00997933],"genre_scores_gemma":[0.9100896,0.0008291917,0.081812814,0.00015793077,0.00007182461,0.00007827794,0.0001046505,0.00022447728,0.0066313515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911255,0.00022722122,0.000032809454,0.000091086884,0.00043203597,0.00010434452],"domain_scores_gemma":[0.99523914,0.0027416358,0.00038805866,0.00038846707,0.0011655141,0.000077142926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012716159,0.0011496235,0.00075799576,0.0010002895,0.00048603019,0.0008519686,0.0010266316,0.0009273995,0.0016312832],"category_scores_gemma":[0.009745993,0.00031997781,0.0007295878,0.0009014214,0.0014619263,0.0014582542,0.0010958768,0.0011242476,0.00056418113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006690379,0.000019577437,0.0008865693,0.00008626987,0.00003601367,0.00021488396,0.000146424,0.9002814,0.009718263,0.077275425,0.00038007123,0.010888097],"study_design_scores_gemma":[0.0000015833472,0.000011665237,0.00014765881,0.0000071402214,0.000009779632,0.000064417174,0.000011033519,0.98346704,0.0028669348,0.013207289,0.00019727169,0.000008191544],"about_ca_topic_score_codex":0.0044126827,"about_ca_topic_score_gemma":0.0031922644,"teacher_disagreement_score":0.0044126827,"about_ca_system_score_codex":0.0015057578,"about_ca_system_score_gemma":0.0018571685,"threshold_uncertainty_score":0.010925114},"labels":[],"label_agreement":null},{"id":"W2518374686","doi":"10.1109/isit.2016.7541412","title":"Simplified Successive-Cancellation List decoding of polar codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; Computer science; Algorithm; List decoding; Code (set theory); Polar; Computational complexity theory; Error detection and correction; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.0190146752604304,"score_gpt":0.2736983518369704,"score_spread":0.25468367657654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518374686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009967862,0.00029060227,0.9829276,0.00018189293,0.000102112215,0.00006581263,0.00011865915,0.00048551662,0.005859851],"genre_scores_gemma":[0.20904686,0.0009875132,0.77923244,0.0003088906,0.00018551339,0.00015376067,0.0006159002,0.00016971194,0.009299439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870145,0.00031760795,0.000069964626,0.00010891203,0.00068102067,0.00012102231],"domain_scores_gemma":[0.9985989,0.00043904415,0.00012099095,0.0003074965,0.00049739185,0.000036239555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007625111,0.0008367419,0.0006150658,0.0010163176,0.0005458879,0.0014043187,0.0009185694,0.0007159761,0.002954201],"category_scores_gemma":[0.0036679248,0.0002926451,0.0004604323,0.0010861104,0.0008799461,0.0013192075,0.0011151035,0.00091454794,0.002109157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058351195,0.00007803552,0.00075119885,0.0005177689,0.000059826885,0.0005724311,0.00034221506,0.30938894,0.07550944,0.21492435,0.00915409,0.38811815],"study_design_scores_gemma":[0.000060521113,0.0000913426,0.00019808071,0.0000489475,0.000020379966,0.00033987674,0.000036879745,0.9079373,0.042049114,0.03753677,0.011633715,0.000047002908],"about_ca_topic_score_codex":0.0023450034,"about_ca_topic_score_gemma":0.0029457873,"teacher_disagreement_score":0.002954201,"about_ca_system_score_codex":0.00077091844,"about_ca_system_score_gemma":0.0019674047,"threshold_uncertainty_score":0.009882808},"labels":[],"label_agreement":null},{"id":"W2521520100","doi":"10.1109/tit.2016.2613113","title":"New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Huawei Technologies","keywords":"Characterization (materials science); Algorithm; Tanner graph; Mathematics; Simple (philosophy); Low-density parity-check code; Multiplicity (mathematics); Graph theory; Graph; Data structure; Combinatorics; Discrete mathematics; Decoding methods; Computer science; Error floor","score_opus":0.011586395829305646,"score_gpt":0.24724546566781472,"score_spread":0.23565906983850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521520100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11099433,0.00029435207,0.8808678,0.00023429954,0.000026322476,0.00022318908,0.00034144946,0.00065540697,0.006362897],"genre_scores_gemma":[0.53370005,0.00026417203,0.45918915,0.0001693932,0.000032991367,0.00034334723,0.0015043947,0.00014675329,0.004649754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999574,0.00006653456,0.000038101698,0.000095088,0.00015906396,0.000067113775],"domain_scores_gemma":[0.99912065,0.00041993195,0.00010478824,0.00013542589,0.00017010854,0.000049045204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027619003,0.00045695188,0.0005914408,0.0010066878,0.0005184974,0.000777586,0.00082891044,0.0005126003,0.0022288298],"category_scores_gemma":[0.0021301191,0.00026247295,0.00050167326,0.0007494418,0.0005635343,0.00165552,0.0011064907,0.0008518708,0.00039621204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005431326,0.00021177145,0.0066192695,0.00058458536,0.00009099225,0.0003902651,0.00080481777,0.3076259,0.059445437,0.23801902,0.007122261,0.3785425],"study_design_scores_gemma":[0.00005134239,0.00011242147,0.0007437436,0.00003513335,0.000021399446,0.00027530143,0.00008666322,0.92336506,0.012771123,0.058071095,0.0044335253,0.000033271393],"about_ca_topic_score_codex":0.0015881654,"about_ca_topic_score_gemma":0.0019368891,"teacher_disagreement_score":0.0022288298,"about_ca_system_score_codex":0.00081528246,"about_ca_system_score_gemma":0.0012871491,"threshold_uncertainty_score":0.0074561834},"labels":[],"label_agreement":null},{"id":"W2524854129","doi":"10.1109/iwcmc.2016.7577057","title":"Towards a smart universe: One droplet at a time","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fountain code; Computer science; Code (set theory); Overhead (engineering); Network packet; Luby transform code; Theoretical computer science; Transmission (telecommunications); Unavailability; Degree distribution; Algorithm; Scalability; Set (abstract data type); Bit error rate; Computer engineering; Decoding methods; Block code; Computer network; Mathematics; Telecommunications; Concatenated error correction code","score_opus":0.01613831076678904,"score_gpt":0.2277708773785943,"score_spread":0.21163256661180527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524854129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11408815,0.064926624,0.44845748,0.14643912,0.0062015415,0.00013128444,0.00024611,0.0019378662,0.21757182],"genre_scores_gemma":[0.7139513,0.026732758,0.16962492,0.02123491,0.0020735774,0.00012493697,0.00018891509,0.0004716475,0.06559696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994518,0.00014868556,0.000017308967,0.00009163282,0.00019413697,0.00009645967],"domain_scores_gemma":[0.9993661,0.00012573371,0.000051695046,0.00017214025,0.00012341428,0.00016085805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009083447,0.00029020678,0.00047162958,0.00049741706,0.0013924548,0.003117236,0.00086761924,0.0027002695,0.0034995868],"category_scores_gemma":[0.0022697644,0.00025928157,0.0002941562,0.00054379925,0.0039710323,0.012636319,0.0041759275,0.003321225,0.0016059689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009481141,0.000055849025,0.0009343631,0.00019611648,0.000017525623,0.00028881742,0.0019161346,0.0021849195,0.011187924,0.8184067,0.020945877,0.14377102],"study_design_scores_gemma":[0.000018299985,0.00012637892,0.00051868625,0.00024521915,0.000018383702,0.00064895203,0.0018986701,0.010614274,0.00881063,0.51587987,0.46115488,0.00006573833],"about_ca_topic_score_codex":0.0005191752,"about_ca_topic_score_gemma":0.0005453712,"teacher_disagreement_score":0.0034995868,"about_ca_system_score_codex":0.00089838903,"about_ca_system_score_gemma":0.00091216166,"threshold_uncertainty_score":0.011707306},"labels":[],"label_agreement":null},{"id":"W2524901373","doi":"10.1145/2964910","title":"Acceleration of k-Means Algorithm Using Altera SDK for OpenCL","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Cluster analysis; Field-programmable gate array; Acceleration; Parallel computing; Throughput; Cluster (spacecraft); Hardware acceleration; Power consumption; Dimension (graph theory); Algorithm; Computational science; Power (physics); Embedded system; Artificial intelligence; Operating system; Wireless","score_opus":0.04420405884421208,"score_gpt":0.289629587082721,"score_spread":0.24542552823850894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524901373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12816045,0.0006115402,0.6793791,0.0004956472,0.00038518856,0.00036767495,0.0019018552,0.14381397,0.044884622],"genre_scores_gemma":[0.5314079,0.0002666482,0.43939957,0.0003219793,0.00004361722,0.00048820185,0.0035034507,0.0037427703,0.0208259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994641,0.00006092064,0.00004563872,0.0000924398,0.00024084382,0.000096107964],"domain_scores_gemma":[0.9992907,0.00019020906,0.00007010251,0.00011068229,0.00029669082,0.000041605286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019016,0.0010661529,0.0004123417,0.0010476764,0.00035597812,0.00086558214,0.0016281164,0.0004629448,0.017873004],"category_scores_gemma":[0.0014180277,0.0003373501,0.00037372828,0.00086598593,0.00021641815,0.00060641486,0.00047981925,0.0007711495,0.0051026717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024099392,0.0006013215,0.008525512,0.0010317006,0.0002920552,0.0010050151,0.00058477896,0.13514683,0.09192778,0.015236026,0.10268021,0.64055884],"study_design_scores_gemma":[0.00052805507,0.00055062585,0.0038610941,0.00006561741,0.000092536444,0.00052244886,0.00013224676,0.7886175,0.12705617,0.0037016731,0.074765116,0.00010690057],"about_ca_topic_score_codex":0.0045569898,"about_ca_topic_score_gemma":0.004640945,"teacher_disagreement_score":0.017873004,"about_ca_system_score_codex":0.00100713,"about_ca_system_score_gemma":0.0010887748,"threshold_uncertainty_score":0.059791207},"labels":[],"label_agreement":null},{"id":"W2531628009","doi":"10.1109/tcomm.2016.2617335","title":"Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Huawei Technologies","keywords":"Low-density parity-check code; Mathematics; Circulant matrix; Block code; Girth (graph theory); Permutation matrix; Permutation (music); Discrete mathematics; Combinatorics; Turbo code; Raptor code; Concatenated error correction code; Linear code; Algorithm; Decoding methods","score_opus":0.04413507167374254,"score_gpt":0.30240792962932656,"score_spread":0.258272857955584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531628009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041695826,0.00064424466,0.9476565,0.0002257187,0.00010996256,0.00013002183,0.00014105125,0.0004244724,0.0089721875],"genre_scores_gemma":[0.53346336,0.0006843699,0.46107072,0.0002607482,0.00008344017,0.00021248267,0.00035554633,0.00009913623,0.0037701435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989225,0.00030497808,0.000067153815,0.00012288876,0.00046536856,0.00011700524],"domain_scores_gemma":[0.9979997,0.0006368159,0.0002780548,0.00061545364,0.0003925259,0.00007751184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086503226,0.0005348922,0.00041663426,0.00075976364,0.0006149199,0.00065309345,0.0011351478,0.000600395,0.002230734],"category_scores_gemma":[0.002760883,0.00029583127,0.0006171868,0.0007458559,0.0011544395,0.0010168881,0.0010197505,0.0011992668,0.0007436069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027255612,0.00009886761,0.0010473264,0.00045414132,0.00006353407,0.0004665239,0.0003204099,0.12760445,0.06474594,0.6750873,0.002780217,0.12705879],"study_design_scores_gemma":[0.00009610632,0.000360078,0.0006426257,0.00009957344,0.000067358764,0.0014673357,0.00008255362,0.7340925,0.07361774,0.16757849,0.021757243,0.00013849688],"about_ca_topic_score_codex":0.00073817524,"about_ca_topic_score_gemma":0.0011445306,"teacher_disagreement_score":0.002230734,"about_ca_system_score_codex":0.00074738386,"about_ca_system_score_gemma":0.001388471,"threshold_uncertainty_score":0.007462561},"labels":[],"label_agreement":null},{"id":"W2532418359","doi":"10.1109/itw2.2006.323810","title":"Index Assignment Optimization for Joint Source-Channel MAP Decoding","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Computer science; List decoding; Channel (broadcasting); Index (typography); Joint (building); Algorithm; A priori and a posteriori; Sequential decoding; Quadratic programming; Mathematical optimization; Mathematics; Statistics; Telecommunications; Concatenated error correction code; Maximum likelihood; Engineering","score_opus":0.021807680999190157,"score_gpt":0.241966842041951,"score_spread":0.22015916104276084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532418359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017776506,0.00014809016,0.9796157,0.00013562352,0.000019126339,0.00002132619,0.000052076823,0.00024694132,0.0019846014],"genre_scores_gemma":[0.58673906,0.00035071553,0.4077874,0.000105500054,0.000061848936,0.0001074111,0.000208147,0.00016633648,0.004473698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990766,0.00037283712,0.000042309366,0.00015452084,0.00025812202,0.00009570456],"domain_scores_gemma":[0.9987664,0.00081256015,0.00012725558,0.00011531832,0.00014088515,0.000037576163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853052,0.0006998902,0.0007637554,0.00037896217,0.00037688157,0.00076994166,0.0006251015,0.00074569246,0.0016434869],"category_scores_gemma":[0.004556198,0.00027690246,0.00022917893,0.001019822,0.00066370465,0.0012588378,0.0010469805,0.0008206985,0.00044351578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000218823,0.00006832723,0.0003716179,0.0001080311,0.000033326145,0.000075551616,0.00013401624,0.8476857,0.013848848,0.042953443,0.0018722671,0.092630066],"study_design_scores_gemma":[0.000011969239,0.000028589291,0.00007173145,0.000004336728,0.0000053384197,0.000029095501,0.000012746791,0.9754706,0.005202606,0.01860846,0.0005473477,0.000007323246],"about_ca_topic_score_codex":0.0013006384,"about_ca_topic_score_gemma":0.0012541112,"teacher_disagreement_score":0.0016434869,"about_ca_system_score_codex":0.0006710044,"about_ca_system_score_gemma":0.0011138354,"threshold_uncertainty_score":0.0057397485},"labels":[],"label_agreement":null},{"id":"W2536217578","doi":"10.17760/d20211572","title":"Efficient algorithms for stochastic decoding of LDPC codes","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Gilead Sciences; McKnight Foundation","keywords":"Low-density parity-check code; Computer science; Decoding methods; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; List decoding; Theoretical computer science; Block code; Concatenated error correction code; Computer engineering; Parallel computing","score_opus":0.025813791491237702,"score_gpt":0.3220486601179452,"score_spread":0.2962348686267075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536217578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033843978,0.00017395405,0.9938685,0.0000706233,0.000020091182,0.000045975972,0.000046852776,0.00026071692,0.002128916],"genre_scores_gemma":[0.16245024,0.00093987177,0.830633,0.00011278144,0.00007212837,0.00038777146,0.00045796475,0.00021302642,0.004733246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861014,0.000336448,0.000087710636,0.00013935218,0.0007117308,0.00011451958],"domain_scores_gemma":[0.99758303,0.0013013036,0.00019974206,0.0003227708,0.000551868,0.0000412265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334803,0.001021293,0.0007145457,0.0012114733,0.0007255279,0.0012532419,0.0009980244,0.0009564356,0.0026884635],"category_scores_gemma":[0.006232818,0.0005484199,0.0006769758,0.0014266159,0.0008325775,0.001138302,0.0010680133,0.0013799841,0.0013972184],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074257885,0.000055659402,0.000452187,0.00017831897,0.000037499653,0.00008709597,0.00016481431,0.5867699,0.0107002,0.24842916,0.0029702021,0.15008073],"study_design_scores_gemma":[0.000015411246,0.00001765303,0.000053677948,0.000020608979,0.0000049176897,0.000055633103,0.000010494784,0.94946814,0.0035329333,0.04436026,0.0024474468,0.000012766481],"about_ca_topic_score_codex":0.0020346912,"about_ca_topic_score_gemma":0.003374378,"teacher_disagreement_score":0.0026884635,"about_ca_system_score_codex":0.0015468348,"about_ca_system_score_gemma":0.0023926105,"threshold_uncertainty_score":0.011223078},"labels":[],"label_agreement":null},{"id":"W2536636723","doi":"10.1109/tcsi.2017.2745902","title":"A 9.52 dB NCG FEC Scheme and 162 b/Cycle Low-Complexity Product Decoder Architecture","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Forward error correction; Concatenation (mathematics); Decoding methods; Error detection and correction; Code (set theory); Product (mathematics); Algorithm; Bit error rate; Coding gain; Mathematics; Arithmetic","score_opus":0.027839725483409253,"score_gpt":0.25730487053851503,"score_spread":0.2294651450551058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536636723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14665557,0.00084236055,0.81883943,0.00089674763,0.00031233593,0.00048096396,0.00027970443,0.0052767373,0.026416246],"genre_scores_gemma":[0.48266044,0.00031010847,0.4967209,0.00032936252,0.00012888799,0.00016265009,0.0003957604,0.000096202355,0.019195743],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.000054374887,0.000021892078,0.00006466329,0.0001666916,0.00003200891],"domain_scores_gemma":[0.99963903,0.000060881815,0.000037896516,0.00007373279,0.0001640755,0.000024356197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031705233,0.00056634913,0.00038061495,0.00063462247,0.0005148886,0.0004920625,0.0008528807,0.001009357,0.0033456392],"category_scores_gemma":[0.0005394753,0.00024997408,0.0002581159,0.00041362314,0.00037677307,0.00074546004,0.00034560903,0.0006697337,0.0020690726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074817485,0.00040683185,0.0012569329,0.00021424082,0.000051716106,0.00056910294,0.00018493776,0.012008112,0.69352204,0.026040155,0.0052057197,0.2597919],"study_design_scores_gemma":[0.00018550683,0.0018116854,0.0025518446,0.000048235554,0.00010038811,0.0034620953,0.00003303258,0.29204232,0.64749587,0.0030307793,0.049119607,0.0001186877],"about_ca_topic_score_codex":0.0014611426,"about_ca_topic_score_gemma":0.002466732,"teacher_disagreement_score":0.0033456392,"about_ca_system_score_codex":0.0006186653,"about_ca_system_score_gemma":0.0009017676,"threshold_uncertainty_score":0.011192262},"labels":[],"label_agreement":null},{"id":"W2539056945","doi":"10.1109/istc.2016.7593130","title":"Finite-length quasi-synchronous LDPC decoders","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Low-density parity-check code; Energy consumption; Energy (signal processing); Algorithm; Channel (broadcasting); Electronic engineering; Parallel computing; Mathematics; Telecommunications; Electrical engineering; Engineering; Statistics","score_opus":0.02450226971274969,"score_gpt":0.2799030711098379,"score_spread":0.2554008013970882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539056945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38105145,0.0003713963,0.6129797,0.0001227682,0.0000330176,0.000029643394,0.00015046637,0.00068545755,0.004576073],"genre_scores_gemma":[0.96561474,0.00015000612,0.033121105,0.00002302253,0.000008331277,0.000014742711,0.000047358208,0.000046504483,0.00097435014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997094,0.00008117756,0.000017162254,0.000047719364,0.00011506395,0.000029313409],"domain_scores_gemma":[0.9982703,0.000976707,0.00024024342,0.0002739054,0.0001989425,0.00003990676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047911797,0.00028993023,0.00029890647,0.00023443515,0.00021216253,0.00047603264,0.0004597343,0.00041553436,0.0010289861],"category_scores_gemma":[0.002452565,0.00014183417,0.0001668337,0.00030067225,0.0005563054,0.00077954953,0.0002092395,0.00038864475,0.00023489783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026311248,0.000063822044,0.0020228701,0.00017062375,0.000041685464,0.00021036858,0.00013073173,0.7766148,0.11072794,0.08388539,0.0004944129,0.025374232],"study_design_scores_gemma":[0.0000075060784,0.000066313376,0.0003020077,0.000005368636,0.000005876466,0.00006752328,0.0000069349408,0.9711936,0.021607855,0.006307827,0.00042043594,0.000008741723],"about_ca_topic_score_codex":0.0006930583,"about_ca_topic_score_gemma":0.0010665826,"teacher_disagreement_score":0.0010289861,"about_ca_system_score_codex":0.00054570194,"about_ca_system_score_gemma":0.00048379146,"threshold_uncertainty_score":0.003959298},"labels":[],"label_agreement":null},{"id":"W2547363301","doi":"10.1109/ccece.2016.7726832","title":"Implementation of decoders for symmetric low density parity check codes on parallel computation platforms using OpenCL","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Compiler; Parallel computing; Field-programmable gate array; Low-density parity-check code; Computation; Decoding methods; Embedded system; Algorithm; Programming language","score_opus":0.05587076522278294,"score_gpt":0.3571538484123292,"score_spread":0.3012830831895463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547363301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15478155,0.00017625213,0.8146356,0.00018201787,0.0001018033,0.00027170495,0.00027428134,0.017656166,0.0119207045],"genre_scores_gemma":[0.5401937,0.00013481901,0.44828534,0.0001283746,0.000029858933,0.00029250837,0.00066272845,0.0013696961,0.008902936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953794,0.00007150162,0.00003834052,0.0000688289,0.00019349676,0.000089907495],"domain_scores_gemma":[0.9987625,0.0004069183,0.00009471109,0.00018036195,0.0005096824,0.000045872945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288268,0.0006520927,0.00044985974,0.00067625975,0.00059960387,0.0008841656,0.0013747482,0.0004902614,0.005138258],"category_scores_gemma":[0.0024012956,0.00034721172,0.0004192171,0.00046647442,0.00034511648,0.0007836482,0.00060539244,0.00075802434,0.0013666864],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011580045,0.0006313139,0.006106479,0.0008408937,0.00017921838,0.0012717136,0.00085978355,0.23555323,0.25256696,0.04476589,0.013616086,0.44245043],"study_design_scores_gemma":[0.00018159613,0.0003232886,0.0007710945,0.000035536134,0.00003468759,0.00030044085,0.000056095138,0.75579935,0.22299758,0.0067390287,0.01271488,0.000046491994],"about_ca_topic_score_codex":0.0023100919,"about_ca_topic_score_gemma":0.004053953,"teacher_disagreement_score":0.005138258,"about_ca_system_score_codex":0.0010664825,"about_ca_system_score_gemma":0.0014697711,"threshold_uncertainty_score":0.017189145},"labels":[],"label_agreement":null},{"id":"W2551106978","doi":"10.1109/allerton.2012.6483266","title":"Faulty Gallager-B decoding with optimal message repetition","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Overhead (engineering); List decoding; Algorithm; Fault tolerance; Soft-decision decoder; Message passing; Sequential decoding; Channel (broadcasting); Parallel computing; Distributed computing; Computer network; Concatenated error correction code; Block code","score_opus":0.016531565105586066,"score_gpt":0.25769096187740914,"score_spread":0.24115939677182308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551106978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34473777,0.0002749769,0.65093,0.00027245245,0.000047102978,0.000059941423,0.000069339774,0.0006152512,0.0029930552],"genre_scores_gemma":[0.88253796,0.00013052496,0.116183005,0.00004868067,0.000025328862,0.000042583393,0.00005050156,0.00006630687,0.00091513473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991634,0.00027659067,0.00004144741,0.00012422257,0.00024439578,0.00014990193],"domain_scores_gemma":[0.99653685,0.0016146435,0.0005696359,0.0008019491,0.0003569421,0.00011997804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097534666,0.0007346299,0.0007446563,0.0005816488,0.00046298228,0.00086783624,0.00086630945,0.0010640027,0.0006565293],"category_scores_gemma":[0.00670709,0.00022346218,0.0004236949,0.0006531663,0.0012399005,0.0014420582,0.000835534,0.00078007235,0.00023421732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053189986,0.00006679537,0.0022454362,0.00009041594,0.000057602407,0.00033269793,0.00013748537,0.8873957,0.01856822,0.07309879,0.0005514777,0.01692355],"study_design_scores_gemma":[0.000021162597,0.00006603383,0.00012249555,0.0000041517956,0.000008058596,0.00005310969,0.000011068858,0.9752099,0.008809085,0.015461001,0.00022259123,0.000011484057],"about_ca_topic_score_codex":0.0015087583,"about_ca_topic_score_gemma":0.001107798,"teacher_disagreement_score":0.0015087583,"about_ca_system_score_codex":0.0010085799,"about_ca_system_score_gemma":0.0010930544,"threshold_uncertainty_score":0.007317841},"labels":[],"label_agreement":null},{"id":"W2552101656","doi":"10.1109/allerton.2009.5394496","title":"Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivity","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Encoder; Binary number; Computer science; Distributed source coding; Universality (dynamical systems); Mathematics; Theoretical computer science; Channel code; Statistics; Arithmetic","score_opus":0.03584734140875678,"score_gpt":0.307292230030714,"score_spread":0.2714448886219572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552101656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31182924,0.0005054804,0.68274075,0.00016903214,0.000017859202,0.00007119149,0.000082298335,0.00048654267,0.0040977173],"genre_scores_gemma":[0.9468174,0.00019230558,0.052070063,0.000033713477,0.000010646757,0.000044431225,0.000058623496,0.00002783141,0.0007449975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978169,0.0007359127,0.0001216714,0.00024554564,0.00066388503,0.0004161007],"domain_scores_gemma":[0.9906412,0.006450535,0.00081538863,0.0012822372,0.00058271,0.0002279549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567553,0.00090435025,0.0009828373,0.0008116343,0.0004849015,0.0009644975,0.0010347969,0.0007662136,0.0009832203],"category_scores_gemma":[0.0114521105,0.0003039632,0.00047952248,0.000900215,0.0018592788,0.0023300347,0.0022463559,0.0010103177,0.0002289042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063006306,0.00011385279,0.0041745547,0.00016163607,0.00012700385,0.0003234288,0.00036978157,0.81193924,0.02941253,0.09979317,0.00024357373,0.052711185],"study_design_scores_gemma":[0.00001946899,0.00010351095,0.00036504128,0.000015594243,0.000020374799,0.0001222383,0.000025778594,0.9597104,0.025898095,0.013423563,0.00026976978,0.000025993295],"about_ca_topic_score_codex":0.0011531728,"about_ca_topic_score_gemma":0.0011675206,"teacher_disagreement_score":0.0026567553,"about_ca_system_score_codex":0.001122492,"about_ca_system_score_gemma":0.0010069568,"threshold_uncertainty_score":0.014050424},"labels":[],"label_agreement":null},{"id":"W2554211814","doi":"10.1109/allerton.2009.5394793","title":"On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Puncturing; Binary erasure channel; Decoding methods; Maximization; Mathematics; Algorithm; Binary number; Channel (broadcasting); Channel capacity; Computer science; Topology (electrical circuits); Mathematical optimization; Arithmetic; Combinatorics","score_opus":0.06156967862486773,"score_gpt":0.26537496261639554,"score_spread":0.2038052839915278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554211814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08082455,0.0002625848,0.91335905,0.0001282808,0.000025150232,0.00009820295,0.000057794987,0.00025843614,0.004986057],"genre_scores_gemma":[0.7411648,0.0003771792,0.2566463,0.00012779336,0.000025721181,0.00019295447,0.00009737066,0.000061650906,0.0013062556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.0003569784,0.000063104904,0.000127079,0.00025785834,0.00008957697],"domain_scores_gemma":[0.998412,0.00081159896,0.00026790734,0.00020607273,0.00022310927,0.00007925991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012146663,0.00063052645,0.00038874536,0.00040350904,0.0003238447,0.0004563592,0.00059521414,0.00048224835,0.00066829525],"category_scores_gemma":[0.0030624673,0.0003535955,0.00032186985,0.00039247537,0.0008145735,0.0006610712,0.00086767296,0.0007313545,0.00024125603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019508197,0.00009866635,0.0012477313,0.00025935567,0.00004517141,0.00027923638,0.0003479308,0.53042775,0.1169425,0.26565766,0.00080825004,0.0836906],"study_design_scores_gemma":[0.000028410655,0.0002612528,0.00019201048,0.000036375957,0.000011162631,0.00013909704,0.00002279095,0.90130174,0.062386595,0.03343642,0.0021507826,0.0000334059],"about_ca_topic_score_codex":0.0003438131,"about_ca_topic_score_gemma":0.0004534169,"teacher_disagreement_score":0.0012146663,"about_ca_system_score_codex":0.00044642197,"about_ca_system_score_gemma":0.0008699504,"threshold_uncertainty_score":0.006423831},"labels":[],"label_agreement":null},{"id":"W2554527937","doi":"10.1109/tcsi.2016.2619324","title":"A Fast Polar Code List Decoder Architecture Based on Sphere Decoding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; Computer science; List decoding; Throughput; Polar; Algorithm; Error detection and correction; Code (set theory); Sequential decoding; Soft-decision decoder; Concatenated error correction code; Telecommunications; Block code; Set (abstract data type); Wireless","score_opus":0.01595336298905812,"score_gpt":0.23033648201292342,"score_spread":0.2143831190238653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554527937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021570997,0.00068490196,0.9576756,0.00028281377,0.00023180486,0.0001681122,0.0003676467,0.0066595455,0.012358641],"genre_scores_gemma":[0.2939396,0.0010166743,0.6853792,0.00045304137,0.00021287474,0.0001740966,0.0011432631,0.0002463895,0.017434882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999694,0.000054507513,0.000019860885,0.000045548033,0.0001484597,0.00003764529],"domain_scores_gemma":[0.9995511,0.0000891845,0.000031984026,0.00006375054,0.00023393198,0.000030081763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002437975,0.00071605324,0.000511487,0.00088275864,0.00058448245,0.0010339756,0.00086611474,0.0006790057,0.004274144],"category_scores_gemma":[0.00066481595,0.0002410362,0.00025629095,0.0007602764,0.00034219114,0.0010640408,0.00070281647,0.0006668771,0.004192599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010289561,0.00017307854,0.0014614495,0.00046959586,0.00011373284,0.00074798276,0.00025476588,0.06748014,0.35524788,0.05707245,0.022429435,0.49352047],"study_design_scores_gemma":[0.00013204082,0.0006408475,0.00053356716,0.00005985185,0.0000784321,0.0011226948,0.000055356868,0.60414207,0.3399705,0.008042664,0.04511905,0.000102966376],"about_ca_topic_score_codex":0.0027459762,"about_ca_topic_score_gemma":0.0041685537,"teacher_disagreement_score":0.004274144,"about_ca_system_score_codex":0.00059795653,"about_ca_system_score_gemma":0.0014274626,"threshold_uncertainty_score":0.014298379},"labels":[],"label_agreement":null},{"id":"W2558776151","doi":"10.1109/isit.2017.8006717","title":"Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Low-density parity-check code; Computer science; Terminology; Simple (philosophy); Algorithm; Code (set theory); Ranging; Representation (politics); Theoretical computer science; Decoding methods; Programming language","score_opus":0.030762139991211065,"score_gpt":0.3109040462150831,"score_spread":0.28014190622387203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558776151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10265687,0.00025368962,0.89142245,0.00017119673,0.000014038003,0.00018794251,0.0003575535,0.00058611797,0.004350057],"genre_scores_gemma":[0.4336784,0.0002444117,0.560965,0.00010053667,0.000016733453,0.00038315952,0.0016378607,0.00014043013,0.0028334856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.000086452266,0.000026265563,0.000071890994,0.00010115838,0.00005763875],"domain_scores_gemma":[0.99874395,0.00079226587,0.00012888922,0.00014293646,0.00014713703,0.00004476671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035849356,0.0005544553,0.0006526464,0.0012698778,0.0004341634,0.0006766907,0.00087752345,0.0005480022,0.0022473233],"category_scores_gemma":[0.0030349337,0.00029248028,0.0004977189,0.00091148575,0.00054240774,0.0011683634,0.0009932072,0.0005981988,0.0004015427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039809695,0.00016276739,0.005384998,0.00049974775,0.000084532534,0.0002500411,0.0005018446,0.61045355,0.022868203,0.10583581,0.003984325,0.24957614],"study_design_scores_gemma":[0.000027633385,0.00004954698,0.00038818413,0.000016216905,0.000012529602,0.00011628478,0.000053369393,0.96882194,0.0032451868,0.026012363,0.001245472,0.000011201821],"about_ca_topic_score_codex":0.002055345,"about_ca_topic_score_gemma":0.002672936,"teacher_disagreement_score":0.0022473233,"about_ca_system_score_codex":0.0006605633,"about_ca_system_score_gemma":0.0014082278,"threshold_uncertainty_score":0.007518053},"labels":[],"label_agreement":null},{"id":"W2567389047","doi":"10.1109/globalsip.2016.7905932","title":"Stall pattern avoidance in polynomial product codes","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bit error rate; Computer science; Algorithm; Error detection and correction; Product (mathematics); Propagation of uncertainty; Polynomial; Word error rate; Reed–Solomon error correction; Concatenated error correction code; Mathematics; Decoding methods; Block code; Speech recognition","score_opus":0.020740942170882865,"score_gpt":0.27368366666587557,"score_spread":0.2529427244949927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567389047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3461105,0.00040788128,0.6473024,0.00015731432,0.00004031079,0.00003960088,0.00007540146,0.000970672,0.0048959334],"genre_scores_gemma":[0.94353515,0.00018829523,0.053484935,0.00004246183,0.000016537088,0.000025881202,0.000077830686,0.00005998709,0.002568838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935955,0.000121468605,0.00003266002,0.00008824565,0.00027012106,0.00012803107],"domain_scores_gemma":[0.9973017,0.0012248548,0.00046735114,0.00048777313,0.00045207763,0.00006621196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044999953,0.00050134055,0.00039169154,0.00042368274,0.00047073982,0.0005600626,0.00061083946,0.00038905512,0.0009954078],"category_scores_gemma":[0.0045757405,0.00016424277,0.00018374463,0.0005754275,0.00092244864,0.00079196907,0.0006701158,0.0005845229,0.00030029065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066054065,0.0000806631,0.005261445,0.0003075323,0.000038892314,0.00066588965,0.0004110522,0.56645554,0.11522688,0.16271651,0.002517599,0.14565745],"study_design_scores_gemma":[0.00002471987,0.00021569186,0.0005863823,0.000023198216,0.000014331259,0.0003336915,0.00003988726,0.89225876,0.069086775,0.03481776,0.002571677,0.000027141747],"about_ca_topic_score_codex":0.0015131717,"about_ca_topic_score_gemma":0.0016490897,"teacher_disagreement_score":0.0015131717,"about_ca_system_score_codex":0.00051304465,"about_ca_system_score_gemma":0.00091833045,"threshold_uncertainty_score":0.0037224293},"labels":[],"label_agreement":null},{"id":"W2574730918","doi":"10.1109/tit.2017.2784839","title":"On Short Cycle Enumeration in Biregular Bipartite Graphs","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Girth (graph theory); Odd graph; Tanner graph; Discrete mathematics; Complete bipartite graph; Low-density parity-check code; Probability of error; Dense graph; Enumeration; Chordal graph; Graph; 1-planar graph; Decoding methods; Algorithm; Error floor","score_opus":0.011482672351554502,"score_gpt":0.25786941242606776,"score_spread":0.24638674007451325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574730918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11909142,0.00076853,0.86695373,0.0005459104,0.000054719283,0.00016120545,0.00044218785,0.0006765806,0.011305676],"genre_scores_gemma":[0.5391959,0.0018905166,0.4481387,0.00045417287,0.00014849642,0.0004269938,0.0014776333,0.00046478945,0.0078027667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979808,0.00080191175,0.00010970586,0.00034598444,0.0004835153,0.0002781596],"domain_scores_gemma":[0.99348915,0.0044515086,0.0005857989,0.00074907887,0.0005345503,0.00018985668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957365,0.0007970568,0.0007981981,0.0027224764,0.0012581701,0.0017027354,0.001088261,0.0010942667,0.0038571807],"category_scores_gemma":[0.009591888,0.00061318284,0.0007311218,0.0036787866,0.002188143,0.003757216,0.0019034514,0.0016359525,0.0008087592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030442173,0.00013095114,0.0024467718,0.00036955334,0.000034675442,0.00029512434,0.00051482086,0.23442033,0.009193741,0.6402674,0.0035446465,0.10847748],"study_design_scores_gemma":[0.000022954984,0.000049962357,0.00048157075,0.000063451494,0.000011805095,0.00017553756,0.00009908002,0.3036974,0.004062839,0.6879522,0.0033512316,0.000031985906],"about_ca_topic_score_codex":0.0029659914,"about_ca_topic_score_gemma":0.0037722834,"teacher_disagreement_score":0.0038571807,"about_ca_system_score_codex":0.0014940007,"about_ca_system_score_gemma":0.0012299125,"threshold_uncertainty_score":0.012903631},"labels":[],"label_agreement":null},{"id":"W2579410364","doi":"10.1109/tit.2018.2805906","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Discrete mathematics; Combinatorics; Degree (music); Graph; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.00874073550674255,"score_gpt":0.23439110394418125,"score_spread":0.2256503684374387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579410364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6357741,0.0009301264,0.35324696,0.00066029665,0.00004383229,0.00008469611,0.00042953456,0.00040668095,0.0084238015],"genre_scores_gemma":[0.98805827,0.0004008824,0.009101832,0.00007561816,0.000029733046,0.000050372604,0.00019606172,0.000081098595,0.0020061417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932337,0.0002449275,0.000015673915,0.00013987794,0.00016939764,0.00010676767],"domain_scores_gemma":[0.9949443,0.0032317713,0.0004822745,0.0005317475,0.0006191252,0.00019077993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014468168,0.00044928287,0.00051112316,0.0014589619,0.0004653244,0.0008246707,0.0008192788,0.000725117,0.0015453574],"category_scores_gemma":[0.009368339,0.00036733787,0.00038866012,0.0008775732,0.0014742475,0.0018855929,0.0006615981,0.0008782797,0.00024002373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024706224,0.000060454047,0.00651293,0.0001210062,0.000055000168,0.0003174901,0.0003184154,0.55669737,0.0118411435,0.40822914,0.001504326,0.014095618],"study_design_scores_gemma":[0.0000069343664,0.000022394146,0.0010066363,0.00001247541,0.000006263065,0.00008766115,0.000028416562,0.9581459,0.0016788277,0.038550843,0.00043505273,0.000018483623],"about_ca_topic_score_codex":0.0027714414,"about_ca_topic_score_gemma":0.0021168634,"teacher_disagreement_score":0.0027714414,"about_ca_system_score_codex":0.0015657254,"about_ca_system_score_gemma":0.0007614731,"threshold_uncertainty_score":0.011360168},"labels":[],"label_agreement":null},{"id":"W2579856090","doi":"10.1109/cefc.2016.7816128","title":"GPU optimization and implementation of Gaussian belief propagation algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Belief propagation; Graphics processing unit; Gaussian; CUDA; Parallel computing; Central processing unit; Sparse matrix; Gaussian elimination; Algorithm; Computational science; Computer hardware","score_opus":0.009204596306334162,"score_gpt":0.27314556941909035,"score_spread":0.2639409731127562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579856090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086300306,0.00017481527,0.8960459,0.00025330993,0.00010343781,0.000089091955,0.00037408856,0.0063320245,0.010327095],"genre_scores_gemma":[0.34661302,0.00010782928,0.64840174,0.00006152529,0.000014828837,0.00012089789,0.0006346536,0.0004653729,0.003580066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967325,0.000051021747,0.000017629834,0.00005090078,0.00015173199,0.000055505887],"domain_scores_gemma":[0.9994647,0.000081942395,0.000028147777,0.00008803805,0.0003122095,0.000025001462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037784842,0.00044320937,0.0004878629,0.0005083578,0.0003767684,0.0006598337,0.001161391,0.0005490894,0.0031823672],"category_scores_gemma":[0.0015882174,0.00023746857,0.00030637567,0.0008646367,0.00024127397,0.0004409033,0.00044147717,0.0006249844,0.00086592947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042509986,0.00023144769,0.0050755376,0.00021522313,0.0001389683,0.00033768348,0.0002535178,0.60167694,0.053782523,0.02275653,0.015496753,0.29960984],"study_design_scores_gemma":[0.000018483695,0.000028535429,0.0003798961,0.0000036049857,0.000008812877,0.000028994362,0.000011808464,0.97892123,0.016424028,0.0009735964,0.0031923992,0.000008610196],"about_ca_topic_score_codex":0.013068066,"about_ca_topic_score_gemma":0.010303359,"teacher_disagreement_score":0.013068066,"about_ca_system_score_codex":0.00058363884,"about_ca_system_score_gemma":0.0013043446,"threshold_uncertainty_score":0.025984049},"labels":[],"label_agreement":null},{"id":"W2581521217","doi":"10.1109/isit.2017.8006751","title":"Neural offset min-sum decoding","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Nvidia","keywords":"Decoding methods; Offset (computer science); Computer science; Multiplicative function; Belief propagation; Algorithm; Artificial neural network; Graph; Path (computing); Arithmetic; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.06152156936520667,"score_gpt":0.330383403636796,"score_spread":0.2688618342715894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581521217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020468155,0.0002864721,0.9716794,0.0002715457,0.00012643558,0.00002360883,0.00010955892,0.0011997647,0.005835112],"genre_scores_gemma":[0.50660354,0.0003456983,0.47633117,0.00032540644,0.00010062596,0.00006224391,0.00029693494,0.00025281883,0.015681561],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931157,0.00012961583,0.000037860194,0.00015042885,0.00029064607,0.000079824844],"domain_scores_gemma":[0.99900913,0.00035494764,0.000058492045,0.00024752365,0.00029486394,0.000034975994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006052635,0.0006676399,0.0006598114,0.00057128497,0.0004384715,0.001005345,0.0013872063,0.00091036,0.003428597],"category_scores_gemma":[0.0041758027,0.00026968733,0.00035157817,0.00074037333,0.00074700534,0.0013540868,0.0013064357,0.0013525815,0.0010915404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049113535,0.00009310646,0.00096512836,0.00023087932,0.00008994484,0.0001817903,0.00016544746,0.28803113,0.029774446,0.12816848,0.0062351627,0.54557335],"study_design_scores_gemma":[0.000012252119,0.000039222712,0.0001360459,0.000017311888,0.000015589163,0.00011428691,0.000012235736,0.93657917,0.028280843,0.032381084,0.0023986863,0.000013280398],"about_ca_topic_score_codex":0.0020841626,"about_ca_topic_score_gemma":0.004358275,"teacher_disagreement_score":0.003428597,"about_ca_system_score_codex":0.0007696687,"about_ca_system_score_gemma":0.0011566282,"threshold_uncertainty_score":0.011469841},"labels":[],"label_agreement":null},{"id":"W2586495303","doi":"10.1109/tsp.2017.2664045","title":"Implementation of Sparse Superposition Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Encoder; Code word; Encoding (memory); Algorithm; Code (set theory); Superposition principle; Throughput; Error detection and correction; Set (abstract data type); Parallel computing; Computer engineering; Theoretical computer science; Mathematics; Wireless; Telecommunications; Artificial intelligence","score_opus":0.03805065613208781,"score_gpt":0.33346601522842834,"score_spread":0.29541535909634054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586495303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0595804,0.00040151272,0.9024489,0.000323249,0.00014730799,0.00015658767,0.000326996,0.0038366746,0.032778364],"genre_scores_gemma":[0.57913685,0.0003733542,0.40721503,0.0002198326,0.000064504806,0.00021158825,0.0006761383,0.00012681252,0.011975919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994267,0.0001007094,0.000036798523,0.00006943123,0.00027357935,0.00009280733],"domain_scores_gemma":[0.99909985,0.00019601347,0.00007263449,0.00024651148,0.00035699378,0.000028085975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953616,0.00039795865,0.0003470638,0.00046805118,0.0004584597,0.00091158383,0.000873148,0.00051788863,0.006833081],"category_scores_gemma":[0.0019712453,0.0001987034,0.00030917407,0.0006969111,0.00037842194,0.0009993664,0.0008478618,0.0005307607,0.0015644841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069217,0.00019450035,0.0020997007,0.00041126748,0.00010822005,0.00035001483,0.00041780816,0.13599804,0.13934386,0.19184488,0.011006567,0.51771814],"study_design_scores_gemma":[0.00008375329,0.00043547232,0.0007804667,0.00008304004,0.00006870789,0.0005167368,0.00013045708,0.75310475,0.16050294,0.038248397,0.046006486,0.000038823775],"about_ca_topic_score_codex":0.0018307483,"about_ca_topic_score_gemma":0.0030331726,"teacher_disagreement_score":0.006833081,"about_ca_system_score_codex":0.0006919447,"about_ca_system_score_gemma":0.0013954,"threshold_uncertainty_score":0.022858918},"labels":[],"label_agreement":null},{"id":"W2588162691","doi":"10.1109/lcomm.2017.2669319","title":"On-Line Fountain Codes With Unequal Error Protection","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Beijing Council of Science and Technology","keywords":"Fountain code; Computer science; Overhead (engineering); Algorithm; Encoding (memory); Line (geometry); Luby transform code; Scheme (mathematics); Decoding methods; Fountain; Property (philosophy); Theoretical computer science; Block code; Error floor; Mathematics; Artificial intelligence","score_opus":0.10624791661529759,"score_gpt":0.34462253197676407,"score_spread":0.23837461536146648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588162691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23615132,0.0008551922,0.75246626,0.0003676908,0.00014089768,0.00012583015,0.000105494175,0.0011580414,0.008629297],"genre_scores_gemma":[0.8740977,0.00027509042,0.12131492,0.0001708225,0.00005070224,0.00006852409,0.00009400854,0.00006122352,0.0038669396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.00017658662,0.000028912928,0.00006325363,0.0002609582,0.00013008901],"domain_scores_gemma":[0.998264,0.00040474127,0.00030328034,0.00054088363,0.0004200864,0.00006702569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004339046,0.0006318228,0.000489595,0.0008246023,0.0005269455,0.000630735,0.001012587,0.0007833656,0.0014576467],"category_scores_gemma":[0.0029319727,0.00014715297,0.00026422198,0.00088707055,0.0005751426,0.001181785,0.0010576169,0.00062413974,0.00038272253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015113547,0.00026005498,0.002572954,0.0002697617,0.00011241099,0.00093745586,0.0006069491,0.10161717,0.15594034,0.073275685,0.0048175827,0.6580782],"study_design_scores_gemma":[0.000099381046,0.00056881324,0.0015711429,0.00009216911,0.00005854469,0.0017326362,0.0001087572,0.7959976,0.15957285,0.023236005,0.016853392,0.00010871158],"about_ca_topic_score_codex":0.001959314,"about_ca_topic_score_gemma":0.002067183,"teacher_disagreement_score":0.001959314,"about_ca_system_score_codex":0.0006919051,"about_ca_system_score_gemma":0.0006664314,"threshold_uncertainty_score":0.0050201416},"labels":[],"label_agreement":null},{"id":"W2594907695","doi":"10.1007/s11265-017-1232-z","title":"A Modular Architecture for Structured Long Block-Length LDPC Decoders","year":2017,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Parallel computing; Block (permutation group theory); Modular design; Offset (computer science); Block size; Code (set theory); Interconnection; Clock rate; Decoding methods; Architecture; Computer hardware; Algorithm; Mathematics; Key (lock); Set (abstract data type); Computer network","score_opus":0.022702860753887704,"score_gpt":0.29026375036835284,"score_spread":0.2675608896144651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594907695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857738,0.00044882088,0.89948434,0.00024131754,0.00010588734,0.00013531603,0.00024182926,0.0033602424,0.0074048634],"genre_scores_gemma":[0.54180986,0.0003351681,0.4492033,0.0002099052,0.00010002989,0.00016884769,0.000433167,0.0001493517,0.0075903134],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998621,0.000025492987,0.000011031334,0.000030048079,0.000048466125,0.000022709075],"domain_scores_gemma":[0.9996402,0.000064244756,0.000041326726,0.00009949758,0.00012490842,0.000029794925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019158523,0.00041231792,0.00027287795,0.00046044588,0.00035210463,0.0005561276,0.0008603213,0.0004951528,0.0029624908],"category_scores_gemma":[0.0004796967,0.0002293829,0.0002584257,0.00031878633,0.00023260209,0.00060423755,0.00053930946,0.00051618024,0.0016855933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006832879,0.00018354684,0.0011646498,0.0004191776,0.00010220345,0.00035006634,0.0002061276,0.069512896,0.5742485,0.05930095,0.0058448534,0.28798375],"study_design_scores_gemma":[0.00018719013,0.0015363307,0.0016965278,0.00013081894,0.00017745674,0.0009109066,0.00006742516,0.5686526,0.36509922,0.029575573,0.031864796,0.00010124592],"about_ca_topic_score_codex":0.0005914129,"about_ca_topic_score_gemma":0.0019101887,"teacher_disagreement_score":0.0029624908,"about_ca_system_score_codex":0.000447681,"about_ca_system_score_gemma":0.0006878915,"threshold_uncertainty_score":0.009910524},"labels":[],"label_agreement":null},{"id":"W2601496744","doi":"10.1109/tsp.2017.2740204","title":"Fast and Flexible Successive-Cancellation List Decoders for Polar Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Error detection and correction; Coding gain; Polar code; Throughput; Polar; Coding (social sciences); Bit error rate; Parity bit; Computer engineering; Telecommunications; Mathematics; Statistics; Physics; Wireless","score_opus":0.03388292182735758,"score_gpt":0.311307947499687,"score_spread":0.2774250256723294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601496744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021044936,0.00055709615,0.9703537,0.00016929318,0.00007652899,0.0001187968,0.00019800932,0.0022414671,0.005240099],"genre_scores_gemma":[0.24335037,0.00082890014,0.7464195,0.00028420685,0.0001180664,0.00021871802,0.00072777283,0.00017114835,0.007881298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.00008839136,0.00003295889,0.00005277374,0.0002587695,0.000051238974],"domain_scores_gemma":[0.9991146,0.0003236859,0.00012129172,0.00014066893,0.00026941017,0.000030430261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049492915,0.00062106596,0.00040841865,0.0009062816,0.0005277422,0.0008416726,0.0009127342,0.00048251502,0.0028920854],"category_scores_gemma":[0.0017542981,0.00026273608,0.00030032845,0.0008724549,0.0005208056,0.0008594172,0.00078181666,0.0008915111,0.0017966434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007116024,0.00011621212,0.0012288924,0.00043654398,0.00006768818,0.00039009744,0.00031713155,0.13933843,0.20703466,0.0834044,0.010270982,0.55668336],"study_design_scores_gemma":[0.000118441145,0.00033630154,0.00056863675,0.00008118114,0.000041023024,0.0005972866,0.000048988688,0.7891734,0.16680324,0.015527086,0.026625352,0.00007904191],"about_ca_topic_score_codex":0.0020254597,"about_ca_topic_score_gemma":0.004290972,"teacher_disagreement_score":0.0028920854,"about_ca_system_score_codex":0.00077802705,"about_ca_system_score_gemma":0.0014137654,"threshold_uncertainty_score":0.009674966},"labels":[],"label_agreement":null},{"id":"W2608866305","doi":"10.1109/glocom.2017.8254146","title":"Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Polynomial ring; Polynomial expansion; Algorithm; Applied mathematics; Interval (graph theory); Polynomial; Polar; Discrete mathematics; Computer science; Combinatorics; Mathematical analysis","score_opus":0.023623023834663644,"score_gpt":0.31037340697809274,"score_spread":0.2867503831434291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608866305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015716381,0.00014691964,0.98045236,0.00008617445,0.00002178902,0.000024241686,0.000020107547,0.00008284717,0.0034491846],"genre_scores_gemma":[0.48376507,0.0007439391,0.50849634,0.00023310324,0.00016045907,0.00026952822,0.00014266543,0.0002502363,0.005938642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989139,0.00035514744,0.000043835098,0.00018770402,0.00036748277,0.00013197536],"domain_scores_gemma":[0.99705315,0.0017979451,0.00022268559,0.00047484293,0.00033147226,0.000119866316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015944738,0.0006041517,0.0005241867,0.0012024478,0.0007356461,0.0012329234,0.0010496996,0.000753266,0.0023089733],"category_scores_gemma":[0.007255287,0.0004597268,0.00075514615,0.0007576589,0.0029779912,0.0025872607,0.001766421,0.0022574896,0.0005987438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024492076,0.000012066446,0.0002854995,0.000035151636,0.000005180388,0.000057155197,0.0001613226,0.0333779,0.0039470107,0.94960314,0.00028051276,0.012210576],"study_design_scores_gemma":[0.000020621232,0.000093039096,0.00016672221,0.000041396557,0.00001023289,0.00023596588,0.00006818834,0.43902087,0.0084117735,0.5467793,0.0051148874,0.000037178444],"about_ca_topic_score_codex":0.00051274546,"about_ca_topic_score_gemma":0.00037126843,"teacher_disagreement_score":0.0023089733,"about_ca_system_score_codex":0.0008383169,"about_ca_system_score_gemma":0.00069392216,"threshold_uncertainty_score":0.008432448},"labels":[],"label_agreement":null},{"id":"W2610741500","doi":"10.1109/wcncw.2017.7919044","title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Algorithm; Node (physics); Computer science; Polar; Polar code; List decoding; Set (abstract data type); Code (set theory); Error detection and correction; Word error rate; Sequential decoding; Concatenated error correction code; Block code; Physics; Speech recognition","score_opus":0.02894424314882754,"score_gpt":0.3113803890463912,"score_spread":0.28243614589756366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610741500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02945948,0.0003442503,0.962863,0.00016162684,0.000056766934,0.0001030659,0.00017960019,0.0010164719,0.005815715],"genre_scores_gemma":[0.37792453,0.0007856838,0.6118198,0.0002019759,0.00007005896,0.00015586782,0.0008866995,0.00014672271,0.008008703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880457,0.00028182633,0.00005564891,0.000094114694,0.0006441233,0.00011967617],"domain_scores_gemma":[0.9962907,0.0014422802,0.00032322443,0.0006045093,0.0012747884,0.000064506385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008997524,0.00077518594,0.0005920065,0.0010255685,0.0005536935,0.0010855901,0.00091936666,0.00048766902,0.002316545],"category_scores_gemma":[0.004841397,0.0002625618,0.00043906772,0.0010293336,0.00071382534,0.00124987,0.00097297766,0.00088165904,0.0016398756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065921975,0.00009278866,0.0022402473,0.0004273834,0.000072860246,0.0006687017,0.00039159873,0.48391658,0.09540723,0.08334295,0.005664157,0.3271162],"study_design_scores_gemma":[0.000054440647,0.00019556838,0.0003369569,0.000038013855,0.000024879408,0.00045012546,0.000045783807,0.9083534,0.07107054,0.011896183,0.007490667,0.000043362867],"about_ca_topic_score_codex":0.0033564684,"about_ca_topic_score_gemma":0.0050379373,"teacher_disagreement_score":0.0033564684,"about_ca_system_score_codex":0.0007748068,"about_ca_system_score_gemma":0.0023902378,"threshold_uncertainty_score":0.0077495575},"labels":[],"label_agreement":null},{"id":"W2611384886","doi":"10.1109/lcomm.2017.2748940","title":"Blind Detection With Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Decodes; False alarm; Real-time computing; Constraint (computer-aided design); Latency (audio); Identifier; Error detection and correction; Algorithm; Wireless; Set (abstract data type); Computer network; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.0600659378126206,"score_gpt":0.3191707891389228,"score_spread":0.2591048513263022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611384886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007958101,0.0006087596,0.9870206,0.00012225722,0.000084207226,0.000051122504,0.000062531195,0.00024091505,0.0038515525],"genre_scores_gemma":[0.41430813,0.0015002491,0.57459503,0.00046780152,0.00014260529,0.00022020268,0.00024303072,0.0001062731,0.008416678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806875,0.0006555817,0.00008603823,0.00031866296,0.00064673764,0.00022428313],"domain_scores_gemma":[0.99654454,0.0016429643,0.00038167,0.0005627773,0.00079501886,0.00007298874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249754,0.0011331728,0.0006970788,0.0011227807,0.0006584768,0.0017137097,0.0006330684,0.0012504566,0.0022290822],"category_scores_gemma":[0.008292849,0.00034712718,0.00036598337,0.0014843125,0.0013909917,0.0018581871,0.0017640246,0.0012077373,0.0015909388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018567871,0.00011014793,0.001783682,0.00054667454,0.00009124942,0.00046175157,0.0003926148,0.21112621,0.087226644,0.36025634,0.0052919714,0.33085585],"study_design_scores_gemma":[0.00009586252,0.0003287802,0.00036921713,0.00011785636,0.000047609785,0.0010350853,0.00007663613,0.7763378,0.078387275,0.12631702,0.016767794,0.00011905507],"about_ca_topic_score_codex":0.001135535,"about_ca_topic_score_gemma":0.00073965825,"teacher_disagreement_score":0.0022290822,"about_ca_system_score_codex":0.00061671174,"about_ca_system_score_gemma":0.0011445001,"threshold_uncertainty_score":0.0074570775},"labels":[],"label_agreement":null},{"id":"W2614053718","doi":"10.23919/date.2017.7927069","title":"Energy efficient stochastic computing with Sobol sequences","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sobol sequence; Stochastic computing; Sequence (biology); Pseudorandom binary sequence; Computer science; Shift register; Pseudorandom number generator; Energy (signal processing); Algorithm; Efficient energy use; Computation; Binary number; Parallel computing; Mathematics; Arithmetic; Monte Carlo method; Statistics; Engineering; Telecommunications; Electrical engineering","score_opus":0.018801363157653316,"score_gpt":0.2680878117081027,"score_spread":0.24928644855044937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614053718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14135695,0.0007383455,0.84747505,0.00036753854,0.00007691118,0.000054054664,0.000058204227,0.00060350547,0.009269538],"genre_scores_gemma":[0.8502788,0.0004034962,0.14595516,0.00014171586,0.00003319118,0.00006191976,0.00007505128,0.00006212934,0.0029886554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996779,0.0000682361,0.000020704174,0.00003696868,0.00015456312,0.000041636853],"domain_scores_gemma":[0.9994524,0.00025686092,0.00006933601,0.00009661282,0.00009854766,0.00002619816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222014,0.00023805982,0.00030921766,0.0003928727,0.00022728098,0.00054709276,0.0004051663,0.00036277733,0.0013342224],"category_scores_gemma":[0.0015545498,0.00012505816,0.00014105743,0.00041605183,0.00053401064,0.0008051574,0.000490217,0.0005171157,0.0003762586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004304714,0.00008529917,0.00090071966,0.00034033644,0.0000355532,0.00030776422,0.00017472642,0.2081135,0.1494576,0.45909733,0.0013981173,0.17965859],"study_design_scores_gemma":[0.00003840516,0.0002772713,0.000255304,0.000053590928,0.000013033356,0.00023931362,0.000035678357,0.80528593,0.091293275,0.09440682,0.008066732,0.000034722285],"about_ca_topic_score_codex":0.00025976877,"about_ca_topic_score_gemma":0.0004936123,"teacher_disagreement_score":0.0013342224,"about_ca_system_score_codex":0.0003127118,"about_ca_system_score_gemma":0.000483044,"threshold_uncertainty_score":0.004463434},"labels":[],"label_agreement":null},{"id":"W2615444200","doi":"10.1109/sips.2017.8109987","title":"Efficient bit-channel reliability computation for multi-mode polar code encoders and decoders","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Encoder; Polar code; Reliability (semiconductor); Algorithm; Computation; Code (set theory); Channel (broadcasting); Low-density parity-check code; Decoding methods; Code rate; Parity bit; Computer engineering; Error detection and correction; Set (abstract data type); Telecommunications","score_opus":0.06047249763726605,"score_gpt":0.3589647498871124,"score_spread":0.2984922522498464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615444200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057504475,0.00021971443,0.9388772,0.000066733235,0.000021440328,0.000024734027,0.00007531681,0.0011972395,0.0020131571],"genre_scores_gemma":[0.76486516,0.00016908791,0.23288602,0.00003358671,0.000015132265,0.000056732497,0.00013322383,0.00010124198,0.0017398803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00007046827,0.000016962782,0.000041533203,0.00013586532,0.000039860734],"domain_scores_gemma":[0.9992391,0.000291679,0.000070836104,0.00016966919,0.000208802,0.000019870673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039340247,0.00040474764,0.00042345462,0.00045169907,0.00026162123,0.0006779068,0.0006367887,0.00031761324,0.0019941565],"category_scores_gemma":[0.001833606,0.00020714983,0.00026450047,0.00033014297,0.0003043352,0.0008548957,0.0004571821,0.00042407835,0.00058256596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004402856,0.0000476774,0.0016471975,0.00022179168,0.00004581122,0.00018342864,0.00019828865,0.72380453,0.054576766,0.02969868,0.0016707708,0.18746474],"study_design_scores_gemma":[0.0000061398227,0.00002457623,0.00011873,0.0000066930716,0.0000057688417,0.000042033647,0.000010682144,0.9848934,0.011816549,0.0025331783,0.0005371432,0.0000052094983],"about_ca_topic_score_codex":0.0017758539,"about_ca_topic_score_gemma":0.0027435736,"teacher_disagreement_score":0.0019941565,"about_ca_system_score_codex":0.0005822226,"about_ca_system_score_gemma":0.0009381097,"threshold_uncertainty_score":0.0066711307},"labels":[],"label_agreement":null},{"id":"W2619905542","doi":"10.1109/lcomm.2017.2707553","title":"Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Low-density parity-check code; Elementary proof; Mathematics; Elementary function; Computer science; Decoding methods; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.03360030439567426,"score_gpt":0.29009017800646447,"score_spread":0.25648987361079023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619905542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3569077,0.00747659,0.5884194,0.0027939866,0.000223118,0.00018847598,0.0016835906,0.0011118508,0.041195273],"genre_scores_gemma":[0.9254715,0.0026115598,0.06730787,0.00029011018,0.000251466,0.000218461,0.0009045393,0.0002478372,0.0026966755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982994,0.00030423608,0.00012203651,0.0003241187,0.0006542949,0.0002960033],"domain_scores_gemma":[0.9577822,0.03657954,0.00137745,0.0023068397,0.0012940969,0.0006599026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018505746,0.001123338,0.0010883859,0.001591223,0.0010328133,0.0020943098,0.0015892545,0.0012832523,0.0022595893],"category_scores_gemma":[0.021113886,0.0006019945,0.00083842914,0.0011418719,0.0022489533,0.003132637,0.002269418,0.0025326142,0.00038197133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094619615,0.0003480305,0.014534376,0.0014426921,0.00024260694,0.0014040677,0.00075280695,0.46709678,0.082767315,0.32320973,0.008383648,0.09887175],"study_design_scores_gemma":[0.000043676762,0.00015705089,0.0036035655,0.00016987453,0.000078496734,0.00088924915,0.00016610787,0.72365093,0.029033998,0.23895635,0.0031683852,0.00008229016],"about_ca_topic_score_codex":0.0006876594,"about_ca_topic_score_gemma":0.0010890124,"teacher_disagreement_score":0.0022595893,"about_ca_system_score_codex":0.0013052716,"about_ca_system_score_gemma":0.0008880384,"threshold_uncertainty_score":0.009786904},"labels":[],"label_agreement":null},{"id":"W2625124615","doi":"10.1109/jlt.2017.2716373","title":"Low-Complexity Soft-Decision Concatenated LDGM-Staircase FEC for High-Bit-Rate Fiber-Optic Communication","year":2017,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coding gain; Concatenated error correction code; Decoding methods; Constant-weight code; Forward error correction; Computer science; Algorithm; Systematic code; Bit error rate; Code rate; Computational complexity theory; Code (set theory); Cyclic code; Theoretical computer science; Block code","score_opus":0.03422018111336399,"score_gpt":0.31315127803762155,"score_spread":0.27893109692425755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625124615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16153173,0.0004812934,0.83284104,0.00024605455,0.000052402633,0.000098482145,0.000095961106,0.0005959853,0.0040569995],"genre_scores_gemma":[0.7964816,0.00014426213,0.20085068,0.00006430198,0.000016428834,0.000043048323,0.00008465872,0.000016911716,0.0022981495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.00009777308,0.000023633798,0.00005591669,0.0002808392,0.000049697395],"domain_scores_gemma":[0.99905795,0.00032135737,0.00016145679,0.0001372043,0.00028207374,0.000039986997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036639004,0.00050050876,0.0002964253,0.00046021707,0.00041630276,0.00045563807,0.00068438496,0.00052161515,0.00082410075],"category_scores_gemma":[0.0013793001,0.00016806168,0.0002311811,0.00049999164,0.00037629873,0.0005248014,0.00045720147,0.0005197057,0.00028158163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057261426,0.00020562866,0.0021751383,0.00021228059,0.00009316251,0.0005753172,0.00024306626,0.48597753,0.26864007,0.023876695,0.0012492306,0.21617931],"study_design_scores_gemma":[0.000019846044,0.00021549573,0.0004811211,0.00001929956,0.000023937166,0.00026597054,0.000012980473,0.92101425,0.07349275,0.0027448246,0.0016817906,0.000027728434],"about_ca_topic_score_codex":0.002301126,"about_ca_topic_score_gemma":0.007333212,"teacher_disagreement_score":0.002301126,"about_ca_system_score_codex":0.0008735013,"about_ca_system_score_gemma":0.0009534091,"threshold_uncertainty_score":0.006337762},"labels":[],"label_agreement":null},{"id":"W2734081301","doi":"10.1109/ismvl.2017.50","title":"On the Fault Tolerance of Stochastic Decoders","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Low-density parity-check code; Decoding methods; Soft error; Fault tolerance; Reliability engineering; Bit error rate; Stochastic process; Context (archaeology); Power consumption; Power (physics); Algorithm; Distributed computing; Electronic engineering; Engineering; Mathematics","score_opus":0.02877504986994838,"score_gpt":0.2903342407118874,"score_spread":0.261559190841939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734081301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22338621,0.00086364325,0.7667709,0.0005456087,0.00010658956,0.00003882549,0.0000604138,0.0006251973,0.0076025752],"genre_scores_gemma":[0.9781003,0.00034533464,0.019302996,0.00011954757,0.00005074249,0.00003186912,0.000038589595,0.000067690045,0.0019429262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986902,0.00036832562,0.00006251609,0.00016309394,0.00048292504,0.00023297495],"domain_scores_gemma":[0.9946662,0.0033991518,0.00061981747,0.00060124125,0.0006104176,0.0001032137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964448,0.00045413407,0.00066976075,0.00056483404,0.000590236,0.0008364318,0.000758037,0.00097535085,0.0009868419],"category_scores_gemma":[0.009188293,0.00030100465,0.0005527794,0.0003924477,0.001566871,0.001165087,0.00084525184,0.00082383305,0.0002357882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006926179,0.00001783757,0.00047345203,0.00004134154,0.000023543977,0.000075930395,0.000082291364,0.91611487,0.009128155,0.06641619,0.00024869235,0.007308404],"study_design_scores_gemma":[0.000009481546,0.000059365044,0.00010407887,0.000008480961,0.000009263487,0.00006209934,0.000011679853,0.9759783,0.0048760623,0.018284418,0.0005851801,0.000011490016],"about_ca_topic_score_codex":0.002506945,"about_ca_topic_score_gemma":0.0010366514,"teacher_disagreement_score":0.002506945,"about_ca_system_score_codex":0.0010735241,"about_ca_system_score_gemma":0.00078289397,"threshold_uncertainty_score":0.007789016},"labels":[],"label_agreement":null},{"id":"W2734950220","doi":"10.1109/tit.2017.2726064","title":"Fast Decoding of Expander Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Clemson University","keywords":"Expander graph; Decoding methods; List decoding; Mathematics; Linear code; Sequential decoding; Berlekamp–Welch algorithm; Combinatorics; Bipartite graph; Expander code; Concatenated error correction code; Algorithm; Block code; Discrete mathematics; Vertex (graph theory); Tanner graph; Graph","score_opus":0.01820089463018002,"score_gpt":0.27448185760968963,"score_spread":0.2562809629795096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734950220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04014843,0.0004925555,0.95051235,0.00032031102,0.00008851091,0.000088073306,0.00034015425,0.0016057296,0.0064038937],"genre_scores_gemma":[0.4060489,0.0009694169,0.57439107,0.0004953943,0.0002145852,0.00033350097,0.0014554338,0.0004893247,0.015602383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978459,0.0003976929,0.00010795748,0.00046384777,0.00085506646,0.00032949974],"domain_scores_gemma":[0.9934143,0.0036594456,0.00045349365,0.0012461519,0.0011070056,0.00011961031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010530334,0.0010006994,0.0012498326,0.0011408046,0.00063618453,0.001158824,0.00091681065,0.0012359415,0.0029548807],"category_scores_gemma":[0.009770764,0.00049152924,0.0006564551,0.0012727318,0.00090594875,0.0024004984,0.0022215587,0.0021774098,0.001731608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010778875,0.00013939392,0.0016216987,0.000402902,0.00011467226,0.0007970433,0.00063070736,0.30962512,0.0813033,0.25418055,0.0128471935,0.33725953],"study_design_scores_gemma":[0.0000713189,0.00010174279,0.00043358436,0.000056258104,0.00002474244,0.00037426568,0.000057727993,0.81284255,0.040313154,0.13780473,0.007871339,0.000048549904],"about_ca_topic_score_codex":0.0022855394,"about_ca_topic_score_gemma":0.0026234577,"teacher_disagreement_score":0.0029548807,"about_ca_system_score_codex":0.0010485847,"about_ca_system_score_gemma":0.0013201395,"threshold_uncertainty_score":0.009885013},"labels":[],"label_agreement":null},{"id":"W2740106180","doi":"10.1109/cwit.2017.7994822","title":"On the design of good LDPC codes with joint genetic algorithm and linear programming optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Low-density parity-check code; Computer science; Algorithm; Forward error correction; Decoding methods; Error detection and correction; EXIT chart; Coding (social sciences); Fading; Linear programming; Turbo code; Reliability (semiconductor); Concatenated error correction code; Mathematics; Block code; Statistics","score_opus":0.03601971333674957,"score_gpt":0.25883650433256505,"score_spread":0.22281679099581547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740106180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022794208,0.00028260017,0.97427917,0.00015896306,0.000013319576,0.000045296383,0.000016776006,0.00009471112,0.0023150977],"genre_scores_gemma":[0.45624703,0.00061906193,0.539797,0.00014752983,0.00002788389,0.0003148945,0.00007010117,0.00008010554,0.002696435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955827,0.0002082358,0.000015160035,0.0000694662,0.00010924692,0.000039664952],"domain_scores_gemma":[0.9988686,0.0008128646,0.00011306773,0.000039578277,0.00014054956,0.000025427418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980293,0.000861164,0.0007645735,0.0007520843,0.0003458401,0.00068377535,0.00052058476,0.00093504763,0.00070507894],"category_scores_gemma":[0.0034777613,0.00048585486,0.0004577259,0.0008407167,0.0009387374,0.0006273683,0.0006186067,0.00079027255,0.00015671599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018580125,0.000016933911,0.00018419499,0.000024789253,0.000011410425,0.000019281271,0.000026547117,0.9778578,0.0010758588,0.0074655516,0.00014241293,0.013156719],"study_design_scores_gemma":[0.0000036358135,0.000013809029,0.000024997722,0.0000037305347,0.0000022969748,0.0000048557167,0.000002972441,0.99779534,0.00027505087,0.0017433026,0.00012755618,0.0000023964546],"about_ca_topic_score_codex":0.0038755748,"about_ca_topic_score_gemma":0.0029252798,"teacher_disagreement_score":0.0038755748,"about_ca_system_score_codex":0.00076810876,"about_ca_system_score_gemma":0.0014080161,"threshold_uncertainty_score":0.007706046},"labels":[],"label_agreement":null},{"id":"W2740333227","doi":"10.1109/cwit.2017.7994816","title":"Robust LT designs in binary erasures","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Luby transform code; Erasure; Computer science; Code (set theory); Erasure code; Code rate; Algorithm; Online codes; Raptor code; Binary number; Prefix code; Binary code; Theoretical computer science; Linear code; Discrete mathematics; Decoding methods; Mathematics; Block code; Arithmetic","score_opus":0.12361272626860623,"score_gpt":0.31169791761164006,"score_spread":0.18808519134303384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740333227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036565304,0.00041791538,0.9597592,0.0001424774,0.000043357526,0.00003254239,0.000046060897,0.0003609964,0.0026320503],"genre_scores_gemma":[0.8862212,0.00029305447,0.110018544,0.00017453996,0.000044553195,0.00010707721,0.00006441009,0.000094351046,0.0029822334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891233,0.00038398226,0.000052589396,0.0001699962,0.00031581096,0.00016521095],"domain_scores_gemma":[0.99716055,0.0014182572,0.0005318723,0.00031381968,0.00045722543,0.00011839562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015485885,0.00068034715,0.00064986106,0.00059721153,0.00037247007,0.00083537877,0.000677693,0.00088695734,0.0016620852],"category_scores_gemma":[0.0064197183,0.00042591462,0.0003976803,0.00041365766,0.0012005327,0.0011726092,0.0010788492,0.0007875019,0.00039396915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028846608,0.000044556185,0.0007023862,0.00017511893,0.000059188802,0.0001802264,0.00023977616,0.7697284,0.020131266,0.1423803,0.0010593903,0.06501096],"study_design_scores_gemma":[0.000022148033,0.00011769684,0.00013866703,0.000024697623,0.000011190934,0.000056235313,0.000016991904,0.9653435,0.007118219,0.025708657,0.0014211317,0.000020878088],"about_ca_topic_score_codex":0.0012717891,"about_ca_topic_score_gemma":0.0009213796,"teacher_disagreement_score":0.0016620852,"about_ca_system_score_codex":0.0011387955,"about_ca_system_score_gemma":0.00082912337,"threshold_uncertainty_score":0.008262575},"labels":[],"label_agreement":null},{"id":"W2743033419","doi":"10.1109/newcas.2017.8010172","title":"Virtualization of the LTE physical layer symbol processing with GPUs","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Virtualization; Computer science; Physical layer; Frame (networking); Layer (electronics); Telecommunications link; Wireless; Process (computing); Full virtualization; Embedded system; Computer network; Operating system; Cloud computing","score_opus":0.020838873617498543,"score_gpt":0.28914633707341364,"score_spread":0.2683074634559151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743033419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819469,0.0012717175,0.3891623,0.0005461616,0.00033901207,0.00016337795,0.00025747425,0.005452233,0.02086071],"genre_scores_gemma":[0.9450104,0.00022858162,0.05152994,0.00009383771,0.000025063979,0.000040590425,0.00016671604,0.0001320043,0.0027728947],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967146,0.00007572732,0.000019704003,0.000037783677,0.00010080404,0.000094545205],"domain_scores_gemma":[0.99961096,0.000083952145,0.00002452038,0.00014041654,0.00009649572,0.000043584052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021865591,0.0004551766,0.0003622076,0.00024839796,0.00037053792,0.0010541616,0.0008652989,0.0002520497,0.0020311137],"category_scores_gemma":[0.0011105948,0.00015657693,0.00025584758,0.00031238343,0.00032060593,0.00067116175,0.0006789137,0.000694992,0.00037356745],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001779593,0.000373457,0.011691457,0.000560819,0.00028460156,0.0011485484,0.0008682287,0.3032351,0.3394349,0.07377907,0.01910587,0.24773845],"study_design_scores_gemma":[0.000060401213,0.00030840494,0.002396994,0.00003559996,0.000067825014,0.00028105293,0.00010084082,0.84807897,0.11561831,0.004169538,0.028844595,0.000037363487],"about_ca_topic_score_codex":0.004260773,"about_ca_topic_score_gemma":0.0031986618,"teacher_disagreement_score":0.004260773,"about_ca_system_score_codex":0.00078057457,"about_ca_system_score_gemma":0.0008025492,"threshold_uncertainty_score":0.008471966},"labels":[],"label_agreement":null},{"id":"W2744931845","doi":"10.1109/isit.2017.8006817","title":"Complexity-optimized concatenated LDGM-staircase codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concatenated error correction code; Decoding methods; Computer science; Algorithm; Constant-weight code; Coding gain; Systematic code; Linear code; Theoretical computer science; Code (set theory); Coding (social sciences); Block code; Mathematics; Code rate; Statistics","score_opus":0.0753481072604781,"score_gpt":0.32932663456123606,"score_spread":0.253978527300758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744931845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13317017,0.000427756,0.8589637,0.00022614967,0.000056481433,0.000089678855,0.00023878673,0.0005445342,0.006282712],"genre_scores_gemma":[0.79325616,0.000187277,0.20263122,0.0000689463,0.000019210825,0.00007558626,0.00019578192,0.000035160898,0.0035306562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994098,0.00013263697,0.0000323416,0.00007589604,0.00026358647,0.00008584071],"domain_scores_gemma":[0.998858,0.00034022704,0.00017853054,0.00018297424,0.0003841544,0.00005618918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041923486,0.00056819397,0.00037508822,0.0004964413,0.00034881372,0.00065295584,0.0007003643,0.0005604209,0.0012023024],"category_scores_gemma":[0.0018720921,0.00017558629,0.00027355575,0.0008231547,0.00044935828,0.00056326506,0.00060708425,0.0005433995,0.00038552465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003468506,0.00005458389,0.0008881324,0.00010460291,0.000049071536,0.00021632781,0.00009037687,0.83423454,0.06533179,0.02773129,0.0010688286,0.069883555],"study_design_scores_gemma":[0.000018755776,0.000103828614,0.00024336293,0.000011283066,0.000013962002,0.000097914104,0.0000096040285,0.9697202,0.024176296,0.0044716946,0.0011148112,0.00001826988],"about_ca_topic_score_codex":0.0030765045,"about_ca_topic_score_gemma":0.0062820534,"teacher_disagreement_score":0.0030765045,"about_ca_system_score_codex":0.00096098485,"about_ca_system_score_gemma":0.0013597575,"threshold_uncertainty_score":0.0069724917},"labels":[],"label_agreement":null},{"id":"W2745045892","doi":"10.1109/isit.2017.8006963","title":"High-dimensional coded matrix multiplication","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Matrix multiplication; Computer science; Decoding methods; Computation; Backup; Redundancy (engineering); Low-density parity-check code; Multiplication (music); Algorithm; Theoretical computer science; Parallel computing; Mathematics; Combinatorics","score_opus":0.022172116608426298,"score_gpt":0.309881385354015,"score_spread":0.2877092687455887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745045892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024091141,0.0002854307,0.96459055,0.00029233829,0.00011489979,0.00006408629,0.00009045842,0.00036572234,0.010105356],"genre_scores_gemma":[0.52300096,0.00038239357,0.46768096,0.00019571232,0.00013943855,0.00017712524,0.00016365481,0.000066317465,0.008193552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995161,0.000104779145,0.000019981437,0.000060955488,0.00024538135,0.000052749107],"domain_scores_gemma":[0.99881727,0.000370644,0.000093009556,0.0003663985,0.00030307044,0.000049588398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043401177,0.0004063954,0.0003332721,0.00043837202,0.00042873697,0.0007345606,0.00076369866,0.0005115735,0.0030923001],"category_scores_gemma":[0.0022120136,0.00012985637,0.00021815406,0.00077268766,0.00083150883,0.0009001331,0.0007968833,0.000692508,0.00073332194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025215,0.000072777766,0.0005089341,0.00021328792,0.000034669883,0.00022235021,0.00020967642,0.19658569,0.04666934,0.6057312,0.006737088,0.1427628],"study_design_scores_gemma":[0.000030423626,0.000101929465,0.00014686496,0.000024969126,0.000009715364,0.00017002386,0.000020659782,0.8704601,0.016716179,0.10027629,0.012014513,0.000028390874],"about_ca_topic_score_codex":0.00080039166,"about_ca_topic_score_gemma":0.0012850931,"teacher_disagreement_score":0.0030923001,"about_ca_system_score_codex":0.0006341917,"about_ca_system_score_gemma":0.0007842126,"threshold_uncertainty_score":0.010344744},"labels":[],"label_agreement":null},{"id":"W2745334675","doi":"10.1109/allerton.2017.8262771","title":"On error-correction performance and implementation of polar code list decoders for 5G","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Low-density parity-check code; Polar code; Error detection and correction; Polar; Algorithm; Energy consumption; Throughput; Computer engineering; Code (set theory); Implementation; Latency (audio); Set (abstract data type); Wireless; Telecommunications; Electrical engineering; Engineering","score_opus":0.035539025609808504,"score_gpt":0.35484176765379394,"score_spread":0.31930274204398545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745334675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91073936,0.0038813574,0.06345325,0.00046938725,0.00011848071,0.00007482147,0.00065392954,0.001523788,0.019085716],"genre_scores_gemma":[0.9754351,0.00080875686,0.020279657,0.00008767472,0.000024731395,0.000025968851,0.0005066475,0.00009710262,0.0027343915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988422,0.00024689324,0.00006528028,0.00015080151,0.0005318687,0.00016306169],"domain_scores_gemma":[0.9974656,0.001351241,0.00022089506,0.00021665893,0.000714801,0.000030800828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491878,0.0006768149,0.000394775,0.00087616034,0.00034396615,0.0007194061,0.0007725835,0.0005157332,0.003414789],"category_scores_gemma":[0.0037223275,0.00013888448,0.00022133427,0.0010336457,0.0003049056,0.0010520538,0.00033847117,0.00031321665,0.00086923275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002038269,0.00038084094,0.012979769,0.0008598719,0.00023661794,0.0004125565,0.00031339942,0.4767289,0.18870929,0.009191092,0.0042891786,0.30386022],"study_design_scores_gemma":[0.000061146675,0.001174314,0.0055730375,0.00009786188,0.00012941245,0.00036781753,0.00013530347,0.6483766,0.33749622,0.0013051031,0.005232839,0.000050334445],"about_ca_topic_score_codex":0.0038084688,"about_ca_topic_score_gemma":0.0052403626,"teacher_disagreement_score":0.0038084688,"about_ca_system_score_codex":0.0009620778,"about_ca_system_score_gemma":0.00081557926,"threshold_uncertainty_score":0.011423588},"labels":[],"label_agreement":null},{"id":"W2750544224","doi":"10.1109/lcomm.2017.2740305","title":"Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Berlekamp–Welch algorithm; Algorithm; Polar; Latency (audio); Arithmetic; Concatenated error correction code; Telecommunications; Block code; Mathematics","score_opus":0.054219544283517496,"score_gpt":0.3318252000715529,"score_spread":0.2776056557880354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750544224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1273107,0.00040434007,0.85771143,0.00028446584,0.00019261969,0.00014667952,0.000095987125,0.001092231,0.01276158],"genre_scores_gemma":[0.5446912,0.000581103,0.44330287,0.00019959078,0.000066364584,0.00011359734,0.00024668913,0.0001541749,0.010644403],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996308,0.00006793408,0.00003083997,0.000042602565,0.00016378493,0.000064010106],"domain_scores_gemma":[0.99839693,0.00048699963,0.0001519884,0.00032526796,0.00057007774,0.000068666785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058549916,0.0007517425,0.00044674697,0.00062995485,0.00070396374,0.000921758,0.00070487737,0.0005702668,0.0024264858],"category_scores_gemma":[0.0030299618,0.00031438313,0.00030835127,0.0003904918,0.0007904713,0.0014291559,0.0010105695,0.0008838835,0.0012432951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012116239,0.00021227523,0.003123742,0.0004143945,0.000080092235,0.0007590755,0.000610709,0.09945518,0.41151202,0.10507818,0.002712205,0.37483057],"study_design_scores_gemma":[0.000086378575,0.0003633859,0.0005637256,0.00006197496,0.000053166437,0.0009163364,0.00012507424,0.40240836,0.56404805,0.019614382,0.011686086,0.00007304183],"about_ca_topic_score_codex":0.0014800429,"about_ca_topic_score_gemma":0.0031568334,"teacher_disagreement_score":0.0024264858,"about_ca_system_score_codex":0.0004849025,"about_ca_system_score_gemma":0.0016755658,"threshold_uncertainty_score":0.008117378},"labels":[],"label_agreement":null},{"id":"W2753878108","doi":"10.1109/jetcas.2017.2745704","title":"PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Emerging and Selected Topics in Circuits and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; École de Technologie Supérieure","funders":"","keywords":"Decoding methods; Application-specific integrated circuit; Throughput; CMOS; Clock rate; Polar code; Energy (signal processing); Chip","score_opus":0.04165363227286917,"score_gpt":0.30996181697602526,"score_spread":0.2683081847031561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753878108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42785853,0.005726288,0.3799646,0.0027396288,0.0013948481,0.0006554493,0.0034476332,0.008777063,0.1694359],"genre_scores_gemma":[0.8455862,0.001429066,0.1272825,0.00076128443,0.000113139824,0.00023107657,0.0011716087,0.00026913165,0.023156038],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996793,0.000043729844,0.000010958023,0.000053440577,0.0001632452,0.000049242662],"domain_scores_gemma":[0.99972874,0.000049479768,0.000055184617,0.000033455366,0.00011154011,0.000021634549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028785953,0.00055626646,0.00032551124,0.0004299968,0.00031055632,0.0007548206,0.0006796272,0.00059700524,0.0034971219],"category_scores_gemma":[0.0005363743,0.00017425747,0.00017316727,0.0003496229,0.0003894117,0.00065356446,0.00028057882,0.00054444,0.0019296086],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010935337,0.00025213283,0.0027810747,0.0010578701,0.000110711895,0.0009671638,0.0005775865,0.018500207,0.7437243,0.04736187,0.039757922,0.14381571],"study_design_scores_gemma":[0.00019674546,0.0013310021,0.00133553,0.00014883938,0.00009410082,0.0012847916,0.00014962525,0.08345667,0.74153006,0.0035594543,0.16682719,0.000085867345],"about_ca_topic_score_codex":0.0012484138,"about_ca_topic_score_gemma":0.0021884805,"teacher_disagreement_score":0.0034971219,"about_ca_system_score_codex":0.0008582502,"about_ca_system_score_gemma":0.0008761249,"threshold_uncertainty_score":0.011699021},"labels":[],"label_agreement":null},{"id":"W2763873148","doi":"10.1109/tsp.2014.2347262","title":"A Scalable Successive-Cancellation Decoder for Polar Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Polar code; Scalability; Decoding methods; Field-programmable gate array; Polar; Code (set theory); Algorithm; Stratix; Turbo code; Computer engineering; Parallel computing; Computer hardware","score_opus":0.020923846957244002,"score_gpt":0.277401175074097,"score_spread":0.256477328116853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763873148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029421227,0.00030898763,0.9612288,0.0001543472,0.00011251294,0.00008174718,0.00016901715,0.0016843979,0.006838944],"genre_scores_gemma":[0.3115918,0.0005266353,0.67680776,0.0002500902,0.00011643065,0.00011442307,0.0005984737,0.00010964394,0.009884724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996928,0.000035449095,0.000016054284,0.00004727508,0.00017890379,0.000029501973],"domain_scores_gemma":[0.9995999,0.00010813816,0.00003137818,0.000059138023,0.0001821199,0.000019436238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029136395,0.00046024955,0.00035895145,0.00042325706,0.00034029322,0.0006048907,0.000680508,0.0003714844,0.0027063063],"category_scores_gemma":[0.000809204,0.00019886848,0.00028042076,0.00048399623,0.00029259603,0.00072274683,0.00057232205,0.0006921194,0.001138808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063382863,0.00011381449,0.00068987225,0.00028437114,0.000060777464,0.00037910676,0.00015135495,0.11821623,0.4447156,0.055647526,0.007897339,0.37121016],"study_design_scores_gemma":[0.00008073914,0.00025989593,0.000290902,0.00002780248,0.000039089762,0.00031183226,0.000027595037,0.79689914,0.1796052,0.0079452535,0.014479382,0.000033085635],"about_ca_topic_score_codex":0.0016840277,"about_ca_topic_score_gemma":0.003840918,"teacher_disagreement_score":0.0027063063,"about_ca_system_score_codex":0.00049678684,"about_ca_system_score_gemma":0.0011577096,"threshold_uncertainty_score":0.009053528},"labels":[],"label_agreement":null},{"id":"W2765645554","doi":"10.1109/lcomm.2017.2766223","title":"An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Low-density parity-check code; Linear programming; Decoding methods; Polytope; Mathematics; Projection (relational algebra); Computer science; Computational complexity theory; Euclidean distance; Combinatorics; Artificial intelligence","score_opus":0.0692624273249454,"score_gpt":0.37085774638206986,"score_spread":0.30159531905712444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765645554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012822982,0.00006233821,0.9977174,0.000056065102,0.000017265982,0.000024650384,0.000018400728,0.00016993847,0.00065155106],"genre_scores_gemma":[0.053000674,0.00016974578,0.9441545,0.00011056931,0.000044286073,0.00022409415,0.0001832114,0.00007690443,0.002035958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.0002210691,0.000041635696,0.000099920944,0.0002406606,0.000047941678],"domain_scores_gemma":[0.99906427,0.00046585334,0.00007316017,0.00012939186,0.00023261723,0.0000348039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011338087,0.0011086932,0.00092594884,0.00063072145,0.00056335813,0.000998702,0.00093562296,0.001155745,0.0025311185],"category_scores_gemma":[0.003392897,0.0004581028,0.0006697378,0.0009981546,0.0009806416,0.0010071314,0.0015421169,0.002326879,0.0011621536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016146615,0.00011311847,0.0004525207,0.00023220743,0.00006922619,0.00017424296,0.00018409097,0.51235384,0.011902529,0.06334094,0.0059920447,0.4050238],"study_design_scores_gemma":[0.000019743162,0.00005047467,0.000046392608,0.000014455954,0.000005817103,0.00006695798,0.000009808037,0.98488367,0.0032482191,0.009659881,0.0019820097,0.000012501295],"about_ca_topic_score_codex":0.0015402487,"about_ca_topic_score_gemma":0.0019949025,"teacher_disagreement_score":0.0025311185,"about_ca_system_score_codex":0.0005970345,"about_ca_system_score_gemma":0.0019731196,"threshold_uncertainty_score":0.008467436},"labels":[],"label_agreement":null},{"id":"W2766124948","doi":"10.1109/lcomm.2017.2767028","title":"Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code (set theory); Upper and lower bounds; Combinatorics; Computer science; Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.03862617650656103,"score_gpt":0.2988150922925174,"score_spread":0.2601889157859564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766124948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06238633,0.017131038,0.8670016,0.0027377808,0.0004559803,0.00016814924,0.0011044615,0.00090442935,0.048110235],"genre_scores_gemma":[0.71210504,0.012217445,0.25501332,0.0014665289,0.00076886726,0.00077563396,0.0021851726,0.000555835,0.014912245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956866,0.0007561982,0.00022553472,0.0006163452,0.0019890468,0.00072625285],"domain_scores_gemma":[0.98701537,0.009392015,0.00055252,0.0013711748,0.0013333649,0.000335625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022461775,0.0024376903,0.0018967206,0.0029066894,0.0015549021,0.0031126458,0.0023725596,0.0020923284,0.00585415],"category_scores_gemma":[0.021338983,0.0009751264,0.0009833182,0.002959896,0.0018466463,0.0058868504,0.0036852486,0.0054984037,0.0029184837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008557559,0.00034281932,0.0020411657,0.0014997728,0.00016554089,0.0005194373,0.00056461926,0.41940126,0.03683091,0.37094718,0.012073488,0.15475799],"study_design_scores_gemma":[0.000057054636,0.00014548669,0.0007324462,0.00025389376,0.000050764127,0.0003416126,0.000096993244,0.7259612,0.01676141,0.24320102,0.012294807,0.00010336839],"about_ca_topic_score_codex":0.0018718588,"about_ca_topic_score_gemma":0.0025492883,"teacher_disagreement_score":0.00585415,"about_ca_system_score_codex":0.003060149,"about_ca_system_score_gemma":0.0018529958,"threshold_uncertainty_score":0.022203028},"labels":[],"label_agreement":null},{"id":"W2766216077","doi":"10.1007/s11265-018-1430-3","title":"Fast and Flexible Software Polar List Decoders","year":2019,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; Agence Nationale de la Recherche","keywords":"Computer science; Decoding methods; Puncturing; Software; Soft-decision decoder; Coding (social sciences); Redundancy (engineering); Computer engineering; Algorithm; Throughput; Computer hardware; Wireless; Telecommunications; Operating system; Mathematics","score_opus":0.012473613175751378,"score_gpt":0.2494648621683075,"score_spread":0.2369912489925561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766216077","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017562874,0.00049983565,0.96667475,0.00026591856,0.0001949943,0.00009566497,0.00031272796,0.008197487,0.0061957864],"genre_scores_gemma":[0.268122,0.0005771928,0.70740706,0.00044080315,0.00025203606,0.00029067814,0.0011433209,0.0010642881,0.02070265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989961,0.00024104622,0.00006354432,0.00010099844,0.00046944214,0.00012885623],"domain_scores_gemma":[0.9975727,0.0009211641,0.00015027125,0.0005537191,0.00069749495,0.00010456444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273405,0.001055082,0.00071533024,0.0012980371,0.0008155789,0.0016877467,0.0014545975,0.0009877665,0.0108118635],"category_scores_gemma":[0.0032850294,0.00056783506,0.0004238203,0.0013425255,0.00050656544,0.0016091442,0.0021803405,0.0011022199,0.007740741],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017565172,0.00015358013,0.0012613066,0.00029552318,0.00009511665,0.0004317854,0.00022761055,0.047227807,0.090572484,0.07375551,0.019959154,0.7642636],"study_design_scores_gemma":[0.0003558684,0.0005003252,0.0008900643,0.00015402159,0.000100174264,0.0011144069,0.00012395911,0.7050239,0.19996406,0.047173504,0.044431612,0.0001680899],"about_ca_topic_score_codex":0.0015506484,"about_ca_topic_score_gemma":0.0037167754,"teacher_disagreement_score":0.0108118635,"about_ca_system_score_codex":0.00062915473,"about_ca_system_score_gemma":0.0016649535,"threshold_uncertainty_score":0.03616929},"labels":[],"label_agreement":null},{"id":"W2766305411","doi":"10.1109/jetcas.2017.2764421","title":"Memory-Efficient Polar Decoders","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Emerging and Selected Topics in Circuits and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Polar; Materials science; Electrical engineering; Electronic engineering; Physics; Engineering","score_opus":0.03062185756447545,"score_gpt":0.28877605967033304,"score_spread":0.2581542021058576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766305411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05409971,0.0012454608,0.92381746,0.0002036217,0.00016000263,0.00010597285,0.00038357716,0.0028940162,0.017090203],"genre_scores_gemma":[0.49238294,0.0015820573,0.48573768,0.0002890838,0.00007313779,0.000116248244,0.0009510449,0.00023341402,0.018634325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997869,0.000028740247,0.000018432776,0.000032109678,0.00010402742,0.000029742967],"domain_scores_gemma":[0.99956816,0.0001158036,0.000043950615,0.00006597706,0.00019291097,0.000013125891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020679046,0.000468617,0.00028068078,0.00060299743,0.0003018608,0.0006808891,0.0005511556,0.00038816914,0.00342219],"category_scores_gemma":[0.0009789291,0.00015176115,0.00021556267,0.00054562965,0.0002640268,0.0006549965,0.00040920006,0.0004368686,0.0016705943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008413853,0.00009801006,0.0014263216,0.0006552059,0.0000619101,0.0005800707,0.00020478993,0.12892738,0.3000576,0.077092275,0.008589131,0.48146582],"study_design_scores_gemma":[0.00008508188,0.0003035576,0.00047354135,0.000060200182,0.000053879477,0.00086712115,0.00008646105,0.5037932,0.45123112,0.010253799,0.03275116,0.000040808914],"about_ca_topic_score_codex":0.0012818328,"about_ca_topic_score_gemma":0.0024349738,"teacher_disagreement_score":0.00342219,"about_ca_system_score_codex":0.00037971837,"about_ca_system_score_gemma":0.0008646144,"threshold_uncertainty_score":0.011448383},"labels":[],"label_agreement":null},{"id":"W2766698197","doi":"10.1109/access.2017.2763614","title":"Polar Code Design for Irregular Multidimensional Constellations","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Huawei Technologies; Ontario Ministry of Economic Development and Innovation","keywords":"Computer science; Polar code; Decoding methods; Constellation; Coding (social sciences); Wireless; Algorithm; Polar; Binary number; Theoretical computer science; Set (abstract data type); Forward error correction; Code (set theory); Telecommunications; Mathematics; Arithmetic","score_opus":0.12412628566901836,"score_gpt":0.3820861654271523,"score_spread":0.25795987975813395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766698197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013659517,0.00017001033,0.9824181,0.0001293574,0.000036043726,0.00003361856,0.000041368578,0.0001404393,0.0033716378],"genre_scores_gemma":[0.2962145,0.0005427751,0.69978833,0.00015016386,0.000051053954,0.00017245788,0.00014608141,0.00007506743,0.0028594832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.00017477089,0.00003945792,0.0000721119,0.00024034551,0.0000652377],"domain_scores_gemma":[0.9986582,0.00044358455,0.00023031965,0.00024772878,0.00035900105,0.00006106258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000494686,0.00048423224,0.00038257483,0.0006976258,0.00045453163,0.0007460493,0.0005548949,0.00056592847,0.0021767064],"category_scores_gemma":[0.0029575457,0.00020806752,0.00026261562,0.0009344158,0.00062593375,0.0007633687,0.0012217544,0.00085625064,0.00082613283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037623075,0.00006409765,0.0016987605,0.0003049219,0.000047969665,0.00034677918,0.0004984861,0.21339363,0.117555946,0.35883456,0.0032209277,0.30365774],"study_design_scores_gemma":[0.00004922852,0.00022745223,0.00033687628,0.000092354116,0.000026587055,0.00066504284,0.00012611748,0.7929531,0.121551104,0.06116975,0.022754341,0.000048132006],"about_ca_topic_score_codex":0.00029907838,"about_ca_topic_score_gemma":0.0004452598,"teacher_disagreement_score":0.0021767064,"about_ca_system_score_codex":0.0005058805,"about_ca_system_score_gemma":0.0006262393,"threshold_uncertainty_score":0.0072817802},"labels":[],"label_agreement":null},{"id":"W2768477051","doi":"10.1109/lcomm.2017.2777441","title":"An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Algorithm; Computer science; Variable (mathematics); Tree (set theory); Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Combinatorics","score_opus":0.057150610431607914,"score_gpt":0.3419300642919074,"score_spread":0.2847794538602995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768477051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009906654,0.0001923636,0.9872556,0.00009778616,0.000042347765,0.0000538554,0.00011861693,0.00088612916,0.0014466931],"genre_scores_gemma":[0.09101362,0.0001396126,0.9060731,0.00007234881,0.000022082213,0.00012712211,0.00048190972,0.00018816533,0.0018820015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990909,0.0001447968,0.0000637128,0.00015233443,0.00044996635,0.00009829645],"domain_scores_gemma":[0.9979202,0.0009700532,0.00015651855,0.00022348437,0.00067159475,0.00005818024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096904,0.0006107995,0.00078328757,0.0015415942,0.0007843886,0.0010061935,0.0013004215,0.0009623001,0.0036154534],"category_scores_gemma":[0.005128291,0.00031936765,0.0005316946,0.0017614723,0.00064042653,0.0015180164,0.0010957631,0.0008805462,0.0013406913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026803082,0.00010533602,0.0016500466,0.00030931088,0.00007695656,0.00022089265,0.0003529282,0.2824638,0.027206894,0.07696303,0.010540596,0.5998422],"study_design_scores_gemma":[0.000068613044,0.00009167362,0.0002668815,0.000027397244,0.000019249932,0.00021670347,0.000069369155,0.9410313,0.011812229,0.03978625,0.006577433,0.00003297425],"about_ca_topic_score_codex":0.0042934134,"about_ca_topic_score_gemma":0.0059485226,"teacher_disagreement_score":0.0042934134,"about_ca_system_score_codex":0.00093237485,"about_ca_system_score_gemma":0.0024985727,"threshold_uncertainty_score":0.012094855},"labels":[],"label_agreement":null},{"id":"W2769209600","doi":"10.1109/sips.2017.8110014","title":"Reduced-memory high-throughput fast-SSC polar code decoder architecture","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar code; Computer science; Throughput; Decoding methods; Latency (audio); Polar; Parallel computing; Computer hardware; Embedded system; Wireless; Algorithm; Telecommunications","score_opus":0.01778577062827813,"score_gpt":0.28630582052941433,"score_spread":0.2685200499011362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769209600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13743293,0.0018430526,0.8292236,0.00045848187,0.0002076243,0.00019014359,0.0005662996,0.006943575,0.02313435],"genre_scores_gemma":[0.6603114,0.00097432436,0.31292415,0.00038903957,0.00011518296,0.00014210235,0.0011254254,0.00014136433,0.023877071],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997826,0.000028622673,0.000015559754,0.000030597672,0.00011597081,0.000026587419],"domain_scores_gemma":[0.99960154,0.00008522333,0.00003861864,0.00006864121,0.00019010245,0.000015973148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019407654,0.00043223926,0.00031882979,0.0005754231,0.00031088098,0.0006521742,0.0007678622,0.00043637268,0.00484718],"category_scores_gemma":[0.0004929721,0.00015735792,0.00019937617,0.00051047024,0.00022168213,0.000787398,0.00041740868,0.0004236127,0.001621888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010596636,0.00021073595,0.0020586085,0.00048031,0.00011935287,0.0005300959,0.0001844152,0.06336677,0.47262576,0.026986403,0.011037053,0.42134094],"study_design_scores_gemma":[0.00013731017,0.00074138126,0.001349709,0.000054535147,0.00011413133,0.0014541512,0.000064201624,0.55341053,0.40444237,0.005342903,0.032817807,0.00007095393],"about_ca_topic_score_codex":0.0019440786,"about_ca_topic_score_gemma":0.0043467158,"teacher_disagreement_score":0.00484718,"about_ca_system_score_codex":0.00048535262,"about_ca_system_score_gemma":0.001141707,"threshold_uncertainty_score":0.016215384},"labels":[],"label_agreement":null},{"id":"W2772435313","doi":"10.1109/wcncw.2018.8368991","title":"Improved successive cancellation flip decoding of polar codes based on error distribution","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Error detection and correction; Sorting; Code word; List decoding; Index selection; Block Error Rate; Bit error rate; Selection (genetic algorithm); Block code; Concatenated error correction code; Telecommunications","score_opus":0.02431425572408844,"score_gpt":0.30054574929572314,"score_spread":0.2762314935716347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772435313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057353478,0.0003122386,0.9370323,0.0001314534,0.000075289914,0.000055913162,0.0000820888,0.00052972545,0.0044275736],"genre_scores_gemma":[0.4895018,0.0007136075,0.5035062,0.00015168215,0.00007047467,0.00007221683,0.0003952822,0.00007716352,0.0055115316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943787,0.00013531912,0.000029011328,0.00006330309,0.00026752154,0.00006692575],"domain_scores_gemma":[0.9986326,0.0005378763,0.00012282428,0.00019363519,0.00047510868,0.000037858365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012921,0.00073935627,0.0005136215,0.000634046,0.00034877346,0.0006445914,0.0005524173,0.00047044575,0.0011183502],"category_scores_gemma":[0.0028736496,0.00016014632,0.0003345614,0.0009049109,0.00054090226,0.00069852156,0.0005805892,0.00061801734,0.0005575792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006650208,0.000107188825,0.0022346752,0.00024025408,0.00008712927,0.0005144789,0.00030156464,0.32593486,0.15823327,0.08289405,0.0027480945,0.42603937],"study_design_scores_gemma":[0.00003215745,0.00012726248,0.00033738604,0.000021853568,0.000022736493,0.00036289837,0.000023167113,0.8854986,0.104548305,0.006253326,0.002744635,0.000027633481],"about_ca_topic_score_codex":0.0018214051,"about_ca_topic_score_gemma":0.0020713224,"teacher_disagreement_score":0.0018214051,"about_ca_system_score_codex":0.00043279686,"about_ca_system_score_gemma":0.0011495327,"threshold_uncertainty_score":0.0037412643},"labels":[],"label_agreement":null},{"id":"W2772479553","doi":"10.1109/tit.2019.2904988","title":"Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Subcategory; Additive white Gaussian noise; Trapping; Decoding methods; Error floor; Gaussian; Code (set theory); Mathematics; Channel (broadcasting); Discrete mathematics; Computer science; Algorithm; Combinatorics; Physics; Telecommunications; Biology","score_opus":0.026400803656583087,"score_gpt":0.2843982716759575,"score_spread":0.2579974680193744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772479553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36100143,0.0019244953,0.59999937,0.004549005,0.00013161915,0.00027095058,0.0041029416,0.00094853126,0.027071731],"genre_scores_gemma":[0.8868568,0.0016809813,0.100046836,0.00073350884,0.0003785995,0.00037818594,0.003453084,0.00024482622,0.006227175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983197,0.00035312414,0.00011445941,0.00047380372,0.0004843802,0.00025446806],"domain_scores_gemma":[0.978696,0.017990636,0.0009340139,0.0013944978,0.00051472057,0.0004700348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823379,0.0010370179,0.0013174396,0.0011377188,0.0015452126,0.0033776572,0.0024700956,0.0017822651,0.004214147],"category_scores_gemma":[0.012386491,0.00075755885,0.0013926432,0.0017410043,0.0025044195,0.006966721,0.0029418685,0.003461331,0.00061199587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013344268,0.00064855587,0.009261091,0.0021031634,0.00038354803,0.0012086318,0.0019405687,0.46175206,0.02224635,0.39000127,0.023101127,0.08601912],"study_design_scores_gemma":[0.00012313836,0.00012208679,0.0018448777,0.0000858793,0.00008703509,0.0006647509,0.000340521,0.44449532,0.006916721,0.5401268,0.0051326444,0.00006027284],"about_ca_topic_score_codex":0.0013856831,"about_ca_topic_score_gemma":0.0011976555,"teacher_disagreement_score":0.004214147,"about_ca_system_score_codex":0.0013885068,"about_ca_system_score_gemma":0.0010884125,"threshold_uncertainty_score":0.014097691},"labels":[],"label_agreement":null},{"id":"W2773681515","doi":"10.1109/icc.2018.8422464","title":"Partitioned Successive-Cancellation Flip Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Throughput; Frame (networking); Code (set theory); Computational complexity theory; Channel (broadcasting); Polar; Energy (signal processing); Sequential decoding","score_opus":0.02143846662542421,"score_gpt":0.2883430230799074,"score_spread":0.2669045564544832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773681515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07122867,0.00045749889,0.9195107,0.00013634491,0.00007605495,0.000084665015,0.00022137613,0.00056167645,0.0077229408],"genre_scores_gemma":[0.57315207,0.00081701064,0.41668788,0.00017511324,0.0000599784,0.00012244453,0.0007175117,0.00010477291,0.008163191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968183,0.000078974444,0.0000160982,0.000044757373,0.00012583438,0.00005257402],"domain_scores_gemma":[0.99898714,0.00041337908,0.000087537475,0.00017080003,0.00031264834,0.000028569857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029712814,0.0006407645,0.00039409613,0.00050272257,0.00039615974,0.00061696745,0.00047209152,0.00039814532,0.0018789307],"category_scores_gemma":[0.002270259,0.00015385757,0.00026847338,0.0006029662,0.00047419162,0.00062702695,0.0006239887,0.00046930427,0.00088954077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075443817,0.00006962898,0.0012054122,0.00027230885,0.00006296444,0.0005391578,0.0002721988,0.40129283,0.113802224,0.07205911,0.004099813,0.40556988],"study_design_scores_gemma":[0.000050460192,0.00016330028,0.0003679432,0.00003909154,0.000018894603,0.00042687656,0.000058820515,0.88434404,0.09079057,0.018240595,0.0054756915,0.000023711802],"about_ca_topic_score_codex":0.002376372,"about_ca_topic_score_gemma":0.0034317658,"teacher_disagreement_score":0.002376372,"about_ca_system_score_codex":0.00036434684,"about_ca_system_score_gemma":0.0009679284,"threshold_uncertainty_score":0.006285608},"labels":[],"label_agreement":null},{"id":"W2774002047","doi":"10.1109/tit.2018.2879823","title":"From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Trapping; Low-density parity-check code; Girth (graph theory); Combinatorics; Upper and lower bounds; Degree (music); Discrete mathematics; Minimum weight; Cage; Minimum distance; Decoding methods; Algorithm; Physics; Biology","score_opus":0.013445672666642514,"score_gpt":0.2622321549856071,"score_spread":0.24878648231896458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774002047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476945,0.001125032,0.95371985,0.0002817068,0.00009524744,0.00007490395,0.000312045,0.00037087445,0.009250854],"genre_scores_gemma":[0.5665189,0.0040553045,0.41708127,0.0007664707,0.0003852614,0.00066866755,0.0012395008,0.00082678633,0.008457773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990037,0.00022912999,0.00006821603,0.00025866157,0.00031619123,0.00012404424],"domain_scores_gemma":[0.9926918,0.0048146225,0.0005555036,0.0011276741,0.0005432003,0.00026720492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656598,0.0015861992,0.0010836372,0.002480525,0.00097466353,0.0013476901,0.001732929,0.0011958885,0.0029519014],"category_scores_gemma":[0.009407314,0.0008135766,0.001419414,0.0017579542,0.0023357638,0.0033676706,0.0037306673,0.0039618863,0.0008891633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014228551,0.00011956029,0.0017619595,0.0005775179,0.000097641554,0.00048211985,0.00061540754,0.1824327,0.035360683,0.7160683,0.0054449136,0.056896858],"study_design_scores_gemma":[0.000022631579,0.00017989235,0.0010362806,0.00013632055,0.000080629805,0.0006210037,0.00014740933,0.44568607,0.01937321,0.52001363,0.012612329,0.00009056793],"about_ca_topic_score_codex":0.00090783986,"about_ca_topic_score_gemma":0.0013353634,"teacher_disagreement_score":0.0029519014,"about_ca_system_score_codex":0.0011351369,"about_ca_system_score_gemma":0.00068307616,"threshold_uncertainty_score":0.009875059},"labels":[],"label_agreement":null},{"id":"W2775074672","doi":"10.1109/iemcon.2017.8117161","title":"Performance of NMS decoding of SC polar codes based density evolution","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Algorithm; Function (biology); Reduction (mathematics); Sequential decoding; Product (mathematics); Computer science; Berlekamp–Welch algorithm; Polar; Nonlinear system; Probability density function; Process (computing); Mathematics; Physics; Statistics; Block code","score_opus":0.02235162601650961,"score_gpt":0.27084438269563776,"score_spread":0.24849275667912815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775074672","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7012043,0.0014599722,0.26737222,0.0005771522,0.00015031596,0.000054337303,0.00018436744,0.0010311237,0.02796626],"genre_scores_gemma":[0.97462535,0.00025538966,0.023058103,0.000043517077,0.000015592157,0.00001846055,0.00013279208,0.000038166647,0.0018127024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991641,0.00023040007,0.00003492855,0.000093604955,0.00038075665,0.00009622639],"domain_scores_gemma":[0.9987919,0.0005564215,0.0000943458,0.00012920209,0.0003904059,0.000037874222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066617195,0.0005962819,0.00046723918,0.00042876802,0.00045483178,0.0007105942,0.0004395093,0.0007563402,0.0010731473],"category_scores_gemma":[0.0030869436,0.0001176667,0.00020092023,0.0005128659,0.000621256,0.00077882415,0.00068999315,0.00050160533,0.0002991431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002771689,0.00018308671,0.0078483615,0.000546199,0.00019536087,0.00046552133,0.0005326182,0.5326747,0.20845385,0.062437188,0.0018316358,0.18205981],"study_design_scores_gemma":[0.000022563547,0.00017278348,0.0008891126,0.000023596855,0.00001912359,0.00020528528,0.000033853616,0.91926503,0.075338915,0.0032339352,0.00076847203,0.000027211954],"about_ca_topic_score_codex":0.0021317767,"about_ca_topic_score_gemma":0.0014115013,"teacher_disagreement_score":0.0021317767,"about_ca_system_score_codex":0.0005822079,"about_ca_system_score_gemma":0.0008644283,"threshold_uncertainty_score":0.0042387247},"labels":[],"label_agreement":null},{"id":"W2782317874","doi":"10.1109/tcsii.2018.2872653","title":"Design and Implementation of a Polar Codes Blind Detection Scheme","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Polar code; Wireless; Polar; Latency (audio); False alarm; Code (set theory); Real-time computing; Scheme (mathematics); Set (abstract data type); Algorithm; Computer engineering; Computer hardware; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.03898881336223481,"score_gpt":0.298916537268396,"score_spread":0.2599277239061612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782317874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023984374,0.00029423373,0.9665499,0.00017854094,0.0000959445,0.00020936271,0.00011443174,0.0013211994,0.007252065],"genre_scores_gemma":[0.46804753,0.00033110863,0.52183765,0.00025366168,0.000058527476,0.00021849941,0.0001989916,0.00007212313,0.008981869],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.00007580538,0.000028674958,0.00008543129,0.000163005,0.000059198308],"domain_scores_gemma":[0.9996147,0.0000715819,0.000044999215,0.000072165,0.00017447076,0.000022046284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034325125,0.00046230952,0.00035502174,0.00052918255,0.00047358833,0.00091407925,0.00088285154,0.0006952832,0.0029786925],"category_scores_gemma":[0.0007042966,0.00022895375,0.00025352495,0.00032178118,0.0003632538,0.00063688465,0.0005850897,0.0006711825,0.0015244794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010093059,0.00015751917,0.0014474534,0.0003112263,0.00008547825,0.00040290886,0.00029016504,0.084279716,0.53107727,0.07738459,0.0044552055,0.2990992],"study_design_scores_gemma":[0.00012729685,0.00063856365,0.0006483802,0.000053953336,0.00006553368,0.00062303053,0.000041840598,0.591736,0.36959508,0.008021904,0.028387368,0.00006119851],"about_ca_topic_score_codex":0.00092566654,"about_ca_topic_score_gemma":0.00078119634,"teacher_disagreement_score":0.0029786925,"about_ca_system_score_codex":0.00058218377,"about_ca_system_score_gemma":0.00087931374,"threshold_uncertainty_score":0.0099647045},"labels":[],"label_agreement":null},{"id":"W2785927350","doi":"10.1109/vtcfall.2017.8287918","title":"Throughput-Based Design of Polar Codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Throughput; Decoding methods; Polar code; Algorithm; Concatenated error correction code; Word error rate; Error detection and correction; Code rate; Metric (unit); Block code; Transmission (telecommunications); Speech recognition; Wireless; Telecommunications","score_opus":0.059122591230558644,"score_gpt":0.314718461707722,"score_spread":0.25559587047716337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785927350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012800034,0.00034931998,0.97592723,0.00015714437,0.000086338085,0.00014241207,0.000099297795,0.00041180386,0.01002633],"genre_scores_gemma":[0.5024468,0.0012913095,0.49001247,0.00023301007,0.00011484042,0.00035434015,0.00024970196,0.00017189124,0.0051257163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987336,0.00036258917,0.000068341804,0.00017253407,0.0005339351,0.00012900238],"domain_scores_gemma":[0.9977646,0.0006516786,0.0003385447,0.00021848886,0.0009326642,0.00009411878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462098,0.0010201596,0.00049002434,0.0010357354,0.00060752296,0.0011874773,0.0006646772,0.0004929676,0.0018699985],"category_scores_gemma":[0.0037143943,0.0003814697,0.00028648786,0.00086035446,0.00078766403,0.00075452,0.0011366713,0.00087948935,0.0010455501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006415482,0.00012111154,0.0014643124,0.0003671681,0.00006945113,0.00040288028,0.00033764425,0.4079557,0.15207525,0.25380653,0.0038985878,0.17885979],"study_design_scores_gemma":[0.00008004281,0.00036443296,0.00026125635,0.00007362282,0.000042685428,0.0005377114,0.00006757014,0.7789867,0.1630083,0.0404385,0.016065056,0.00007415808],"about_ca_topic_score_codex":0.0006168143,"about_ca_topic_score_gemma":0.00069584127,"teacher_disagreement_score":0.0018699985,"about_ca_system_score_codex":0.0010539714,"about_ca_system_score_gemma":0.0015190584,"threshold_uncertainty_score":0.0076471567},"labels":[],"label_agreement":null},{"id":"W2787606408","doi":"10.1109/tcsi.2018.2855679","title":"A Multi-Kernel Multi-Code Polar Decoder Architecture","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar code; Computer science; Code (set theory); Algorithm; Kernel (algebra); Binary number; Decoding methods; Binary code; Code rate; Systematic code; Polar; Parallel computing; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Arithmetic","score_opus":0.03661196375200784,"score_gpt":0.2726667422869453,"score_spread":0.23605477853493748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787606408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035642423,0.0005611779,0.94507885,0.00030264817,0.00014829685,0.00015843594,0.00027575018,0.0047023944,0.013129868],"genre_scores_gemma":[0.43801337,0.0006083526,0.5334601,0.0006272691,0.00014104642,0.00018098942,0.00089842686,0.0001653721,0.02590504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.000053239848,0.000022831711,0.00007066559,0.00016436934,0.00005437909],"domain_scores_gemma":[0.9995419,0.00007678896,0.00003423417,0.00006899867,0.00024502544,0.000033209453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957436,0.00047619463,0.00046224255,0.0006555939,0.0004544896,0.00095323514,0.0011568051,0.00090075907,0.0035085562],"category_scores_gemma":[0.0006468361,0.00028259392,0.00033992037,0.0004731635,0.00025597517,0.0010236455,0.0008930179,0.0007274516,0.0030356075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012955423,0.0002827661,0.0021745022,0.00037198013,0.00015223173,0.0009931647,0.00032563022,0.07593522,0.36375722,0.04677594,0.013032327,0.49490342],"study_design_scores_gemma":[0.00012099861,0.0004110096,0.0005920739,0.00004705689,0.0000835324,0.0012874678,0.000047597598,0.72837013,0.23759656,0.005641501,0.025711697,0.000090398215],"about_ca_topic_score_codex":0.002334354,"about_ca_topic_score_gemma":0.004336881,"teacher_disagreement_score":0.0035085562,"about_ca_system_score_codex":0.00060892757,"about_ca_system_score_gemma":0.001356199,"threshold_uncertainty_score":0.011737347},"labels":[],"label_agreement":null},{"id":"W2793068283","doi":"10.1109/jlt.2018.2812738","title":"Low-Complexity Concatenated LDPC-Staircase Codes","year":2018,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenated error correction code; Low-density parity-check code; Computer science; Serial concatenated convolutional codes; Decoding methods; Code word; Turbo code; Algorithm; Linear code; Code (set theory); Block code; Theoretical computer science","score_opus":0.025085567041950373,"score_gpt":0.28984475771263907,"score_spread":0.2647591906706887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793068283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14295945,0.00045433303,0.84729487,0.0001923747,0.000041335607,0.00007576768,0.00020113894,0.0007363541,0.008044468],"genre_scores_gemma":[0.8045629,0.00020435311,0.19094007,0.000048952083,0.000018457584,0.000059805137,0.00016108874,0.000027393296,0.0039770612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995141,0.00009118687,0.00002581837,0.000049256312,0.00025361544,0.000065979526],"domain_scores_gemma":[0.99918336,0.0002603371,0.00012085379,0.00015234867,0.00024497914,0.00003809087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027660982,0.00046441794,0.00034004723,0.0003927701,0.00032594474,0.0005608401,0.00061172264,0.0004649652,0.0010390962],"category_scores_gemma":[0.0012693487,0.00016866304,0.00022776234,0.00049463246,0.00036925048,0.0003846894,0.00044310058,0.00048391434,0.00048070672],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039011368,0.00007651401,0.0016722439,0.0002034715,0.00005819225,0.00033481227,0.00012408025,0.68032736,0.15837431,0.06093439,0.0012248185,0.09627974],"study_design_scores_gemma":[0.000016658709,0.000098419056,0.00035173964,0.000013179066,0.000017651993,0.0001416067,0.000007685469,0.9471841,0.044880595,0.0051775114,0.0020916334,0.000019251946],"about_ca_topic_score_codex":0.0021316754,"about_ca_topic_score_gemma":0.004505321,"teacher_disagreement_score":0.0021316754,"about_ca_system_score_codex":0.0007371089,"about_ca_system_score_gemma":0.0011862082,"threshold_uncertainty_score":0.005348146},"labels":[],"label_agreement":null},{"id":"W2794935685","doi":"10.1109/tvlsi.2018.2812214","title":"Toward Energy-Efficient Stochastic Circuits Using Parallel Sobol Sequences","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Stochastic computing; Sobol sequence; Computer science; Parallel computing; Random number generation; Electronic circuit; Algorithm; Efficient energy use; Binary number; Computation; Pseudorandom number generator; Mathematics; Monte Carlo method; Arithmetic; Engineering; Statistics","score_opus":0.04107774159824099,"score_gpt":0.27774488206919096,"score_spread":0.23666714047094997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794935685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088640064,0.000608254,0.9017348,0.00022786325,0.00006565886,0.00012406481,0.000074147014,0.0012492755,0.0072758114],"genre_scores_gemma":[0.613987,0.00053669844,0.38155964,0.00017948863,0.00005175922,0.00015612248,0.00014974285,0.000093311006,0.0032862255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999754,0.00004231464,0.000015827365,0.000041371022,0.00011519009,0.00003125685],"domain_scores_gemma":[0.9996666,0.00011131831,0.000071663206,0.000053245873,0.000082030194,0.000015286349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025592514,0.00039021848,0.00023925488,0.00042048562,0.00019967866,0.00049852254,0.00063284766,0.00030663953,0.0017620854],"category_scores_gemma":[0.00068416615,0.00018070631,0.00023700805,0.00046071084,0.00029891846,0.0006925549,0.00033155034,0.00042787183,0.00041125002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033939388,0.00020338024,0.00098704,0.00050399895,0.00007233049,0.00029860882,0.00018119246,0.17881891,0.39843306,0.10990087,0.0030019507,0.3072593],"study_design_scores_gemma":[0.00006771411,0.000664126,0.00046396465,0.00006199507,0.00004557362,0.00034766685,0.000037781603,0.7677568,0.18580087,0.02459698,0.020123577,0.000032798845],"about_ca_topic_score_codex":0.0005265727,"about_ca_topic_score_gemma":0.0011735914,"teacher_disagreement_score":0.0017620854,"about_ca_system_score_codex":0.00041183396,"about_ca_system_score_gemma":0.0006385369,"threshold_uncertainty_score":0.00589478},"labels":[],"label_agreement":null},{"id":"W2796841874","doi":"10.1109/tit.2018.2873140","title":"Stopping Redundancy Hierarchy Beyond the Minimum Distance","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Illinois at Urbana-Champaign; ITMO University; University of Cambridge; Tallinna Tehnikaülikool; Tartu Ülikool; Nanyang Technological University; Belarusian State University; Saint Petersburg State University; Lunds Universitet; McGill University; Eesti Teadusagentuur; Technion-Israel Institute of Technology; University College Dublin","keywords":"Redundancy (engineering); Row; Mathematics; Code (set theory); Decoding methods; Combinatorics; Upper and lower bounds; Binary erasure channel; Discrete mathematics; Algorithm; Computer science; Coding (social sciences); Statistics; Set (abstract data type)","score_opus":0.013488795517293851,"score_gpt":0.2542901375572471,"score_spread":0.24080134203995326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796841874","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5134217,0.0045163915,0.41433308,0.001933986,0.00020273401,0.00008662607,0.0005864261,0.0006836775,0.06423539],"genre_scores_gemma":[0.96857107,0.00076338835,0.026335832,0.00027695225,0.00017375036,0.00010910132,0.00031450848,0.000102443526,0.003353014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976266,0.0006413932,0.0001303766,0.0003104423,0.00089146633,0.0003997476],"domain_scores_gemma":[0.98917764,0.006987289,0.0009908518,0.0013092712,0.00094771176,0.0005872182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017323096,0.0007703831,0.0010939826,0.0017101495,0.0011526461,0.0015712566,0.0014566816,0.0014440956,0.0026567413],"category_scores_gemma":[0.011550602,0.0005488793,0.000688716,0.0007370608,0.002427525,0.0031331645,0.0028217083,0.0024659166,0.0006312197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022165987,0.00005512538,0.0015873801,0.00028499175,0.000044333116,0.00038835665,0.0003966012,0.053419437,0.010413014,0.91033095,0.0024092488,0.020448914],"study_design_scores_gemma":[0.000024752711,0.00012764159,0.00090072537,0.00006661813,0.000020633792,0.00040149293,0.000060610175,0.33132443,0.004257873,0.6602789,0.0024853728,0.00005078752],"about_ca_topic_score_codex":0.00047309787,"about_ca_topic_score_gemma":0.0003101909,"teacher_disagreement_score":0.0026567413,"about_ca_system_score_codex":0.0011708835,"about_ca_system_score_gemma":0.0006753445,"threshold_uncertainty_score":0.009161413},"labels":[],"label_agreement":null},{"id":"W2798350582","doi":"10.1109/acssc.2017.8335664","title":"On the performance of polar codes for 5G eMBB control channel","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Control channel; Computer science; Channel (broadcasting); Polar; Telecommunications; Computer network; Physics","score_opus":0.024869911384946073,"score_gpt":0.2752540023163081,"score_spread":0.250384090931362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798350582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65464437,0.017407032,0.27280915,0.001585403,0.00028793237,0.000107622276,0.0010309268,0.0008300638,0.05129745],"genre_scores_gemma":[0.9843053,0.003418349,0.010179464,0.0001256338,0.000066060245,0.000029878602,0.000296775,0.000064127205,0.0015144576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855334,0.00041425208,0.000037550522,0.00012825723,0.0005853484,0.00028138974],"domain_scores_gemma":[0.9938081,0.0043931804,0.00043233152,0.00026604836,0.0010374279,0.00006285466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424762,0.0015144295,0.00074730016,0.0011066936,0.0006498506,0.0010050696,0.0005179257,0.0008517413,0.0027630567],"category_scores_gemma":[0.008344636,0.00022187033,0.00032609023,0.0012572423,0.0012849431,0.0012428245,0.0009722789,0.00077984453,0.000492192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009228439,0.000083409446,0.0019450001,0.0004054411,0.0000740247,0.00037118924,0.00022668304,0.8951218,0.025544586,0.031733338,0.002034994,0.04153671],"study_design_scores_gemma":[0.000017268569,0.00027629238,0.0010826881,0.0001041142,0.000044375647,0.00027314352,0.00009561366,0.9687064,0.021151995,0.0070480797,0.0011492908,0.000050755774],"about_ca_topic_score_codex":0.006181473,"about_ca_topic_score_gemma":0.0055584847,"teacher_disagreement_score":0.006181473,"about_ca_system_score_codex":0.0014457832,"about_ca_system_score_gemma":0.0012734655,"threshold_uncertainty_score":0.012291014},"labels":[],"label_agreement":null},{"id":"W2798867000","doi":"10.1109/glocom.2018.8648105","title":"Generalized Fast Decoding of Polar Codes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; List decoding; Sequential decoding; Computer science; Algorithm; Polar code; Berlekamp–Welch algorithm; Polar; Code (set theory); Coding (social sciences); Concatenated error correction code; Mathematics; Set (abstract data type); Block code; Statistics","score_opus":0.03681981122579413,"score_gpt":0.30668119745454114,"score_spread":0.269861386228747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798867000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021233134,0.00039209198,0.971704,0.00014030456,0.000077452954,0.00005089002,0.0001382295,0.00056291535,0.0057010134],"genre_scores_gemma":[0.32713318,0.0013025521,0.66197306,0.00027734562,0.00013525861,0.00017994187,0.00071851956,0.0002227126,0.008057474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992803,0.00018159745,0.00004135694,0.000115203045,0.00027418594,0.00010734961],"domain_scores_gemma":[0.9984598,0.00049035274,0.00010939068,0.0004163098,0.00048071303,0.000043409447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000499811,0.0009293677,0.00064943294,0.00079694524,0.00052497175,0.0010770905,0.0006158069,0.00062041194,0.0022602063],"category_scores_gemma":[0.0023649312,0.0002362225,0.00044725512,0.0010450762,0.00082863716,0.0010984339,0.0015381259,0.0010148112,0.0017402016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005997866,0.00005741958,0.0011518917,0.0004652887,0.00004955313,0.0006427202,0.0005910647,0.22542472,0.14289035,0.21670952,0.005294648,0.40612304],"study_design_scores_gemma":[0.000071311195,0.00025262058,0.00038462481,0.000090906724,0.000025913158,0.00086804293,0.00014168702,0.7468434,0.13492523,0.0935717,0.022769984,0.00005446552],"about_ca_topic_score_codex":0.0012185937,"about_ca_topic_score_gemma":0.0014911679,"teacher_disagreement_score":0.0022602063,"about_ca_system_score_codex":0.0005052268,"about_ca_system_score_gemma":0.0013589917,"threshold_uncertainty_score":0.007561147},"labels":[],"label_agreement":null},{"id":"W2801011149","doi":"10.1109/iscas.2018.8351832","title":"Low-Complexity Software Stack Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Computational complexity theory; Sorting; Sequential decoding; Error detection and correction; List decoding; Code (set theory); Concatenated error correction code; Computer engineering; Theoretical computer science; Block code","score_opus":0.04428452878262642,"score_gpt":0.30252772888976515,"score_spread":0.25824320010713875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801011149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06203507,0.00026641134,0.93200004,0.000109762805,0.000040185787,0.00003428407,0.00005702278,0.0011089939,0.004348322],"genre_scores_gemma":[0.53048563,0.00040620047,0.46315315,0.000100880374,0.000046403267,0.000065955544,0.00024991718,0.00015761206,0.0053342823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948514,0.000099495046,0.000025153984,0.000036499354,0.0002844345,0.000069287256],"domain_scores_gemma":[0.9988354,0.00046462865,0.00012531078,0.00020167542,0.00034863973,0.000024391056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037294152,0.00050903857,0.00034292598,0.0005827936,0.00033069865,0.0008347442,0.0004998234,0.00031394642,0.0016501177],"category_scores_gemma":[0.00235415,0.00015839678,0.0002788098,0.0005554331,0.0004727465,0.00073339354,0.0006491316,0.0005947922,0.00077859516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000748792,0.00008630309,0.0025623536,0.00033630437,0.00005854285,0.0003515639,0.0002896425,0.14578965,0.17829978,0.10494407,0.0031042544,0.56342876],"study_design_scores_gemma":[0.000045046592,0.00019161339,0.00045392042,0.000041263975,0.00002612896,0.00034396173,0.00006215819,0.77644646,0.20130533,0.014262908,0.006788943,0.00003220649],"about_ca_topic_score_codex":0.0019602533,"about_ca_topic_score_gemma":0.0031605496,"teacher_disagreement_score":0.0019602533,"about_ca_system_score_codex":0.00036900662,"about_ca_system_score_gemma":0.0014928109,"threshold_uncertainty_score":0.0055202246},"labels":[],"label_agreement":null},{"id":"W2802514696","doi":"10.1109/tcomm.2018.2832207","title":"Decoder Partitioning: Towards Practical List Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Polar; Algorithm; Concatenated error correction code; Electronic engineering; Theoretical computer science; Parallel computing; Block code; Engineering","score_opus":0.08444422761163856,"score_gpt":0.3729335643544408,"score_spread":0.28848933674280225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802514696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011195192,0.00023514987,0.98523384,0.00015159369,0.000032657117,0.00006797804,0.0001054948,0.0006442255,0.0023338613],"genre_scores_gemma":[0.17819676,0.00058969937,0.8168149,0.00031199396,0.00009790566,0.00022352429,0.00060316804,0.00020493733,0.0029570842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.00045221983,0.00009186457,0.0001473251,0.00047104034,0.00016448899],"domain_scores_gemma":[0.99753344,0.0012214442,0.0001624779,0.00043661098,0.0005663686,0.000079704085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083567813,0.001211839,0.00083220954,0.0008631085,0.0005992602,0.0012796072,0.0011118435,0.0008200114,0.0022999658],"category_scores_gemma":[0.005325581,0.0004359357,0.00043279628,0.0010412227,0.00070919615,0.0016185328,0.0023506829,0.0012912651,0.0019831585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009904149,0.00016599889,0.0010323751,0.00063486455,0.00006969854,0.0006699626,0.0005310399,0.34400153,0.103964396,0.12176079,0.008406311,0.4177726],"study_design_scores_gemma":[0.00009479633,0.00022982746,0.00017537053,0.00006474753,0.00002637291,0.00036098532,0.00010135352,0.89044005,0.048931625,0.05166973,0.007869699,0.00003546823],"about_ca_topic_score_codex":0.0013979306,"about_ca_topic_score_gemma":0.0021800585,"teacher_disagreement_score":0.0022999658,"about_ca_system_score_codex":0.0007020336,"about_ca_system_score_gemma":0.0019705214,"threshold_uncertainty_score":0.007694125},"labels":[],"label_agreement":null},{"id":"W2805738890","doi":"10.1145/3194554.3194620","title":"Bit-Wise Iterative Decoding of Polar Codes using Stochastic Computing","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council","keywords":"Decoding methods; Computer science; Stochastic computing; Belief propagation; Sequential decoding; Latency (audio); Throughput; Berlekamp–Welch algorithm; Wireless; Low latency (capital markets); Algorithm; Convergence (economics); List decoding; Parallel computing; Computer engineering; Computer network; Computation; Telecommunications; Concatenated error correction code; Block code","score_opus":0.03873353105281009,"score_gpt":0.3203431045095584,"score_spread":0.2816095734567483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805738890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014024317,0.0001299654,0.98330486,0.00008709088,0.000029110703,0.000029213383,0.000024847945,0.00027387132,0.0020968055],"genre_scores_gemma":[0.4360632,0.00053240295,0.5594841,0.00013826221,0.000053082742,0.0001173141,0.00015858434,0.00006349653,0.003389514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931693,0.00017822802,0.00004669075,0.000087554516,0.00029646524,0.00007405682],"domain_scores_gemma":[0.99900395,0.00041299142,0.000092477196,0.00013736996,0.00032080847,0.000032316813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686838,0.0005759699,0.00054265285,0.0005078105,0.00043267623,0.0008638947,0.0006096825,0.00053705805,0.0008862012],"category_scores_gemma":[0.0025895035,0.00022299775,0.00037208747,0.0007487087,0.0006572038,0.0007712951,0.0007927321,0.0008088205,0.00048132893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035365587,0.00009241303,0.0012330401,0.00019797623,0.00007749652,0.00030624657,0.00027800995,0.4880454,0.0736714,0.16066827,0.0017200892,0.27335605],"study_design_scores_gemma":[0.000011496578,0.000059250775,0.000091661204,0.000013117401,0.00000866351,0.00008887684,0.000011057058,0.96792865,0.01859381,0.011824389,0.001358666,0.000010380489],"about_ca_topic_score_codex":0.0016148669,"about_ca_topic_score_gemma":0.0023604634,"teacher_disagreement_score":0.0016148669,"about_ca_system_score_codex":0.00045088923,"about_ca_system_score_gemma":0.0013535732,"threshold_uncertainty_score":0.0032714605},"labels":[],"label_agreement":null},{"id":"W2806758424","doi":"10.1109/tit.2019.2895356","title":"On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Multiplicity (mathematics); Low-density parity-check code; Discrete mathematics; Tanner graph; Degree (music); Graph; Algorithm; Decoding methods; Physics","score_opus":0.02405202218869541,"score_gpt":0.25488724770940535,"score_spread":0.23083522552070995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806758424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252756,0.00040432785,0.46910864,0.00034372258,0.00004336845,0.000063391446,0.0004531024,0.0007570852,0.00355075],"genre_scores_gemma":[0.87639266,0.00031805906,0.120882556,0.00006762477,0.00006417679,0.000087334134,0.0006421171,0.0001140653,0.001431521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.0002380219,0.000044980487,0.00021393174,0.00020997948,0.00010948511],"domain_scores_gemma":[0.9907611,0.0065293172,0.00102294,0.0008560191,0.00047053286,0.00036011764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011263996,0.0008127689,0.000769069,0.0042226496,0.0007559666,0.0011100951,0.00094937265,0.00086324994,0.0012410725],"category_scores_gemma":[0.016691128,0.0004371827,0.00044997357,0.0026387875,0.0018465451,0.0029749575,0.0012370981,0.0007159451,0.00030382499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008829296,0.00024236653,0.031365264,0.00018318546,0.00014993313,0.0004233124,0.0005047616,0.6199418,0.01872977,0.16485663,0.002982203,0.15973796],"study_design_scores_gemma":[0.000017473465,0.000043756565,0.0020612774,0.000016133305,0.000009422344,0.00015333414,0.000041061805,0.899226,0.002966929,0.09498166,0.0004598145,0.000023140105],"about_ca_topic_score_codex":0.0029652554,"about_ca_topic_score_gemma":0.0036645841,"teacher_disagreement_score":0.0042226496,"about_ca_system_score_codex":0.0008642927,"about_ca_system_score_gemma":0.0007748381,"threshold_uncertainty_score":0.006270945},"labels":[],"label_agreement":null},{"id":"W2808059776","doi":"10.1109/tit.2019.2898224","title":"Coupling Data Transmission for Multiple-Access Communications","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Demodulation; Decoding methods; Computer science; Additive white Gaussian noise; Algorithm; Data stream; Encoder; Error detection and correction; Single antenna interference cancellation; Channel (broadcasting); Theoretical computer science; Telecommunications","score_opus":0.0903698762017232,"score_gpt":0.3513965285180419,"score_spread":0.26102665231631866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808059776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030610668,0.0011976019,0.9597941,0.00037661724,0.000113158676,0.00006284069,0.00004437989,0.00013775751,0.0076628393],"genre_scores_gemma":[0.8082683,0.0017371265,0.18351823,0.00027900003,0.00012883243,0.00016883164,0.00009483774,0.00009266663,0.0057121986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991906,0.00028078683,0.000019320856,0.00008277877,0.00037580242,0.000050750117],"domain_scores_gemma":[0.9984659,0.0010365419,0.00011624378,0.00020387121,0.00014350822,0.000033923687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717853,0.0008320735,0.0006730391,0.00033895927,0.0004953192,0.0011046771,0.00070492737,0.0009843042,0.0024986858],"category_scores_gemma":[0.0038388,0.00024096819,0.00028459934,0.00072106713,0.00091633067,0.001144325,0.0012948638,0.0011824798,0.0005127743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001862022,0.0001021498,0.0007345036,0.00055433094,0.000057760615,0.00038760994,0.0003222443,0.38762614,0.028280683,0.5063201,0.0021627548,0.073265426],"study_design_scores_gemma":[0.000015994077,0.0001301794,0.00019568614,0.000028238079,0.000025262892,0.00020915718,0.000039622963,0.8474824,0.012123148,0.13402766,0.005702316,0.000020238665],"about_ca_topic_score_codex":0.0006007614,"about_ca_topic_score_gemma":0.000639224,"teacher_disagreement_score":0.0024986858,"about_ca_system_score_codex":0.0007214301,"about_ca_system_score_gemma":0.0006211264,"threshold_uncertainty_score":0.008358955},"labels":[],"label_agreement":null},{"id":"W2808558511","doi":"10.1109/tvlsi.2018.2838591","title":"A Multi-Gb/s Frame-Interleaved LDPC Decoder With Path-Unrolled Message Passing in 28-nm CMOS","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Decoding methods; Low-density parity-check code; Clock rate; CMOS; Chip; Node (physics); Scalability; Parallel computing; Computer hardware; Algorithm; Electronic engineering; Physics; Engineering; Telecommunications","score_opus":0.016555530266814143,"score_gpt":0.2663288758883945,"score_spread":0.24977334562158035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808558511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3481652,0.000942477,0.6319873,0.00031081165,0.00011012459,0.00022954977,0.00047665896,0.0044619585,0.013315905],"genre_scores_gemma":[0.58568317,0.00041396404,0.4054638,0.00008984144,0.00003138055,0.000088862434,0.00037916793,0.0000937408,0.0077560954],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985766,0.000013506716,0.000007087992,0.000034212477,0.00006825898,0.000019246629],"domain_scores_gemma":[0.99989295,0.00002464808,0.000016510388,0.000017347036,0.000039806568,0.000008677377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011609368,0.0002149978,0.00020840862,0.00021758466,0.00022625524,0.00031042963,0.0006124787,0.0002652045,0.0009406839],"category_scores_gemma":[0.00025459635,0.00014670829,0.00014253524,0.00018790847,0.00015055822,0.00031754147,0.00015101011,0.00028419154,0.0004335817],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002219187,0.0000955794,0.0013322402,0.00024253312,0.00004005502,0.000360399,0.00015987224,0.03461466,0.81899184,0.00795027,0.0022512944,0.13373938],"study_design_scores_gemma":[0.000091793096,0.00055493263,0.0014279863,0.000023374369,0.000059543963,0.0005761545,0.00003294595,0.29202133,0.6794923,0.00081936136,0.024862822,0.00003748141],"about_ca_topic_score_codex":0.0032050142,"about_ca_topic_score_gemma":0.007384253,"teacher_disagreement_score":0.0032050142,"about_ca_system_score_codex":0.00056291645,"about_ca_system_score_gemma":0.0009079908,"threshold_uncertainty_score":0.00637269},"labels":[],"label_agreement":null},{"id":"W2810665697","doi":"10.1109/glocom.2018.8647308","title":"On the Decoding of Polar Codes on Permuted Factor Graphs","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Factor graph; Decoding methods; List decoding; Code word; Computer science; Permutation (music); Polar code; Error detection and correction; Algorithm; Belief propagation; Polar; Low-density parity-check code; Block code; Concatenated error correction code","score_opus":0.04685174314602396,"score_gpt":0.2995124849923075,"score_spread":0.2526607418462835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810665697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028727947,0.00017897387,0.9643609,0.00016160324,0.00006143011,0.000051284846,0.00011436208,0.0002995671,0.0060439357],"genre_scores_gemma":[0.5301947,0.0015466182,0.45838118,0.00030782397,0.00012899263,0.00018317069,0.0006367759,0.00020172734,0.008419053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985852,0.0004493832,0.00006676975,0.0001780688,0.00055380975,0.00016679],"domain_scores_gemma":[0.99755114,0.001470272,0.00021008796,0.0003258968,0.00039695183,0.000045614797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214201,0.0010554775,0.00059727154,0.00067986234,0.00045317164,0.00084623107,0.00044486334,0.00067534356,0.001840546],"category_scores_gemma":[0.004764027,0.00036901998,0.0005044766,0.0009743752,0.0015875326,0.0012164493,0.0010044713,0.00094139983,0.0009013914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042056944,0.000032611617,0.0006093097,0.00017400403,0.000038863218,0.0004689134,0.00025065397,0.63490325,0.03171071,0.2364512,0.0024948434,0.09244497],"study_design_scores_gemma":[0.000022327506,0.00006122654,0.000116845054,0.000029019533,0.000009757757,0.00012478082,0.000027048973,0.9212598,0.017764855,0.057867505,0.0026935851,0.000023256089],"about_ca_topic_score_codex":0.0035905065,"about_ca_topic_score_gemma":0.002671791,"teacher_disagreement_score":0.0035905065,"about_ca_system_score_codex":0.0006915959,"about_ca_system_score_gemma":0.0012023189,"threshold_uncertainty_score":0.007139206},"labels":[],"label_agreement":null},{"id":"W2870050732","doi":"10.1109/jetcas.2018.2852705","title":"An Energy-Efficient Online-Learning Stochastic Computational Deep Belief Network","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Emerging and Selected Topics in Circuits and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Deep belief network; Deep learning; Artificial intelligence; Computation; Artificial neural network; Floating point; Stochastic gradient descent; Computer engineering; Machine learning; Algorithm","score_opus":0.01826749025007503,"score_gpt":0.2743906919465532,"score_spread":0.2561232016964782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2870050732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022356687,0.00038689925,0.97137445,0.00025963684,0.000080996964,0.000037713926,0.00009836609,0.0008827362,0.0045225928],"genre_scores_gemma":[0.7140237,0.0004502476,0.28018898,0.00029490926,0.00004525807,0.00010771352,0.00025716703,0.000059004127,0.004572977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998324,0.00002410092,0.000008825974,0.00003704357,0.000074871976,0.000022754512],"domain_scores_gemma":[0.99986756,0.0000356129,0.000016507403,0.000016021464,0.00005246863,0.000011940642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023472524,0.0003453643,0.00033603839,0.00020572789,0.0001939132,0.00038215963,0.0010213028,0.00039087003,0.0013718806],"category_scores_gemma":[0.00052567956,0.00023313852,0.000271189,0.00027513926,0.00029244542,0.0006188541,0.00041635436,0.00066026277,0.0002902217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022567002,0.00014631779,0.0014873022,0.00023602821,0.00007833456,0.00019299754,0.00006396859,0.5907041,0.059673015,0.036251687,0.006936968,0.30400363],"study_design_scores_gemma":[0.0000079809815,0.000033241093,0.00009656634,0.0000052291057,0.000006583277,0.000026490812,0.0000023121117,0.99259746,0.004435484,0.0011801743,0.0016032899,0.000005241843],"about_ca_topic_score_codex":0.002306302,"about_ca_topic_score_gemma":0.004817007,"teacher_disagreement_score":0.002306302,"about_ca_system_score_codex":0.00048095692,"about_ca_system_score_gemma":0.0008391984,"threshold_uncertainty_score":0.0045894384},"labels":[],"label_agreement":null},{"id":"W2886278004","doi":"10.1109/isit.2018.8437485","title":"Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Subcategory; Decoding methods; Error floor; Trapping; Code (set theory); Gaussian; Computer science; Mathematics; Discrete mathematics; Channel (broadcasting); Algorithm; Combinatorics; Physics; Set (abstract data type); Telecommunications; Biology","score_opus":0.04150145517598843,"score_gpt":0.310448073592786,"score_spread":0.26894661841679757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886278004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55172855,0.0007354429,0.43415973,0.0017112513,0.000049985174,0.00024643357,0.0013143519,0.0008982821,0.009155908],"genre_scores_gemma":[0.8966737,0.00052234536,0.09709117,0.00033058407,0.00006409623,0.00020776314,0.0012959606,0.00013148772,0.0036829268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989863,0.00018584939,0.00008266592,0.00031835574,0.0002484136,0.00017836099],"domain_scores_gemma":[0.98718214,0.0102574015,0.00093983946,0.0009393346,0.0004247607,0.0002565943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819565,0.00061784923,0.000985134,0.0006788413,0.0012128039,0.00239087,0.0014826837,0.001572856,0.0019005355],"category_scores_gemma":[0.009414341,0.00076590036,0.00085359206,0.0009878742,0.001805713,0.0042267903,0.0019225175,0.0017763748,0.0003401651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009769595,0.00040711378,0.011202697,0.0014537425,0.00026251347,0.0011234106,0.001285906,0.6106458,0.031713504,0.21232235,0.009227117,0.11937892],"study_design_scores_gemma":[0.00007103396,0.00011248614,0.0013665941,0.0000690815,0.000050994375,0.0005554925,0.00035145757,0.6424862,0.012830415,0.33910105,0.0029646063,0.000040518924],"about_ca_topic_score_codex":0.0012530562,"about_ca_topic_score_gemma":0.0014441134,"teacher_disagreement_score":0.00239087,"about_ca_system_score_codex":0.00097627175,"about_ca_system_score_gemma":0.0010786781,"threshold_uncertainty_score":0.0070833564},"labels":[],"label_agreement":null},{"id":"W2886581636","doi":"10.1109/tcomm.2018.2873322","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Decoding methods; Computer science; Error detection and correction; Bit error rate; Sorting; List decoding; Code (set theory); Concatenated error correction code; Block code","score_opus":0.039094336960628716,"score_gpt":0.3243455029031874,"score_spread":0.2852511659425587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886581636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009440602,0.00015155949,0.9885029,0.00005024138,0.000040582774,0.000056288067,0.000049203885,0.00044676274,0.0012618497],"genre_scores_gemma":[0.14073715,0.00030586973,0.8558608,0.00009244586,0.00003246904,0.00014765568,0.0002875875,0.00005819505,0.0024777458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993007,0.0001306649,0.000050166396,0.000102220634,0.0003571071,0.000059090395],"domain_scores_gemma":[0.9991924,0.00027768343,0.0000629103,0.00010722681,0.00033669363,0.000023076316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054232316,0.0006805343,0.0005569431,0.0008737997,0.00037946034,0.0006304763,0.0007933231,0.00067622523,0.0020512568],"category_scores_gemma":[0.0022692485,0.00018699246,0.00044555045,0.0010324985,0.00041639185,0.00063980854,0.00063852954,0.00079891225,0.0010192367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045085922,0.000074536714,0.0013184045,0.00018937673,0.000057057576,0.0003270848,0.00022275187,0.22662792,0.09730414,0.041878384,0.0029383947,0.6286111],"study_design_scores_gemma":[0.00003468596,0.000089694724,0.0002666671,0.000016365264,0.000012366114,0.00027843786,0.0000134526235,0.9578536,0.03370965,0.0044564656,0.0032424212,0.00002617487],"about_ca_topic_score_codex":0.0029389453,"about_ca_topic_score_gemma":0.0030239956,"teacher_disagreement_score":0.0029389453,"about_ca_system_score_codex":0.00059634814,"about_ca_system_score_gemma":0.0013146488,"threshold_uncertainty_score":0.0068621635},"labels":[],"label_agreement":null},{"id":"W2886750952","doi":"10.1109/isit.2018.8437837","title":"Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Infinity; Tanner graph; Code (set theory); Block (permutation group theory); Discrete mathematics; Combinatorics; Trapping; Constant (computer programming); Decoding methods; Algorithm; Computer science; Error floor; Set (abstract data type); Mathematical analysis","score_opus":0.02032303248281222,"score_gpt":0.2845847425245275,"score_spread":0.2642617100417153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886750952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9151438,0.0004345591,0.08068222,0.00017367334,0.000017397198,0.000019673096,0.00020034223,0.00019175767,0.0031366097],"genre_scores_gemma":[0.9925281,0.00018638228,0.006261004,0.000025487112,0.000020587466,0.000037893995,0.00023942071,0.000037543636,0.000663645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932694,0.00019755577,0.000044196833,0.00015638683,0.00017506062,0.000099833895],"domain_scores_gemma":[0.9904136,0.006572597,0.0009666299,0.00082684384,0.00073060446,0.0004897229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013578733,0.0003611431,0.0004936156,0.0010874304,0.00059356476,0.0009582275,0.000863368,0.0007693992,0.0007775186],"category_scores_gemma":[0.011367281,0.00038631892,0.0003645859,0.00047127745,0.0015967397,0.001747181,0.0009677025,0.0007388886,0.000100736564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006053673,0.00022510503,0.042976137,0.00032784275,0.00019677704,0.00075651,0.00054427434,0.5897027,0.05756839,0.27595896,0.0019369333,0.02920098],"study_design_scores_gemma":[0.000016432467,0.00007926971,0.0062051318,0.000028821789,0.000034819135,0.00034254233,0.000076657525,0.94176257,0.009408572,0.041594334,0.0004101224,0.000040776893],"about_ca_topic_score_codex":0.00056175713,"about_ca_topic_score_gemma":0.00076579495,"teacher_disagreement_score":0.0013578733,"about_ca_system_score_codex":0.0008550737,"about_ca_system_score_gemma":0.0004404679,"threshold_uncertainty_score":0.0071811676},"labels":[],"label_agreement":null},{"id":"W2887241500","doi":"10.1109/icc.2018.8422461","title":"Localization-Based Polar Code Construction with Sublinear Complexity","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Huawei Technologies (Canada)","funders":"","keywords":"Sublinear function; Code (set theory); Set (abstract data type); Computer science; Algorithm; Matching (statistics); Polar code; Boundary (topology); Polar; Construct (python library); Theoretical computer science; Topology (electrical circuits); Mathematics; Discrete mathematics; Combinatorics; Decoding methods; Physics; Statistics","score_opus":0.03028749005856178,"score_gpt":0.27054782664034693,"score_spread":0.24026033658178514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887241500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007169639,0.000089042405,0.99031514,0.00006799873,0.00002082674,0.000034775723,0.000044752458,0.000491776,0.0017661623],"genre_scores_gemma":[0.1794853,0.0002823408,0.8162922,0.00009932336,0.000033575787,0.000180275,0.00037628046,0.00019621552,0.0030544759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.0002141814,0.000039134702,0.0001415893,0.00037509075,0.00009033897],"domain_scores_gemma":[0.9980925,0.00083017134,0.00015570465,0.00040851592,0.00042268197,0.000090512505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054428977,0.00072335976,0.0006702949,0.0010890202,0.0006645702,0.00093830324,0.0008533144,0.0005846764,0.0032480995],"category_scores_gemma":[0.003535604,0.00038301127,0.0005924329,0.00095507334,0.0009775148,0.0016393375,0.0020779327,0.0013147884,0.0016236732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048013215,0.00010208438,0.001668589,0.00044165034,0.000045793015,0.0002828587,0.00045305694,0.24149415,0.052274253,0.23926534,0.005643488,0.45784858],"study_design_scores_gemma":[0.00004262336,0.000088135406,0.00017474944,0.000024586188,0.00001646788,0.0002614513,0.00006987515,0.9132353,0.03477436,0.045442,0.005831877,0.00003859505],"about_ca_topic_score_codex":0.0017503827,"about_ca_topic_score_gemma":0.0014489257,"teacher_disagreement_score":0.0032480995,"about_ca_system_score_codex":0.0006510274,"about_ca_system_score_gemma":0.0015235216,"threshold_uncertainty_score":0.010865986},"labels":[],"label_agreement":null},{"id":"W2887931791","doi":"10.1109/isit.2018.8437733","title":"Convolutional Polar Codes: LLR-based Successive Cancellation Decoder and List Decoding Performance","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Convolutional code; Computer science; Decoding methods; Sequential decoding; Polar; Serial concatenated convolutional codes; Soft-decision decoder; Viterbi decoder; List decoding; Algorithm; Concatenated error correction code; Block code; Physics","score_opus":0.014377446818901674,"score_gpt":0.2627261029942239,"score_spread":0.2483486561753222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887931791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32277682,0.0012892161,0.6491635,0.0006927044,0.000077409124,0.000095272524,0.0005455242,0.0017101424,0.023649462],"genre_scores_gemma":[0.9287816,0.00044398173,0.06801875,0.00009403123,0.000017957987,0.00004145734,0.00027794743,0.000047095204,0.0022771582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993932,0.00016299223,0.000024984181,0.000056136996,0.00025293918,0.000109636305],"domain_scores_gemma":[0.9974049,0.0012861254,0.0002456236,0.0002295185,0.0007492866,0.000084564235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000863215,0.0006067739,0.00035881714,0.0005138218,0.0003829983,0.00077808637,0.000452894,0.00067246944,0.0019171323],"category_scores_gemma":[0.0044330917,0.00014837767,0.00016067048,0.0008758841,0.0007807866,0.0008910304,0.00075235235,0.0005232079,0.0004992704],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013980046,0.00012025542,0.0051869056,0.00033700134,0.0000667801,0.00044699275,0.00028047772,0.667113,0.06876297,0.11444111,0.0033045625,0.13854194],"study_design_scores_gemma":[0.000019108686,0.00013652058,0.00042041577,0.000018511078,0.000014139693,0.0001600845,0.000028044988,0.95050687,0.039657123,0.008045342,0.00096209807,0.000031758897],"about_ca_topic_score_codex":0.0046633272,"about_ca_topic_score_gemma":0.0042063524,"teacher_disagreement_score":0.0046633272,"about_ca_system_score_codex":0.0010011995,"about_ca_system_score_gemma":0.0016732081,"threshold_uncertainty_score":0.009272337},"labels":[],"label_agreement":null},{"id":"W2888993486","doi":"10.1109/tcomm.2018.2867475","title":"Polar Codes: Bounds on Bhattacharyya Parameters and Their Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bhattacharyya distance; Upper and lower bounds; Merge (version control); Binary number; Binary symmetric channel; Cardinality (data modeling); Channel (broadcasting); Polar; Mathematics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Channel capacity; Combinatorics; Telecommunications; Physics; Mathematical analysis; Arithmetic","score_opus":0.03945787012498194,"score_gpt":0.30332605850138084,"score_spread":0.2638681883763989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888993486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027092608,0.004020721,0.9427567,0.0005451957,0.00010414813,0.000050139137,0.00010902106,0.00028181984,0.025039602],"genre_scores_gemma":[0.76876307,0.006116724,0.21744798,0.0005421604,0.00035853346,0.00043005001,0.00031406156,0.0004062912,0.005621183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980623,0.00051211205,0.00013352846,0.00037226026,0.00065203337,0.0002677875],"domain_scores_gemma":[0.99306655,0.0045916913,0.00050878146,0.0009970334,0.000605987,0.00022993698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019376923,0.0012750627,0.0008764062,0.0015417264,0.0010796624,0.0020690814,0.0012280593,0.0012135948,0.003912024],"category_scores_gemma":[0.011654609,0.0005634497,0.0005255931,0.001584747,0.002820827,0.005046331,0.0032590956,0.0043809307,0.0009415828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002003599,0.000037309535,0.0005890719,0.00024370906,0.00002002177,0.00011162369,0.000315698,0.06483036,0.014274818,0.87566674,0.0013065623,0.042403795],"study_design_scores_gemma":[0.000024760007,0.00013559533,0.0003789868,0.00024765643,0.000029550007,0.00035506045,0.00020735434,0.2700848,0.033655424,0.680741,0.014042483,0.00009739684],"about_ca_topic_score_codex":0.00047485903,"about_ca_topic_score_gemma":0.00042813315,"teacher_disagreement_score":0.003912024,"about_ca_system_score_codex":0.0015882538,"about_ca_system_score_gemma":0.0008834023,"threshold_uncertainty_score":0.013087034},"labels":[],"label_agreement":null},{"id":"W2889019039","doi":"10.1109/mesa.2018.8449144","title":"Accelerating Viterbi Algorithm using Custom Instruction Approach","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Viterbi algorithm; Instruction set; Viterbi decoder; Set (abstract data type); Sequential decoding","score_opus":0.05030825863340325,"score_gpt":0.29278219059997274,"score_spread":0.2424739319665695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889019039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05443689,0.00053497986,0.9337485,0.00016432269,0.00009781996,0.000081896585,0.000050871407,0.004804538,0.0060801464],"genre_scores_gemma":[0.47644854,0.00046137077,0.51344156,0.00017941988,0.000052692176,0.0001530989,0.0002953063,0.0002042256,0.008763724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995815,0.00005533041,0.000029982262,0.000086156644,0.00018004153,0.00006690346],"domain_scores_gemma":[0.999508,0.000137368,0.00004601778,0.000117214804,0.00017232337,0.00001915009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028519635,0.00045277853,0.00038418823,0.000659912,0.00031393685,0.000524188,0.0011109493,0.00044716324,0.0027721927],"category_scores_gemma":[0.0011828942,0.00025618565,0.00026195645,0.000593209,0.00031954737,0.00082579005,0.00052911777,0.00077897625,0.00070653216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005261874,0.00020142413,0.0027933707,0.00023579261,0.00007677404,0.0002665945,0.00030597844,0.15531641,0.13638611,0.032304775,0.0058851237,0.6657015],"study_design_scores_gemma":[0.00006206516,0.0002648736,0.000972351,0.000019772528,0.000049798095,0.0002545135,0.000030344214,0.8692525,0.110780925,0.005193541,0.013080564,0.000038762675],"about_ca_topic_score_codex":0.005593035,"about_ca_topic_score_gemma":0.006106591,"teacher_disagreement_score":0.005593035,"about_ca_system_score_codex":0.0006166817,"about_ca_system_score_gemma":0.0013210708,"threshold_uncertainty_score":0.011120975},"labels":[],"label_agreement":null},{"id":"W2889062623","doi":"10.1109/tcomm.2018.2867436","title":"Performance Analysis and Improvement of Online Fountain Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Beijing Council of Science and Technology; National Natural Science Foundation of China","keywords":"Fountain code; Fountain; Computer science; Telecommunications; Electronic engineering; Engineering; Decoding methods; Block code; Concatenated error correction code; History","score_opus":0.02961203989107317,"score_gpt":0.3069218964144205,"score_spread":0.27730985652334733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889062623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1945816,0.002431675,0.7918318,0.000513022,0.000088399924,0.00007763355,0.000102344246,0.00145672,0.008916832],"genre_scores_gemma":[0.9490402,0.0004798521,0.049040888,0.0001065505,0.000041086554,0.00004131949,0.000054670876,0.00008018086,0.0011152513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997239,0.00087228883,0.00008411411,0.00027340648,0.0010148231,0.00051627075],"domain_scores_gemma":[0.988988,0.0064325863,0.0010096487,0.0017696581,0.0015740558,0.00022604177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010745,0.0011577389,0.00088916154,0.0010133369,0.0005723922,0.0011086361,0.0013515095,0.0010484079,0.0014134477],"category_scores_gemma":[0.015166996,0.00029435847,0.00041463203,0.0010170698,0.0014706181,0.0022480867,0.0016147908,0.0012122049,0.00027014336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073026767,0.00014264544,0.0018246642,0.00014631994,0.000051554376,0.00027095975,0.00023105596,0.82356185,0.015867705,0.046219047,0.0016184045,0.10933555],"study_design_scores_gemma":[0.000012863796,0.00011291832,0.00026387235,0.00001584208,0.000012327322,0.00014932125,0.000024958938,0.98531693,0.006428679,0.0071197106,0.00052070885,0.00002190051],"about_ca_topic_score_codex":0.0034205578,"about_ca_topic_score_gemma":0.0022821873,"teacher_disagreement_score":0.0034205578,"about_ca_system_score_codex":0.0017899009,"about_ca_system_score_gemma":0.001745452,"threshold_uncertainty_score":0.01298666},"labels":[],"label_agreement":null},{"id":"W2889372359","doi":"10.1109/spawc.2018.8445986","title":"Neural Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Soft-decision decoder; Sequential decoding; List decoding; Algorithm; Artificial neural network; Polar; Berlekamp–Welch algorithm; Latency (audio); Concatenated error correction code; Telecommunications; Artificial intelligence; Block code","score_opus":0.019323402075933208,"score_gpt":0.2929403306562726,"score_spread":0.2736169285803394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889372359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06226964,0.00028756834,0.93013287,0.00016635038,0.00007680004,0.000040908766,0.00007822037,0.0006295061,0.006318141],"genre_scores_gemma":[0.62797844,0.0005470389,0.3601388,0.00017063919,0.00004937037,0.00007663044,0.00030769943,0.000076722135,0.010654781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959916,0.000085938074,0.000025982365,0.000050763218,0.0001895036,0.000048730548],"domain_scores_gemma":[0.99918324,0.00028044757,0.00007235273,0.000106150794,0.00033347038,0.000024396062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040587314,0.0004344087,0.00033194825,0.00046961394,0.0003067448,0.00047639257,0.0004554012,0.0004450911,0.0012594674],"category_scores_gemma":[0.002192371,0.00016780451,0.0002672804,0.00044006816,0.00044635238,0.0005438293,0.00061713246,0.0005630414,0.0005415822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065637,0.0000954329,0.0013390012,0.00026926238,0.000070959024,0.0004354484,0.00026450475,0.32043946,0.15602167,0.07965604,0.002708304,0.43804356],"study_design_scores_gemma":[0.000017745493,0.00006892234,0.00018569091,0.000014138069,0.000010590994,0.00013811541,0.000019470923,0.9216315,0.0690307,0.006889754,0.0019802544,0.000013116666],"about_ca_topic_score_codex":0.0032422566,"about_ca_topic_score_gemma":0.004805523,"teacher_disagreement_score":0.0032422566,"about_ca_system_score_codex":0.00038055872,"about_ca_system_score_gemma":0.0013153515,"threshold_uncertainty_score":0.006446779},"labels":[],"label_agreement":null},{"id":"W2889614711","doi":"10.1049/iet-com.2018.5491","title":"Robust quaternary fountain codes in AWGN interference","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Fountain; Interference (communication); Additive white Gaussian noise; Computer science; Quaternary; Telecommunications; Mathematics; White noise; Decoding methods; Concatenated error correction code; Block code; Geology; Geography","score_opus":0.1026133796919187,"score_gpt":0.3357789117287844,"score_spread":0.23316553203686569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889614711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3146198,0.0004549427,0.67774934,0.00031549556,0.000050684688,0.000027476985,0.00007805541,0.00036088564,0.006343274],"genre_scores_gemma":[0.9611993,0.00013938574,0.03714388,0.000051882977,0.000015963768,0.000015828304,0.000033218977,0.000023818542,0.00137686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994993,0.00012767414,0.000021800515,0.000053925927,0.00020279728,0.00009446341],"domain_scores_gemma":[0.99863225,0.0006212074,0.00030421623,0.0001735229,0.00021074168,0.000058149562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080761866,0.00034601105,0.00044243247,0.0006098354,0.00036945683,0.0007031594,0.00056606287,0.0006621529,0.0004983095],"category_scores_gemma":[0.0034632804,0.00014052339,0.00020379078,0.0005051659,0.0012071811,0.0008336814,0.00078106683,0.0005329435,0.00018729296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005360196,0.00006185192,0.0012069726,0.00014521436,0.000046691217,0.00035174654,0.00031619123,0.4838433,0.09324839,0.3617217,0.00087431975,0.057647727],"study_design_scores_gemma":[0.00002114688,0.000100333455,0.00030319125,0.000017109005,0.000007984185,0.00017461008,0.000028717739,0.94296116,0.027794931,0.027671207,0.000896459,0.000023110058],"about_ca_topic_score_codex":0.0010513334,"about_ca_topic_score_gemma":0.0006858396,"teacher_disagreement_score":0.0010513334,"about_ca_system_score_codex":0.0007292604,"about_ca_system_score_gemma":0.00071778113,"threshold_uncertainty_score":0.0052912235},"labels":[],"label_agreement":null},{"id":"W2893800824","doi":"10.1109/icee.2018.8472553","title":"Low Decoding Complexity of LDPC Codes Over the Binary Erasure Channel","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Binary erasure channel; Erasure; Belief propagation; Algorithm; Computer science; Sequential decoding; Binary number; Set (abstract data type); List decoding; Channel (broadcasting); Theoretical computer science; Mathematics; Concatenated error correction code; Block code; Arithmetic; Channel capacity; Telecommunications","score_opus":0.058922926078977034,"score_gpt":0.30218271702814564,"score_spread":0.2432597909491686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893800824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22565046,0.00080584246,0.76566756,0.0006168999,0.000049986214,0.0000641739,0.00015329836,0.0011532773,0.005838377],"genre_scores_gemma":[0.83219343,0.00036500336,0.16463678,0.00009838868,0.000025335914,0.00008047699,0.0001737476,0.00009168577,0.0023352185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982893,0.00032832086,0.000074337535,0.00015292165,0.0009834575,0.00017163249],"domain_scores_gemma":[0.99379385,0.004552102,0.00042186896,0.0005426563,0.00060325314,0.00008625275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007568262,0.0004361003,0.0006572392,0.00072335114,0.00045047572,0.0011412677,0.0006289089,0.0007808778,0.0011473557],"category_scores_gemma":[0.0076918104,0.00025932927,0.00022796437,0.00063238153,0.0007008146,0.001615745,0.00063387834,0.001007859,0.00029999594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008955377,0.00017099138,0.004099248,0.00044259778,0.00010069556,0.00035340435,0.00026747587,0.6547289,0.08634548,0.07955805,0.0020852657,0.17095238],"study_design_scores_gemma":[0.00002913959,0.00003966561,0.0006019483,0.000013001815,0.000010540281,0.00009734544,0.000012073366,0.9668551,0.02115925,0.010653089,0.0005142609,0.000014502346],"about_ca_topic_score_codex":0.0023041351,"about_ca_topic_score_gemma":0.002637612,"teacher_disagreement_score":0.0023041351,"about_ca_system_score_codex":0.0012056826,"about_ca_system_score_gemma":0.0022720324,"threshold_uncertainty_score":0.008747876},"labels":[],"label_agreement":null},{"id":"W2898132586","doi":"10.1109/acssc.2018.8645388","title":"Learning from the Syndrome","year":2018,"lang":"en","type":"article","venue":"2018 52nd Asilomar Conference on Signals, Systems, and Computers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Code word; Inference; Decoding methods; Function (biology); Algorithm; Relaxation (psychology); Block code; Block (permutation group theory); Machine learning; Artificial intelligence; Mathematics; Medicine","score_opus":0.04598265160560145,"score_gpt":0.2577555843162757,"score_spread":0.21177293271067427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898132586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01502518,0.00021367116,0.98230225,0.00028812326,0.00006246084,0.00002368382,0.000114807044,0.0004373911,0.001532368],"genre_scores_gemma":[0.6907377,0.00076930644,0.29559505,0.0007258656,0.00026726138,0.00019257423,0.0011325055,0.00029634908,0.010283312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898106,0.0003535067,0.0000625238,0.00021759963,0.0003026877,0.000082557875],"domain_scores_gemma":[0.9952362,0.0031056346,0.00028641388,0.00057640806,0.0006578049,0.00013763484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015691663,0.0009912513,0.0009111063,0.0007027907,0.000314752,0.0010069214,0.001141433,0.0012795969,0.0032545635],"category_scores_gemma":[0.013750674,0.00039105225,0.00039475452,0.00047533773,0.0010497121,0.002055525,0.0017591144,0.0017560506,0.00086582336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039585633,0.00008899037,0.002250338,0.00023406942,0.00012263432,0.00027493446,0.00012969601,0.5891438,0.010569894,0.091377735,0.0057330425,0.29967898],"study_design_scores_gemma":[0.000018327253,0.000062209605,0.0001761929,0.00002386921,0.000012329331,0.00009876837,0.00001137813,0.96590614,0.003994174,0.028489066,0.0011968834,0.00001064888],"about_ca_topic_score_codex":0.0014118677,"about_ca_topic_score_gemma":0.0016016755,"teacher_disagreement_score":0.0032545635,"about_ca_system_score_codex":0.0006672337,"about_ca_system_score_gemma":0.0013968571,"threshold_uncertainty_score":0.010887623},"labels":[],"label_agreement":null},{"id":"W2899037237","doi":"10.22215/etd/2018-13265","title":"Multilevel Polar Coded-Modulation for Wireless Communications","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Forward error correction; MIMO; Fading; Algorithm; Hybrid automatic repeat request; Block code; Turbo code; Decoding methods; Electronic engineering; Theoretical computer science; Transmission (telecommunications); Telecommunications; Channel (broadcasting); Engineering","score_opus":0.04309928077665302,"score_gpt":0.34918620534614525,"score_spread":0.3060869245694922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899037237","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03186758,0.18135859,0.36697802,0.0061946907,0.002673368,0.00023355876,0.0006594871,0.0006436513,0.40939102],"genre_scores_gemma":[0.52093595,0.15256895,0.15810458,0.0015191468,0.001462009,0.0002749765,0.0010259146,0.00014814516,0.1639602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988556,0.000018013812,0.0000037462369,0.000016445521,0.0000645532,0.000011641421],"domain_scores_gemma":[0.999925,0.000023011804,0.000006336055,0.000010045274,0.000031057392,0.0000044761705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012887384,0.00024281183,0.00018515477,0.00034294475,0.0002631495,0.0006074726,0.00021931823,0.0003756781,0.00539942],"category_scores_gemma":[0.00041615852,0.00007825231,0.0000950368,0.0009272697,0.0002775074,0.00037981066,0.0003668883,0.000862422,0.0017337681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076964025,0.00005180141,0.00020618967,0.00072700647,0.000014462822,0.0001215698,0.00033136795,0.0054071485,0.043765385,0.39378986,0.025504438,0.5300038],"study_design_scores_gemma":[0.0000260675,0.00014133938,0.0011853036,0.0005960109,0.000023063756,0.00060753815,0.00016429307,0.03266818,0.03096573,0.1993654,0.73421293,0.00004422955],"about_ca_topic_score_codex":0.00044102987,"about_ca_topic_score_gemma":0.00065276393,"teacher_disagreement_score":0.00539942,"about_ca_system_score_codex":0.0004911117,"about_ca_system_score_gemma":0.00038143896,"threshold_uncertainty_score":0.01806283},"labels":[],"label_agreement":null},{"id":"W2899161352","doi":"10.1109/icc.2019.8761399","title":"Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cyclic redundancy check; Belief propagation; Computer science; Factor graph; Decoding methods; Polar code; Algorithm; Polar; Redundancy (engineering); Low-density parity-check code; Error detection and correction; Propagation of uncertainty; Concatenated error correction code; Forward error correction; Overhead (engineering); Turbo code; Block code","score_opus":0.02877681902638675,"score_gpt":0.2846153124911657,"score_spread":0.25583849346477894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899161352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07347401,0.00028713312,0.92100143,0.0002663712,0.00007099091,0.000050881343,0.000102491154,0.00067604246,0.004070698],"genre_scores_gemma":[0.7141445,0.00029970554,0.27958786,0.00013699515,0.00004248925,0.000065972075,0.0002710545,0.00006200287,0.0053894217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993893,0.00015682897,0.000028015504,0.00008940074,0.00025579115,0.000080637314],"domain_scores_gemma":[0.9979539,0.00097443967,0.00017341514,0.00015662299,0.00070384267,0.00003779592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282757,0.00075995334,0.0005293086,0.0004713846,0.0003243502,0.00054524885,0.0007337459,0.0007735297,0.0009746983],"category_scores_gemma":[0.005287698,0.00026149082,0.00027601287,0.0006189033,0.00074221566,0.00085792074,0.00067513634,0.00078069436,0.0004076067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004670762,0.000058359943,0.001032586,0.00010711662,0.000047878293,0.00018527836,0.00012407012,0.8150652,0.018728493,0.017161123,0.0015042381,0.14551854],"study_design_scores_gemma":[0.000008064236,0.000022031505,0.000102659316,0.0000042649904,0.000005966287,0.000021792468,0.000005373236,0.99233985,0.005602842,0.0016505637,0.00023133663,0.000005271284],"about_ca_topic_score_codex":0.009215559,"about_ca_topic_score_gemma":0.00943916,"teacher_disagreement_score":0.009215559,"about_ca_system_score_codex":0.00075444917,"about_ca_system_score_gemma":0.0012291413,"threshold_uncertainty_score":0.018323839},"labels":[],"label_agreement":null},{"id":"W2899428255","doi":"10.1007/s11265-018-1413-4","title":"Operation Merging for Hardware Implementations of Fast Polar Decoders","year":2018,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Throughput; Polar code; Block (permutation group theory); Node (physics); Application-specific integrated circuit; Coding (social sciences); Channel (broadcasting)","score_opus":0.03184729412565777,"score_gpt":0.3307016108114475,"score_spread":0.2988543166857897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899428255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08719523,0.00067493727,0.8989258,0.00014769475,0.00012873716,0.00010869161,0.00014669567,0.0032098494,0.0094623575],"genre_scores_gemma":[0.4767263,0.00034914346,0.51487625,0.00013164083,0.000083339764,0.00011660462,0.0004461901,0.000280732,0.006989792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923897,0.00017147593,0.00007276053,0.00008249937,0.0002928552,0.00014142442],"domain_scores_gemma":[0.99898773,0.00039359572,0.000091421934,0.00021285043,0.000271127,0.000043154327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071236014,0.0007507685,0.00044707712,0.0009298101,0.0007822247,0.0015054137,0.0010898135,0.00047144483,0.007545966],"category_scores_gemma":[0.001589483,0.00044747323,0.00034369525,0.00095075986,0.0004579633,0.0015632333,0.0015606951,0.0007436554,0.0019941062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002304722,0.00019421222,0.0018159016,0.00042404176,0.00009684794,0.0004003508,0.00054324727,0.030751735,0.16869248,0.11766045,0.0059248395,0.67119116],"study_design_scores_gemma":[0.00023197496,0.001144148,0.0014662185,0.00014347839,0.00016505225,0.001003811,0.00039399875,0.36459184,0.5389886,0.055913527,0.03582793,0.00012942862],"about_ca_topic_score_codex":0.00097449124,"about_ca_topic_score_gemma":0.0025858865,"teacher_disagreement_score":0.007545966,"about_ca_system_score_codex":0.0005489309,"about_ca_system_score_gemma":0.0012745041,"threshold_uncertainty_score":0.025243819},"labels":[],"label_agreement":null},{"id":"W2899538333","doi":"10.1109/tcomm.2018.2880204","title":"Throughput-Based Design for Polar-Coded Modulation","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Throughput; Algorithm; Decoding methods; Coding gain; Code rate; Quadrature amplitude modulation; Polar code; Automatic repeat request; Real-time computing; Bit error rate; Telecommunications link; Computer network; Telecommunications; Wireless","score_opus":0.12284797493317359,"score_gpt":0.3495131739354024,"score_spread":0.22666519900222878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899538333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077272197,0.00028519952,0.9857287,0.00010166989,0.000043420496,0.00007595488,0.00007194282,0.0005215784,0.005444473],"genre_scores_gemma":[0.6879741,0.00080728665,0.30575922,0.00020041481,0.00011440908,0.00025942703,0.00022485673,0.00017568246,0.004484599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894756,0.00027414432,0.000044009324,0.00014515177,0.0004982586,0.00009083722],"domain_scores_gemma":[0.9985379,0.0004940158,0.00019717081,0.00014968112,0.00057973556,0.000041587708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083493313,0.0009642044,0.00046795566,0.0008765849,0.00053867936,0.0011163083,0.00086266414,0.00049344293,0.0021355108],"category_scores_gemma":[0.0035397003,0.00030749966,0.00025173533,0.0007477703,0.0005493977,0.0007368136,0.0007818219,0.0007353773,0.0010977932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038322012,0.000114448165,0.0012836689,0.0003010373,0.00006962829,0.00026456238,0.0002631738,0.53640175,0.14132212,0.13236916,0.0040537785,0.18317342],"study_design_scores_gemma":[0.000024907064,0.00017330512,0.0003087215,0.00004315613,0.000032433734,0.00023140505,0.000023416593,0.91357017,0.058164086,0.020919196,0.006476449,0.00003275489],"about_ca_topic_score_codex":0.00090382784,"about_ca_topic_score_gemma":0.0009856209,"teacher_disagreement_score":0.0021355108,"about_ca_system_score_codex":0.0015195864,"about_ca_system_score_gemma":0.0010575554,"threshold_uncertainty_score":0.011025429},"labels":[],"label_agreement":null},{"id":"W2902814568","doi":"10.1109/wcsp.2018.8555566","title":"Rate Matching and Piecewise Sequence Adaptation for Polar Codes with Reed-Solomon Kernels","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Piecewise; Kernel (algebra); Matching (statistics); Algorithm; Sequence (biology); Mathematics; Binary number; Computation; Computer science; Dimension (graph theory); Discrete mathematics; Arithmetic; Statistics; Combinatorics","score_opus":0.039855244250454246,"score_gpt":0.29062993552079314,"score_spread":0.2507746912703389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902814568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044644624,0.00037144037,0.9526143,0.00006722168,0.00004044662,0.00004617374,0.000021960663,0.00027908964,0.0019148204],"genre_scores_gemma":[0.7762846,0.00074417447,0.21990082,0.00007710495,0.00006240917,0.00006645272,0.00005154399,0.00007955564,0.0027333929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991467,0.0002645389,0.000047460562,0.00013833542,0.00030976135,0.00009316401],"domain_scores_gemma":[0.9981669,0.0008533104,0.00034957426,0.0003494916,0.0002391734,0.000041516865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064029475,0.00055137894,0.00034900164,0.00052931753,0.00028485287,0.0005604973,0.0006177648,0.00043274387,0.0009044799],"category_scores_gemma":[0.005012001,0.00024048254,0.00034726667,0.0006465526,0.000667546,0.001143449,0.0006905375,0.00073578773,0.00038797458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084617134,0.00010825478,0.001777891,0.00033484842,0.000072185554,0.00043731483,0.0004081211,0.35861582,0.17470826,0.1421428,0.0010409878,0.31950727],"study_design_scores_gemma":[0.000014644989,0.00026105784,0.0003387421,0.000024055222,0.000023391623,0.0005325127,0.000045798617,0.90945613,0.075500056,0.01111479,0.0026516058,0.000037243994],"about_ca_topic_score_codex":0.0006108895,"about_ca_topic_score_gemma":0.0003105966,"teacher_disagreement_score":0.0009044799,"about_ca_system_score_codex":0.00044356333,"about_ca_system_score_gemma":0.00047249804,"threshold_uncertainty_score":0.0033861995},"labels":[],"label_agreement":null},{"id":"W2903040940","doi":"10.1109/wcsp.2018.8555718","title":"Enhanced Bit-Flipping Successive Cancellation Decoding for Convolutional Polar Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Decoding methods; Cyclic redundancy check; Convolutional code; Computer science; Algorithm; Redundancy (engineering); Polar; Coding (social sciences); Coding gain; Sequential decoding; Mathematics; Block code","score_opus":0.023367788234559626,"score_gpt":0.30549452366938684,"score_spread":0.2821267354348272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903040940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017495252,0.00044556783,0.9780662,0.00011387151,0.00009429428,0.000043234846,0.000060394512,0.000503966,0.0031772784],"genre_scores_gemma":[0.31924313,0.0010427294,0.67195743,0.00021748735,0.00012268224,0.00006660074,0.00028175983,0.0000856772,0.006982544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993173,0.00014054916,0.000032700773,0.00006533145,0.00038582608,0.000058278085],"domain_scores_gemma":[0.9990728,0.00024994317,0.00009961926,0.00017058157,0.00036563622,0.000041471485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044161163,0.0008219159,0.00037819706,0.0008297694,0.0003551089,0.00057303905,0.0005626396,0.0005513839,0.0014842856],"category_scores_gemma":[0.002183964,0.00018604402,0.00031299517,0.0007559857,0.00051078957,0.0007210098,0.0007526815,0.00077464175,0.00084938854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006133015,0.000087064655,0.0012582637,0.00031970293,0.00007108464,0.00040651386,0.00021380506,0.091159694,0.24305041,0.056023665,0.0025997576,0.6041968],"study_design_scores_gemma":[0.00004743549,0.00023301518,0.0004442046,0.000046647325,0.00004026815,0.0008986154,0.000029258877,0.7710733,0.20809354,0.007856277,0.011176529,0.000060902916],"about_ca_topic_score_codex":0.0016846611,"about_ca_topic_score_gemma":0.0023567025,"teacher_disagreement_score":0.0016846611,"about_ca_system_score_codex":0.00039876826,"about_ca_system_score_gemma":0.0011558128,"threshold_uncertainty_score":0.004965365},"labels":[],"label_agreement":null},{"id":"W2908007131","doi":"10.1049/el.2018.6940","title":"Repetition‐assisted decoding of polar codes","year":2019,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsemi (Canada)","funders":"Australian Research Council","keywords":"Decoding methods; Polar; Repetition (rhetorical device); Computer science; List decoding; Sequential decoding; Electronic engineering; Telecommunications; Concatenated error correction code; Physics; Engineering; Block code","score_opus":0.007788063098156485,"score_gpt":0.23226176889809266,"score_spread":0.22447370579993617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908007131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.323707,0.0017259051,0.65333164,0.000492298,0.00025351724,0.0000737792,0.0001266748,0.001114782,0.019174378],"genre_scores_gemma":[0.773463,0.0012043978,0.21224491,0.0002058594,0.00013068796,0.000054836164,0.00019676353,0.00008242221,0.012417073],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994727,0.00013743888,0.00002137492,0.00005097518,0.00026044156,0.00005720602],"domain_scores_gemma":[0.9991561,0.00026899137,0.00013355109,0.00013452616,0.00028142188,0.00002542203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003756645,0.000354698,0.0002819803,0.00042194076,0.00029079866,0.0003374014,0.000428568,0.00047898758,0.0011280215],"category_scores_gemma":[0.0015105207,0.0001582493,0.00019780474,0.0003679112,0.00036627182,0.0004264704,0.0006413822,0.0005915017,0.00083833723],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060719496,0.000055112407,0.0010265097,0.00024841804,0.000036435726,0.00061001023,0.00025608504,0.052109983,0.7215817,0.02905148,0.0016296272,0.19278747],"study_design_scores_gemma":[0.000046965473,0.0003315183,0.00070482655,0.000037847058,0.000024243356,0.0009272863,0.000037162634,0.2683847,0.7147162,0.004937866,0.009793306,0.00005807509],"about_ca_topic_score_codex":0.0006100732,"about_ca_topic_score_gemma":0.0009294722,"teacher_disagreement_score":0.0011280215,"about_ca_system_score_codex":0.00023460286,"about_ca_system_score_gemma":0.0005917659,"threshold_uncertainty_score":0.00377357},"labels":[],"label_agreement":null},{"id":"W2909099852","doi":"10.48550/arxiv.1805.09378","title":"Convolutional Polar Codes on Channels with Memory using Tensor Networks","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Polar; Computer science; Tensor (intrinsic definition); Convolutional code; Physics; Algorithm; Mathematics; Decoding methods; Geometry; Astronomy","score_opus":0.08322893827590501,"score_gpt":0.20369919215029264,"score_spread":0.12047025387438763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909099852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092465855,0.00032706826,0.8984803,0.00031111183,0.000055558427,0.00004436818,0.00011310121,0.0006390697,0.007563588],"genre_scores_gemma":[0.7909974,0.00060208247,0.20061612,0.00013075187,0.000058913018,0.00009301933,0.0002338644,0.00013478601,0.007132945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00013293924,0.000015315105,0.00005082388,0.00010218559,0.00006189848],"domain_scores_gemma":[0.9988563,0.0005623377,0.00012476215,0.0001878515,0.00021753303,0.000051212828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056083716,0.00057269563,0.0004098184,0.00053260487,0.00047582708,0.0009706112,0.0007198794,0.00064888695,0.0016056853],"category_scores_gemma":[0.0030579693,0.00029315223,0.0003885662,0.0006539442,0.00140754,0.0017900375,0.0012824953,0.0011377329,0.0003787038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014755361,0.000029526966,0.00062974857,0.00007263152,0.000026416965,0.000100230056,0.00015331873,0.63225776,0.0069932938,0.31470093,0.0013976208,0.04349095],"study_design_scores_gemma":[0.0000048253155,0.000012403758,0.000042913627,0.000005899777,0.0000035963055,0.000015474607,0.000008871281,0.96239257,0.0022799498,0.03456607,0.00066083664,0.0000066192247],"about_ca_topic_score_codex":0.0058584725,"about_ca_topic_score_gemma":0.005551725,"teacher_disagreement_score":0.0058584725,"about_ca_system_score_codex":0.001097389,"about_ca_system_score_gemma":0.0010658401,"threshold_uncertainty_score":0.011648774},"labels":[],"label_agreement":null},{"id":"W2909503871","doi":"10.1109/tsp.2018.2890066","title":"Stochastic Bit-Wise Iterative Decoding of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Stochastic computing; Belief propagation; Throughput; Berlekamp–Welch algorithm; Latency (audio); Algorithm; Wireless; Sequential decoding; Convergence (economics); Low latency (capital markets); Parallel computing; Computer engineering; Computer network; Telecommunications; Computation; Block code","score_opus":0.020063870288671837,"score_gpt":0.27454883355405607,"score_spread":0.2544849632653842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909503871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014534017,0.00018622685,0.98236173,0.000099681194,0.00003600352,0.00002626238,0.00003806351,0.00018909709,0.0025289196],"genre_scores_gemma":[0.54733807,0.0007860993,0.44679004,0.00018864484,0.00006911232,0.00012258474,0.00022703367,0.000073924915,0.0044044754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907494,0.00025478177,0.00006013111,0.00012363921,0.0003829965,0.00010348182],"domain_scores_gemma":[0.99874675,0.0004807267,0.00014146966,0.00014831254,0.00044058842,0.00004204637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006453309,0.0005724432,0.0005853589,0.00046219738,0.0004110354,0.0008610053,0.00067930244,0.00053846836,0.0010615481],"category_scores_gemma":[0.0030772972,0.00024582868,0.000347664,0.000764402,0.00069619983,0.00075892743,0.0008147974,0.0008095553,0.0005183882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031456313,0.0000510151,0.00092125544,0.00019025836,0.00005313789,0.00028376706,0.00023168598,0.58933794,0.04850679,0.17148474,0.002060253,0.18656452],"study_design_scores_gemma":[0.000009538976,0.00004421682,0.00007798397,0.000012663028,0.0000060706147,0.000078936864,0.000010488581,0.97440296,0.012864669,0.011173566,0.001308584,0.000010364943],"about_ca_topic_score_codex":0.0017658032,"about_ca_topic_score_gemma":0.0021688784,"teacher_disagreement_score":0.0017658032,"about_ca_system_score_codex":0.0004501952,"about_ca_system_score_gemma":0.0014568154,"threshold_uncertainty_score":0.0035512447},"labels":[],"label_agreement":null},{"id":"W2911101083","doi":"10.1109/tit.2021.3132675","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China; Research Grants Council, University Grants Committee; William and Flora Hewlett Foundation; National Science Foundation","keywords":"Mathematics; Algorithm; Polynomial; Mutual information; Channel (broadcasting); Finite state; Regular polygon; Exponential function; Channel capacity; Euclidean space; Mathematical optimization; Applied mathematics; Computer science; Markov chain; Combinatorics; Mathematical analysis; Statistics","score_opus":0.021461174823274375,"score_gpt":0.25001115417279673,"score_spread":0.22854997934952237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911101083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002626166,0.00006044134,0.9949426,0.000101713704,0.00003581031,0.0000627719,0.000057043377,0.0010887127,0.0010247085],"genre_scores_gemma":[0.14598429,0.00009969564,0.85016483,0.0001261874,0.0000782185,0.00038916303,0.00029724956,0.0003043645,0.002555936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860543,0.0002958891,0.00007333441,0.00033416963,0.0005290764,0.00016217343],"domain_scores_gemma":[0.9964079,0.00211501,0.00017026112,0.000566016,0.0006454171,0.00009531084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012886383,0.0011620384,0.00082114176,0.0012922481,0.0007860317,0.0013062173,0.002370784,0.0014424868,0.006775147],"category_scores_gemma":[0.009159772,0.0005513986,0.0008790306,0.0009821319,0.0012828454,0.001825817,0.0016938637,0.0027469585,0.0017100484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031288198,0.00019684539,0.00084206514,0.00019943203,0.00009902927,0.00014442779,0.00016214591,0.49918297,0.010273285,0.17026958,0.0069641885,0.31135315],"study_design_scores_gemma":[0.000030059082,0.000017648743,0.00007047954,0.000008693409,0.000005392191,0.000027889091,0.000006082421,0.97201693,0.0025384421,0.024196312,0.0010675113,0.00001463442],"about_ca_topic_score_codex":0.0047125863,"about_ca_topic_score_gemma":0.005278426,"teacher_disagreement_score":0.006775147,"about_ca_system_score_codex":0.0019136673,"about_ca_system_score_gemma":0.0028034972,"threshold_uncertainty_score":0.022665083},"labels":[],"label_agreement":null},{"id":"W2911338190","doi":"10.1109/wcnc.2019.8885698","title":"Fast Decoding of Multi-Kernel Polar Codes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; List decoding; Polar code; Computer science; Algorithm; Polar; Code word; Mathematics; Block code; Concatenated error correction code; Physics","score_opus":0.0423110682051343,"score_gpt":0.30854938003823557,"score_spread":0.26623831183310126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911338190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0626254,0.00018839928,0.9282962,0.0001247604,0.000069466376,0.000056708697,0.00013509615,0.0010466712,0.0074572046],"genre_scores_gemma":[0.54949903,0.0004225147,0.43940702,0.00012817116,0.00004918823,0.00009338826,0.0005222921,0.000233028,0.009645436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992888,0.00011437981,0.000046993562,0.00010837021,0.00033236542,0.000109174456],"domain_scores_gemma":[0.99796414,0.00058030745,0.00016399504,0.0006182094,0.00062161824,0.00005179364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043572715,0.00061820826,0.0004459666,0.00049134565,0.0003986267,0.0008749865,0.0006527098,0.0004580161,0.002371497],"category_scores_gemma":[0.0033880104,0.0002548064,0.00035491041,0.00061568513,0.000609483,0.0011781097,0.0012619884,0.00095983007,0.0015952695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000864258,0.00010044645,0.002162466,0.00036509475,0.000064566884,0.000670918,0.0006116869,0.19074419,0.19828938,0.18338405,0.0047112713,0.41803175],"study_design_scores_gemma":[0.000049969123,0.00014595703,0.00054298807,0.00004334463,0.00001882454,0.00045708174,0.000108812,0.7887667,0.16419506,0.036616378,0.009017585,0.00003720607],"about_ca_topic_score_codex":0.0014587152,"about_ca_topic_score_gemma":0.0024902166,"teacher_disagreement_score":0.002371497,"about_ca_system_score_codex":0.00051120744,"about_ca_system_score_gemma":0.0011828273,"threshold_uncertainty_score":0.007933438},"labels":[],"label_agreement":null},{"id":"W2911385876","doi":"10.1109/istc.2018.8625273","title":"Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Multiplicity (mathematics); Mathematics; Discrete mathematics; Combinatorics; Decoding methods; Algorithm; Geometry","score_opus":0.021975445583879306,"score_gpt":0.2853517169949502,"score_spread":0.2633762714110709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911385876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9125523,0.00013624401,0.08525711,0.000099904086,0.000010676911,0.000012966993,0.000146619,0.00022361505,0.0015605228],"genre_scores_gemma":[0.9861179,0.00006449786,0.01314742,0.000014391801,0.000008572454,0.000020792117,0.00022123818,0.00003997246,0.00036526396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961025,0.0000779726,0.000029359207,0.00009066571,0.00012667869,0.00006513761],"domain_scores_gemma":[0.9941559,0.003789627,0.00073869695,0.00056890014,0.00048724646,0.0002596354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008655887,0.0002844032,0.00035288074,0.0009182999,0.0003842672,0.00065472,0.0007688111,0.000544995,0.000717867],"category_scores_gemma":[0.013557883,0.00026902428,0.0002613946,0.0006233004,0.0009590225,0.0012777355,0.000768662,0.0005523312,0.00011832152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003189686,0.000093334726,0.042669628,0.00015562116,0.000084023246,0.00058646494,0.00021656814,0.84760153,0.02815752,0.061642446,0.00066937035,0.01780446],"study_design_scores_gemma":[0.0000055635037,0.00002746259,0.00320311,0.000009400629,0.000008777329,0.00014595785,0.000027795297,0.9777865,0.007779647,0.010865697,0.00012582281,0.000014252786],"about_ca_topic_score_codex":0.0009859209,"about_ca_topic_score_gemma":0.0016250343,"teacher_disagreement_score":0.0009859209,"about_ca_system_score_codex":0.0009516607,"about_ca_system_score_gemma":0.0005224763,"threshold_uncertainty_score":0.0069048405},"labels":[],"label_agreement":null},{"id":"W2912616608","doi":"10.1109/icc.2019.8761129","title":"Asymmetric Construction of Low-Latency and Length-Flexible Polar Codes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Latency (audio); Polar; Telecommunications; Computer network; Physics","score_opus":0.016151912897366043,"score_gpt":0.26089216777857394,"score_spread":0.2447402548812079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912616608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09542811,0.00020453983,0.89342284,0.00019591342,0.000088056346,0.00010260329,0.00016469207,0.0003489553,0.01004424],"genre_scores_gemma":[0.6947506,0.0004169163,0.29696038,0.0001499089,0.00006399029,0.00016631854,0.00032274975,0.00009289504,0.007076143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995022,0.000105124585,0.000029615521,0.000073537456,0.00020570445,0.00008384924],"domain_scores_gemma":[0.99872214,0.00037662752,0.0002180282,0.0003313319,0.0002867359,0.00006514793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038946385,0.00051288353,0.00035647413,0.000499822,0.00042632633,0.00060934736,0.0006706809,0.00042233535,0.0016444345],"category_scores_gemma":[0.0015745641,0.0001991592,0.00031882132,0.0005921588,0.0006116244,0.0007455606,0.0011473174,0.0009175927,0.00064743776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006119421,0.00011918587,0.0013948653,0.00021709448,0.00004230919,0.0006563774,0.00042630514,0.15179937,0.2618169,0.35220766,0.002298379,0.22840963],"study_design_scores_gemma":[0.00009688652,0.0003653845,0.0005260317,0.000060515315,0.00003812171,0.00080043555,0.000085938846,0.6277787,0.30428904,0.051026925,0.014852527,0.00007937939],"about_ca_topic_score_codex":0.00038856344,"about_ca_topic_score_gemma":0.00045783148,"teacher_disagreement_score":0.0016444345,"about_ca_system_score_codex":0.0004411497,"about_ca_system_score_gemma":0.0007903757,"threshold_uncertainty_score":0.005501151},"labels":[],"label_agreement":null},{"id":"W2913164447","doi":"10.1109/tcomm.2019.2896190","title":"Log-Likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes With Residual Phase Noise","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Huawei Technologies","keywords":"Quadrature amplitude modulation; Residual; Additive white Gaussian noise; Algorithm; Modulation (music); Bit error rate; Phase-shift keying; Signal-to-noise ratio (imaging); Computer science; Phase noise; Mathematics; Electronic engineering; Statistics; Decoding methods; White noise; Physics; Engineering","score_opus":0.04991518570806551,"score_gpt":0.3233230937693331,"score_spread":0.2734079080612676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072420095,0.00017516932,0.9902998,0.00005371344,0.000019350266,0.000021639406,0.000017670363,0.00030740802,0.0018631621],"genre_scores_gemma":[0.33298275,0.00053347624,0.66265154,0.00011694133,0.000052427742,0.000120598,0.00010965441,0.0002489109,0.003183707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.00036578096,0.000049675047,0.0000646792,0.00054299156,0.000048465034],"domain_scores_gemma":[0.99764025,0.0015503082,0.00021139304,0.0002758521,0.00029047785,0.000031815413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014003962,0.0006525061,0.00046127752,0.00065453746,0.00024487378,0.00079807144,0.0009798557,0.0006369426,0.0018442473],"category_scores_gemma":[0.008069454,0.0002480938,0.00037836423,0.00043386736,0.00049077644,0.001446644,0.0006512003,0.00081163,0.00087479816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028748345,0.00011709518,0.001961358,0.0003658075,0.0000784116,0.0007047749,0.00021558389,0.6642825,0.03737455,0.1058124,0.0018903875,0.18690959],"study_design_scores_gemma":[0.000007922578,0.000027303133,0.00013754451,0.000010259494,0.0000066329153,0.00017498559,0.000007741437,0.9863663,0.007813089,0.0044247215,0.0010128133,0.000010652347],"about_ca_topic_score_codex":0.00058953435,"about_ca_topic_score_gemma":0.00082082127,"teacher_disagreement_score":0.0018442473,"about_ca_system_score_codex":0.00059820275,"about_ca_system_score_gemma":0.00066517724,"threshold_uncertainty_score":0.0074061155},"labels":[],"label_agreement":null},{"id":"W2913328603","doi":"10.1109/istc.2018.8625374","title":"Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplicity (mathematics); Low-density parity-check code; Computation; Catalan number; Mathematics; Counting problem; Generalization; Decoding methods; Discrete mathematics; Code (set theory); Computer science; Combinatorics; Algorithm","score_opus":0.023038724132207325,"score_gpt":0.2900871196368367,"score_spread":0.2670483955046294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913328603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986737,0.00009172778,0.099222735,0.00012301699,0.000009336553,0.000015461006,0.00010907643,0.00020292656,0.0015520336],"genre_scores_gemma":[0.9817655,0.000044576504,0.01756205,0.00001802667,0.0000066497923,0.00002599688,0.00015127483,0.000034332643,0.00039160097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.00014890649,0.000034123655,0.0001028827,0.00015784563,0.00006830074],"domain_scores_gemma":[0.99348575,0.0046479153,0.00071808597,0.0004843125,0.00042930504,0.00023464602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011298782,0.00030043643,0.00038777487,0.0008773078,0.00041309634,0.0006968062,0.00077897956,0.00066576985,0.000667869],"category_scores_gemma":[0.013856016,0.0003174876,0.0002746099,0.0005800306,0.0011195686,0.0012793526,0.00074584025,0.00054464187,0.00009511813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016194716,0.00005848754,0.015718943,0.000070247785,0.00004527776,0.00021905056,0.00008742103,0.9195637,0.012090024,0.04297524,0.00033102013,0.008678669],"study_design_scores_gemma":[0.0000047091294,0.000018268369,0.0010721119,0.0000042135703,0.0000038697767,0.000043429744,0.000011891502,0.9869848,0.0035283698,0.008268426,0.000052038016,0.000007834919],"about_ca_topic_score_codex":0.0011077092,"about_ca_topic_score_gemma":0.0019279234,"teacher_disagreement_score":0.0011298782,"about_ca_system_score_codex":0.0010963101,"about_ca_system_score_gemma":0.0005290582,"threshold_uncertainty_score":0.007954299},"labels":[],"label_agreement":null},{"id":"W2913738884","doi":"10.1109/istc.2018.8625355","title":"On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Tanner graph; Low-density parity-check code; Adjacency matrix; Mathematics; Combinatorics; Discrete mathematics; Graph; Algorithm; Decoding methods; Error floor","score_opus":0.03132140871814146,"score_gpt":0.29896848788261493,"score_spread":0.2676470791644735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913738884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34028617,0.0011228852,0.649187,0.00071423437,0.0000941835,0.00012734254,0.0005187607,0.00052703655,0.0074223587],"genre_scores_gemma":[0.8193301,0.0010251284,0.17602102,0.00018738986,0.00013948123,0.00017436765,0.0005311147,0.0001440295,0.0024473506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990514,0.00030899898,0.00005604426,0.0001935129,0.00030100078,0.00008907491],"domain_scores_gemma":[0.9901844,0.007159623,0.0008362432,0.0007951654,0.00078368536,0.00024090464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011029863,0.0006065357,0.0006925166,0.0028059992,0.00075477094,0.0012249309,0.0008306863,0.0007723578,0.0013760529],"category_scores_gemma":[0.01436428,0.00031936672,0.00044371665,0.0021189647,0.0015810129,0.003129586,0.0009658898,0.00086255686,0.00021105021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000367455,0.00012404038,0.0074919835,0.00033009463,0.00007989234,0.0003339398,0.0006196899,0.36526868,0.020308051,0.48713398,0.0032487642,0.11469337],"study_design_scores_gemma":[0.000015085692,0.000042193507,0.00083363877,0.00004432088,0.000014226605,0.00013517421,0.00003941466,0.7817803,0.0044139503,0.21153893,0.0011135911,0.00002918272],"about_ca_topic_score_codex":0.0027787187,"about_ca_topic_score_gemma":0.002786552,"teacher_disagreement_score":0.0028059992,"about_ca_system_score_codex":0.0011010383,"about_ca_system_score_gemma":0.0008870274,"threshold_uncertainty_score":0.007988572},"labels":[],"label_agreement":null},{"id":"W2922114365","doi":"10.1109/jlt.2018.2880323","title":"Corrections to “Low-Complexity Concatenated LDPC-Staircase Codes” [Jun 18 2443-2449]","year":2018,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concatenated error correction code; Serial concatenated convolutional codes; Computer science; Turbo code; Low-density parity-check code; Algorithm; Theoretical computer science; Block code; Decoding methods","score_opus":0.03585889217671932,"score_gpt":0.3138175205978622,"score_spread":0.2779586284211429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922114365","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036755449,0.0036734561,0.036779437,0.09008341,0.8470548,0.00011470729,0.0020352143,0.0060260417,0.010557315],"genre_scores_gemma":[0.1725245,0.016864052,0.12347129,0.12209269,0.17192982,0.0006497011,0.0069614854,0.009233366,0.37627313],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651515,0.0004767646,0.00043293738,0.0004224275,0.0018111145,0.00034159113],"domain_scores_gemma":[0.9875546,0.0019172004,0.0009793306,0.001208684,0.007917101,0.00042310896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017544166,0.0023987598,0.0012522121,0.0023202586,0.0035074311,0.0020241924,0.0028336209,0.0054682815,0.028613824],"category_scores_gemma":[0.030621259,0.001497041,0.0020617563,0.0020914415,0.0020376416,0.0020585828,0.0019402346,0.008651683,0.016055634],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023933861,0.00005031875,0.000238796,0.0003350967,0.00008990361,0.0010492044,0.00019671675,0.0012106729,0.0038097298,0.010730408,0.95596653,0.02608347],"study_design_scores_gemma":[0.00007959826,0.000113587725,0.0012699368,0.00023643753,0.000105925,0.0011882853,0.00012173848,0.005328108,0.015679508,0.009980452,0.96569985,0.0001965572],"about_ca_topic_score_codex":0.010590871,"about_ca_topic_score_gemma":0.018615087,"teacher_disagreement_score":0.028613824,"about_ca_system_score_codex":0.0033942712,"about_ca_system_score_gemma":0.0025372934,"threshold_uncertainty_score":0.095722795},"labels":[],"label_agreement":null},{"id":"W2923426534","doi":"10.1109/tit.2020.3011556","title":"On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Discrete mathematics; Lambda; Low-density parity-check code; Dense graph; Multiplicity (mathematics); Triangle-free graph; Graph; 1-planar graph; Line graph; Algorithm; Decoding methods; Physics","score_opus":0.021742185949613677,"score_gpt":0.2936117421233498,"score_spread":0.2718695561737361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923426534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29766282,0.00044083205,0.69200647,0.00049216236,0.00007578713,0.000105788604,0.0009583696,0.0016297564,0.006628048],"genre_scores_gemma":[0.6807912,0.00048014478,0.31199005,0.00021638795,0.00013578935,0.00023835684,0.0022663644,0.00031903398,0.0035626537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989667,0.00027240498,0.00006403478,0.00027752377,0.00029150498,0.00012780583],"domain_scores_gemma":[0.9917303,0.0055229054,0.0008867935,0.00080153864,0.00060152705,0.00045695476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012060106,0.0011568883,0.00092690747,0.004563325,0.00084154424,0.001679135,0.0016344034,0.0013027355,0.0034911395],"category_scores_gemma":[0.014683676,0.00057297404,0.00076718745,0.0029189568,0.00205815,0.004758882,0.001628559,0.0011015733,0.0011542635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011155948,0.00048167937,0.02350141,0.00044844628,0.0002154824,0.00043636747,0.0006193158,0.43672976,0.024809578,0.26367062,0.008874979,0.23909679],"study_design_scores_gemma":[0.000028891653,0.00005742433,0.0013137279,0.000028638995,0.000011393773,0.00011687447,0.000062477186,0.8330448,0.0038477813,0.16060114,0.00085272203,0.000034101045],"about_ca_topic_score_codex":0.0033254577,"about_ca_topic_score_gemma":0.0046532503,"teacher_disagreement_score":0.004563325,"about_ca_system_score_codex":0.0009929021,"about_ca_system_score_gemma":0.0010763971,"threshold_uncertainty_score":0.011678994},"labels":[],"label_agreement":null},{"id":"W2923621805","doi":"10.1109/tcomm.2019.2906232","title":"Fast Successive-Cancellation-Based Decoders of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Sequential decoding; List decoding; Polar code; Algorithm; Latency (audio); Code (set theory); Parallel computing; Reduction (mathematics); Berlekamp–Welch algorithm; Concatenated error correction code; Mathematics; Telecommunications; Block code; Set (abstract data type)","score_opus":0.02210518038164526,"score_gpt":0.283981946344798,"score_spread":0.26187676596315274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923621805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0543311,0.00047514343,0.93583345,0.00019183602,0.0001134821,0.00010679828,0.00019398388,0.0017062534,0.0070480253],"genre_scores_gemma":[0.3876799,0.0005918041,0.60366213,0.00020637285,0.00009479111,0.00013847313,0.00047562842,0.00015808565,0.006992755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993874,0.00013167475,0.000040618816,0.00005546451,0.00031399805,0.00007076896],"domain_scores_gemma":[0.9983851,0.00056971953,0.00013462774,0.00020975248,0.0006537712,0.00004712152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071053556,0.0006175169,0.00041254103,0.0011010991,0.00044973454,0.00076070504,0.0006731344,0.00046485267,0.0028149916],"category_scores_gemma":[0.0023620147,0.00029575572,0.000334408,0.0008022464,0.00045893763,0.00093147525,0.0007503151,0.0007606101,0.0011298303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009784208,0.00011627909,0.0019707305,0.00040297958,0.0000796582,0.00046334235,0.0003332499,0.13079144,0.23592377,0.07660488,0.0057012774,0.5466341],"study_design_scores_gemma":[0.000098042125,0.0003024533,0.0005521805,0.000048861646,0.000035727968,0.00044202572,0.000053184987,0.7022778,0.27177083,0.013021622,0.011340089,0.000057237823],"about_ca_topic_score_codex":0.0024192412,"about_ca_topic_score_gemma":0.004010619,"teacher_disagreement_score":0.0028149916,"about_ca_system_score_codex":0.0006937036,"about_ca_system_score_gemma":0.0016413173,"threshold_uncertainty_score":0.009417057},"labels":[],"label_agreement":null},{"id":"W2925144048","doi":"","title":"Stochastic Computing with Integrated Optics","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Integrated optics; Optics; Physics","score_opus":0.05677558142636784,"score_gpt":0.19072526196570028,"score_spread":0.13394968053933243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925144048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072415814,0.0012589517,0.9013483,0.00058494933,0.00017690052,0.000057381592,0.00005965239,0.0008565988,0.023241509],"genre_scores_gemma":[0.8430989,0.00079634605,0.15010966,0.0001803418,0.000068249654,0.00006905125,0.000044267974,0.00007184003,0.005561216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965215,0.000058722024,0.000010370193,0.000051658677,0.00018474649,0.000042367425],"domain_scores_gemma":[0.9997662,0.000083067804,0.00002859762,0.000053858643,0.000052839194,0.000015492838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026083074,0.00033551356,0.00027136152,0.0002780882,0.00025195433,0.00081511895,0.00052163505,0.0004578393,0.0016094192],"category_scores_gemma":[0.00103408,0.0001715331,0.0002864073,0.00038508125,0.0007335904,0.0005178366,0.0006564232,0.00077640323,0.00031023822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001986754,0.00009591981,0.0008347434,0.00022517383,0.00006837379,0.0001309505,0.000096071504,0.23952734,0.08028023,0.563939,0.0023346243,0.11226886],"study_design_scores_gemma":[0.000026827967,0.00014163423,0.000305059,0.000034623798,0.0000251741,0.00008998477,0.000011753637,0.8730179,0.031700727,0.083592124,0.011030023,0.000024154948],"about_ca_topic_score_codex":0.0006651915,"about_ca_topic_score_gemma":0.00089230813,"teacher_disagreement_score":0.0016094192,"about_ca_system_score_codex":0.00081340846,"about_ca_system_score_gemma":0.0006366628,"threshold_uncertainty_score":0.005901754},"labels":[],"label_agreement":null},{"id":"W2938346405","doi":"10.1109/ciss.2019.8692789","title":"Length-Compatible Polar Codes: A Survey : (Invited Paper)","year":2019,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Puncturing; Polar; Computer science; Polar code; Flexibility (engineering); Algorithm; Coding (social sciences); Code (set theory); Block (permutation group theory); Block code; Theoretical computer science; Computer engineering; Telecommunications; Mathematics; Decoding methods; Programming language; Statistics; Physics","score_opus":0.01911263809848944,"score_gpt":0.2561988371804215,"score_spread":0.23708619908193207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938346405","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031713415,0.48690873,0.3869864,0.0037078424,0.0029586486,0.00017253186,0.00054265413,0.00053651,0.08647321],"genre_scores_gemma":[0.25016224,0.57354903,0.1425769,0.002224804,0.0032005676,0.00023089633,0.0012539121,0.00032676733,0.02647485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995166,0.00007982241,0.000039124086,0.00009421808,0.00021686996,0.000053435087],"domain_scores_gemma":[0.99830437,0.0007768927,0.00012367022,0.00014069714,0.00059838814,0.00005600406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737605,0.00052095135,0.00038325487,0.0020008048,0.0004015151,0.0011344802,0.0005752287,0.0008241503,0.0037587194],"category_scores_gemma":[0.0032774985,0.0003124165,0.00025122153,0.0028589813,0.0007489106,0.0018505722,0.0008697908,0.0012324261,0.0022892067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015221775,0.000049593546,0.0010563538,0.0012077396,0.000020256466,0.00017644608,0.00017976253,0.0081372745,0.005214259,0.09582196,0.019201433,0.8687827],"study_design_scores_gemma":[0.000034645265,0.00043063823,0.0016310561,0.00092313875,0.00006094622,0.0036015552,0.00025302207,0.029014286,0.021204172,0.06655946,0.87616897,0.00011815645],"about_ca_topic_score_codex":0.0010256818,"about_ca_topic_score_gemma":0.00049773365,"teacher_disagreement_score":0.0037587194,"about_ca_system_score_codex":0.0006221413,"about_ca_system_score_gemma":0.00078458106,"threshold_uncertainty_score":0.012574196},"labels":[],"label_agreement":null},{"id":"W2941720294","doi":"10.1109/access.2019.2910535","title":"Low Complexity Polar Decoder for 5G Embb Control Channel","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Computational complexity theory; Belief propagation; Algorithm; Error detection and correction; List decoding; Node (physics); Bit error rate; Concatenated error correction code; Sequential decoding; Polar code; Communication complexity; Linear network coding; Block code; Theoretical computer science; Computer network","score_opus":0.048326024380446184,"score_gpt":0.327832548875133,"score_spread":0.2795065244946868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941720294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024756331,0.0009822814,0.9623189,0.0005243095,0.00017472351,0.000105425985,0.00020862244,0.0007838058,0.010145494],"genre_scores_gemma":[0.73678195,0.0016463909,0.24672706,0.0005689623,0.00013757324,0.00014576042,0.00048239334,0.00006993548,0.013439994],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960274,0.00009035463,0.000016851152,0.00006086033,0.0001816836,0.000047532558],"domain_scores_gemma":[0.9996074,0.0001226823,0.00004016243,0.000044797936,0.00016719497,0.000017800348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032002112,0.0006039131,0.00041145153,0.0004274038,0.0005252803,0.0007233167,0.00041799858,0.0006370798,0.003251933],"category_scores_gemma":[0.0010051496,0.00017914597,0.00020569768,0.0003845563,0.0004372379,0.00066024164,0.0007118586,0.0008157421,0.00090560014],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012560339,0.00016855134,0.0019581383,0.0005828769,0.00009781652,0.0011968438,0.00035467328,0.345,0.13969345,0.14990196,0.013765793,0.3460238],"study_design_scores_gemma":[0.00007576067,0.00015432082,0.0002634807,0.00003785796,0.000034970977,0.00042385445,0.000036520174,0.9474693,0.03599422,0.009281427,0.00619727,0.000031075102],"about_ca_topic_score_codex":0.002774511,"about_ca_topic_score_gemma":0.004088297,"teacher_disagreement_score":0.003251933,"about_ca_system_score_codex":0.00046803796,"about_ca_system_score_gemma":0.0014031603,"threshold_uncertainty_score":0.010878801},"labels":[],"label_agreement":null},{"id":"W2945033151","doi":"10.1109/tit.2019.2917222","title":"Code Design Based on Connecting Spatially Coupled Graph Chains","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Decoding methods; Code (set theory); Computer science; Block (permutation group theory); Chain (unit); Concatenated error correction code; Algorithm; Block code; Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.014462411306443178,"score_gpt":0.23470088814558632,"score_spread":0.22023847683914313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945033151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24573398,0.00024673043,0.7455168,0.00020313017,0.00006980423,0.00011790652,0.00009498907,0.00032868274,0.0076878956],"genre_scores_gemma":[0.8272528,0.00022206536,0.16998512,0.00008414796,0.000022741227,0.0001612832,0.000098183235,0.000052958654,0.0021206862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997675,0.000063442494,0.000011210511,0.000047374113,0.00008934003,0.000021116795],"domain_scores_gemma":[0.9995598,0.00012566974,0.00006342859,0.00010034507,0.00010919031,0.000041570045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604338,0.00029764842,0.00026053892,0.00042856333,0.00040759452,0.00036855874,0.000560116,0.0005142054,0.0008433488],"category_scores_gemma":[0.00080823683,0.00019469393,0.00018807949,0.00043250964,0.0005526045,0.00047770128,0.0007422259,0.00049547927,0.0003113345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014839118,0.00011192825,0.0011840049,0.00023538711,0.00007361837,0.00036162286,0.00020581995,0.4132111,0.3230145,0.1975249,0.0010339747,0.06289475],"study_design_scores_gemma":[0.000024258807,0.00014861823,0.0003110824,0.000020765612,0.000022756898,0.00018546707,0.000022734404,0.89897895,0.06498041,0.03131951,0.0039564427,0.000029019597],"about_ca_topic_score_codex":0.0003555013,"about_ca_topic_score_gemma":0.0007326988,"teacher_disagreement_score":0.0008433488,"about_ca_system_score_codex":0.00030940934,"about_ca_system_score_gemma":0.0004400755,"threshold_uncertainty_score":0.0028212667},"labels":[],"label_agreement":null},{"id":"W2945448702","doi":"10.1109/tit.2019.2917683","title":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Upper and lower bounds; Algorithm; Energy (signal processing); Encoder; Encoding (memory); Polar code; Block (permutation group theory); Topology (electrical circuits); Discrete mathematics; Mathematics; Combinatorics; Artificial intelligence; Statistics","score_opus":0.017824784635746438,"score_gpt":0.24351747872334242,"score_spread":0.22569269408759599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945448702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20024614,0.0034496356,0.70396703,0.002911442,0.00022101388,0.00019338857,0.0007928568,0.0012988498,0.08691958],"genre_scores_gemma":[0.87517613,0.0028821817,0.104156844,0.0004763759,0.00025838948,0.0004471439,0.0010134014,0.0004059569,0.015183526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812645,0.00033285157,0.00007994557,0.00024153446,0.00072428316,0.00049496687],"domain_scores_gemma":[0.9913446,0.0069678053,0.00028932633,0.00085294794,0.00043563364,0.000109736735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049709,0.00093908457,0.0006798769,0.00096847775,0.00072043354,0.0028460233,0.001433694,0.0010997264,0.0088827405],"category_scores_gemma":[0.010964489,0.0003880245,0.00080201175,0.0013878999,0.002104312,0.004115564,0.0016147807,0.0020742214,0.0011757895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005927265,0.00013371401,0.001214279,0.00040367316,0.000058260386,0.00025185652,0.00022899958,0.46180645,0.02089746,0.4166002,0.006132354,0.09168009],"study_design_scores_gemma":[0.000026942003,0.00009422049,0.00055724307,0.000056518144,0.000029308592,0.00020361527,0.000066507826,0.8564978,0.012837362,0.12622115,0.003373516,0.00003573629],"about_ca_topic_score_codex":0.0026547634,"about_ca_topic_score_gemma":0.0037109517,"teacher_disagreement_score":0.0088827405,"about_ca_system_score_codex":0.0025790464,"about_ca_system_score_gemma":0.0018908897,"threshold_uncertainty_score":0.029715717},"labels":[],"label_agreement":null},{"id":"W2947190950","doi":"10.1109/access.2019.2919502","title":"Multiple-Block Combined Decoding for Cell Search With Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Block Error Rate; Decoding methods; Computer science; Algorithm; List decoding; Sequential decoding; Block (permutation group theory); Encoding (memory); Transmission (telecommunications); Theoretical computer science; Block code; Mathematics; Concatenated error correction code; Telecommunications","score_opus":0.03400998204498339,"score_gpt":0.3090088241215295,"score_spread":0.2749988420765461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947190950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898325,0.000925237,0.97470653,0.00014170322,0.000043623753,0.00004584234,0.000056359728,0.00018620852,0.004911254],"genre_scores_gemma":[0.5125272,0.0015768778,0.4797629,0.00019550504,0.000065534216,0.00015084971,0.0002053803,0.00006031655,0.0054554488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999161,0.00026343192,0.000035129746,0.00008538186,0.00037747153,0.00007757103],"domain_scores_gemma":[0.99912554,0.0004136704,0.00009828814,0.00009262977,0.00024393757,0.000025997608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053894153,0.0008014273,0.0006179137,0.0005903916,0.0004413423,0.0007599019,0.000500814,0.0006676526,0.0018825971],"category_scores_gemma":[0.0021909478,0.00028240593,0.00038768025,0.0010514185,0.0005081144,0.00094100565,0.00107494,0.00071424036,0.00079483906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005571616,0.0001025364,0.0017311849,0.00038997547,0.00012164266,0.00037058655,0.00028083788,0.48909995,0.09221138,0.108709134,0.0027898904,0.30363572],"study_design_scores_gemma":[0.00002588094,0.00008976622,0.00014882705,0.000030960073,0.000023388639,0.00019226618,0.000018411201,0.9669034,0.021864062,0.007397483,0.0032795873,0.0000259349],"about_ca_topic_score_codex":0.00161214,"about_ca_topic_score_gemma":0.0030427363,"teacher_disagreement_score":0.0018825971,"about_ca_system_score_codex":0.00056412007,"about_ca_system_score_gemma":0.0013048912,"threshold_uncertainty_score":0.0062978864},"labels":[],"label_agreement":null},{"id":"W2947712626","doi":"10.1007/s00373-019-02110-6","title":"Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Degree (music); Tanner graph; Discrete mathematics; Odd graph; Multiplicity (mathematics); Low-density parity-check code; Graph; Line graph; 1-planar graph; Decoding methods; Algorithm; Physics","score_opus":0.020632343594461828,"score_gpt":0.2576696587519261,"score_spread":0.23703731515746426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947712626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7299073,0.00042962626,0.21309496,0.0019422026,0.00032158423,0.00014897973,0.0015103957,0.001118331,0.051526595],"genre_scores_gemma":[0.94013864,0.00033136786,0.046859805,0.0005865684,0.00010111967,0.00017191033,0.0011062732,0.00033120293,0.010373092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00023475876,0.000036106638,0.00019281764,0.00017402902,0.00013000813],"domain_scores_gemma":[0.9946813,0.002312445,0.000647406,0.00119555,0.00081872573,0.00034450385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066491327,0.00067172584,0.00046964173,0.0019288431,0.0012652267,0.0018769858,0.0008735308,0.0016052941,0.007977784],"category_scores_gemma":[0.005297114,0.0005073183,0.0003604383,0.0018297918,0.0012221128,0.0026798258,0.00093020924,0.0012321151,0.00067083107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054094614,0.00024403312,0.0031915882,0.00023694898,0.000060712555,0.00041230986,0.00033653932,0.04054404,0.031319804,0.88354635,0.007284889,0.032281812],"study_design_scores_gemma":[0.00017425074,0.00008159035,0.0031593728,0.00009137791,0.00009339236,0.0008373373,0.00039919652,0.31196773,0.039040536,0.6314208,0.012647031,0.00008738345],"about_ca_topic_score_codex":0.0012119458,"about_ca_topic_score_gemma":0.0021172937,"teacher_disagreement_score":0.007977784,"about_ca_system_score_codex":0.0010613872,"about_ca_system_score_gemma":0.0007655867,"threshold_uncertainty_score":0.026688337},"labels":[],"label_agreement":null},{"id":"W2949161139","doi":"10.48550/arxiv.1308.1259","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Node (physics); Variable (mathematics); Graph; Computer science; Set (abstract data type); Characterization (materials science); Coding (social sciences); Simple (philosophy); Code (set theory); Class (philosophy); Mathematics; Discrete mathematics; Combinatorics; Error floor; Algorithm; Decoding methods; Statistics","score_opus":0.04591237933680283,"score_gpt":0.18907386936045678,"score_spread":0.14316149002365394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949161139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6862433,0.00041659747,0.2964355,0.00026144905,0.0000314714,0.000117731826,0.00054786325,0.00026073743,0.015685255],"genre_scores_gemma":[0.96398276,0.00027435916,0.03139723,0.00011003043,0.000041594154,0.00011375423,0.0005972552,0.00007942158,0.0034036029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996395,0.000060595,0.000021448595,0.00010342138,0.00010263759,0.00007242637],"domain_scores_gemma":[0.9980293,0.00097557897,0.00038400668,0.00018830196,0.0002267014,0.00019607738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002581528,0.00035617416,0.00043502447,0.001357881,0.0008298292,0.00083057635,0.0007133095,0.00052643794,0.0032244239],"category_scores_gemma":[0.0025322083,0.00031524838,0.0005427154,0.00082757074,0.0013589846,0.0013066897,0.0008518639,0.0009049139,0.0002481234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018295617,0.00012663893,0.009521578,0.00029573648,0.00004716072,0.00076161034,0.0010148283,0.08923594,0.033195883,0.83676744,0.0018854801,0.026964698],"study_design_scores_gemma":[0.00003972289,0.0001686008,0.0055790283,0.00007637629,0.00003978442,0.0010758818,0.00037279725,0.46560842,0.012224467,0.5093133,0.005436895,0.00006477515],"about_ca_topic_score_codex":0.0009057689,"about_ca_topic_score_gemma":0.0007743506,"teacher_disagreement_score":0.0032244239,"about_ca_system_score_codex":0.0005858302,"about_ca_system_score_gemma":0.00042691908,"threshold_uncertainty_score":0.010786772},"labels":[],"label_agreement":null},{"id":"W2949272805","doi":"10.48550/arxiv.cs/0612011","title":"Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Binary number; Parity (physics); Low-density parity-check code; Parity bit; Frame (networking); Computer science; Bit error rate; Bit (key); Algorithm; Statistics; Mathematics; Arithmetic; Telecommunications; Computer security; Decoding methods; Physics","score_opus":0.04967656923097404,"score_gpt":0.3078139570739864,"score_spread":0.2581373878430124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949272805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1385815,0.00012721767,0.8595356,0.00004911695,0.000008944323,0.000044055367,0.00011931738,0.00032745587,0.0012068327],"genre_scores_gemma":[0.7859538,0.0002411713,0.21273556,0.00002002742,0.0000124033295,0.000100016085,0.00020105529,0.00006974814,0.000666173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882,0.00046675926,0.00004174734,0.00012826153,0.0004701918,0.00007300124],"domain_scores_gemma":[0.9925902,0.005094879,0.00074513006,0.0007362426,0.00075247575,0.00008117927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017771348,0.0007305225,0.00063236285,0.0015024216,0.00033242328,0.0007415098,0.0008086625,0.0008290487,0.0005261588],"category_scores_gemma":[0.017848663,0.00034502483,0.0002604272,0.00073091284,0.0010325124,0.001079012,0.00071161607,0.0007137318,0.00025606356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002756814,0.000042959386,0.005074108,0.00008507305,0.00004246732,0.00010759156,0.00013415345,0.9041113,0.018461544,0.021539954,0.00028827312,0.049836878],"study_design_scores_gemma":[0.0000053048743,0.000012791181,0.00067291176,0.000007662783,0.000003684415,0.00003187141,0.0000058131945,0.98561585,0.009541065,0.003996559,0.00009237332,0.000014032643],"about_ca_topic_score_codex":0.0023179054,"about_ca_topic_score_gemma":0.0014800212,"teacher_disagreement_score":0.0023179054,"about_ca_system_score_codex":0.0008154732,"about_ca_system_score_gemma":0.0007732711,"threshold_uncertainty_score":0.00939846},"labels":[],"label_agreement":null},{"id":"W2949429534","doi":"10.48550/arxiv.1701.02379","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Combinatorics; Discrete mathematics; Degree (music); Graph; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.04597061034360059,"score_gpt":0.21065014677081714,"score_spread":0.16467953642721656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949429534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6308875,0.0010619942,0.35718927,0.00076714874,0.000049969447,0.00008583423,0.0004594864,0.00043528594,0.009063646],"genre_scores_gemma":[0.98693126,0.00050041283,0.009770641,0.00009579832,0.000038059672,0.000057929337,0.0002414139,0.00009910395,0.0022654724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992912,0.00025117645,0.000016129723,0.00014990952,0.00017384684,0.00011784692],"domain_scores_gemma":[0.9946768,0.0034087077,0.00049054244,0.00058417424,0.00062542286,0.00021432605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014462873,0.00048081137,0.00055080955,0.0014779881,0.000490421,0.0008467746,0.0008930669,0.0007572562,0.00162181],"category_scores_gemma":[0.0101130735,0.00038696543,0.00041719843,0.0009467202,0.0015824573,0.0021249298,0.00073669245,0.0009927251,0.00026067585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027146525,0.00006336891,0.0064320196,0.00012819565,0.000056764973,0.00033285018,0.00034073798,0.49931324,0.011848349,0.4648299,0.0018143132,0.014568826],"study_design_scores_gemma":[0.000008309727,0.000025229303,0.0011053403,0.000015265936,0.0000073268557,0.000107308886,0.00003331291,0.94616276,0.0017805186,0.05018733,0.00054390344,0.000023446788],"about_ca_topic_score_codex":0.0028392882,"about_ca_topic_score_gemma":0.0020261528,"teacher_disagreement_score":0.0028392882,"about_ca_system_score_codex":0.0015374888,"about_ca_system_score_gemma":0.0007917831,"threshold_uncertainty_score":0.011155307},"labels":[],"label_agreement":null},{"id":"W2949438557","doi":"10.48550/arxiv.0801.3511","title":"Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Erasure; Parity (physics); Erasure code; Binary number; Low-density parity-check code; Binary erasure channel; Computer science; Mathematics; Arithmetic; Statistics; Algorithm; Physics; Decoding methods; Coding (social sciences); Programming language; Channel capacity; Atomic physics","score_opus":0.09757864263697298,"score_gpt":0.3057547996144752,"score_spread":0.20817615697750225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949438557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06599072,0.00019899954,0.9303984,0.00017448161,0.000042118056,0.000046025732,0.00006477967,0.00018318523,0.0029012444],"genre_scores_gemma":[0.7555435,0.00019573545,0.24272606,0.00008416356,0.000023916242,0.00015539303,0.00007132203,0.00003846082,0.0011614689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999328,0.00022563968,0.000035031266,0.00008688921,0.00025375234,0.00007075774],"domain_scores_gemma":[0.9986986,0.0005164121,0.00026857632,0.00023775714,0.00023400589,0.000044520217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073623453,0.00032093405,0.00036388656,0.0003795553,0.0004418868,0.00048084487,0.0005553066,0.0004696294,0.0005485088],"category_scores_gemma":[0.0024629063,0.00029460806,0.00033653082,0.00033751703,0.0006646307,0.00038018526,0.0006068106,0.0004974939,0.00015336281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010142605,0.000047134396,0.0015346516,0.00014204135,0.000047668087,0.0000789684,0.00011122414,0.8340981,0.022347508,0.09730594,0.00076686055,0.043418437],"study_design_scores_gemma":[0.000014496749,0.000047810652,0.00015360577,0.000008582595,0.000008946148,0.000038424852,0.0000071953045,0.9821101,0.0071398895,0.009473117,0.0009847176,0.000013210963],"about_ca_topic_score_codex":0.00072425813,"about_ca_topic_score_gemma":0.001100438,"teacher_disagreement_score":0.00073623453,"about_ca_system_score_codex":0.0006097337,"about_ca_system_score_gemma":0.00088314764,"threshold_uncertainty_score":0.004423976},"labels":[],"label_agreement":null},{"id":"W2949743890","doi":"10.48550/arxiv.1701.08126","title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Algorithm; Node (physics); Computer science; Polar code; Polar; List decoding; Set (abstract data type); Code (set theory); Word error rate; Error detection and correction; Concatenated error correction code; Block code; Physics; Speech recognition","score_opus":0.08685566390040513,"score_gpt":0.23255022438399073,"score_spread":0.1456945604835856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949743890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025160676,0.00030040543,0.9672404,0.00018148418,0.000059921033,0.00009078541,0.00018476878,0.00092371093,0.005857837],"genre_scores_gemma":[0.35806298,0.0007425944,0.6303045,0.00023572247,0.00008333986,0.00016484308,0.0008988397,0.0001683152,0.009338899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855584,0.00034949143,0.00006261496,0.00012000439,0.00077329954,0.00013883578],"domain_scores_gemma":[0.9957753,0.0017204786,0.0003595553,0.0007079082,0.001363466,0.00007336037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248565,0.00084244605,0.0006080197,0.0011286164,0.00060508325,0.0012161232,0.0010425638,0.00057957525,0.0027199115],"category_scores_gemma":[0.0061037433,0.00029313046,0.00047486374,0.0011971348,0.0008324118,0.0013414315,0.0012061778,0.0010859588,0.0019219713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000686783,0.000091505935,0.0020839053,0.00040193615,0.0000745955,0.00065402087,0.00043432045,0.49715307,0.08014104,0.11444671,0.0061631743,0.29766896],"study_design_scores_gemma":[0.00005226419,0.00016680466,0.00029331245,0.000041155625,0.000023352824,0.00040239756,0.000049382277,0.91449034,0.058793083,0.018509097,0.0071378658,0.000040934192],"about_ca_topic_score_codex":0.0031087468,"about_ca_topic_score_gemma":0.004362722,"teacher_disagreement_score":0.0031087468,"about_ca_system_score_codex":0.0008538797,"about_ca_system_score_gemma":0.0025092224,"threshold_uncertainty_score":0.009099007},"labels":[],"label_agreement":null},{"id":"W2950033884","doi":"10.1109/tit.2019.2923198","title":"Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Mathematics; Multiplicity (mathematics); Tanner graph; Code (set theory); Infinity; Block (permutation group theory); Combinatorics; Discrete mathematics; Trapping; Decoding methods; Algorithm; Error floor; Set (abstract data type); Computer science; Geometry; Mathematical analysis","score_opus":0.013411385765304781,"score_gpt":0.24217016432167512,"score_spread":0.22875877855637033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950033884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91516227,0.0004282945,0.08022407,0.00020850486,0.000019633628,0.000021671141,0.00017352753,0.00021050604,0.0035514685],"genre_scores_gemma":[0.99206185,0.00016515584,0.006679317,0.000028060389,0.0000252713,0.000040586892,0.0002171655,0.000049284397,0.0007332644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.0002228129,0.000058353162,0.00020926168,0.0002572738,0.00012277985],"domain_scores_gemma":[0.99005437,0.005979039,0.0013922744,0.0010226433,0.0008868828,0.00066472485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013781965,0.00041325937,0.0006115888,0.001294717,0.00071530876,0.0010176934,0.0010333842,0.00077936496,0.0010511185],"category_scores_gemma":[0.013921401,0.00047039893,0.0005102149,0.0005926334,0.0019534251,0.0020992674,0.001374974,0.00088891375,0.00014790671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007106846,0.00024145466,0.056283295,0.0003298475,0.0002192881,0.0014057511,0.00067170407,0.5377399,0.072500885,0.30232993,0.0020042597,0.02556292],"study_design_scores_gemma":[0.000019347573,0.00010778888,0.008974389,0.000034120498,0.000039391136,0.00061231427,0.00010007001,0.9217582,0.010719934,0.057091426,0.00048346393,0.000059604958],"about_ca_topic_score_codex":0.00063616846,"about_ca_topic_score_gemma":0.00084090064,"teacher_disagreement_score":0.0013781965,"about_ca_system_score_codex":0.001168517,"about_ca_system_score_gemma":0.0005414542,"threshold_uncertainty_score":0.008478224},"labels":[],"label_agreement":null},{"id":"W2950521206","doi":"10.48550/arxiv.1111.5668","title":"Connecting Spatially Coupled LDPC Code Chains","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Code (set theory); Algorithm; Computer science; Chain (unit); Theoretical computer science; Mathematics; Physics","score_opus":0.10687352960670855,"score_gpt":0.2053957367562588,"score_spread":0.09852220714955025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950521206","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56005454,0.00026975645,0.42063457,0.00027144558,0.00008549768,0.00014406363,0.00017650082,0.00033531367,0.018028345],"genre_scores_gemma":[0.9399151,0.00019561414,0.0561549,0.00007298887,0.00001896808,0.00014847671,0.00014026985,0.000037776208,0.003315938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997187,0.0000919413,0.0000125839815,0.000045662673,0.000100414254,0.00003059175],"domain_scores_gemma":[0.9991142,0.00039329304,0.0001173132,0.00015716127,0.00015099399,0.00006694499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024191987,0.00040489328,0.00030781966,0.00058369024,0.00070716505,0.00071029895,0.00061655685,0.00089394255,0.0019337273],"category_scores_gemma":[0.0018013736,0.0003067635,0.00029017497,0.0006922352,0.0008326128,0.0006912036,0.0011680068,0.0006309863,0.00037440012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022150052,0.00010792295,0.0016842847,0.00020996432,0.000081113176,0.0007156674,0.0003844586,0.5702739,0.07707277,0.32069218,0.00084908697,0.027707206],"study_design_scores_gemma":[0.000028478318,0.000092324495,0.00034872358,0.000026038193,0.000025388972,0.00015523884,0.00004921128,0.9085884,0.015644953,0.07285044,0.0021597582,0.00003098077],"about_ca_topic_score_codex":0.0005648174,"about_ca_topic_score_gemma":0.00085432397,"teacher_disagreement_score":0.0019337273,"about_ca_system_score_codex":0.00042002852,"about_ca_system_score_gemma":0.00044834553,"threshold_uncertainty_score":0.0064689517},"labels":[],"label_agreement":null},{"id":"W2951016211","doi":"10.48550/arxiv.1611.10014","title":"Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Characterization (materials science); Computer science; Simple (philosophy); Node (physics); Variety (cybernetics); Variable (mathematics); Code (set theory); Algorithm; Graph; Theoretical computer science; Mathematics; Decoding methods; Engineering","score_opus":0.05886455175116401,"score_gpt":0.22152065265234916,"score_spread":0.16265610090118515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951016211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14349665,0.00029099945,0.8469086,0.00035453055,0.000027814527,0.0003112374,0.00063126883,0.0011811944,0.006797742],"genre_scores_gemma":[0.47043127,0.00019837372,0.5219225,0.00016580365,0.000027054984,0.0003881986,0.0024595067,0.00022240047,0.004184975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958795,0.00007855932,0.00003280807,0.00010661654,0.000113166425,0.00008095124],"domain_scores_gemma":[0.99878436,0.00071276724,0.00012530822,0.00017370748,0.00014598119,0.000057904563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031749034,0.0005666553,0.00072239566,0.001112997,0.0005227809,0.0008240046,0.00111299,0.000645684,0.0031884264],"category_scores_gemma":[0.0028304658,0.00033312503,0.0005921182,0.0009296409,0.000587496,0.0013797896,0.0012334578,0.00080877426,0.00060405326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006020571,0.00032265895,0.0076226895,0.00071074185,0.00012480178,0.00040733803,0.0008100034,0.42060566,0.032806896,0.10594151,0.008688668,0.42135698],"study_design_scores_gemma":[0.000048365582,0.00007204554,0.00052991166,0.000023108974,0.000019762121,0.00014601326,0.00010290407,0.95075655,0.0048031234,0.041519783,0.0019614983,0.000016923392],"about_ca_topic_score_codex":0.0022222595,"about_ca_topic_score_gemma":0.0032798483,"teacher_disagreement_score":0.0031884264,"about_ca_system_score_codex":0.0006974636,"about_ca_system_score_gemma":0.0015857319,"threshold_uncertainty_score":0.01066637},"labels":[],"label_agreement":null},{"id":"W2951035445","doi":"10.48550/arxiv.1205.2428","title":"Relaxed Half-Stochastic Belief Propagation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Decoding methods; Belief propagation; Computer science; Code word; Binary number; Algorithm; Low-density parity-check code; Coding (social sciences); Throughput; Implementation; Theoretical computer science; Parallel computing; Arithmetic; Mathematics; Wireless; Telecommunications","score_opus":0.07135625512394875,"score_gpt":0.19702736597010043,"score_spread":0.12567111084615168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951035445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024306739,0.00009798936,0.9719114,0.00021863623,0.000024137056,0.000039804538,0.00009291605,0.0002495961,0.0030587546],"genre_scores_gemma":[0.6032414,0.00024744993,0.3900851,0.00028772472,0.00005398891,0.0002150836,0.00034518636,0.00010974683,0.0054142494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985858,0.000568827,0.00006506874,0.00017864298,0.00046769282,0.00013395549],"domain_scores_gemma":[0.99479276,0.0032405818,0.00031285002,0.00078527577,0.0007657276,0.00010282841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016254621,0.00056068326,0.0007039279,0.0005594144,0.00044563497,0.0010907863,0.0017205143,0.0011725717,0.002331117],"category_scores_gemma":[0.008696886,0.0004441741,0.0005570472,0.00069403957,0.0012684768,0.0017581191,0.0011051728,0.001531445,0.0006398832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027753727,0.00004689037,0.000699976,0.0001233345,0.00004962051,0.00010391303,0.00014305618,0.74080324,0.006376598,0.18880664,0.0016514946,0.06091767],"study_design_scores_gemma":[0.0000116798665,0.000015545593,0.000038309885,0.000004842119,0.000003792006,0.000016866521,0.0000051991224,0.98097366,0.0016868693,0.016937502,0.0003000903,0.000005654363],"about_ca_topic_score_codex":0.0024549318,"about_ca_topic_score_gemma":0.0021966447,"teacher_disagreement_score":0.0024549318,"about_ca_system_score_codex":0.0009002541,"about_ca_system_score_gemma":0.0013923614,"threshold_uncertainty_score":0.008596361},"labels":[],"label_agreement":null},{"id":"W2951757437","doi":"10.48550/arxiv.1004.1586","title":"Belief Propagation for Min-cost Network Flow: Convergence and Correctness","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Correctness; Computer science; Uniqueness; Belief propagation; Convergence (economics); Context (archaeology); Inference; Polynomial; Mathematical optimization; Variety (cybernetics); Time complexity; Optimization problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.05746430421515762,"score_gpt":0.20409708169626284,"score_spread":0.1466327774811052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951757437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00615803,0.00020069504,0.99013597,0.0005652939,0.000041592215,0.000035266487,0.00005953005,0.00028230777,0.0025214234],"genre_scores_gemma":[0.40614194,0.0011896027,0.5846888,0.00042435183,0.0002628487,0.00056151766,0.00038941103,0.0004660987,0.005875453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701333,0.0010574742,0.00011481626,0.00050630164,0.0009881034,0.00031997325],"domain_scores_gemma":[0.98004216,0.015320439,0.0007886481,0.001569068,0.0020090474,0.0002707663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005840733,0.0011515262,0.0013087896,0.0013098906,0.0010648622,0.0026807955,0.0022050522,0.0022142194,0.0025988682],"category_scores_gemma":[0.04701901,0.00065767183,0.00094166806,0.0016931334,0.0031396868,0.0045510386,0.002446129,0.0050044092,0.0008366354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018623186,0.000067615445,0.00079728727,0.00018589346,0.000043043845,0.000055939185,0.00018050622,0.56594324,0.0013461239,0.36622494,0.00358077,0.061388288],"study_design_scores_gemma":[0.00001646597,0.000014788855,0.00007154264,0.000020545456,0.000006583841,0.00001670544,0.000009957671,0.8524242,0.0006890732,0.14616208,0.0005611397,0.0000068454847],"about_ca_topic_score_codex":0.005719696,"about_ca_topic_score_gemma":0.004220002,"teacher_disagreement_score":0.005840733,"about_ca_system_score_codex":0.0029233051,"about_ca_system_score_gemma":0.0036787465,"threshold_uncertainty_score":0.030889094},"labels":[],"label_agreement":null},{"id":"W2951830307","doi":"10.48550/arxiv.1810.10902","title":"Learning from the Syndrome","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Code word; Computer science; Inference; Function (biology); Decoding methods; Algorithm; Relaxation (psychology); Block (permutation group theory); Adaptation (eye); Artificial intelligence; Mathematics; Psychology; Neuroscience; Combinatorics","score_opus":0.07689133187419804,"score_gpt":0.1900650456300301,"score_spread":0.11317371375583206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951830307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0165148,0.0002301458,0.9804406,0.00037296655,0.00006720185,0.000024885585,0.00013388258,0.00044575887,0.0017697224],"genre_scores_gemma":[0.69046676,0.0007945869,0.2952343,0.0007633303,0.0002951753,0.00019036779,0.0011035152,0.00029829014,0.010853639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883837,0.00040636497,0.00006619797,0.00024906252,0.00035096257,0.00008902271],"domain_scores_gemma":[0.9947917,0.0033987816,0.00031250555,0.00067654013,0.0006758446,0.00014468306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619682,0.0009773718,0.00089540955,0.0007629745,0.00034370442,0.0010598702,0.0011679728,0.0013614278,0.0032772182],"category_scores_gemma":[0.015537096,0.0003834345,0.00038276467,0.0005549325,0.0011999261,0.002121526,0.0018571872,0.0019875462,0.00092226453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037733096,0.00008567961,0.0023097035,0.00024107151,0.00012074791,0.00026702104,0.00014145837,0.59108377,0.010499273,0.11760025,0.0059226495,0.27135095],"study_design_scores_gemma":[0.000017651326,0.000058857848,0.00018488582,0.00002619659,0.0000121107605,0.00010439636,0.000012978856,0.95236367,0.0043865745,0.041409567,0.001411125,0.00001191834],"about_ca_topic_score_codex":0.0014683127,"about_ca_topic_score_gemma":0.0016081487,"teacher_disagreement_score":0.0032772182,"about_ca_system_score_codex":0.0007441385,"about_ca_system_score_gemma":0.0014951783,"threshold_uncertainty_score":0.01096338},"labels":[],"label_agreement":null},{"id":"W2951961520","doi":"10.48550/arxiv.1103.3641","title":"On the Pseudocodeword Redundancy of Binary Linear Codes","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Science Foundation Ireland; National Research Foundation Singapore; National Research Foundation","keywords":"Hamming code; Redundancy (engineering); Mathematics; Linear code; Hamming distance; Combinatorics; Eigenvalues and eigenvectors; Binary number; Upper and lower bounds; Discrete mathematics; Parity-check matrix; Row; Block code; Low-density parity-check code; Algorithm; Computer science; Arithmetic; Decoding methods; Physics","score_opus":0.10894284833859937,"score_gpt":0.20942311816140236,"score_spread":0.10048026982280299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951961520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36707383,0.0086776,0.5905185,0.0013303697,0.00022713824,0.000067067886,0.00045358663,0.00051989336,0.031132054],"genre_scores_gemma":[0.9401677,0.0035103261,0.051649977,0.00017123968,0.00038213457,0.00012245409,0.0003444565,0.00011099772,0.003540663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980908,0.00052372564,0.0000747501,0.00015299393,0.0009643535,0.00019334766],"domain_scores_gemma":[0.9919743,0.0057786424,0.00061406824,0.0007167733,0.000798681,0.00011755899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001349018,0.0008601332,0.0005750089,0.002569423,0.00048052298,0.0009127789,0.00078878476,0.0008379371,0.0016896928],"category_scores_gemma":[0.012327313,0.00042265916,0.00031168404,0.0016534801,0.001642435,0.0016631245,0.0010859128,0.0013481433,0.00053263555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005452854,0.00007447814,0.0024710202,0.00044786444,0.00005146429,0.0006944494,0.00047020978,0.24871698,0.026729641,0.62909365,0.0046784785,0.08602656],"study_design_scores_gemma":[0.000023425868,0.00016281911,0.0011978578,0.00015006181,0.000024941894,0.00062145764,0.00007830069,0.602026,0.01056132,0.38122505,0.0038665426,0.000062154744],"about_ca_topic_score_codex":0.0006400406,"about_ca_topic_score_gemma":0.00052584667,"teacher_disagreement_score":0.002569423,"about_ca_system_score_codex":0.00079918717,"about_ca_system_score_gemma":0.0005558507,"threshold_uncertainty_score":0.007134378},"labels":[],"label_agreement":null},{"id":"W2952613325","doi":"10.48550/arxiv.1710.08314","title":"Fast and Flexible Software Polar List Decoders","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Puncturing; Decoding methods; Soft-decision decoder; Software; Coding (social sciences); Algorithm; Throughput; Redundancy (engineering); Channel (broadcasting); Computer engineering; Parallel computing; Computer hardware; Wireless; Computer network; Telecommunications; Operating system; Mathematics","score_opus":0.07623042496719985,"score_gpt":0.21412968961861378,"score_spread":0.13789926465141394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952613325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02278133,0.00025812568,0.96569043,0.00012847724,0.00007197168,0.00008454302,0.00020869216,0.005708987,0.0050673233],"genre_scores_gemma":[0.30210948,0.00031828153,0.6865631,0.00029865114,0.00008702225,0.00018576664,0.0010830027,0.000570384,0.008784385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.0000920442,0.000050281993,0.000083037725,0.00031417256,0.00008216067],"domain_scores_gemma":[0.99883527,0.00032954314,0.00011166426,0.00026313314,0.00041297404,0.000047504538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046115354,0.00067233294,0.00043894764,0.00097239664,0.00047879608,0.00095642154,0.001222812,0.0005765906,0.004306234],"category_scores_gemma":[0.0019828377,0.00028252605,0.00040148105,0.0008686859,0.0004901539,0.001033207,0.001124171,0.0007583859,0.002825415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009529745,0.00014212838,0.0017800324,0.00037621128,0.00007108151,0.000540094,0.0003112833,0.10527441,0.2190131,0.056434333,0.010794835,0.6043096],"study_design_scores_gemma":[0.00013478694,0.00037962914,0.0005646023,0.00005547308,0.000046538487,0.0007410981,0.000068462425,0.7099523,0.24739331,0.015491645,0.025086446,0.00008575851],"about_ca_topic_score_codex":0.0016426563,"about_ca_topic_score_gemma":0.0032619655,"teacher_disagreement_score":0.004306234,"about_ca_system_score_codex":0.000691878,"about_ca_system_score_gemma":0.0013913605,"threshold_uncertainty_score":0.014405787},"labels":[],"label_agreement":null},{"id":"W2952704026","doi":"10.48550/arxiv.1503.06900","title":"New Classes of Partial Geometries and Their Associated LDPC Codes","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adjacency list; Adjacency matrix; Mathematics; Eigenvalues and eigenvectors; Decoding methods; Simple (philosophy); Low-density parity-check code; Code (set theory); Tanner graph; Hypergraph; Discrete mathematics; Turbo code; Combinatorics; Graph; Algorithm; Computer science; Error floor","score_opus":0.09502483289620725,"score_gpt":0.20981612272250127,"score_spread":0.11479128982629402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952704026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5719157,0.0026416539,0.30114627,0.0013747727,0.00035876912,0.0002817366,0.0022750574,0.0007186901,0.11928741],"genre_scores_gemma":[0.89898115,0.0012771888,0.07753481,0.00034807945,0.00019907347,0.00024237373,0.001229539,0.00013106504,0.020056754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.000095063784,0.000024031671,0.00008698596,0.00012600284,0.00007023676],"domain_scores_gemma":[0.9990646,0.0002821426,0.0001967739,0.0002058469,0.00013327804,0.00011733334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022723785,0.0004583293,0.00030289427,0.0013166618,0.00078791025,0.0012730658,0.00044693143,0.00068740454,0.003721461],"category_scores_gemma":[0.0012751907,0.0003121274,0.00048837706,0.00075281283,0.0016054369,0.0012261677,0.0011989772,0.0011987197,0.0005874184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042876367,0.00001955592,0.00075419096,0.000076983466,0.000009681916,0.00037151302,0.00018605933,0.010833842,0.0066837436,0.96207976,0.0019059825,0.01703581],"study_design_scores_gemma":[0.000031050924,0.0001061458,0.0013648595,0.000043986747,0.00001625222,0.0015905381,0.00014748385,0.051858753,0.0068637533,0.90688527,0.031032156,0.000059788093],"about_ca_topic_score_codex":0.0004962284,"about_ca_topic_score_gemma":0.0007519729,"teacher_disagreement_score":0.003721461,"about_ca_system_score_codex":0.0006960728,"about_ca_system_score_gemma":0.00039781485,"threshold_uncertainty_score":0.012449563},"labels":[],"label_agreement":null},{"id":"W2952828509","doi":"10.48550/arxiv.1808.03616","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Decoding methods; Computer science; Error detection and correction; Sorting; Bit error rate; Code (set theory); Iterated function; Mathematics","score_opus":0.060036470758230584,"score_gpt":0.22606925220110638,"score_spread":0.1660327814428758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952828509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01108418,0.00016136354,0.98632336,0.00006779915,0.000049666483,0.000052453215,0.000060666476,0.0005010634,0.001699421],"genre_scores_gemma":[0.1888972,0.0003169565,0.80692685,0.00012675696,0.00003644906,0.00013400057,0.00027105724,0.00007610189,0.0032145756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999388,0.0001104303,0.000041533185,0.000091708105,0.00031463016,0.000053628017],"domain_scores_gemma":[0.99920803,0.00025164054,0.000062931686,0.0001413901,0.00031358085,0.000022496191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500635,0.00058875774,0.00045149587,0.0008905377,0.00038536018,0.000608741,0.00071032875,0.0006419552,0.0022435104],"category_scores_gemma":[0.0024993964,0.0001627437,0.0003496522,0.0010072513,0.0004502188,0.0006311108,0.00065284944,0.0008262568,0.0009861289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046505092,0.00008807287,0.0014456366,0.00019182217,0.00005537476,0.00031727288,0.0002288429,0.22477905,0.11104718,0.07035441,0.00377114,0.5872562],"study_design_scores_gemma":[0.000034192646,0.00009058383,0.00029872445,0.00002213242,0.0000133761205,0.00029850204,0.000014855434,0.9443362,0.041988377,0.008794846,0.0040809186,0.000027295977],"about_ca_topic_score_codex":0.0024741725,"about_ca_topic_score_gemma":0.002682581,"teacher_disagreement_score":0.0024741725,"about_ca_system_score_codex":0.00054229895,"about_ca_system_score_gemma":0.0012892368,"threshold_uncertainty_score":0.0075052977},"labels":[],"label_agreement":null},{"id":"W2952989657","doi":"10.48550/arxiv.1201.5167","title":"Interactive Encoding and Decoding Based on Binary LDPC Codes with Syndrome Accumulation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Encoder; Binary number; Mathematics; Upper and lower bounds; Code rate; Discrete mathematics; Combinatorics; Arithmetic; Statistics","score_opus":0.10145331082354303,"score_gpt":0.2356169276184559,"score_spread":0.13416361679491287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952989657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810073,0.00027708837,0.95528436,0.00007364285,0.0000253298,0.00006926978,0.00007611934,0.00043293327,0.0056605926],"genre_scores_gemma":[0.7134692,0.00042973316,0.28186837,0.00007590986,0.000027738393,0.00010611818,0.00019801581,0.000035633922,0.0037892705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944705,0.00010485467,0.00003023177,0.00007605043,0.0002524012,0.000089462024],"domain_scores_gemma":[0.9993616,0.0002595436,0.00006478524,0.00016374441,0.000115176495,0.000035121593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004588635,0.00053224474,0.00051866303,0.0005610938,0.0003412594,0.00071004895,0.0010260239,0.0006223067,0.0010562163],"category_scores_gemma":[0.0012393905,0.00018213132,0.00037340494,0.0006119451,0.0007955309,0.00089434034,0.0012244823,0.0009077628,0.00038781183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041530989,0.00013154965,0.0021738003,0.0002963836,0.0000757485,0.00069959677,0.00040095844,0.28099298,0.09873304,0.43816432,0.0013874122,0.17652889],"study_design_scores_gemma":[0.000016585609,0.000074273856,0.0002426925,0.000022861892,0.000019651094,0.00023418928,0.000018702518,0.9394453,0.03668967,0.020849405,0.0023587386,0.000027958082],"about_ca_topic_score_codex":0.0011244885,"about_ca_topic_score_gemma":0.0016429386,"teacher_disagreement_score":0.0011244885,"about_ca_system_score_codex":0.00070263,"about_ca_system_score_gemma":0.0010853864,"threshold_uncertainty_score":0.0050979853},"labels":[],"label_agreement":null},{"id":"W2955242165","doi":"10.1109/tvlsi.2019.2920152","title":"An Energy-Efficient and Noise-Tolerant Recurrent Neural Network Using Stochastic Computing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Recurrent neural network; Stochastic computing; Energy consumption; Artificial neural network; Noise (video); Binary number; Computer engineering; Efficient energy use; Artificial intelligence; Arithmetic; Engineering","score_opus":0.015574871332141822,"score_gpt":0.25869684725040276,"score_spread":0.24312197591826093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955242165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07340613,0.00066738436,0.9197946,0.00020007044,0.00010757445,0.000044789937,0.00009146649,0.0013589358,0.004329047],"genre_scores_gemma":[0.7402742,0.0002882065,0.25534806,0.00018741161,0.000033706936,0.000052683066,0.00016982769,0.00004907104,0.0035968076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998233,0.000027556955,0.000013285841,0.00004376109,0.00007308015,0.000019156787],"domain_scores_gemma":[0.9998301,0.00004045546,0.000025550658,0.000025068724,0.000069804366,0.000008942767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021473166,0.00031621192,0.0002887094,0.00022110227,0.0002028405,0.00032327496,0.00089876575,0.00033547595,0.00083277235],"category_scores_gemma":[0.0004523827,0.00015866799,0.00025381835,0.00028921958,0.00022032678,0.00052894506,0.0002625603,0.00033710108,0.00023343434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038952465,0.00017437167,0.0018609536,0.00033230925,0.0001554315,0.00033764524,0.00008824898,0.22595511,0.28124303,0.0219668,0.0051254057,0.46237117],"study_design_scores_gemma":[0.000022791015,0.00023300349,0.00049584423,0.000013276447,0.00004075115,0.00016398924,0.000008880194,0.9436855,0.0503238,0.001534821,0.0034597488,0.000017710028],"about_ca_topic_score_codex":0.0018547851,"about_ca_topic_score_gemma":0.0054815696,"teacher_disagreement_score":0.0018547851,"about_ca_system_score_codex":0.00032571642,"about_ca_system_score_gemma":0.0004912379,"threshold_uncertainty_score":0.0036879778},"labels":[],"label_agreement":null},{"id":"W2963021833","doi":"10.1109/tit.2017.2673805","title":"On the VLSI Energy Complexity of LDPC Decoder Circuits","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Very-large-scale integration; Low-density parity-check code; Decoding methods; Computer science; Electronic circuit; Energy (signal processing); Forward error correction; Electronic engineering; Algorithm; Mathematics; Electrical engineering; Engineering; Embedded system","score_opus":0.03635577643927789,"score_gpt":0.26470977847563254,"score_spread":0.22835400203635464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963021833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44841057,0.0032470971,0.490907,0.0045127184,0.0001734208,0.00021109123,0.0013810531,0.001105777,0.05005132],"genre_scores_gemma":[0.93388677,0.001174635,0.050862342,0.0003769317,0.00013480992,0.00029280205,0.0008360028,0.00023463937,0.012200966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.0003100361,0.00004881687,0.00018983784,0.0004991304,0.0001698472],"domain_scores_gemma":[0.99282116,0.005991058,0.000345304,0.00036464378,0.0003820753,0.00009573048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797382,0.0007812469,0.0005871827,0.000745965,0.00046805604,0.0016253167,0.0012580976,0.0008925569,0.00831791],"category_scores_gemma":[0.010589787,0.0004749894,0.0005091832,0.0010295582,0.0008405994,0.002576853,0.0008732283,0.0013051752,0.00072367385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006171369,0.00015988127,0.0031193746,0.0003713372,0.00009253746,0.0003276936,0.00013920922,0.7291299,0.019430699,0.1629987,0.00464023,0.078973204],"study_design_scores_gemma":[0.000040139264,0.000077069984,0.0007222484,0.000022476353,0.000023707566,0.000087567176,0.00002674683,0.93396944,0.0031564813,0.06087707,0.0009839092,0.000013107216],"about_ca_topic_score_codex":0.001932683,"about_ca_topic_score_gemma":0.003636975,"teacher_disagreement_score":0.00831791,"about_ca_system_score_codex":0.0025631348,"about_ca_system_score_gemma":0.0014737992,"threshold_uncertainty_score":0.02782619},"labels":[],"label_agreement":null},{"id":"W2963477777","doi":"10.1109/tit.2016.2554598","title":"ADMM LP Decoding of Non-Binary LDPC Codes in &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$ \\mathbb {F}_{2^{m}}$ &lt;/tex-math&gt; &lt;/inline-formula&gt;","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decoding methods; Binary number; Low-density parity-check code; Notation; Discrete mathematics; Arithmetic; Binary code; Combinatorics; Algorithm","score_opus":0.011951475316008963,"score_gpt":0.2540117262449244,"score_spread":0.24206025092891545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963477777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041499464,0.00010197901,0.99316835,0.00018932445,0.000032491815,0.000018900828,0.000060149658,0.00016282311,0.0021160173],"genre_scores_gemma":[0.13613027,0.00031786048,0.85063684,0.00024644053,0.0000757652,0.00017357622,0.0005223802,0.00023163708,0.011665287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.00018691552,0.000027308752,0.000098959295,0.00017336554,0.000040359795],"domain_scores_gemma":[0.9985619,0.0009822735,0.00008019507,0.00012934419,0.000218066,0.000028139764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010511691,0.00092931197,0.00085098523,0.00035901612,0.00030253438,0.00095182844,0.0007182436,0.0011149755,0.00343938],"category_scores_gemma":[0.0037690487,0.0004382751,0.00052305375,0.0006459163,0.00078281556,0.0010642695,0.0008885738,0.002127945,0.0010614364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070195354,0.00004731089,0.00022476894,0.00018358197,0.000027228714,0.000096638825,0.00006493607,0.8416732,0.0034992856,0.069375746,0.003975814,0.080761306],"study_design_scores_gemma":[0.000010410328,0.000012920228,0.000027176304,0.000008659634,0.000002744283,0.000016935674,0.0000054054544,0.9841111,0.001488565,0.013338099,0.0009742453,0.0000038204143],"about_ca_topic_score_codex":0.0026190209,"about_ca_topic_score_gemma":0.0038084558,"teacher_disagreement_score":0.00343938,"about_ca_system_score_codex":0.0009615696,"about_ca_system_score_gemma":0.0019056984,"threshold_uncertainty_score":0.011505842},"labels":[],"label_agreement":null},{"id":"W2963924687","doi":"10.1109/isit.2018.8437465","title":"From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Trapping; Girth (graph theory); Combinatorics; Upper and lower bounds; Minimum weight; Discrete mathematics; Degree (music); Minimum distance; Cage; Graph theory; Decoding methods; Algorithm; Physics","score_opus":0.020185994114112704,"score_gpt":0.28118928684685685,"score_spread":0.26100329273274414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963924687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020653762,0.0010507954,0.96859276,0.000248858,0.00010809223,0.00007255897,0.00027018794,0.0003673974,0.0086355945],"genre_scores_gemma":[0.5003625,0.0047606835,0.48185772,0.0009863297,0.00053868466,0.00085337705,0.0012200688,0.00094089535,0.008479652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875665,0.00028957744,0.00008938377,0.0003033996,0.00040647123,0.00015442967],"domain_scores_gemma":[0.9911006,0.0060155718,0.00061977044,0.0013273063,0.000635698,0.00030100014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012936391,0.0020686374,0.0012951419,0.0032669012,0.001053769,0.0014435188,0.0021106978,0.0012459446,0.0034150714],"category_scores_gemma":[0.010689703,0.000924671,0.0018324064,0.0021339343,0.002554155,0.004281893,0.004099349,0.0047731944,0.0010351485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017927137,0.00016264466,0.0018784972,0.00066968217,0.00016169243,0.0005445376,0.00062425534,0.21920818,0.039164905,0.66409105,0.0069080815,0.06640729],"study_design_scores_gemma":[0.000026322528,0.00020978496,0.0010260371,0.00014450852,0.000112610345,0.00064314855,0.00013253363,0.53481275,0.0199908,0.42911345,0.013674038,0.00011399036],"about_ca_topic_score_codex":0.0009776875,"about_ca_topic_score_gemma":0.0013975298,"teacher_disagreement_score":0.0034150714,"about_ca_system_score_codex":0.0012456831,"about_ca_system_score_gemma":0.0007596778,"threshold_uncertainty_score":0.011424601},"labels":[],"label_agreement":null},{"id":"W2964159840","doi":"10.1049/iet-com.2018.5273","title":"Overlapped LT codes over the binary erasure channel: analysis and design","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Binary erasure channel; Computer science; Erasure code; Binary number; Channel (broadcasting); Computer network; Algorithm; Decoding methods; Mathematics; Arithmetic; Channel capacity; Programming language","score_opus":0.035287467490104765,"score_gpt":0.2945892423021458,"score_spread":0.25930177481204103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964159840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048232086,0.0018263301,0.9394775,0.00042713716,0.00006203658,0.00009366485,0.00016607426,0.0003475392,0.009367576],"genre_scores_gemma":[0.89381135,0.0017416435,0.100105025,0.00016328733,0.00007060352,0.00021186119,0.00013704236,0.00006244225,0.003696675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989454,0.00029716134,0.00003673011,0.00010200659,0.00044182088,0.0001769762],"domain_scores_gemma":[0.9965604,0.0017927284,0.000490657,0.00024353203,0.0008147969,0.00009785272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089271506,0.0007783051,0.0005722446,0.0009795331,0.0006040435,0.0012905477,0.00072270515,0.0009889393,0.0020479506],"category_scores_gemma":[0.00433107,0.00034216818,0.00039734397,0.0011931014,0.0010897903,0.0010251133,0.00084017136,0.0007596395,0.0004196245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003911874,0.00006639314,0.0015907859,0.00030215824,0.00008442975,0.00045950589,0.00032545088,0.7953924,0.01598456,0.12619399,0.0019409491,0.057268325],"study_design_scores_gemma":[0.00001135878,0.00004920262,0.00017658136,0.00003256936,0.000013006524,0.00015999725,0.000026137293,0.9871982,0.002595302,0.008629352,0.0010911208,0.000017088976],"about_ca_topic_score_codex":0.006146193,"about_ca_topic_score_gemma":0.0046280837,"teacher_disagreement_score":0.006146193,"about_ca_system_score_codex":0.0017224705,"about_ca_system_score_gemma":0.0020829064,"threshold_uncertainty_score":0.012497425},"labels":[],"label_agreement":null},{"id":"W2964312726","doi":"10.1109/istc.2010.5613902","title":"An efficient algorithm for finding dominant trapping sets of LDPC codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Decoding methods; Set (abstract data type); Code (set theory); Trapping; Error floor; Graph; Tanner graph; Theoretical computer science","score_opus":0.020466618685707955,"score_gpt":0.31201796045084434,"score_spread":0.2915513417651364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964312726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055175507,0.00009637004,0.9919373,0.0000609838,0.000022034419,0.00010307257,0.00006381041,0.00072293566,0.0014759832],"genre_scores_gemma":[0.049367107,0.000113767004,0.9476346,0.00004950844,0.000014915655,0.00027138492,0.0002950278,0.00014399241,0.0021096966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941456,0.00010892974,0.000044953107,0.00011546912,0.00024438402,0.0000717874],"domain_scores_gemma":[0.9989668,0.0005046934,0.00007618968,0.00014151189,0.00027620417,0.000034637404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846485,0.0010584011,0.0008321905,0.0019535525,0.0011345159,0.0009237402,0.0013607466,0.0009145466,0.004196017],"category_scores_gemma":[0.0033473137,0.0005068417,0.00071133574,0.0013427614,0.0007578474,0.0013440454,0.001522112,0.0011016374,0.0017100427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002558894,0.00013085092,0.0011768504,0.00037576613,0.00008327248,0.00031462946,0.00043468023,0.196796,0.027892794,0.06736656,0.006538449,0.69863415],"study_design_scores_gemma":[0.00013150048,0.000093274204,0.00027846135,0.000048912778,0.000036397105,0.00038064676,0.000078871344,0.9141476,0.015977202,0.05926395,0.009508731,0.00005439225],"about_ca_topic_score_codex":0.002528672,"about_ca_topic_score_gemma":0.0031905654,"teacher_disagreement_score":0.004196017,"about_ca_system_score_codex":0.00085471163,"about_ca_system_score_gemma":0.0019129552,"threshold_uncertainty_score":0.014037073},"labels":[],"label_agreement":null},{"id":"W2964468414","doi":"10.1109/sips47522.2019.9020513","title":"Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Decoding methods; Computer science; Algorithm; List decoding; Error detection and correction; Computation; Concatenated error correction code; Block code","score_opus":0.017862448933596838,"score_gpt":0.2969528488379353,"score_spread":0.2790903999043385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964468414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06781553,0.00024376097,0.921072,0.00014209436,0.00007459003,0.00003678433,0.00007548712,0.00030861414,0.010231214],"genre_scores_gemma":[0.7241411,0.0006744431,0.2636711,0.00015653846,0.00006421104,0.00006648349,0.00025021908,0.00007447942,0.010901426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.000045959365,0.000010280401,0.000028440752,0.0000886037,0.00003072672],"domain_scores_gemma":[0.9995584,0.00016299772,0.000041999552,0.000077688295,0.00014133775,0.000017696702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027037243,0.00036159367,0.00024739746,0.00032617166,0.00030461708,0.000547098,0.00042755707,0.00042502032,0.0015538705],"category_scores_gemma":[0.0019843292,0.00012240805,0.00015359432,0.00041166894,0.0006373804,0.00047854078,0.00061546016,0.00053821306,0.00063575845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039910493,0.00005232981,0.00083142624,0.00018840133,0.000028637422,0.00029039392,0.00024013233,0.27595094,0.1220145,0.22022358,0.0027209949,0.37705958],"study_design_scores_gemma":[0.000014983886,0.0000648323,0.00017187378,0.000019294612,0.0000060475745,0.00019816255,0.000024316727,0.9016858,0.06738753,0.026903294,0.003507255,0.000016635644],"about_ca_topic_score_codex":0.0013719805,"about_ca_topic_score_gemma":0.0016913055,"teacher_disagreement_score":0.0015538705,"about_ca_system_score_codex":0.00029394342,"about_ca_system_score_gemma":0.0005867033,"threshold_uncertainty_score":0.0051981807},"labels":[],"label_agreement":null},{"id":"W2967101352","doi":"10.1109/jsac.2019.2933954","title":"Deep Learning-Based Decoding of Constrained Sequence Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decoding methods; Convolutional code; Sequential decoding; Algorithm; List decoding; Convolutional neural network; Throughput; Serial concatenated convolutional codes; Bit error rate; Concatenated error correction code; Block code; Artificial intelligence; Wireless; Telecommunications","score_opus":0.041384693533824936,"score_gpt":0.3216702355624585,"score_spread":0.28028554202863354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967101352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352133,0.00054190244,0.90828574,0.0003074087,0.00011392604,0.00004818259,0.00019195133,0.0012362058,0.0057533886],"genre_scores_gemma":[0.83718467,0.00033581306,0.15674148,0.00025070316,0.00003922469,0.00006651981,0.00037386848,0.000103582664,0.004904228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.00009265037,0.000034815734,0.00008440548,0.00019916026,0.00009145158],"domain_scores_gemma":[0.9986443,0.0006474075,0.00013632128,0.0001636233,0.00036859963,0.00003980728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056497,0.00055422547,0.00047136866,0.0003728491,0.00027237137,0.00057272805,0.0007200313,0.0006599158,0.0014502283],"category_scores_gemma":[0.003203532,0.00021077933,0.0003267646,0.0004778304,0.0006845813,0.0011704982,0.00067170087,0.0009809728,0.00036215739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026198933,0.00006325985,0.0012020678,0.00012771288,0.000041465857,0.00021307792,0.00009202815,0.8126152,0.025633404,0.030179488,0.0024353913,0.1271349],"study_design_scores_gemma":[0.0000050693775,0.000023271792,0.00005865008,0.000006109561,0.0000037640598,0.000025753803,0.0000050273284,0.98842955,0.007940731,0.0030526768,0.00044460365,0.0000047607955],"about_ca_topic_score_codex":0.0075209886,"about_ca_topic_score_gemma":0.009514487,"teacher_disagreement_score":0.0075209886,"about_ca_system_score_codex":0.0009540288,"about_ca_system_score_gemma":0.0017605905,"threshold_uncertainty_score":0.014954388},"labels":[],"label_agreement":null},{"id":"W2967560862","doi":"10.1109/tbc.2019.2932336","title":"Quasi-Cyclic Spatially Coupled LDPC Code for Broadcasting","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Science, Technology and Innovation Commission of Shenzhen Municipality","keywords":"Low-density parity-check code; Computer science; Forward error correction; Decoding methods; Robustness (evolution); Transmission (telecommunications); Algorithm; Electronic engineering; Channel (broadcasting); Code (set theory); Theoretical computer science; Telecommunications; Engineering","score_opus":0.02871990551622855,"score_gpt":0.2775644353013472,"score_spread":0.24884452978511867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967560862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06346092,0.0010873928,0.9193943,0.00035871324,0.0000646877,0.000105980886,0.0001779841,0.0005641971,0.014785841],"genre_scores_gemma":[0.70122665,0.00097106834,0.29143804,0.00013971246,0.000027188324,0.00016463532,0.00020753169,0.00004447755,0.0057807104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984646,0.000035417095,0.000005243403,0.000020802536,0.00008189057,0.000010179114],"domain_scores_gemma":[0.99980193,0.00005864122,0.000028001425,0.000043130553,0.000061281935,0.000007026032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015283929,0.00015143794,0.00012098293,0.000285083,0.00028551792,0.00020151366,0.00029537446,0.00035323144,0.00096026954],"category_scores_gemma":[0.0006341536,0.0000835052,0.00011376839,0.00054610986,0.00038369614,0.0002003937,0.0002233301,0.00033763194,0.00019310415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106227315,0.00006378433,0.0012952753,0.00051441387,0.000039019556,0.00033803174,0.00033791535,0.27555335,0.23223299,0.32150292,0.004751926,0.16326419],"study_design_scores_gemma":[0.000020062302,0.00007528003,0.00061262236,0.000031417825,0.000017277755,0.0002444093,0.00002287785,0.9061683,0.049367663,0.026814803,0.016595151,0.000030201927],"about_ca_topic_score_codex":0.0026441202,"about_ca_topic_score_gemma":0.002976528,"teacher_disagreement_score":0.0026441202,"about_ca_system_score_codex":0.00047057963,"about_ca_system_score_gemma":0.00092950364,"threshold_uncertainty_score":0.0052574873},"labels":[],"label_agreement":null},{"id":"W2969069694","doi":"10.1109/lcomm.2019.2933828","title":"Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Trillium Foundation","keywords":"Low-density parity-check code; Tanner graph; Girth (graph theory); Block code; Linear code; Code (set theory); Tornado code; Computer science; Concatenated error correction code; Mathematics; Discrete mathematics; Raptor code; Combinatorics; Decoding methods; Algorithm; Set (abstract data type)","score_opus":0.03327658837706519,"score_gpt":0.2668818608246346,"score_spread":0.23360527244756943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969069694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1980741,0.00043354626,0.7924939,0.00028460572,0.00007705302,0.00015969746,0.00016668264,0.0004216252,0.007888853],"genre_scores_gemma":[0.63345695,0.0003169895,0.3624099,0.00012848945,0.000017018036,0.00017596543,0.00019519251,0.00005454358,0.0032450035],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999824,0.000032554264,0.000009957269,0.000025999163,0.000084231746,0.000023202556],"domain_scores_gemma":[0.99958724,0.00012739917,0.000072285344,0.00009465741,0.00008822359,0.00003023921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024589946,0.0003029093,0.0002823424,0.00038431425,0.00036815787,0.0002836807,0.00056570634,0.0003640984,0.00083213614],"category_scores_gemma":[0.00067211385,0.00019595923,0.0002882935,0.00032871333,0.0005186536,0.0003553788,0.00061127706,0.0006033611,0.00023153955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020988872,0.00014709058,0.002549201,0.0006227747,0.00008516125,0.00076082116,0.0004103058,0.2172691,0.432517,0.22974093,0.0019368975,0.1137508],"study_design_scores_gemma":[0.00009546359,0.00026338644,0.0008697038,0.000047727266,0.000048535807,0.00071729464,0.000042798318,0.75993747,0.19767962,0.028609693,0.011619387,0.00006889283],"about_ca_topic_score_codex":0.00077853247,"about_ca_topic_score_gemma":0.0013125595,"teacher_disagreement_score":0.00083213614,"about_ca_system_score_codex":0.00043946702,"about_ca_system_score_gemma":0.001085681,"threshold_uncertainty_score":0.0031885505},"labels":[],"label_agreement":null},{"id":"W2972671693","doi":"10.1109/twc.2020.3022922","title":"Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Science Foundation","keywords":"Sublinear function; Decoding methods; Latency (audio); Algorithm; Computer science; Polar; Mathematics; Upper and lower bounds; Discrete mathematics; Telecommunications; Physics","score_opus":0.0733727783293457,"score_gpt":0.3351965098153082,"score_spread":0.2618237314859625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972671693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09396742,0.0019076825,0.8860029,0.0005508918,0.00014508211,0.00010358896,0.00018797362,0.000738217,0.0163962],"genre_scores_gemma":[0.90232617,0.002921722,0.084317334,0.00033515214,0.00018507431,0.00021694756,0.00033728022,0.0002235893,0.009136604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982582,0.00030317737,0.0000599043,0.00013476219,0.000854206,0.00038984654],"domain_scores_gemma":[0.9927482,0.005068462,0.0005272118,0.00058049266,0.00095164846,0.00012398385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585492,0.001152593,0.00052959763,0.00074267876,0.0005690831,0.0017243869,0.0006626235,0.00051221176,0.0040880796],"category_scores_gemma":[0.010398545,0.00039586282,0.00041540252,0.0008866489,0.0014902083,0.002359857,0.0010699461,0.0014356825,0.0008900791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006269358,0.000074517346,0.0013147789,0.00033415886,0.000045280885,0.0003005562,0.00038353598,0.68043613,0.035922725,0.2219644,0.0026685917,0.05592832],"study_design_scores_gemma":[0.000021484564,0.0001149561,0.00023106502,0.00003267462,0.0000171957,0.00013313831,0.00006407907,0.94479746,0.013393516,0.039210174,0.0019580997,0.000026103799],"about_ca_topic_score_codex":0.004587732,"about_ca_topic_score_gemma":0.0046092,"teacher_disagreement_score":0.004587732,"about_ca_system_score_codex":0.002624335,"about_ca_system_score_gemma":0.0033890568,"threshold_uncertainty_score":0.019040942},"labels":[],"label_agreement":null},{"id":"W2973003915","doi":"10.1109/focs46700.2020.00050","title":"LDPC Codes Achieve List Decoding Capacity","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; National Science Foundation","keywords":"Low-density parity-check code; Decoding methods; Mathematics; Code (set theory); List decoding; Discrete mathematics; Combinatorics; Concatenated error correction code; Algorithm; Computer science; Block code","score_opus":0.0839619599965839,"score_gpt":0.298660119496544,"score_spread":0.21469815949996007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973003915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21112862,0.0008599481,0.74667406,0.0013258887,0.00007743674,0.00016334961,0.0010435783,0.0025142033,0.03621304],"genre_scores_gemma":[0.97100306,0.0004973004,0.02368641,0.0003464379,0.00006091489,0.00016843731,0.00035250364,0.00021327306,0.0036716873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979595,0.00036265174,0.00010031444,0.00029631253,0.0008950569,0.00038613283],"domain_scores_gemma":[0.9877543,0.007246926,0.0012059443,0.0019753557,0.0013925773,0.00042486217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331535,0.00084590487,0.0008711523,0.0011448844,0.0010859873,0.0017515203,0.0010740376,0.0012934222,0.002614773],"category_scores_gemma":[0.015353629,0.0004570174,0.00065233203,0.0012693269,0.001993438,0.002785438,0.0029474322,0.0024931843,0.001342489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003690045,0.00013828809,0.0033872367,0.0004202288,0.00011393791,0.00055308326,0.00057814515,0.30000877,0.043553445,0.5952124,0.0067891288,0.04887632],"study_design_scores_gemma":[0.00006471042,0.00015269678,0.0008461279,0.00007362699,0.000041957155,0.00059425784,0.000092700466,0.61213696,0.052631132,0.32865903,0.0046290997,0.000077706296],"about_ca_topic_score_codex":0.0012512006,"about_ca_topic_score_gemma":0.0008269283,"teacher_disagreement_score":0.002614773,"about_ca_system_score_codex":0.001293718,"about_ca_system_score_gemma":0.0011251764,"threshold_uncertainty_score":0.009386659},"labels":[],"label_agreement":null},{"id":"W2977557067","doi":"10.1109/tsp.2019.2944738","title":"Rate-Flexible Fast Polar Decoders","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Signal processing; Algorithm; Digital signal processing; Computer hardware","score_opus":0.018130204388519932,"score_gpt":0.2651004711459094,"score_spread":0.24697026675738948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977557067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023866337,0.0008233473,0.96250397,0.00018528345,0.00018006444,0.00012703476,0.0002875249,0.002159987,0.00986643],"genre_scores_gemma":[0.34223592,0.0014049592,0.63887775,0.00041526693,0.00018052306,0.00018464935,0.0008097204,0.00025099094,0.015640134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994578,0.00007500162,0.000048112994,0.00008152715,0.00026757584,0.00006997396],"domain_scores_gemma":[0.9989889,0.00028860694,0.000095338255,0.00021234261,0.00037867666,0.00003603916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005334978,0.00072666927,0.00044179964,0.000905171,0.00046680844,0.0011254858,0.0008566897,0.0005168097,0.0042788386],"category_scores_gemma":[0.0016071728,0.00032219346,0.0003145243,0.0007921288,0.0004760571,0.0013826012,0.0009710181,0.00094855117,0.0021167174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009569722,0.000103362305,0.0013359829,0.0004064586,0.000057610883,0.00048300362,0.00024331029,0.076218195,0.21609245,0.093323335,0.009302169,0.60147715],"study_design_scores_gemma":[0.00019194739,0.0005875327,0.00069421646,0.00012305574,0.00008150229,0.0016190829,0.00013702617,0.5256757,0.3786549,0.031526,0.060580444,0.00012859252],"about_ca_topic_score_codex":0.0010432702,"about_ca_topic_score_gemma":0.00216114,"teacher_disagreement_score":0.0042788386,"about_ca_system_score_codex":0.00048470518,"about_ca_system_score_gemma":0.0011629398,"threshold_uncertainty_score":0.014314115},"labels":[],"label_agreement":null},{"id":"W2977760468","doi":"10.1109/tcsi.2019.2942833","title":"Energy-Efficient Hardware Architectures for Fast Polar Decoders","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Efficient energy use; Energy consumption; CMOS; Throughput; Polar code; Embedded system; Computer architecture; Computer engineering; Computer hardware; Parallel computing; Wireless; Electronic engineering; Algorithm; Engineering; Telecommunications; Electrical engineering","score_opus":0.012427781989295278,"score_gpt":0.22321910985165191,"score_spread":0.21079132786235663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977760468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12749928,0.0017712773,0.8455432,0.0005576594,0.0001806478,0.00019441026,0.0003797007,0.0040647597,0.019809065],"genre_scores_gemma":[0.61629003,0.00082693517,0.37144795,0.000337201,0.00008399843,0.00010989658,0.0005676844,0.00012437212,0.01021205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974626,0.00003342897,0.000023724411,0.000035050205,0.00011738506,0.0000441531],"domain_scores_gemma":[0.99954575,0.00012220694,0.000056542714,0.00006922501,0.00018801827,0.000018183193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024103552,0.00046562523,0.00025487444,0.0008513465,0.0004356069,0.0009061007,0.0007584427,0.00046154842,0.0041073286],"category_scores_gemma":[0.00064246595,0.0001989199,0.00026116392,0.00066480896,0.00031225392,0.0009993298,0.00043912025,0.0004991997,0.0014479816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080324674,0.00015682325,0.002364794,0.0005897103,0.000084073705,0.00046152383,0.00029872538,0.10752681,0.3366805,0.08601229,0.009885886,0.45513564],"study_design_scores_gemma":[0.00015294593,0.00092074985,0.0013456829,0.000119957185,0.00009182301,0.0009074143,0.00016335023,0.5439748,0.3827117,0.02019544,0.04933152,0.00008460366],"about_ca_topic_score_codex":0.001707808,"about_ca_topic_score_gemma":0.00596422,"teacher_disagreement_score":0.0041073286,"about_ca_system_score_codex":0.0007552062,"about_ca_system_score_gemma":0.0013294555,"threshold_uncertainty_score":0.013740361},"labels":[],"label_agreement":null},{"id":"W2980043203","doi":"10.22215/etd/2016-11443","title":"Multilevel Polar Codes for Grassmannian Signalling","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grassmannian; Constellation; Coding (social sciences); Algorithm; Polar; Computer science; Partition (number theory); Set (abstract data type); Channel (broadcasting); Constellation diagram; Decoding methods; Theoretical computer science; Polar code; Mathematics; Bit error rate; Telecommunications; Statistics","score_opus":0.025488587233653534,"score_gpt":0.3084197226063094,"score_spread":0.28293113537265585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980043203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050869144,0.008926513,0.7695628,0.0021282618,0.0006759559,0.00011210308,0.0005284697,0.00039287482,0.16680388],"genre_scores_gemma":[0.661254,0.013324565,0.26037264,0.00090155884,0.00086737756,0.0002620705,0.00070910563,0.0002081719,0.062100545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997981,0.000042103882,0.000007552619,0.000026997157,0.000096526215,0.000028712244],"domain_scores_gemma":[0.9998054,0.000073154144,0.000020456519,0.00003770432,0.000048623606,0.0000146394395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001968649,0.00034389272,0.00022920492,0.0005436396,0.0003751885,0.00095362077,0.00027452246,0.00046329905,0.0069716815],"category_scores_gemma":[0.00082341244,0.0001346743,0.00021764939,0.00062320323,0.00069026084,0.0006525923,0.0006946089,0.0012590183,0.0018268565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000359891,0.000010107143,0.00006405993,0.00007324014,0.0000044291987,0.000051361403,0.000099201585,0.005740839,0.008793376,0.9343735,0.0032570655,0.047496874],"study_design_scores_gemma":[0.00002363519,0.000048704598,0.00020867282,0.00011299756,0.000008712996,0.00023905301,0.000048399972,0.04491354,0.01070701,0.8928621,0.050799385,0.000027797583],"about_ca_topic_score_codex":0.0003562353,"about_ca_topic_score_gemma":0.000568054,"teacher_disagreement_score":0.0069716815,"about_ca_system_score_codex":0.0005750514,"about_ca_system_score_gemma":0.00045034135,"threshold_uncertainty_score":0.023322642},"labels":[],"label_agreement":null},{"id":"W2981971274","doi":"10.1109/iswcs.2019.8877353","title":"Optimization of Protograph LDPC Codes based on High-Level Energy Models","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Energy consumption; Computer science; Decoding methods; Energy (signal processing); Optimization problem; Low-density parity-check code; Soft-decision decoder; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.04163851049418526,"score_gpt":0.25985365445990805,"score_spread":0.21821514396572278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981971274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043118015,0.0004837984,0.95042425,0.0001895892,0.000022314867,0.000028904476,0.00013647122,0.00022177509,0.0053748097],"genre_scores_gemma":[0.8485821,0.00089709176,0.14110865,0.00008695841,0.00002462353,0.0001354226,0.0002192109,0.0002069577,0.00873911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997348,0.000086285465,0.000006763094,0.00003857939,0.000098362994,0.00003521434],"domain_scores_gemma":[0.9995177,0.00031145522,0.000043225296,0.000040405917,0.000070049995,0.000017132374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034130109,0.0006319989,0.0005953004,0.00042035495,0.00025512825,0.0007244608,0.0005631359,0.0007734737,0.0013838763],"category_scores_gemma":[0.0011779537,0.00032471993,0.00030411477,0.000770989,0.0006625563,0.0008257366,0.00048672353,0.0006174683,0.00031800743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015604088,0.0000047352014,0.000049648177,0.000021072443,0.000004456675,0.00001232745,0.000009081529,0.9848161,0.0013667704,0.01038903,0.00013201084,0.0031790882],"study_design_scores_gemma":[0.0000016159702,0.0000074700397,0.000027372442,0.0000019443582,0.000001367251,0.0000062244567,0.000002200009,0.99528766,0.000587423,0.0038723892,0.0002023136,0.0000019810536],"about_ca_topic_score_codex":0.0028045627,"about_ca_topic_score_gemma":0.00310944,"teacher_disagreement_score":0.0028045627,"about_ca_system_score_codex":0.0015349566,"about_ca_system_score_gemma":0.0010181691,"threshold_uncertainty_score":0.011136949},"labels":[],"label_agreement":null},{"id":"W2982453029","doi":"10.1109/mwscas.2019.8885042","title":"Affordable Sequence Decoding Techniques for High Speed SerDes","year":2019,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"SerDes; Computer science; Decoding methods; Viterbi algorithm; Equalization (audio); Electronic engineering; Viterbi decoder; Digital signal processing; Computer hardware; Real-time computing; Algorithm; Engineering","score_opus":0.030637469113535425,"score_gpt":0.2939546524933212,"score_spread":0.26331718337978577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982453029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07812027,0.002067012,0.90522075,0.00037674746,0.00015391683,0.00007716872,0.00013415536,0.0012852099,0.012564856],"genre_scores_gemma":[0.49310172,0.001572835,0.48522,0.00022590988,0.000094168136,0.000060094964,0.00022348268,0.00011274072,0.01938911],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997192,0.000051877603,0.000015842279,0.000035855966,0.00015455419,0.000022585453],"domain_scores_gemma":[0.99954885,0.00011844322,0.000076118195,0.00008715076,0.00015828443,0.000011154508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026570942,0.0004413905,0.0002277161,0.000429329,0.0002850993,0.00055831973,0.00040285682,0.00051589176,0.0040376554],"category_scores_gemma":[0.00094689656,0.0001740831,0.00020882713,0.00039148176,0.00025476876,0.00068217935,0.0003355751,0.000652162,0.0016812611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032793984,0.000080969214,0.0013878996,0.00038476882,0.00004594238,0.0003969982,0.00022884144,0.029209318,0.5151461,0.0400777,0.002560456,0.41015312],"study_design_scores_gemma":[0.000045867375,0.0005866978,0.0014282346,0.00014418758,0.000044620097,0.001890556,0.000100442056,0.18943745,0.7381863,0.009248988,0.05883935,0.000047309197],"about_ca_topic_score_codex":0.00042286652,"about_ca_topic_score_gemma":0.0012212046,"teacher_disagreement_score":0.0040376554,"about_ca_system_score_codex":0.0003428995,"about_ca_system_score_gemma":0.00038206912,"threshold_uncertainty_score":0.013507307},"labels":[],"label_agreement":null},{"id":"W2982703654","doi":"10.4230/lipics.disc.2019.26","title":"The Complexity of Symmetry Breaking in Massive Graphs","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Omega; Combinatorics; Upper and lower bounds; Symmetry breaking; Graph; Algorithm; Mathematics; Time complexity; Discrete mathematics; Physics; Particle physics; Mathematical analysis","score_opus":0.022236742729631654,"score_gpt":0.26792577825810493,"score_spread":0.24568903552847327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982703654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653291,0.00076101953,0.40296847,0.0056411745,0.00019508798,0.0003849999,0.0022810553,0.0035444757,0.018894633],"genre_scores_gemma":[0.9178756,0.00035064082,0.07357475,0.000518044,0.0001489123,0.0003004911,0.0020297733,0.00050404883,0.0046977093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953603,0.0014229913,0.00023582573,0.001022836,0.0011552046,0.00080287445],"domain_scores_gemma":[0.9735865,0.016382357,0.002052574,0.006116586,0.0008687238,0.0009932901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024755087,0.0008618995,0.0018002146,0.0009762001,0.0019796009,0.003766816,0.0036076528,0.0017589596,0.008952907],"category_scores_gemma":[0.023455236,0.0009897589,0.0020760628,0.0016160989,0.0024473497,0.007673728,0.0032537375,0.0038924816,0.0015320954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013775524,0.00034084913,0.0062534204,0.00058322423,0.00022587947,0.00067562674,0.0008992709,0.44372714,0.009294862,0.43447703,0.02210283,0.080042355],"study_design_scores_gemma":[0.000082080966,0.000036414494,0.0006594067,0.000018930868,0.000026708214,0.00010693234,0.00012568064,0.510254,0.001870387,0.48546946,0.0013243016,0.000025664422],"about_ca_topic_score_codex":0.004235815,"about_ca_topic_score_gemma":0.0030200118,"teacher_disagreement_score":0.008952907,"about_ca_system_score_codex":0.0029815002,"about_ca_system_score_gemma":0.00223525,"threshold_uncertainty_score":0.0299505},"labels":[],"label_agreement":null},{"id":"W2983117712","doi":"10.18280/ts.360409","title":"Performance Analysis of Massive Multi-input and Multi-output with Imperfect Channel State Information","year":2019,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Imperfect; Computer science; Channel (broadcasting); State (computer science); Algorithm; Telecommunications","score_opus":0.012550405867444398,"score_gpt":0.22579854057725635,"score_spread":0.21324813470981194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983117712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44313902,0.0028524715,0.5329897,0.00093913183,0.0001741493,0.00009020187,0.000319497,0.00080546166,0.01869047],"genre_scores_gemma":[0.99290025,0.000335306,0.005952062,0.00003516427,0.000027955597,0.000015246435,0.00005151235,0.000015801708,0.0006666988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983895,0.00048153626,0.000045718658,0.00018393545,0.00049136253,0.0004080775],"domain_scores_gemma":[0.99509144,0.0026818507,0.0005803632,0.000376772,0.001100538,0.00016897556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019653882,0.0011250023,0.0008537288,0.0007955931,0.0006567862,0.001158318,0.00079458917,0.00071444694,0.0011590696],"category_scores_gemma":[0.0060375244,0.00030467342,0.0004343501,0.00097422616,0.0009959509,0.00091738167,0.0010474529,0.0006374926,0.00021306404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025288764,0.00004545685,0.0024084877,0.0000962372,0.00006619113,0.00020589013,0.000095976815,0.96561563,0.0048072482,0.013370365,0.00054873986,0.012486945],"study_design_scores_gemma":[0.0000037903865,0.000054625125,0.00046525768,0.000004927846,0.000012507661,0.00003941215,0.000018188477,0.9972945,0.0010645726,0.00094370433,0.00008939407,0.00000915713],"about_ca_topic_score_codex":0.008064199,"about_ca_topic_score_gemma":0.0050453953,"teacher_disagreement_score":0.008064199,"about_ca_system_score_codex":0.0016316988,"about_ca_system_score_gemma":0.0017641842,"threshold_uncertainty_score":0.016034544},"labels":[],"label_agreement":null},{"id":"W2984937238","doi":"10.1109/tvlsi.2019.2950129","title":"Area- and Power-Efficient Staircase Encoder Implementation for High-Throughput Fiber-Optical Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Encoder; Computer science; Throughput; Very-large-scale integration; CMOS; Computer hardware; Latency (audio); Forward error correction; Electronic engineering; Power consumption; Block (permutation group theory); High-definition television; Parallel computing; Embedded system; Power (physics); Decoding methods; Wireless; Engineering; Algorithm; Telecommunications","score_opus":0.019658049629703387,"score_gpt":0.2948270207983588,"score_spread":0.2751689711686554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984937238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.161384,0.0025400133,0.81455576,0.00036175465,0.00022726912,0.0002669511,0.0005871104,0.0048184507,0.015258754],"genre_scores_gemma":[0.7188583,0.00072325126,0.27005243,0.00011103164,0.00005002741,0.00007296022,0.0004916103,0.00006141254,0.0095788175],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999874,0.0000124398275,0.000009527328,0.000018088695,0.000060092432,0.000025806494],"domain_scores_gemma":[0.99978596,0.0000404708,0.00003076866,0.000025576568,0.00010680365,0.000010436492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013163303,0.00032658209,0.00015694315,0.00044371348,0.00031016397,0.0003999351,0.0007059651,0.00030892566,0.0030113182],"category_scores_gemma":[0.00031281824,0.00014670716,0.00014492524,0.00041158943,0.000113488844,0.0005550134,0.00015447498,0.00028684287,0.00075169955],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039491546,0.00014739281,0.0016032644,0.00045855556,0.0000690865,0.0005785518,0.0001505456,0.016346768,0.6777307,0.0123705845,0.0059345914,0.2842151],"study_design_scores_gemma":[0.00006814346,0.0011169309,0.0022284957,0.000052788917,0.000085364576,0.0013080493,0.00006682595,0.21848784,0.73295623,0.0018578396,0.041722592,0.000048874037],"about_ca_topic_score_codex":0.0023408695,"about_ca_topic_score_gemma":0.008704642,"teacher_disagreement_score":0.0030113182,"about_ca_system_score_codex":0.00051543047,"about_ca_system_score_gemma":0.0007911285,"threshold_uncertainty_score":0.010073841},"labels":[],"label_agreement":null},{"id":"W2985618070","doi":"10.1109/tcomm.2019.2953601","title":"Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Computer science; Trapping; Algorithm; Theoretical computer science; Decoding methods; Biology","score_opus":0.017633620423915405,"score_gpt":0.27141470426903447,"score_spread":0.25378108384511905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985618070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12681618,0.00022759625,0.86807483,0.00014193916,0.000025019774,0.00011471061,0.00013277419,0.00059868535,0.003868243],"genre_scores_gemma":[0.5551936,0.00025537316,0.44207254,0.000082456034,0.00000981856,0.00017839434,0.00018321481,0.000069720794,0.0019549234],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.00004022835,0.000013207228,0.000032511613,0.00009807448,0.00003071101],"domain_scores_gemma":[0.9994708,0.00013578768,0.00011960625,0.00009349253,0.00014985926,0.00003041389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021904676,0.000327913,0.00030800048,0.00045257658,0.00026521992,0.00037770867,0.0005257682,0.00028128485,0.00055168144],"category_scores_gemma":[0.00071301655,0.00025038244,0.0002637503,0.00046287486,0.0004266863,0.00028822807,0.0004179842,0.00038884432,0.0002168019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017581107,0.00014287165,0.002364422,0.0004777318,0.00006686261,0.0004026544,0.00027781734,0.26205158,0.5043836,0.09267156,0.0018004118,0.1351846],"study_design_scores_gemma":[0.00006163946,0.00020595493,0.00065468263,0.000027388862,0.000030343579,0.0003406722,0.000025632298,0.8322357,0.15331246,0.0075305225,0.005538988,0.000036049496],"about_ca_topic_score_codex":0.0010422221,"about_ca_topic_score_gemma":0.0015732283,"teacher_disagreement_score":0.0010422221,"about_ca_system_score_codex":0.00056551304,"about_ca_system_score_gemma":0.001135966,"threshold_uncertainty_score":0.004103124},"labels":[],"label_agreement":null},{"id":"W2990585754","doi":"10.1109/lcomm.2019.2955450","title":"Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Forward error correction; Computer science; Constraint (computer-aided design); Turbo code; Concatenated error correction code; Serial concatenated convolutional codes; Decoding methods; Algorithm; Telecommunications; Mathematics; Block code","score_opus":0.02731998949343267,"score_gpt":0.25372740180921854,"score_spread":0.22640741231578587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990585754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22644733,0.000611542,0.7582431,0.00034165234,0.00007462853,0.00007887164,0.00013165215,0.00036446907,0.013706792],"genre_scores_gemma":[0.85077626,0.00039435987,0.14489143,0.00018096052,0.000026462274,0.00009119629,0.00007933222,0.000049758684,0.0035102633],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965286,0.000057990906,0.000020818652,0.00006250353,0.00016770417,0.00003816915],"domain_scores_gemma":[0.9993217,0.00020971832,0.00017328754,0.00009988441,0.00015468484,0.00004078499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022183478,0.0005174897,0.00034283803,0.00033936716,0.00038300015,0.00046926294,0.00068241864,0.00047367436,0.00070097495],"category_scores_gemma":[0.0011264457,0.00018656078,0.00023078028,0.00046837807,0.0006116929,0.0005117201,0.00057371694,0.0004927184,0.00029524043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002791498,0.00013446291,0.001957733,0.0004894569,0.00012315887,0.0005496024,0.00028940666,0.32545686,0.45114246,0.15573627,0.001075843,0.06276558],"study_design_scores_gemma":[0.000052941097,0.00027711416,0.00052583794,0.00003590985,0.000073638104,0.00044169027,0.00004055428,0.82766414,0.14733401,0.018438978,0.005068558,0.00004662524],"about_ca_topic_score_codex":0.00072997034,"about_ca_topic_score_gemma":0.0016984693,"teacher_disagreement_score":0.00072997034,"about_ca_system_score_codex":0.00058705936,"about_ca_system_score_gemma":0.00076827605,"threshold_uncertainty_score":0.004259467},"labels":[],"label_agreement":null},{"id":"W2994653572","doi":"10.1002/9781119562306.ch15","title":"Deep Learning Techniques for Decoding Polar Codes","year":2019,"lang":"en","type":"other","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Algorithm; Polar; Polar code; Coding (social sciences); Belief propagation; Error detection and correction; Encoding (memory); Concatenated error correction code; Block code; Artificial intelligence; Mathematics","score_opus":0.016182552429244483,"score_gpt":0.2835932155825966,"score_spread":0.2674106631533521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994653572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027707503,0.00077553693,0.99167305,0.00018253889,0.00006621847,0.000020152935,0.00008454526,0.000515343,0.0039118677],"genre_scores_gemma":[0.22112009,0.0049327994,0.74928373,0.00061235897,0.00024146329,0.00016573419,0.0010078776,0.00031882583,0.022317102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.000088154906,0.000033024375,0.000061641134,0.00022966237,0.000047776928],"domain_scores_gemma":[0.9994179,0.00026060294,0.000038277067,0.00007572169,0.00019135777,0.000016239386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909252,0.00081182295,0.00047835335,0.0008117654,0.00034519183,0.0011106657,0.0007250524,0.00074572547,0.0037079433],"category_scores_gemma":[0.0028017876,0.0003183326,0.0004781459,0.0009567564,0.00067765714,0.0011271446,0.0012076453,0.0021401697,0.0019077727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008992326,0.000042686894,0.00058064144,0.00024637036,0.000054338838,0.00010509516,0.00013284956,0.26244536,0.010621455,0.1340854,0.0076390435,0.5839568],"study_design_scores_gemma":[0.000008456998,0.00002860649,0.00010110265,0.000046903788,0.000011098167,0.00010083812,0.000019818159,0.94141394,0.009146669,0.039835073,0.009275357,0.000012174733],"about_ca_topic_score_codex":0.0033223333,"about_ca_topic_score_gemma":0.004601141,"teacher_disagreement_score":0.0037079433,"about_ca_system_score_codex":0.00075351616,"about_ca_system_score_gemma":0.00094915874,"threshold_uncertainty_score":0.012404323},"labels":[],"label_agreement":null},{"id":"W2994881336","doi":"10.1109/iemcon.2019.8936303","title":"Stopping Criterion for Belief Propagation Polar Code Decoders based on Bits Difference Ratio","year":2019,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Decoding methods; Belief propagation; Computer science; Early stopping; Algorithm; Reduction (mathematics); Constraint (computer-aided design); Polar; Polar code; Bit error rate; Code (set theory); Latency (audio); Optimal stopping; Propagation of uncertainty; Mathematics; Mathematical optimization; Telecommunications; Artificial intelligence; Physics","score_opus":0.021743962478090764,"score_gpt":0.2751785140212802,"score_spread":0.25343455154318945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994881336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008747384,0.00030758462,0.9898498,0.00007512898,0.00002717594,0.00002878254,0.000021605432,0.00016635236,0.0007761868],"genre_scores_gemma":[0.48084265,0.0008159543,0.51458585,0.00019621619,0.00008309821,0.00021635188,0.00029797293,0.0002424405,0.0027194496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970499,0.0009010115,0.00025221737,0.00036213623,0.0012541163,0.00018067294],"domain_scores_gemma":[0.992374,0.0041989707,0.0005710646,0.00033058724,0.0023260291,0.00019941668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025800022,0.0011084329,0.0009457159,0.0012907154,0.0005290005,0.001805041,0.0012924487,0.0011449559,0.000984181],"category_scores_gemma":[0.014420109,0.00046659133,0.00042223508,0.0008850444,0.0012331518,0.0019517776,0.001192581,0.0015776294,0.00051304535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010968365,0.00008455185,0.0042102537,0.00052093243,0.00012720803,0.00028763426,0.00041257867,0.50052917,0.052024048,0.11679537,0.002479055,0.32143244],"study_design_scores_gemma":[0.000020023173,0.00012661821,0.0002456244,0.000026484033,0.000015975473,0.000117754695,0.0000170596,0.97223884,0.015641153,0.01050439,0.0010179965,0.000028155539],"about_ca_topic_score_codex":0.0014972605,"about_ca_topic_score_gemma":0.00091869413,"teacher_disagreement_score":0.0025800022,"about_ca_system_score_codex":0.0010609279,"about_ca_system_score_gemma":0.0016386191,"threshold_uncertainty_score":0.0136445165},"labels":[],"label_agreement":null},{"id":"W2997794147","doi":"10.1007/s11265-019-01506-0","title":"An Efficient Software List Sphere Decoder for Polar Codes","year":2020,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Soft-decision decoder; Computer science; Decoding methods; Algorithm; Software; Sorting; Theoretical computer science","score_opus":0.029176133680983624,"score_gpt":0.28824625622597955,"score_spread":0.25907012254499595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997794147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01648255,0.00039649048,0.973056,0.0003190944,0.00018044797,0.00006754999,0.00032899395,0.0031477725,0.006021128],"genre_scores_gemma":[0.26329985,0.0007884119,0.7170093,0.0004447532,0.00020685945,0.00015881805,0.001292551,0.00048802883,0.01631144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993148,0.00016353276,0.000042248077,0.000063455154,0.00032668634,0.00008928978],"domain_scores_gemma":[0.9989641,0.00032154913,0.000057729918,0.00016839737,0.00043014326,0.000058044643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047080108,0.0008933469,0.00083380775,0.00083066896,0.0006371448,0.0014378054,0.00071478816,0.00083647046,0.0045426646],"category_scores_gemma":[0.0018880122,0.0003592094,0.0003963335,0.0010960653,0.00041356895,0.0009214854,0.0017788766,0.00084256567,0.004589254],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015485405,0.0001786272,0.0015639549,0.00045255906,0.00013033,0.00071081554,0.0002861616,0.112684265,0.12087021,0.11838763,0.02579593,0.61739105],"study_design_scores_gemma":[0.00013442153,0.0003339529,0.0004154444,0.0000807973,0.000062935615,0.0007916735,0.000073156436,0.831873,0.113855526,0.028883638,0.023417873,0.0000776423],"about_ca_topic_score_codex":0.0023874852,"about_ca_topic_score_gemma":0.0043604793,"teacher_disagreement_score":0.0045426646,"about_ca_system_score_codex":0.000540609,"about_ca_system_score_gemma":0.0024962302,"threshold_uncertainty_score":0.0151968},"labels":[],"label_agreement":null},{"id":"W2998239782","doi":"10.1109/tcomm.2019.2962397","title":"Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Complete bipartite graph; Algorithm; Graph; Discrete mathematics; Mathematics; Computer science","score_opus":0.02737860117143568,"score_gpt":0.2921835513328338,"score_spread":0.2648049501613981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998239782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017418344,0.0008598768,0.9744932,0.0010238105,0.00015626656,0.00035263636,0.00037599463,0.001543399,0.0037764178],"genre_scores_gemma":[0.12571612,0.0013042792,0.8641293,0.0007283046,0.0004135252,0.00075170083,0.001577998,0.00063943514,0.0047393064],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966389,0.0007671391,0.00025261255,0.0008089447,0.0011443121,0.00038804338],"domain_scores_gemma":[0.9928532,0.0040814783,0.00050059234,0.0014541582,0.00081728573,0.00029329275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706641,0.0019353889,0.001768765,0.0034262843,0.0018990013,0.0025334612,0.0031824186,0.0021392533,0.005857742],"category_scores_gemma":[0.007974204,0.0010473551,0.0026798144,0.0033982866,0.0016398989,0.008928562,0.0032718487,0.0030402362,0.0017188026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009698229,0.0007387152,0.004207856,0.0017260535,0.00036517126,0.00050008524,0.0006965612,0.09045961,0.037284493,0.19022329,0.031157538,0.6416708],"study_design_scores_gemma":[0.0002472574,0.00032996535,0.0014171907,0.00013954539,0.00019036884,0.0012831872,0.00026180502,0.63132304,0.016414665,0.32849514,0.019725231,0.00017245892],"about_ca_topic_score_codex":0.0026952685,"about_ca_topic_score_gemma":0.002511583,"teacher_disagreement_score":0.005857742,"about_ca_system_score_codex":0.0014749757,"about_ca_system_score_gemma":0.0021240402,"threshold_uncertainty_score":0.0195961},"labels":[],"label_agreement":null},{"id":"W2998916130","doi":"10.1109/lwc.2020.2966624","title":"Nested Construction of Polar Codes for Blind Detection","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Control channel; Telecommunications link; Latency (audio); Polar; Scheme (mathematics); Coding (social sciences); Channel code; Real-time computing; Computer network; Algorithm; Telecommunications; Mathematics","score_opus":0.04607982118845658,"score_gpt":0.28753787770252914,"score_spread":0.24145805651407257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998916130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018031947,0.00031684394,0.9788205,0.00011199895,0.00006724409,0.00004928271,0.00006390052,0.00017866225,0.0023595442],"genre_scores_gemma":[0.43362778,0.00065596355,0.5615862,0.00028489466,0.00008593418,0.00019151982,0.00021908556,0.000053118612,0.0032955138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990171,0.00030632282,0.000050707153,0.00014443553,0.00034339327,0.0001380247],"domain_scores_gemma":[0.9980648,0.00080207223,0.00023056465,0.00034265,0.00044951195,0.000110368055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224776,0.0006763252,0.00057288806,0.0007695059,0.0006163236,0.0007058898,0.0005258459,0.00072534365,0.0015930086],"category_scores_gemma":[0.0034179967,0.00031592537,0.00037295328,0.0007392171,0.0010593857,0.0011783105,0.0019576913,0.0011019281,0.00066782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077852444,0.0001156967,0.0013444963,0.00030298677,0.000061523395,0.0006137867,0.0006644476,0.18827197,0.13188519,0.40685862,0.0026540658,0.26644868],"study_design_scores_gemma":[0.00006545193,0.00034924044,0.0003084181,0.00008003752,0.000032701304,0.00070361356,0.00007705726,0.84103537,0.05605908,0.090227626,0.010968267,0.00009309251],"about_ca_topic_score_codex":0.000867194,"about_ca_topic_score_gemma":0.00079405744,"teacher_disagreement_score":0.0015930086,"about_ca_system_score_codex":0.00046911777,"about_ca_system_score_gemma":0.00118238,"threshold_uncertainty_score":0.0053291917},"labels":[],"label_agreement":null},{"id":"W3000733996","doi":"10.1109/tii.2020.2965952","title":"Spatially Coupled Codes via Partial and Recursive Superposition for Industrial IoT With High Trustworthiness","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Science Foundation, United Arab Emirates; Ministry of Science, ICT and Future Planning; National Natural Science Foundation of China","keywords":"Low-density parity-check code; Computer science; Superposition principle; Transmission (telecommunications); Computational complexity theory; Encoding (memory); Algorithm; Block (permutation group theory); Reduction (mathematics); Reliability (semiconductor); Code (set theory); Forward error correction; Theoretical computer science; Computer engineering; Decoding methods; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.04816081336348197,"score_gpt":0.24891094703559227,"score_spread":0.2007501336721103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000733996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05361538,0.00023609631,0.9417831,0.00013972339,0.000018826282,0.000030900654,0.00003232307,0.00020433486,0.003939332],"genre_scores_gemma":[0.82936203,0.00039252816,0.16724095,0.000076852,0.000020508283,0.000075729455,0.000064208754,0.000043161606,0.002724084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995598,0.00011578696,0.000016647606,0.000050467355,0.00021330548,0.00004388135],"domain_scores_gemma":[0.9993876,0.00030002804,0.000091589725,0.00010143474,0.00009533675,0.00002398772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039104687,0.00037474328,0.0003191546,0.00027699565,0.00032253365,0.00043637078,0.00047133476,0.00036180316,0.0009018299],"category_scores_gemma":[0.0014839746,0.00024152095,0.0004437962,0.0005401258,0.00069564267,0.0006367068,0.0008030124,0.0005530785,0.00021362708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001672225,0.000046939047,0.0016023619,0.00016230407,0.00006857544,0.0003791087,0.0003583974,0.6847547,0.07355211,0.15818015,0.00092450954,0.07980352],"study_design_scores_gemma":[0.0000067571286,0.00003190401,0.0001553347,0.000007726597,0.000011639118,0.00005522521,0.000009258458,0.9849421,0.005882922,0.008181294,0.00070498005,0.000010818517],"about_ca_topic_score_codex":0.002325552,"about_ca_topic_score_gemma":0.0028808934,"teacher_disagreement_score":0.002325552,"about_ca_system_score_codex":0.0006073684,"about_ca_system_score_gemma":0.0007738416,"threshold_uncertainty_score":0.004624009},"labels":[],"label_agreement":null},{"id":"W3000741554","doi":"10.3934/amc.2020062","title":"QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Girth (graph theory); Exponent; Multiplicative function; Tanner graph; Algebraic number; Parity-check matrix; Discrete mathematics; Combinatorics; Decoding methods; Finite field; Code (set theory); Error floor; Set (abstract data type); Statistics; Computer science","score_opus":0.037195923058011296,"score_gpt":0.31015976200605067,"score_spread":0.2729638389480394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000741554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8074916,0.00019508903,0.1824671,0.00023278309,0.000032628654,0.00012568943,0.00021290642,0.0003772908,0.008864931],"genre_scores_gemma":[0.9520144,0.00013564118,0.046191446,0.00005720936,0.000010347343,0.00004931172,0.00020351728,0.000025457924,0.0013126805],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977845,0.000039437582,0.000015809906,0.000052033287,0.00007658368,0.000037555452],"domain_scores_gemma":[0.9990225,0.00039222,0.00013519259,0.00027280237,0.0001179381,0.000059388236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020998859,0.00024252862,0.0001905579,0.0003768004,0.00043656636,0.00031313096,0.0003326769,0.00026292028,0.0008417299],"category_scores_gemma":[0.0011109324,0.00014890506,0.00029668031,0.00037730558,0.0006332938,0.0005561135,0.0005928823,0.0004561076,0.00011345876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005302128,0.0002278178,0.0074669314,0.0006894536,0.0000813989,0.0011191897,0.00074531924,0.14758533,0.4274366,0.33896226,0.002134615,0.07302088],"study_design_scores_gemma":[0.00019535418,0.00047530278,0.004849753,0.00007412383,0.0001139842,0.0012367588,0.00015026011,0.60425127,0.291023,0.08723622,0.010301194,0.00009269696],"about_ca_topic_score_codex":0.0009834184,"about_ca_topic_score_gemma":0.001400395,"teacher_disagreement_score":0.0009834184,"about_ca_system_score_codex":0.00031851567,"about_ca_system_score_gemma":0.00074210187,"threshold_uncertainty_score":0.0028159022},"labels":[],"label_agreement":null},{"id":"W3003276132","doi":"10.1109/tcsi.2020.2969325","title":"Polar Compiler: Auto-Generator of Hardware Architectures for Polar Encoders","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Southeast University; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Compiler; Computer science; Encoder; Parallel computing; Computer hardware; Polar; Computer architecture; Programming language; Operating system","score_opus":0.027456397506108652,"score_gpt":0.23812427722940369,"score_spread":0.21066787972329504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003276132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019710835,0.00032031734,0.93988585,0.00008506884,0.00014123491,0.00020133017,0.0010168544,0.030927198,0.0077113374],"genre_scores_gemma":[0.23925185,0.00053817703,0.73455465,0.0002319813,0.00008611662,0.00045348363,0.0046849023,0.009382686,0.010816216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962604,0.00006647358,0.000036882142,0.00007208705,0.00014220642,0.000056273424],"domain_scores_gemma":[0.9992324,0.00024741073,0.000055695156,0.00018733281,0.00025596304,0.000021119991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046645774,0.000701558,0.00026595884,0.00078265864,0.0002537806,0.00070567016,0.0007808819,0.0003266509,0.008359991],"category_scores_gemma":[0.0018556912,0.00039911986,0.0004648199,0.00043538504,0.00029802747,0.00070376653,0.00063943694,0.0006885828,0.0032579235],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010861462,0.00021245003,0.005157123,0.0013088363,0.00009885339,0.0009025936,0.00056042033,0.074771695,0.123679966,0.087008074,0.059511915,0.6457019],"study_design_scores_gemma":[0.00032228153,0.00055895554,0.0013655294,0.00026231605,0.00010464047,0.001168733,0.00016008136,0.45593488,0.34412152,0.029538032,0.16637747,0.000085615546],"about_ca_topic_score_codex":0.0005548844,"about_ca_topic_score_gemma":0.00069530966,"teacher_disagreement_score":0.008359991,"about_ca_system_score_codex":0.00030637826,"about_ca_system_score_gemma":0.00090599403,"threshold_uncertainty_score":0.027966976},"labels":[],"label_agreement":null},{"id":"W3005925191","doi":"10.1109/itw44776.2019.8989134","title":"On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth","year":2019,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Tanner graph; Degree (music); Discrete mathematics; Low-density parity-check code; Girth (graph theory); Time complexity; Partition (number theory); Frequency partition of a graph; Sequence (biology); Graph; Algorithm; Line graph; Graph power; Decoding methods","score_opus":0.047815911412591366,"score_gpt":0.28550874175409774,"score_spread":0.23769283034150637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005925191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6737467,0.0018407706,0.28476366,0.00826833,0.00023935485,0.0005090617,0.0027112036,0.0028993818,0.025021546],"genre_scores_gemma":[0.8151601,0.0011428301,0.1716769,0.00069849944,0.0002593502,0.0004710278,0.0031700295,0.00038420054,0.0070370203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998201,0.0005155146,0.000085695196,0.0005264271,0.00029467882,0.0003767077],"domain_scores_gemma":[0.98052055,0.017122716,0.0007566097,0.0008860422,0.00035502273,0.00035906464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017677516,0.0010018125,0.0013765503,0.0011096505,0.0013766388,0.003753277,0.0018511729,0.0014974267,0.008851136],"category_scores_gemma":[0.012301603,0.0006784264,0.0013069436,0.0019966557,0.0021711395,0.006157645,0.001938181,0.0024347086,0.0011321208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029696673,0.0007178026,0.009288707,0.0009834121,0.0002816255,0.00057833927,0.00063902745,0.7379335,0.01381391,0.06500444,0.017810274,0.1499793],"study_design_scores_gemma":[0.00028173486,0.00013670871,0.0016807386,0.000039091945,0.000066690205,0.00018723612,0.00022323907,0.9129287,0.0028523088,0.08008421,0.0014868355,0.000032391617],"about_ca_topic_score_codex":0.009020267,"about_ca_topic_score_gemma":0.012599991,"teacher_disagreement_score":0.009020267,"about_ca_system_score_codex":0.0026001872,"about_ca_system_score_gemma":0.003190479,"threshold_uncertainty_score":0.029610038},"labels":[],"label_agreement":null},{"id":"W3008718072","doi":"10.1109/tcomm.2020.2975195","title":"Error Floor Estimation of LDPC Decoders — A Code Independent Approach to Measuring the Harmfulness of Trapping Sets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Randomness; Algorithm; Tanner graph; Message passing; Decoding methods; Computer science; Binary number; Graph; Code (set theory); Belief propagation; Theoretical computer science; Mathematics; Set (abstract data type); Error floor; Statistics","score_opus":0.11425838287925082,"score_gpt":0.3156160599393843,"score_spread":0.20135767706013347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008718072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070483975,0.000103953906,0.9275811,0.00006204826,0.000010744309,0.00003344575,0.000050897765,0.00037958997,0.0012943264],"genre_scores_gemma":[0.8647279,0.00014149185,0.13341168,0.000058857673,0.000011007806,0.000060968396,0.00013079843,0.00008431349,0.0013729212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990483,0.00029927128,0.00003299208,0.0001377803,0.00042397936,0.000057652855],"domain_scores_gemma":[0.99735814,0.0014642328,0.00036181678,0.0004140148,0.00033829463,0.000063548345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013868,0.000703142,0.0005938624,0.0009745544,0.00036373708,0.00057810004,0.0010148436,0.00070740335,0.000510635],"category_scores_gemma":[0.005404685,0.00042403693,0.00045226366,0.00052155025,0.00094941206,0.0012227795,0.00096247566,0.00096440385,0.00017435156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019840854,0.00008260084,0.0056412583,0.00014126197,0.00010141558,0.00019702605,0.00025227907,0.8477139,0.05705209,0.037758008,0.0004779045,0.050383765],"study_design_scores_gemma":[0.0000022549011,0.000017742546,0.00034471555,0.0000046378714,0.0000044769704,0.000033162145,0.0000065257177,0.98698086,0.010091902,0.002412539,0.000092011804,0.00000923799],"about_ca_topic_score_codex":0.0022049765,"about_ca_topic_score_gemma":0.0019681416,"teacher_disagreement_score":0.0022049765,"about_ca_system_score_codex":0.00090255117,"about_ca_system_score_gemma":0.0010150418,"threshold_uncertainty_score":0.0065484643},"labels":[],"label_agreement":null},{"id":"W3011022548","doi":"10.1109/ojcoms.2020.2982355","title":"Computational Power Evaluation for Energy-Constrained Wireless Communications Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computational complexity theory; Digital signal processing; Wireless; Field-programmable gate array; Computer engineering; Application-specific integrated circuit; Communications system; Algorithm; Embedded system; Computer hardware; Telecommunications","score_opus":0.12831678269892052,"score_gpt":0.36901967023231674,"score_spread":0.24070288753339622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011022548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06268105,0.0011225512,0.928583,0.00012840243,0.00005129129,0.000086387015,0.000087174565,0.00033568413,0.006924371],"genre_scores_gemma":[0.82246447,0.0012056531,0.17321499,0.000065200984,0.000039873477,0.00015262926,0.00020770132,0.00013264111,0.0025168054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869746,0.00030353706,0.000059734717,0.00010922926,0.0007715557,0.000058463702],"domain_scores_gemma":[0.9981974,0.0010176824,0.00017130372,0.0002062201,0.0003820237,0.000025413532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079677324,0.0008657595,0.00039441616,0.0012874777,0.0002856312,0.0009471574,0.0006128816,0.0004161258,0.0018881696],"category_scores_gemma":[0.004840184,0.00014626104,0.00023807047,0.0011692779,0.00049887836,0.0012843418,0.0005809784,0.00047585546,0.00028214647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022114051,0.000096791875,0.0028363988,0.00039698178,0.000085601525,0.00018373196,0.0001230597,0.6535578,0.041074254,0.037159014,0.0016559272,0.2626093],"study_design_scores_gemma":[0.0000056462636,0.00011218451,0.0011148164,0.000028121603,0.000016169173,0.000106689076,0.00003543433,0.96824473,0.0222907,0.005377411,0.00265244,0.000015630803],"about_ca_topic_score_codex":0.0011522586,"about_ca_topic_score_gemma":0.0012975743,"teacher_disagreement_score":0.0018881696,"about_ca_system_score_codex":0.0008091524,"about_ca_system_score_gemma":0.00064979115,"threshold_uncertainty_score":0.006316483},"labels":[],"label_agreement":null},{"id":"W3011494981","doi":"10.1109/dcc47342.2020.00078","title":"Depth-First Decoding of Distributed Arithmetic Codes for Uniform Binary Sources","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Binary number; Soft-decision decoder; Coding (social sciences); Binary code; Algorithm; Arithmetic; Code (set theory); Arithmetic coding; Theoretical computer science; Context-adaptive binary arithmetic coding; Mathematics; Data compression","score_opus":0.037491311697188404,"score_gpt":0.2730578557033466,"score_spread":0.23556654400615823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011494981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033337105,0.0005876492,0.9623285,0.00012263012,0.000035322424,0.000044240827,0.0000637666,0.00039910458,0.0030817217],"genre_scores_gemma":[0.5398486,0.0007465343,0.45464718,0.00013332066,0.000040404222,0.00006343057,0.00015392323,0.000051864266,0.004314661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996952,0.00005217534,0.000016298109,0.000044696844,0.00015894539,0.00003265205],"domain_scores_gemma":[0.9995223,0.00018534274,0.00006804744,0.000063592044,0.00014106816,0.000019605419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032482643,0.00049520377,0.00038606967,0.0006241683,0.00036618125,0.00049445475,0.00057061535,0.00045844662,0.001166103],"category_scores_gemma":[0.0014489513,0.00022474526,0.00021578764,0.0004967457,0.00033896894,0.0007900888,0.0005077692,0.0005315008,0.000299923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050801603,0.000079041616,0.0015931991,0.0004704308,0.00006843372,0.00023163408,0.00030841614,0.28941724,0.14983407,0.08791997,0.0027516517,0.46681777],"study_design_scores_gemma":[0.000047821944,0.00013237903,0.00026879268,0.000040170464,0.000019403764,0.00024028977,0.000024139164,0.9119728,0.06938874,0.01301942,0.004818268,0.000027703018],"about_ca_topic_score_codex":0.002591391,"about_ca_topic_score_gemma":0.004809433,"teacher_disagreement_score":0.002591391,"about_ca_system_score_codex":0.0008334868,"about_ca_system_score_gemma":0.0012734982,"threshold_uncertainty_score":0.006047368},"labels":[],"label_agreement":null},{"id":"W3016073191","doi":"10.1109/icassp40776.2020.9052925","title":"Simplified Dynamic SC-Flip Polar Decoding","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Logarithm; List decoding; Algorithm; Computation; Exponential function; Sequential decoding; Berlekamp–Welch algorithm; Parallel computing; Concatenated error correction code; Block code; Mathematics","score_opus":0.026564764994627565,"score_gpt":0.2700333972041939,"score_spread":0.24346863220956633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016073191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014798618,0.0003943093,0.96499354,0.00026962277,0.00014900026,0.00008792618,0.000250044,0.0009081459,0.0181487],"genre_scores_gemma":[0.3861227,0.0011164017,0.5969202,0.00041703958,0.0001524927,0.00014821923,0.0009329933,0.00021522543,0.013974753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962556,0.00006186267,0.000022327278,0.00006056804,0.00016969726,0.000059969825],"domain_scores_gemma":[0.9995185,0.00008574253,0.000022358146,0.00014996035,0.00020349806,0.000019829164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026899838,0.00062297226,0.00046312026,0.00077368674,0.0005771935,0.0010176033,0.00058829103,0.0006340297,0.0059088445],"category_scores_gemma":[0.0012392062,0.00016466207,0.0003284665,0.0009775548,0.00061956135,0.0010065766,0.0008058336,0.0007365963,0.0025253044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777577,0.00007753252,0.0009093419,0.00029936223,0.000033652308,0.00043686412,0.0001728623,0.12924269,0.08231388,0.29893363,0.012109023,0.4748934],"study_design_scores_gemma":[0.000071525894,0.00017633593,0.00030006052,0.000069452726,0.000028355118,0.0010415621,0.00006475102,0.8064008,0.10063322,0.058610097,0.032532338,0.00007155578],"about_ca_topic_score_codex":0.0018161201,"about_ca_topic_score_gemma":0.0023240258,"teacher_disagreement_score":0.0059088445,"about_ca_system_score_codex":0.0005074861,"about_ca_system_score_gemma":0.001620934,"threshold_uncertainty_score":0.019767046},"labels":[],"label_agreement":null},{"id":"W3017318545","doi":"10.3390/s20082300","title":"A New Construction of High Performance LDPC Matrices for Mobile Networks","year":2020,"lang":"en","type":"article","venue":"Sensors","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Low-density parity-check code; Computer science; Additive white Gaussian noise; Computation; Algorithm; Decoding methods; Data flow diagram; Channel (broadcasting); Theoretical computer science; Computer engineering; Computer network","score_opus":0.01245650318579186,"score_gpt":0.23333440455426369,"score_spread":0.22087790136847182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017318545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01706608,0.00023385657,0.9772051,0.00015963032,0.00006220099,0.00006461591,0.00007288551,0.00027563053,0.0048598866],"genre_scores_gemma":[0.23774844,0.000456771,0.757499,0.0001072804,0.000045216795,0.00016910702,0.00018142188,0.00006605951,0.003726656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.00006462437,0.00001100412,0.000036566402,0.00010909769,0.00001865468],"domain_scores_gemma":[0.9995803,0.00013153325,0.00004814671,0.00010319871,0.00011119296,0.000025634374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024357517,0.0004687233,0.00022517424,0.000577631,0.00044453077,0.00040049443,0.00039094492,0.000422156,0.0014106904],"category_scores_gemma":[0.0012754824,0.00022922459,0.00033290754,0.00045448812,0.00052158977,0.00045598717,0.0005991574,0.0007503365,0.00062722276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013436883,0.00011048526,0.0012274302,0.0004369623,0.000055391694,0.00052836427,0.0003974447,0.1888058,0.15027674,0.39057913,0.005027638,0.2624202],"study_design_scores_gemma":[0.000049946735,0.00016288013,0.00040714422,0.00006267299,0.000024831716,0.0006774547,0.000046508965,0.84586173,0.06732196,0.058556333,0.02677129,0.000057188787],"about_ca_topic_score_codex":0.0007979323,"about_ca_topic_score_gemma":0.0014548344,"teacher_disagreement_score":0.0014106904,"about_ca_system_score_codex":0.00036191146,"about_ca_system_score_gemma":0.00093722495,"threshold_uncertainty_score":0.0047192574},"labels":[],"label_agreement":null},{"id":"W30251028","doi":"10.1007/bf03219809","title":"Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes","year":2005,"lang":"fr","type":"article","venue":"Annals of Telecommunications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Decoding methods; Algorithm; Low-density parity-check code; Computer science; Convergence (economics); Invariant (physics); Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.08025754142665603,"score_gpt":0.34769038030716665,"score_spread":0.2674328388805106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30251028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39890778,0.00028596248,0.58009255,0.0002725205,0.0001479573,0.000056021097,0.00019054249,0.0008381064,0.019208571],"genre_scores_gemma":[0.94751114,0.00012379505,0.04586697,0.000096364805,0.000048512786,0.000045380286,0.00013162667,0.000084928986,0.0060913176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939454,0.00020669596,0.000025763191,0.000081516715,0.00019498695,0.00009649737],"domain_scores_gemma":[0.9981785,0.0010173954,0.00014060443,0.00032181205,0.0002674501,0.00007420732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075200154,0.0003697105,0.000531997,0.00057805015,0.00048171397,0.0010859501,0.0008771427,0.00075930543,0.001870805],"category_scores_gemma":[0.0026557434,0.00021582858,0.0004698645,0.0005297571,0.00097173534,0.0008588908,0.00081306364,0.0006635044,0.00040090657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013308661,0.00014995493,0.0035061743,0.00017960969,0.00015136355,0.0006677203,0.0005205761,0.1986306,0.08654402,0.6277009,0.0024332744,0.078184895],"study_design_scores_gemma":[0.00004189363,0.00008907899,0.0006163405,0.000012084549,0.000030925086,0.00024726472,0.00003211489,0.8681416,0.025065012,0.10468168,0.0010031695,0.000038880673],"about_ca_topic_score_codex":0.00059887255,"about_ca_topic_score_gemma":0.0010613555,"teacher_disagreement_score":0.001870805,"about_ca_system_score_codex":0.0005324868,"about_ca_system_score_gemma":0.0005867704,"threshold_uncertainty_score":0.0062584877},"labels":[],"label_agreement":null},{"id":"W3025756901","doi":"10.1109/tcomm.2020.3039856","title":"Noisy Density Evolution With Asymmetric Deviation Models","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Low-density parity-check code; Code word; Large deviations theory; Decoding methods; Algorithm; Belief propagation; Range (aeronautics); Computer science; Code (set theory); Mathematics; Statistics","score_opus":0.06863529664891711,"score_gpt":0.2877480401966405,"score_spread":0.21911274354772342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025756901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25877848,0.00042900658,0.73269343,0.00034392052,0.0000552642,0.00003348639,0.00009173868,0.00023071989,0.007343964],"genre_scores_gemma":[0.98099476,0.00018930348,0.016912106,0.00005838578,0.000023188803,0.00002426347,0.000058469246,0.00003098123,0.0017086152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918705,0.0003212843,0.000030127125,0.00009549868,0.00029424476,0.00007181234],"domain_scores_gemma":[0.99814963,0.0010967238,0.00025636543,0.0002530809,0.00018375769,0.000060477345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008119847,0.0005736355,0.0006817244,0.00041646766,0.00035827985,0.00080958265,0.000933819,0.00096852944,0.00055147667],"category_scores_gemma":[0.0047455463,0.00029753125,0.00046533725,0.00041293254,0.0012798992,0.0015215316,0.0008554315,0.0009771223,0.0001622287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007721048,0.000028321032,0.001336039,0.00004613976,0.000033219156,0.00020286169,0.00007560656,0.8897967,0.006779707,0.096345216,0.00022748004,0.0050515244],"study_design_scores_gemma":[0.0000023948505,0.000008101428,0.00008563895,0.000002108894,0.0000031357708,0.000025690779,0.0000035414128,0.9917663,0.0012142018,0.0067942753,0.00008918785,0.0000054660604],"about_ca_topic_score_codex":0.0016311652,"about_ca_topic_score_gemma":0.0010130135,"teacher_disagreement_score":0.0016311652,"about_ca_system_score_codex":0.0009861623,"about_ca_system_score_gemma":0.00055464933,"threshold_uncertainty_score":0.0071551204},"labels":[],"label_agreement":null},{"id":"W3029660360","doi":"10.1109/tcomm.2020.2997400","title":"Design and Analysis of Online Fountain Codes for Intermediate Performance","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Fountain code; Overhead (engineering); Fountain; Computer science; Luby transform code; Tornado code; Online codes; Raptor code; Erasure; Decoding methods; Real-time computing; Algorithm; Block code; Hamming code; Operating system","score_opus":0.07554776408683453,"score_gpt":0.32196956672403737,"score_spread":0.24642180263720284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029660360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019521266,0.00083523314,0.97443116,0.0002204845,0.00005634413,0.00008341,0.00006314722,0.00042469657,0.004364193],"genre_scores_gemma":[0.73902476,0.0009889228,0.25564548,0.00023020164,0.0000883121,0.00024650252,0.0001274956,0.00012116853,0.0035271402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852836,0.00035251348,0.000054271743,0.0001711575,0.00064125616,0.0002523956],"domain_scores_gemma":[0.99601763,0.0016664698,0.0005077468,0.0005255678,0.00113267,0.00014989142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208752,0.0012236463,0.0006273429,0.0010953168,0.000776276,0.0011295263,0.0010704105,0.00081159244,0.001964566],"category_scores_gemma":[0.00583698,0.00036638536,0.0004355465,0.0010906555,0.0012822218,0.001203893,0.0011702597,0.0012478877,0.0005089675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041474449,0.00012273868,0.0018024247,0.00033391477,0.00007547474,0.0003852857,0.00042727235,0.6136224,0.041159388,0.17855132,0.0048331623,0.15827194],"study_design_scores_gemma":[0.000014925272,0.00010607355,0.00017549722,0.000039458435,0.000014977961,0.00020208894,0.000034134035,0.9703106,0.009244399,0.017232765,0.0025940903,0.000030963896],"about_ca_topic_score_codex":0.004017867,"about_ca_topic_score_gemma":0.0041818726,"teacher_disagreement_score":0.004017867,"about_ca_system_score_codex":0.0018416467,"about_ca_system_score_gemma":0.0027531767,"threshold_uncertainty_score":0.013362169},"labels":[],"label_agreement":null},{"id":"W3034259722","doi":"10.1109/fccm48280.2020.00060","title":"Rotary Register File: A Micro-Architectural Primitive on FPGA","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register file; Field-programmable gate array; Parallel computing; Multiplexer; Simple (philosophy); Code (set theory); Computer architecture; Parallelism (grammar); Computer hardware; Overlay; Embedded system; Multiplexing; Instruction set; Programming language","score_opus":0.030615251034089814,"score_gpt":0.24898380185493518,"score_spread":0.21836855082084536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034259722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10000827,0.0025006896,0.852195,0.0007146802,0.00045750348,0.00024300863,0.00074177544,0.014968436,0.028170627],"genre_scores_gemma":[0.6335533,0.00088591164,0.3522995,0.0003725023,0.00015939286,0.00018211102,0.0004896105,0.0005072219,0.0115504395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966943,0.000045517467,0.000031121373,0.000062396706,0.0001298314,0.00006182074],"domain_scores_gemma":[0.99935085,0.00014120628,0.00005728628,0.00034224527,0.0000757898,0.0000325989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029921898,0.00039962985,0.00034135606,0.00070576736,0.00046550517,0.0008640107,0.0014129841,0.0004470124,0.0050189253],"category_scores_gemma":[0.0010490962,0.00020522652,0.0003250306,0.0007013832,0.00065683,0.0015589924,0.0006910553,0.00068064546,0.0014197471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013863663,0.0000901201,0.0023094642,0.00061225647,0.000062800675,0.00072355923,0.0003436654,0.026241783,0.19189946,0.20561741,0.022690415,0.54802275],"study_design_scores_gemma":[0.00033078232,0.0015258498,0.0024398232,0.00024803812,0.00017530043,0.0032988938,0.00020594189,0.20655353,0.3874501,0.045067836,0.3524469,0.00025696206],"about_ca_topic_score_codex":0.00088465307,"about_ca_topic_score_gemma":0.0017545325,"teacher_disagreement_score":0.0050189253,"about_ca_system_score_codex":0.00048231683,"about_ca_system_score_gemma":0.0005956633,"threshold_uncertainty_score":0.016789973},"labels":[],"label_agreement":null},{"id":"W3034663452","doi":"10.1109/tcomm.2020.3001647","title":"Joint Component Design for the JSCC System Based on DP-LDPC Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Source code; Coding (social sciences); Algorithm; Connection (principal bundle); Mathematics; Statistics; Programming language","score_opus":0.14220246899759165,"score_gpt":0.2992184717571124,"score_spread":0.15701600275952077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034663452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01606452,0.00018280659,0.9731674,0.00017068691,0.000097091644,0.00017307531,0.00011570167,0.0022219415,0.0078068026],"genre_scores_gemma":[0.66249806,0.00021733578,0.3248237,0.00019023806,0.00007803699,0.0005352676,0.00045678535,0.00031695838,0.010883581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00018930445,0.000046148052,0.00016727073,0.00031968398,0.000094341995],"domain_scores_gemma":[0.99920434,0.00009674298,0.0000636887,0.000112580565,0.00047279274,0.00004990428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057992997,0.0006616814,0.0005104632,0.00066231104,0.0008607985,0.001128582,0.00083328673,0.00062251434,0.005960809],"category_scores_gemma":[0.001317838,0.00026687782,0.00040283415,0.00056931394,0.0004939326,0.0007018158,0.0007184555,0.00071868766,0.0019510903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013053139,0.0002326613,0.0021612968,0.00049335306,0.00015006063,0.00041965392,0.00055946625,0.3291422,0.13219377,0.1321228,0.020267125,0.38095227],"study_design_scores_gemma":[0.00008323767,0.00040114514,0.0006939772,0.000034914818,0.00009970039,0.00021461741,0.000059670587,0.9215594,0.044471152,0.008629975,0.023693655,0.000058614747],"about_ca_topic_score_codex":0.005064189,"about_ca_topic_score_gemma":0.006110887,"teacher_disagreement_score":0.005960809,"about_ca_system_score_codex":0.0011497309,"about_ca_system_score_gemma":0.0017169906,"threshold_uncertainty_score":0.019940913},"labels":[],"label_agreement":null},{"id":"W3036204603","doi":"10.23919/date48585.2020.9116562","title":"Dynamic Stochastic Computing for Digital Signal Processing Applications","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stochastic computing; ENCODE; Computer science; Binary number; Energy (signal processing); Pseudorandom binary sequence; Digital signal processing; Stochastic process; Algorithm; Signal processing; Encoding (memory); Computer hardware; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.020910357777742927,"score_gpt":0.28190564124631023,"score_spread":0.2609952834685673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036204603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012427493,0.003953187,0.96110576,0.00084262906,0.00025935203,0.000063289786,0.00011278827,0.0012967194,0.019938778],"genre_scores_gemma":[0.6006584,0.0076539,0.3755542,0.00060654094,0.00036274703,0.00017500561,0.00030208385,0.00021330643,0.01447375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977106,0.00003642424,0.0000112200705,0.000031353306,0.00012860287,0.000021362082],"domain_scores_gemma":[0.9997576,0.00011087052,0.000020790752,0.000031702228,0.00006428313,0.0000148333065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024350807,0.0004058768,0.00026979818,0.00035755747,0.00029591395,0.00079692545,0.00043412304,0.00045742365,0.005037151],"category_scores_gemma":[0.0010009902,0.00014728564,0.00020209127,0.000723937,0.0003661652,0.0006399507,0.00050366216,0.0009583616,0.001192267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018199121,0.000099523444,0.00070580834,0.0004812945,0.000036303085,0.00023257815,0.00010931752,0.123076506,0.087726116,0.27683467,0.014323756,0.49619213],"study_design_scores_gemma":[0.000019538564,0.00016342428,0.00038271825,0.0001187559,0.000021268948,0.0003700994,0.00004251233,0.80874443,0.027273856,0.09121201,0.071622156,0.00002927868],"about_ca_topic_score_codex":0.0005856326,"about_ca_topic_score_gemma":0.0009999679,"teacher_disagreement_score":0.005037151,"about_ca_system_score_codex":0.0004655021,"about_ca_system_score_gemma":0.0005890819,"threshold_uncertainty_score":0.016850948},"labels":[],"label_agreement":null},{"id":"W3036655972","doi":"10.1109/wcnc45663.2020.9120500","title":"On the Construction of G<sub>N</sub>-coset Codes for Parallel Decoding","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Decoding methods; Coset; Computer science; Encoder; List decoding; Algorithm; Parallel computing; Theoretical computer science; Concatenated error correction code; Mathematics; Discrete mathematics; Block code","score_opus":0.03734309399022484,"score_gpt":0.26236127508852225,"score_spread":0.2250181810982974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036655972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011172987,0.00015813473,0.98440045,0.00009241872,0.000055165212,0.0000729219,0.000059637125,0.00028434137,0.0037039018],"genre_scores_gemma":[0.17234586,0.00069619657,0.8201446,0.00022276855,0.00007409826,0.00017197401,0.00034892574,0.00014580275,0.0058496757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993699,0.00014939466,0.00003387503,0.00013901044,0.00024445678,0.00006344062],"domain_scores_gemma":[0.9989354,0.0003707748,0.000090826405,0.00025379032,0.00030440374,0.00004474934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079081,0.00090881344,0.0005228459,0.0010421388,0.00069923524,0.0006139088,0.00083237526,0.0006324403,0.0021093928],"category_scores_gemma":[0.0021417283,0.00029750116,0.0006467106,0.0013369119,0.0009930889,0.0011462725,0.001077845,0.0010381838,0.0010639592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039799788,0.00013787008,0.0015485173,0.00038951862,0.00008699247,0.00047710148,0.00038998012,0.2253406,0.05578332,0.38259926,0.0046041976,0.3282447],"study_design_scores_gemma":[0.00006660364,0.00020954118,0.00030137232,0.000051550072,0.000051577514,0.0007380846,0.00006497043,0.8425973,0.055365838,0.08247334,0.017997501,0.000082367515],"about_ca_topic_score_codex":0.0026564025,"about_ca_topic_score_gemma":0.0033875627,"teacher_disagreement_score":0.0026564025,"about_ca_system_score_codex":0.00058650144,"about_ca_system_score_gemma":0.0016508648,"threshold_uncertainty_score":0.007056594},"labels":[],"label_agreement":null},{"id":"W3045568928","doi":"10.1109/icc40277.2020.9149099","title":"Fast Thresholded SC-Flip Decoding of Polar Codes","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Sequential decoding; Algorithm; List decoding; Code (set theory); Polar code; Error detection and correction; Berlekamp–Welch algorithm; Set (abstract data type); Concatenated error correction code; Block code","score_opus":0.038613945051818886,"score_gpt":0.27017132260242743,"score_spread":0.23155737755060854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045568928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0859616,0.0003782178,0.90262544,0.00015311388,0.00006327927,0.00006643879,0.00018857807,0.00090012164,0.009663119],"genre_scores_gemma":[0.72116816,0.000446719,0.2741205,0.0000910191,0.000025091005,0.00006442125,0.00029913112,0.00009079889,0.0036941748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996724,0.000050170125,0.000024689713,0.000041547977,0.00016105197,0.000050199127],"domain_scores_gemma":[0.9991722,0.00022313888,0.00006872981,0.0001425267,0.00037105547,0.000022370916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000319843,0.00039833458,0.00032615117,0.000611771,0.00040029173,0.00071520585,0.00036892132,0.00048225152,0.0017652335],"category_scores_gemma":[0.0015422461,0.00014700853,0.00025911673,0.000540576,0.0005344959,0.00065526937,0.00048128166,0.00044305605,0.0005581678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005792457,0.00006339999,0.00282548,0.000349476,0.0000529028,0.00053884904,0.00029432253,0.33014756,0.1571484,0.14463785,0.0038409967,0.35952148],"study_design_scores_gemma":[0.000025240746,0.00008425345,0.0002735125,0.000034046243,0.000009070279,0.00023568135,0.000037068636,0.8555464,0.12707686,0.012912839,0.0037403775,0.000024592238],"about_ca_topic_score_codex":0.0028653108,"about_ca_topic_score_gemma":0.003241807,"teacher_disagreement_score":0.0028653108,"about_ca_system_score_codex":0.00050123996,"about_ca_system_score_gemma":0.0013934816,"threshold_uncertainty_score":0.0059052706},"labels":[],"label_agreement":null},{"id":"W3046030874","doi":"10.48550/arxiv.2007.15647","title":"Fast Thresholded SC-Flip Decoding of Polar Codes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Sequential decoding; Algorithm; List decoding; Code (set theory); Polar code; Error detection and correction; Set (abstract data type); Berlekamp–Welch algorithm; Soft-decision decoder; Concatenated error correction code; Block code","score_opus":0.10715636314802574,"score_gpt":0.2140341889019091,"score_spread":0.10687782575388335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046030874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08147761,0.0003707616,0.9064252,0.00016553723,0.000067702924,0.00006634925,0.00020505923,0.00089860935,0.010323109],"genre_scores_gemma":[0.71244633,0.0004444054,0.28226516,0.00010799741,0.00002816585,0.000067518056,0.00033397763,0.00009396723,0.004212434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996401,0.00005616056,0.000025872898,0.000045446992,0.00017655508,0.000055764765],"domain_scores_gemma":[0.99919206,0.00021863771,0.00006668385,0.00013705675,0.0003627833,0.000022768823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221876,0.00042798297,0.00034055838,0.00059257523,0.00040648723,0.00074041705,0.0003738799,0.0004999483,0.0019568345],"category_scores_gemma":[0.001591538,0.00015163953,0.00027213048,0.0005408291,0.0005312959,0.00066171883,0.0005182395,0.0004730438,0.0006158506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006169927,0.00006558824,0.0027054532,0.0003256454,0.000052838663,0.0005067636,0.0002767024,0.3511309,0.1379162,0.1554043,0.004140032,0.3468585],"study_design_scores_gemma":[0.00002412028,0.0000762693,0.00024324775,0.000030948555,0.000008694379,0.00020974869,0.00003492199,0.8828524,0.100504175,0.012487032,0.003504995,0.000023504239],"about_ca_topic_score_codex":0.003083173,"about_ca_topic_score_gemma":0.0033767666,"teacher_disagreement_score":0.003083173,"about_ca_system_score_codex":0.000531181,"about_ca_system_score_gemma":0.0014545601,"threshold_uncertainty_score":0.0065461993},"labels":[],"label_agreement":null},{"id":"W3048445540","doi":"","title":"Energy-Efficient protograph-based LDPC codes","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Low-density parity-check code; Computer science; Energy (signal processing); Decoding methods; Error floor; Algorithm; Mathematics; Statistics","score_opus":0.014054208363790706,"score_gpt":0.23478394855882387,"score_spread":0.22072974019503316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048445540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24519575,0.0015902875,0.7027397,0.0010815192,0.0001523825,0.000109855224,0.0016169446,0.001741954,0.045771707],"genre_scores_gemma":[0.8657756,0.0010613383,0.10349125,0.00020744128,0.0000492642,0.000093312265,0.000812054,0.00025637817,0.028253376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000051205443,0.000006530867,0.000026181879,0.000102923004,0.000030704534],"domain_scores_gemma":[0.99933124,0.00030888955,0.0000461324,0.00012991393,0.00014973035,0.000034174645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017064679,0.0003201093,0.00029700864,0.00059709605,0.00034996585,0.0005815756,0.00041984415,0.0005407363,0.00424341],"category_scores_gemma":[0.0009878362,0.00015257807,0.00015054831,0.0008971321,0.00038307096,0.00046342117,0.0005575688,0.0005377082,0.0013737829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008970436,0.00011998996,0.0011847974,0.00052185555,0.000049570124,0.00030480974,0.0003093778,0.39119825,0.14095788,0.2738528,0.008480815,0.18212283],"study_design_scores_gemma":[0.000065971646,0.0001282569,0.00093360327,0.00006109922,0.00002573702,0.00029288692,0.000049535654,0.81261533,0.0665812,0.10291999,0.016284568,0.00004175173],"about_ca_topic_score_codex":0.0009928775,"about_ca_topic_score_gemma":0.0026182898,"teacher_disagreement_score":0.00424341,"about_ca_system_score_codex":0.00071270746,"about_ca_system_score_gemma":0.0007575824,"threshold_uncertainty_score":0.014195621},"labels":[],"label_agreement":null},{"id":"W3049056399","doi":"10.1109/tcomm.2020.3016648","title":"A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fast Fourier transform; Computer science; Computational complexity theory; Coding (social sciences); Decoding methods; Distributed algorithm; Distributed computing; Node (physics); Computation; Distributed data store; Parallel computing; Computer engineering; Algorithm; Mathematics; Engineering","score_opus":0.08301009275867412,"score_gpt":0.31403233649428813,"score_spread":0.23102224373561403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049056399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054750703,0.00006982669,0.99220943,0.00007908168,0.000026837737,0.000018727273,0.000013505663,0.00015921067,0.001948327],"genre_scores_gemma":[0.30925575,0.00018417007,0.68452984,0.00009432511,0.00007991752,0.00013979075,0.000068309106,0.00006944639,0.0055784266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981946,0.00003671061,0.000006374185,0.0000249405,0.000090492635,0.000022122753],"domain_scores_gemma":[0.99959177,0.00018209238,0.000031483014,0.0000734696,0.00009702798,0.00002419653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047068,0.00042331134,0.00036030792,0.00030295897,0.00036817684,0.0004226384,0.00077793514,0.00073977595,0.0028927622],"category_scores_gemma":[0.0014513016,0.00014840299,0.0002611766,0.00044162324,0.00047349153,0.00079063105,0.000646584,0.0008478784,0.0007237404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016074702,0.00008999951,0.00038966627,0.00013575374,0.000026581181,0.00024896592,0.00017197368,0.65406334,0.030026414,0.120031,0.004917409,0.18973821],"study_design_scores_gemma":[0.000016286838,0.00002895529,0.000029521678,0.0000059939935,0.0000035083028,0.000048838552,0.0000101655905,0.9887871,0.0020493164,0.0075996723,0.0014161828,0.0000044309995],"about_ca_topic_score_codex":0.0009897504,"about_ca_topic_score_gemma":0.0020167602,"teacher_disagreement_score":0.0028927622,"about_ca_system_score_codex":0.00042880443,"about_ca_system_score_gemma":0.00083026505,"threshold_uncertainty_score":0.009677231},"labels":[],"label_agreement":null},{"id":"W3053432656","doi":"10.1109/tit.2020.3017127","title":"On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Tanner graph; Discrete mathematics; Degree (music); Low-density parity-check code; Girth (graph theory); Time complexity; Complete bipartite graph; Graph; Algorithm; Decoding methods","score_opus":0.018327880795423034,"score_gpt":0.24767533766889085,"score_spread":0.22934745687346783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3053432656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18502772,0.0006505769,0.80434513,0.0010380531,0.000057719604,0.00033934438,0.00042051118,0.0009445166,0.0071764537],"genre_scores_gemma":[0.48981768,0.0013711485,0.5004532,0.00042660552,0.00012672572,0.0004954918,0.0016020202,0.00026705343,0.005440074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875414,0.00041734456,0.000054430202,0.00033867286,0.00026766123,0.00016772239],"domain_scores_gemma":[0.9920425,0.0059271688,0.0007359616,0.0007802511,0.00030863693,0.00020545599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489725,0.0008685481,0.00091145793,0.0011167023,0.0010144202,0.0013046657,0.0010213986,0.0011252477,0.00303869],"category_scores_gemma":[0.008750354,0.00063135626,0.00075538474,0.0016511903,0.0020071007,0.003512181,0.0017041496,0.0012895862,0.00093451503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084718113,0.00058691367,0.006310181,0.0011700848,0.00016315343,0.00065973593,0.00080932083,0.43809178,0.06338632,0.18981239,0.008419032,0.2897439],"study_design_scores_gemma":[0.00017085568,0.00037388914,0.0018269728,0.00008876303,0.00005719135,0.00080455415,0.0002758698,0.7259893,0.017233454,0.24649827,0.0066265324,0.00005437298],"about_ca_topic_score_codex":0.0013928422,"about_ca_topic_score_gemma":0.0018856846,"teacher_disagreement_score":0.00303869,"about_ca_system_score_codex":0.0007257423,"about_ca_system_score_gemma":0.0013322523,"threshold_uncertainty_score":0.010165453},"labels":[],"label_agreement":null},{"id":"W3081212249","doi":"10.1109/isit44484.2020.9174259","title":"A Functional Construction of Codes for Multiple Access and Broadcast Channels","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Block code; Computer science; Code word; Block (permutation group theory); Linear code; Concatenated error correction code; Raptor code; Turbo code; Algorithm; Theoretical computer science; Mathematics; Decoding methods; Combinatorics","score_opus":0.06783062376607543,"score_gpt":0.28959453189885237,"score_spread":0.22176390813277694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081212249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008760151,0.00020759614,0.98087215,0.00020299481,0.00012130763,0.00008015965,0.00011486096,0.00020572598,0.0094351],"genre_scores_gemma":[0.39752555,0.00107868,0.58338964,0.0004403271,0.00031008784,0.00068511086,0.00072590675,0.00037444598,0.015470344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998831,0.0003342537,0.000048394268,0.00013795347,0.00050810986,0.0001403969],"domain_scores_gemma":[0.9977036,0.0009159939,0.00014454665,0.0004071641,0.00067764195,0.00015106391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299987,0.000917741,0.0004135151,0.0014510556,0.0009906192,0.0011286293,0.0012318052,0.0010961588,0.0025263762],"category_scores_gemma":[0.005400022,0.00044754575,0.0008530355,0.00092880474,0.002035742,0.0012647326,0.0019611118,0.0021787798,0.0010479854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025575235,0.000016704806,0.00023038486,0.00006967641,0.0000093020935,0.000082860926,0.00009311853,0.0210422,0.002875331,0.9491667,0.0013490467,0.025039084],"study_design_scores_gemma":[0.000028386647,0.0001778677,0.00035291706,0.00015369302,0.000030585696,0.00055338955,0.00006641146,0.36181727,0.010870803,0.59538245,0.030491432,0.00007475784],"about_ca_topic_score_codex":0.0014391334,"about_ca_topic_score_gemma":0.001360159,"teacher_disagreement_score":0.0025263762,"about_ca_system_score_codex":0.0014353769,"about_ca_system_score_gemma":0.002128581,"threshold_uncertainty_score":0.010414481},"labels":[],"label_agreement":null},{"id":"W3082322395","doi":"10.1109/les.2020.3021144","title":"High-Speed Architecture for Successive Cancellation Decoder With Split-g Node Block","year":2020,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Precomputation; Computer science; Decoding methods; Adder; Soft-decision decoder; Parallel computing; Multiplexer; Latency (audio); Algorithm; Throughput; Computer hardware; Multiplexing; Telecommunications; Computation; Wireless","score_opus":0.01724990581608459,"score_gpt":0.241312903640669,"score_spread":0.22406299782458441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082322395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19836819,0.0016248284,0.7679713,0.00046924927,0.00022440421,0.00038737495,0.0005520698,0.0077909622,0.022611646],"genre_scores_gemma":[0.66994977,0.0005367625,0.31035113,0.00033475863,0.00007229059,0.00018343015,0.00117881,0.0000957293,0.017297292],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988544,0.000013259022,0.000008415378,0.000023351718,0.000049262355,0.00002025656],"domain_scores_gemma":[0.99987054,0.000021882694,0.000013758861,0.000019120094,0.000066153734,0.000008558916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011234053,0.00035400427,0.00023654885,0.00060113653,0.0003874667,0.0004026915,0.0007778273,0.00041374227,0.0045014857],"category_scores_gemma":[0.000234974,0.000156706,0.00018193362,0.00051656,0.00014979998,0.0005772298,0.0003001069,0.0002933155,0.0017077154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092883845,0.00022752168,0.0029784173,0.00039306076,0.00012491153,0.00060058426,0.0002548178,0.04278681,0.5411077,0.020755138,0.013291204,0.376551],"study_design_scores_gemma":[0.00023493243,0.0013596113,0.003618737,0.00006540602,0.00013216361,0.0015865692,0.00007844509,0.6257047,0.3172399,0.005097746,0.044791568,0.000090266076],"about_ca_topic_score_codex":0.0042801164,"about_ca_topic_score_gemma":0.008845186,"teacher_disagreement_score":0.0045014857,"about_ca_system_score_codex":0.0005523736,"about_ca_system_score_gemma":0.0011108319,"threshold_uncertainty_score":0.015058994},"labels":[],"label_agreement":null},{"id":"W3083082078","doi":"10.1007/s12243-020-00804-0","title":"Energy optimization of quantized min-sum decoders for protograph-based LDPC codes","year":2020,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Energy consumption; Energy (signal processing); Low-density parity-check code; Computer science; Mathematical optimization; Frame (networking); Algorithm; Decoding methods; Optimization problem; Mathematics; Statistics; Telecommunications; Engineering; Electrical engineering","score_opus":0.12004088628110868,"score_gpt":0.3560184650241757,"score_spread":0.23597757874306705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083082078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07548097,0.00050928403,0.9129595,0.000558269,0.00005493039,0.000048465452,0.0002978011,0.0004010055,0.009689834],"genre_scores_gemma":[0.8413058,0.0003908569,0.14873978,0.00019137794,0.00003822022,0.00007264954,0.00028915098,0.00014043339,0.008831792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995028,0.00018094684,0.00001996418,0.00006445714,0.00016477078,0.00006700635],"domain_scores_gemma":[0.9991912,0.0005559713,0.000040499144,0.000051508658,0.00013538123,0.000025329558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063994754,0.00062178116,0.00076894154,0.0003441566,0.00035265792,0.0011684096,0.0008051893,0.000861755,0.003762324],"category_scores_gemma":[0.0022075337,0.00034950406,0.00025979205,0.0006305051,0.0006957561,0.00082638673,0.0010039964,0.0007365858,0.00048366783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029336434,0.00005361288,0.00035618452,0.00012388229,0.000041575346,0.000068944966,0.000104601575,0.90189934,0.010062699,0.043576848,0.0013543565,0.042064644],"study_design_scores_gemma":[0.000011984488,0.000027677206,0.00006702444,0.0000095005125,0.0000060792495,0.000017852033,0.000014534447,0.9847936,0.002821744,0.011924051,0.00029846464,0.000007442104],"about_ca_topic_score_codex":0.0024519723,"about_ca_topic_score_gemma":0.0051106466,"teacher_disagreement_score":0.003762324,"about_ca_system_score_codex":0.001254693,"about_ca_system_score_gemma":0.0012109287,"threshold_uncertainty_score":0.012586236},"labels":[],"label_agreement":null},{"id":"W3086686844","doi":"10.1109/tsp.2020.3023582","title":"Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Logarithm; Algorithm; Computational complexity theory; Approximation algorithm; Mathematics","score_opus":0.03451881863408388,"score_gpt":0.3425130294563235,"score_spread":0.3079942108222396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086686844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011283217,0.0002591772,0.9778986,0.0001734682,0.000046050754,0.00018224512,0.0002056366,0.0026035395,0.007348038],"genre_scores_gemma":[0.19414908,0.00046799393,0.7963493,0.00016658996,0.000042909123,0.0002944954,0.0008024243,0.0001610404,0.0075661205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997198,0.000030844334,0.000020320766,0.00004347264,0.00014549456,0.000039986513],"domain_scores_gemma":[0.9996264,0.00007435487,0.000024359862,0.000066690634,0.000191837,0.000016323742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026402128,0.0006252567,0.00036489536,0.0007150866,0.00049584283,0.00080619083,0.0008114494,0.0005787252,0.008348504],"category_scores_gemma":[0.0010300104,0.000267918,0.00026715227,0.0007422291,0.00041383848,0.00082427514,0.0006405147,0.0006805235,0.0035171523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004903814,0.000101508405,0.0016544913,0.00037271646,0.000042027525,0.00029889875,0.0002560254,0.12861322,0.07906916,0.067221664,0.013857622,0.70802224],"study_design_scores_gemma":[0.00015686678,0.00019929542,0.00042760125,0.00006950944,0.00002654772,0.0007942994,0.00010533808,0.83806676,0.11419986,0.012643041,0.03325211,0.000058809223],"about_ca_topic_score_codex":0.003901088,"about_ca_topic_score_gemma":0.00659498,"teacher_disagreement_score":0.008348504,"about_ca_system_score_codex":0.0007467417,"about_ca_system_score_gemma":0.0020564299,"threshold_uncertainty_score":0.027928472},"labels":[],"label_agreement":null},{"id":"W3086990738","doi":"10.1109/lcomm.2020.3023074","title":"Reliable Broadcast Based on Online Fountain Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories; University of Alberta","funders":"Natural Science Foundation of Beijing Municipality; China Scholarship Council; National Natural Science Foundation of China","keywords":"Fountain code; Computer science; Fountain; Decoding methods; Raptor code; Luby transform code; Scheme (mathematics); Code (set theory); Wireless; Theoretical computer science; Algorithm; Computer network; Telecommunications; Block code; Concatenated error correction code; Mathematics","score_opus":0.062511879357247,"score_gpt":0.3026936390537778,"score_spread":0.24018175969653077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086990738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11987982,0.0011539944,0.87300897,0.00027262422,0.00007921471,0.00005241938,0.00005434947,0.00029532664,0.005203264],"genre_scores_gemma":[0.96753985,0.00037118583,0.029892696,0.0000610835,0.000044897468,0.00003962966,0.00002446622,0.000025379823,0.0020009056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00028423438,0.000028410306,0.00009423695,0.00037531788,0.00020046505],"domain_scores_gemma":[0.9967,0.001817279,0.00045083516,0.0004263214,0.00052768027,0.00007789863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083490607,0.0005051729,0.00060308166,0.00071453786,0.0005236664,0.00075100677,0.0008830291,0.00090285344,0.00089717266],"category_scores_gemma":[0.0049883295,0.00020850681,0.0003416722,0.0007859157,0.0013302439,0.001551689,0.0007931953,0.0009083607,0.00021930694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053454645,0.00007581755,0.0014738721,0.00022522842,0.00007999106,0.00050755445,0.00065798196,0.68012357,0.035216726,0.22686021,0.0017156721,0.05252881],"study_design_scores_gemma":[0.00001739072,0.00006979725,0.00015282123,0.000013244073,0.000012165992,0.00012629312,0.00003506518,0.9770921,0.0044705695,0.017125815,0.0008643285,0.000020485842],"about_ca_topic_score_codex":0.0037895022,"about_ca_topic_score_gemma":0.002082296,"teacher_disagreement_score":0.0037895022,"about_ca_system_score_codex":0.001214804,"about_ca_system_score_gemma":0.0007445052,"threshold_uncertainty_score":0.008814037},"labels":[],"label_agreement":null},{"id":"W3087095379","doi":"10.48550/arxiv.2009.09277","title":"Construction of Polar Codes with Reinforcement Learning","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Computer science; Code (set theory); Polar code; Algorithm; Sorting; Reinforcement learning; Decoding methods; Polar; Frame (networking); Equivalence (formal languages); Mathematics; Artificial intelligence; Programming language; Telecommunications; Discrete mathematics","score_opus":0.05201346662222839,"score_gpt":0.18702684626323068,"score_spread":0.1350133796410023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087095379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016025594,0.00006117484,0.98080057,0.00009663793,0.000021681197,0.000050062095,0.000028662036,0.00018306523,0.0027325135],"genre_scores_gemma":[0.5743107,0.0003197192,0.41957894,0.00017502252,0.000037837126,0.00026817044,0.00021156317,0.00013152946,0.0049664043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00027180937,0.00002934388,0.000110772744,0.00023034176,0.00008634439],"domain_scores_gemma":[0.9975988,0.0014803861,0.00020150394,0.00022144621,0.000372643,0.00012526731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957398,0.0006627287,0.0005162833,0.0006334547,0.0004046072,0.0006494995,0.00083431165,0.00066274666,0.00241191],"category_scores_gemma":[0.005897713,0.0003498429,0.00044253896,0.00043326273,0.0015858829,0.00097464904,0.0017677997,0.0013723929,0.00055874826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002017734,0.00006997911,0.0009219884,0.00014487361,0.000025233838,0.00016450151,0.00018453803,0.7554161,0.0069109276,0.1580634,0.0014975835,0.07639903],"study_design_scores_gemma":[0.000026896612,0.000051088628,0.000048092515,0.0000127497515,0.0000051256475,0.000039241488,0.000019037629,0.9628229,0.0032021268,0.032600768,0.0011611511,0.000010786492],"about_ca_topic_score_codex":0.0015005291,"about_ca_topic_score_gemma":0.0010489408,"teacher_disagreement_score":0.00241191,"about_ca_system_score_codex":0.000652795,"about_ca_system_score_gemma":0.0014173499,"threshold_uncertainty_score":0.008068621},"labels":[],"label_agreement":null},{"id":"W3089038802","doi":"10.1109/sips50750.2020.9195213","title":"An Early-Stopping Mechanism for DSCF Decoding of Polar Codes","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Performance metric; Metric (unit); Error detection and correction; Early stopping; Latency (audio); Telecommunications","score_opus":0.05672750236226363,"score_gpt":0.3212918024991138,"score_spread":0.2645643001368502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089038802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046495266,0.0002584965,0.9498943,0.00012179493,0.000060222173,0.00009982869,0.00007356836,0.001053586,0.001942855],"genre_scores_gemma":[0.5085196,0.00025751046,0.48804528,0.00013139934,0.00006626793,0.0001270302,0.00020740343,0.00010328427,0.0025421416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888664,0.00022010476,0.000075667806,0.0001210301,0.0005764823,0.00012010942],"domain_scores_gemma":[0.99627364,0.001139457,0.00037329146,0.00080911804,0.0012740364,0.00013055776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012120238,0.0006919483,0.00051922095,0.001357832,0.0006696041,0.00096253573,0.001091829,0.0008295635,0.0010781283],"category_scores_gemma":[0.007180171,0.00023903509,0.00025133198,0.0009798902,0.0008146394,0.0008793536,0.0008911887,0.000784998,0.00041503875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011168114,0.00012652893,0.003577742,0.00019800712,0.00006238175,0.00034109908,0.0003004516,0.1819964,0.1731951,0.04716583,0.00285582,0.5890639],"study_design_scores_gemma":[0.000060429487,0.00031715553,0.0006569065,0.000030850795,0.00001823159,0.0004594093,0.00003536029,0.7929011,0.19176899,0.008763115,0.0049303337,0.000058194502],"about_ca_topic_score_codex":0.0018329996,"about_ca_topic_score_gemma":0.0026520556,"teacher_disagreement_score":0.0018329996,"about_ca_system_score_codex":0.0007511646,"about_ca_system_score_gemma":0.0016135765,"threshold_uncertainty_score":0.0064098835},"labels":[],"label_agreement":null},{"id":"W3089835555","doi":"10.1109/tcomm.2020.3028302","title":"Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Tanner graph; Algorithm; Error floor; Computer science; Block code; Set (abstract data type); Block (permutation group theory); Graph; Decoding methods; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.032120189380703906,"score_gpt":0.2695646230738625,"score_spread":0.23744443369315857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089835555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24736547,0.00029567158,0.74294037,0.00020812442,0.00005744529,0.0001219557,0.00028495103,0.00076066924,0.007965426],"genre_scores_gemma":[0.7643226,0.00025039836,0.23223506,0.00007878653,0.000010788664,0.000096776,0.00025825272,0.00006625854,0.002681129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988365,0.000019796118,0.000005660756,0.000022049062,0.000051988412,0.000016911294],"domain_scores_gemma":[0.9996947,0.00007666532,0.000057944573,0.00005617482,0.00008715458,0.0000274112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013969773,0.00024076035,0.00021972365,0.00033401928,0.0002663567,0.00024716783,0.00034205173,0.00026391455,0.0006130651],"category_scores_gemma":[0.0004941902,0.00015313513,0.0001638961,0.00036526637,0.000441259,0.00023495543,0.0002981841,0.0003382586,0.00019462097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029368995,0.000089488196,0.0024523463,0.00046048439,0.000048239042,0.00059823453,0.00027504473,0.4768437,0.33615422,0.099005066,0.0019353502,0.08184412],"study_design_scores_gemma":[0.000027977261,0.00014571715,0.0006162903,0.000012331821,0.000016363516,0.00028381372,0.000019580904,0.92481536,0.06269501,0.006394374,0.0049497,0.000023472312],"about_ca_topic_score_codex":0.0012975119,"about_ca_topic_score_gemma":0.0020451313,"teacher_disagreement_score":0.0012975119,"about_ca_system_score_codex":0.00051406724,"about_ca_system_score_gemma":0.0008136631,"threshold_uncertainty_score":0.0037297606},"labels":[],"label_agreement":null},{"id":"W3091388654","doi":"10.1109/iscas45731.2020.9180838","title":"A Regression-Based Method to Synthesize Complex Arithmetic Computations on Stochastic Streams","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Stochastic computing; Computer science; Computation; Algorithm; Linear regression; Parallel computing; Theoretical computer science; Machine learning","score_opus":0.07052398923376149,"score_gpt":0.34631785883448435,"score_spread":0.27579386960072283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091388654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092684645,0.00006970513,0.9881386,0.00007091622,0.000029365783,0.00003568433,0.00003545853,0.0008684753,0.0014834267],"genre_scores_gemma":[0.3100854,0.00014367072,0.68582314,0.00010444675,0.000027614413,0.00015637008,0.00014077651,0.00023682126,0.0032817412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996767,0.000054499185,0.000019526058,0.00008366369,0.00014443195,0.00002116851],"domain_scores_gemma":[0.9995505,0.00019672526,0.000060433566,0.000076385055,0.00010261397,0.000013313503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040581066,0.00051060505,0.00030037915,0.0003766465,0.00023924279,0.00035720706,0.000460454,0.00036849195,0.0018133672],"category_scores_gemma":[0.0014876067,0.0002209063,0.00035937395,0.00034480143,0.00039647502,0.00034857236,0.00033257733,0.00073576183,0.0005275918],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012866987,0.00011449092,0.0005662128,0.00022444407,0.000058160498,0.00015942012,0.00017319874,0.41302872,0.28434327,0.044640534,0.0019195677,0.25464335],"study_design_scores_gemma":[0.000010377259,0.000089941015,0.000081240905,0.000010392669,0.000011842501,0.00007544078,0.0000058789465,0.94643,0.047017798,0.0026202588,0.0036346302,0.000012160647],"about_ca_topic_score_codex":0.0010121338,"about_ca_topic_score_gemma":0.001416566,"teacher_disagreement_score":0.0018133672,"about_ca_system_score_codex":0.0003920498,"about_ca_system_score_gemma":0.0006736244,"threshold_uncertainty_score":0.006066382},"labels":[],"label_agreement":null},{"id":"W3098702051","doi":"","title":"4 The ADMM penalized decoder for LDPC codes∗","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Computer science; Forward error correction; Decoding methods; Algorithm; Turbo code; Theoretical computer science; Mathematics","score_opus":0.014098455745762758,"score_gpt":0.28154345622478194,"score_spread":0.2674450004790192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098702051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120887095,0.00020477957,0.9801194,0.0003957212,0.00005871813,0.00005477476,0.00021048638,0.0003531127,0.0065141683],"genre_scores_gemma":[0.34353927,0.00024539605,0.644348,0.00031752142,0.000047000587,0.0002183823,0.00063972786,0.00014418036,0.0105005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994031,0.00026976754,0.000024560259,0.00007373127,0.00018541662,0.000043408916],"domain_scores_gemma":[0.999008,0.0005071556,0.00008306437,0.000118520555,0.00025269078,0.00003065864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914588,0.0006389566,0.00061239436,0.00039613256,0.00039664345,0.00087900134,0.0008056966,0.0013216629,0.0027761634],"category_scores_gemma":[0.003395013,0.00031525653,0.00044484893,0.00058697537,0.00083269057,0.0007149701,0.00079002144,0.0013162068,0.00060796173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000633231,0.00001691915,0.00020112109,0.000049170507,0.0000163542,0.000044734275,0.000020279682,0.9519235,0.0014893106,0.027827729,0.0015403541,0.016807174],"study_design_scores_gemma":[0.0000071678487,0.000014748105,0.000028579641,0.0000048286684,0.0000017779832,0.000012565638,0.0000021149422,0.9923868,0.0010457005,0.005718546,0.0007735654,0.0000035788132],"about_ca_topic_score_codex":0.0037094161,"about_ca_topic_score_gemma":0.0032331515,"teacher_disagreement_score":0.0037094161,"about_ca_system_score_codex":0.0010427431,"about_ca_system_score_gemma":0.0018295263,"threshold_uncertainty_score":0.009287238},"labels":[],"label_agreement":null},{"id":"W3098807857","doi":"","title":"Fast list decoders for polar codes","year":2016,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; List decoding; Concatenated error correction code; Polar code; Error detection and correction; Sequential decoding; Algorithm; Forward error correction; Serial concatenated convolutional codes; Berlekamp–Welch algorithm; Cyclic redundancy check; Theoretical computer science; Block code; Error floor","score_opus":0.01645277043609536,"score_gpt":0.2753505181720378,"score_spread":0.25889774773594243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098807857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013996436,0.00041142837,0.9772273,0.00015319992,0.00010803556,0.00007791059,0.00014233697,0.0027992886,0.0050840657],"genre_scores_gemma":[0.16257879,0.0006825568,0.82535225,0.00020825672,0.000130523,0.00018815164,0.0005950052,0.00031341834,0.009951053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995041,0.00010092162,0.00004351506,0.000056413242,0.00023653438,0.00005855039],"domain_scores_gemma":[0.9980616,0.00081875414,0.00021338342,0.0002493078,0.00060460396,0.00005234135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734944,0.0006741645,0.00038448884,0.0013316269,0.00071592565,0.0013377272,0.00071344303,0.0007333632,0.005025597],"category_scores_gemma":[0.0036766252,0.00027181645,0.00032415325,0.0011078486,0.0005175094,0.001341825,0.0010974606,0.0009091244,0.0033040754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073569943,0.00011845905,0.001470171,0.00039331397,0.000049008806,0.00031705672,0.00038862127,0.10732207,0.08947245,0.1071697,0.01079571,0.6817678],"study_design_scores_gemma":[0.00015429435,0.0003057908,0.0004852317,0.00012231182,0.000045970857,0.00046270806,0.00009842223,0.7596725,0.17061211,0.0395609,0.028392171,0.00008760719],"about_ca_topic_score_codex":0.0015604374,"about_ca_topic_score_gemma":0.0026566037,"teacher_disagreement_score":0.005025597,"about_ca_system_score_codex":0.000705883,"about_ca_system_score_gemma":0.0014055269,"threshold_uncertainty_score":0.016812265},"labels":[],"label_agreement":null},{"id":"W3100814986","doi":"","title":"Coded Sequential Matrix Multiplication For Straggler Mitigation","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Matrix multiplication; Multiplication (music); Parallel computing; Matrix (chemical analysis); Arithmetic; Mathematics; Combinatorics; Chemistry","score_opus":0.03885571071306662,"score_gpt":0.3050603360880518,"score_spread":0.2662046253749851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100814986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014835562,0.00027498216,0.97749627,0.0002517897,0.00015526493,0.000052067928,0.00008393866,0.0019146523,0.0049355687],"genre_scores_gemma":[0.27923152,0.0003116313,0.7013261,0.0003366175,0.00009905838,0.00009908804,0.0001999651,0.00028263047,0.018113371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.0000799796,0.000019484596,0.00006582206,0.00019300605,0.000040362662],"domain_scores_gemma":[0.9989936,0.00027844743,0.000085452666,0.00025753654,0.000347013,0.00003793784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031931378,0.0009861591,0.0003391658,0.00064554246,0.0008027691,0.00064951775,0.0009693307,0.00076970505,0.009358675],"category_scores_gemma":[0.0019395613,0.00023756642,0.00021939205,0.00085060095,0.0004602752,0.0010154374,0.0008176604,0.0009524186,0.0021850856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006801466,0.00016242893,0.000769223,0.00026646687,0.000103103135,0.00029047343,0.00020143096,0.035664555,0.13666436,0.07066926,0.013810492,0.740718],"study_design_scores_gemma":[0.000054085514,0.00032481435,0.00053333875,0.0001103739,0.00006516043,0.00073227164,0.00006385905,0.62723255,0.3080703,0.034713764,0.028040297,0.00005926975],"about_ca_topic_score_codex":0.002304168,"about_ca_topic_score_gemma":0.0070608933,"teacher_disagreement_score":0.009358675,"about_ca_system_score_codex":0.00043913093,"about_ca_system_score_gemma":0.0012918297,"threshold_uncertainty_score":0.031307876},"labels":[],"label_agreement":null},{"id":"W3101863493","doi":"10.1109/lcomm.2021.3069668","title":"On Systematic Polarization-Adjusted Convolutional (PAC) Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Convolutional code; Algorithm; Systematic error; Turbo code; Coding (social sciences); Upper and lower bounds; Code (set theory); Channel code; Polarization (electrochemistry); Theoretical computer science; Decoding methods; Mathematics; Statistics","score_opus":0.05154111491655979,"score_gpt":0.29351126158759155,"score_spread":0.24197014667103176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101863493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17377752,0.00083600206,0.81108713,0.0002939335,0.00006693488,0.000066402965,0.00011393698,0.0003567199,0.013401467],"genre_scores_gemma":[0.8068709,0.0012613038,0.18865421,0.00016096506,0.00005462862,0.00009016698,0.000160927,0.000056294284,0.002690612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990872,0.00025808538,0.000027357444,0.00008169247,0.00043381914,0.00011183078],"domain_scores_gemma":[0.9982369,0.00081064756,0.00024621634,0.00032654722,0.00033961367,0.000040038314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006576737,0.0005700054,0.00028836055,0.00046703967,0.00032576395,0.00047112966,0.00047027585,0.0005486264,0.00054039387],"category_scores_gemma":[0.0033567331,0.00022498067,0.00021015623,0.00076961966,0.001190601,0.000629007,0.00085343193,0.00078919594,0.00021713082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023301289,0.000050514784,0.0019291922,0.00018647112,0.000053430114,0.00039894515,0.00021592877,0.45786452,0.088290155,0.3283642,0.0016986559,0.12071507],"study_design_scores_gemma":[0.000022033353,0.00013149773,0.00069738453,0.00007511926,0.000028057277,0.0003858952,0.000019834812,0.8802977,0.06473377,0.04843684,0.005126779,0.000045027624],"about_ca_topic_score_codex":0.0018426821,"about_ca_topic_score_gemma":0.0020271605,"teacher_disagreement_score":0.0018426821,"about_ca_system_score_codex":0.0006492829,"about_ca_system_score_gemma":0.0010732245,"threshold_uncertainty_score":0.0047109127},"labels":[],"label_agreement":null},{"id":"W3101931308","doi":"","title":"Disjoint LDPC Coding for Gaussian Broadcast Channels","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Coding (social sciences); Algorithm; Channel code; Joint (building); Theoretical computer science; Gaussian; Channel capacity; Channel (broadcasting); Dirty paper coding; Computer network; Mathematics; MIMO; Precoding; Statistics; Engineering","score_opus":0.061673085749255785,"score_gpt":0.31472423865932064,"score_spread":0.25305115291006486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101931308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09203044,0.0005767403,0.8931738,0.00040361093,0.000053053504,0.00006547099,0.00027799213,0.00046372227,0.012955075],"genre_scores_gemma":[0.83018345,0.00047908613,0.16468243,0.000115619194,0.00004286785,0.00017782573,0.00033605928,0.00004641308,0.003936277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993267,0.00024265797,0.000022127122,0.000070982445,0.0002605732,0.00007699577],"domain_scores_gemma":[0.9984458,0.0008668571,0.00015172124,0.00021014205,0.00028431922,0.000041122694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345173,0.00043458553,0.0003279471,0.00063724775,0.000578806,0.00053167256,0.0005680353,0.00055387116,0.0015968265],"category_scores_gemma":[0.0032582222,0.00022344514,0.00017580792,0.000768085,0.0007579113,0.00038169743,0.0008329941,0.00059465674,0.00037747703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050811033,0.00012647358,0.0010189713,0.00023324294,0.00003888358,0.0004993224,0.00035101778,0.4909485,0.035699166,0.3414762,0.0043326127,0.1247676],"study_design_scores_gemma":[0.000057479003,0.00005275837,0.0002241892,0.00003566635,0.000016914966,0.00017109339,0.000022932922,0.895947,0.01678374,0.082275316,0.0043924768,0.00002044376],"about_ca_topic_score_codex":0.0024073517,"about_ca_topic_score_gemma":0.0018923872,"teacher_disagreement_score":0.0024073517,"about_ca_system_score_codex":0.0008629391,"about_ca_system_score_gemma":0.00096043065,"threshold_uncertainty_score":0.0062611103},"labels":[],"label_agreement":null},{"id":"W3102815313","doi":"","title":"Normal factor graphs: a diagrammatic approach to linear algebra","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Diagrammatic reasoning; Pfaffian; Linear algebra; Factor (programming language); Algebra over a field; Simple (philosophy); Conjecture; Computer science; Link (geometry); Encoding (memory); Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Artificial intelligence; Programming language","score_opus":0.03195371281568085,"score_gpt":0.2728715657453747,"score_spread":0.24091785292969384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102815313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009809818,0.0011177092,0.9566317,0.0012675817,0.00041194053,0.000043383072,0.00024926933,0.00075373886,0.029714828],"genre_scores_gemma":[0.47482666,0.0037414616,0.4921632,0.0018344303,0.0013929496,0.00027102474,0.0006490092,0.0007472379,0.02437398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990927,0.00031758877,0.0000480002,0.00021277356,0.00023745434,0.00009142282],"domain_scores_gemma":[0.9988697,0.0005321264,0.0000894948,0.00022589375,0.00020820193,0.00007442326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012229285,0.0007004133,0.0004470477,0.0018864529,0.0011599051,0.0021063746,0.00122539,0.001172087,0.006954335],"category_scores_gemma":[0.00379884,0.0003179083,0.0009280891,0.0016321337,0.004033133,0.0067984206,0.0016908805,0.003045661,0.0017049717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073877172,0.000004381613,0.000043268818,0.00002643124,0.0000022854977,0.000024212492,0.00016457931,0.00083548634,0.00043404338,0.99157214,0.00089324324,0.0059925043],"study_design_scores_gemma":[0.0000026682062,0.000006325448,0.00001966989,0.000010541595,0.0000025614659,0.00003639711,0.000023244858,0.0018374466,0.0002829056,0.98844063,0.009332377,0.0000051240186],"about_ca_topic_score_codex":0.0014192078,"about_ca_topic_score_gemma":0.001065328,"teacher_disagreement_score":0.006954335,"about_ca_system_score_codex":0.001194627,"about_ca_system_score_gemma":0.00066683354,"threshold_uncertainty_score":0.023264587},"labels":[],"label_agreement":null},{"id":"W3103043697","doi":"10.1007/s11265-016-1157-y","title":"Low-Latency Software Polar Decoders","year":2016,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Memory footprint; Software; Rendering (computer graphics); Exploit; Polar; Encoding (memory); Latency (audio); Efficient energy use","score_opus":0.01574898870569315,"score_gpt":0.2521758610143998,"score_spread":0.23642687230870665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103043697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09354854,0.0018316446,0.8743999,0.000634511,0.00045667257,0.00013586122,0.00036925383,0.0078601325,0.020763518],"genre_scores_gemma":[0.6835148,0.001206586,0.2776716,0.00058080215,0.00030327408,0.000098293654,0.0006757444,0.00047001409,0.035478823],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953485,0.000091378795,0.000027995413,0.000059354355,0.00021470345,0.00007175661],"domain_scores_gemma":[0.9985972,0.0005228299,0.000117399184,0.00023061219,0.00047257982,0.00005932775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035899493,0.0006658314,0.00044570485,0.00073716545,0.00051319186,0.0014412071,0.0008157266,0.00058774935,0.011243415],"category_scores_gemma":[0.0021515172,0.0003112407,0.00020349331,0.0007297707,0.0002881168,0.0012700163,0.00087118056,0.0007394507,0.004377101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021928872,0.00019223127,0.003121037,0.00048331913,0.00010259043,0.00044871925,0.00020965045,0.02531139,0.24597661,0.061570056,0.012982,0.6474095],"study_design_scores_gemma":[0.00026793615,0.00077371823,0.0016363083,0.00018231016,0.00015827315,0.0015250926,0.00019371866,0.4893629,0.43031994,0.024329131,0.051146973,0.00010368775],"about_ca_topic_score_codex":0.0012371859,"about_ca_topic_score_gemma":0.004223606,"teacher_disagreement_score":0.011243415,"about_ca_system_score_codex":0.0005151324,"about_ca_system_score_gemma":0.001427793,"threshold_uncertainty_score":0.037612915},"labels":[],"label_agreement":null},{"id":"W3103925037","doi":"","title":"237 Gbit/s unrolled hardware polar decoder","year":2015,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Polar; Polar code; Computer science; Field-programmable gate array; Soft-decision decoder; Throughput; Gigabit; Computer hardware; Architecture; Code (set theory); Parallel computing; Algorithm; Telecommunications; Set (abstract data type); Physics","score_opus":0.025625512892906988,"score_gpt":0.28022186340595884,"score_spread":0.25459635051305185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103925037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25458091,0.0006345204,0.70596534,0.00031525225,0.00027217722,0.00011775533,0.0006399927,0.006645989,0.030827936],"genre_scores_gemma":[0.619591,0.0003528577,0.34667608,0.00018118542,0.00007636063,0.000052435367,0.0008884964,0.00016870456,0.032012917],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990094,0.000007736216,0.000004510343,0.000018511022,0.00005395284,0.00001427755],"domain_scores_gemma":[0.9998851,0.00002779322,0.000013674648,0.000023388819,0.000039546005,0.00001038948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008560285,0.00026586273,0.00017615728,0.00020348051,0.000175034,0.00036905025,0.00045140248,0.00023246641,0.006689014],"category_scores_gemma":[0.0002451686,0.00012039899,0.00010304768,0.00016488328,0.00021859442,0.00046545613,0.00030373028,0.00041690702,0.0016952399],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004302453,0.00007297054,0.00073854614,0.00018882516,0.000021847158,0.00031444817,0.00011212515,0.018049154,0.726779,0.017982792,0.0037726553,0.23153742],"study_design_scores_gemma":[0.0001050972,0.0006135579,0.0015368613,0.000032092565,0.0000371415,0.00076304027,0.000047520698,0.19483444,0.7411966,0.0046472726,0.05613849,0.000047922644],"about_ca_topic_score_codex":0.0010068278,"about_ca_topic_score_gemma":0.002619706,"teacher_disagreement_score":0.006689014,"about_ca_system_score_codex":0.00032296873,"about_ca_system_score_gemma":0.0006957451,"threshold_uncertainty_score":0.022376955},"labels":[],"label_agreement":null},{"id":"W3104878415","doi":"","title":"0 Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Alberta","funders":"","keywords":"Binary symmetric channel; Upper and lower bounds; Binary number; Hamming bound; Sphere packing; Binary code; Channel code; Combinatorics; Mathematics; Coding (social sciences); Channel (broadcasting); Code (set theory); Decoding methods; Algorithm; Discrete mathematics; Computer science; Block code; Linear code; Telecommunications; Mathematical analysis; Geometry; Statistics; Arithmetic","score_opus":0.03493126267689595,"score_gpt":0.29435710585843816,"score_spread":0.2594258431815422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104878415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12878594,0.005496243,0.7822808,0.0032507097,0.0010586428,0.00017409962,0.00089910167,0.0020276154,0.07602684],"genre_scores_gemma":[0.84237504,0.0028784997,0.13608612,0.00093144237,0.0006395068,0.00033840231,0.0007861864,0.0005613126,0.015403539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631554,0.0008008883,0.00016094481,0.00039141884,0.001684725,0.000646535],"domain_scores_gemma":[0.98675364,0.00839915,0.0009327976,0.0017041703,0.0016653261,0.0005448816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627061,0.001714103,0.001753646,0.0018132551,0.0013659507,0.0037462497,0.002126952,0.0018016556,0.009439],"category_scores_gemma":[0.020195214,0.0006171974,0.00072181696,0.0024407047,0.0022052703,0.0055562784,0.0036046803,0.0034422905,0.0029760327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010219405,0.00025013596,0.0010670115,0.0007694402,0.00008848371,0.0004397269,0.00044379066,0.2304766,0.022301646,0.6084362,0.021278841,0.11342617],"study_design_scores_gemma":[0.000057056626,0.0002110259,0.0004037258,0.0001535252,0.00003319639,0.00029939585,0.00008964786,0.55710584,0.020100623,0.41201305,0.009452238,0.000080663114],"about_ca_topic_score_codex":0.0019582158,"about_ca_topic_score_gemma":0.0017593021,"teacher_disagreement_score":0.009439,"about_ca_system_score_codex":0.002737184,"about_ca_system_score_gemma":0.0021091779,"threshold_uncertainty_score":0.031576574},"labels":[],"label_agreement":null},{"id":"W3105529327","doi":"","title":"Hierarchical and High-Girth QC LDPC Codes","year":2013,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Circulant matrix; Block code; Girth (graph theory); Mathematics; Code (set theory); Concatenated error correction code; Linear code; Parity-check matrix; Diagonal; Turbo code; Combinatorial design; Computer science; Discrete mathematics; Algorithm; Decoding methods","score_opus":0.010214750185458343,"score_gpt":0.2349389853764164,"score_spread":0.22472423519095805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105529327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08005246,0.00020779377,0.90589947,0.00016848993,0.000021536332,0.00006765224,0.00014988307,0.00052089157,0.012911891],"genre_scores_gemma":[0.5920209,0.00021128276,0.4014317,0.00014394704,0.00001531133,0.00010412726,0.00017214047,0.000085543696,0.005815021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964285,0.0000730074,0.000014134611,0.000059149985,0.00016682548,0.00004400175],"domain_scores_gemma":[0.9994655,0.00015109002,0.00006171919,0.00015966415,0.00012820227,0.000033781096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003050536,0.00023969372,0.00015053323,0.00027737647,0.00030281398,0.00038332195,0.0005330182,0.00037870306,0.0015957381],"category_scores_gemma":[0.0009413985,0.00016623126,0.00021590249,0.0003797026,0.00057757134,0.00040552585,0.000480794,0.00050812523,0.00037864907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014499555,0.00006240191,0.0018171037,0.00022395723,0.000021406884,0.00029818306,0.00030780543,0.36204365,0.2263573,0.31676984,0.0021536094,0.08979964],"study_design_scores_gemma":[0.00003241992,0.00016330289,0.001454852,0.000027127306,0.000019638563,0.00033888267,0.000054328888,0.823467,0.09126684,0.068410605,0.0147263035,0.00003873568],"about_ca_topic_score_codex":0.0017501385,"about_ca_topic_score_gemma":0.0034900813,"teacher_disagreement_score":0.0017501385,"about_ca_system_score_codex":0.00080461137,"about_ca_system_score_gemma":0.0007759646,"threshold_uncertainty_score":0.0058379173},"labels":[],"label_agreement":null},{"id":"W3108119177","doi":"10.1109/ccece47787.2020.9255673","title":"Turbo Receiver for Polar-Coded OFDM systems with unknown CSI","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Fading; Turbo code; Turbo; Decoding methods; Channel state information; Algorithm; Bit error rate; Turbo equalizer; Radio receiver design; Detector; Electronic engineering; Channel (broadcasting); Telecommunications; Concatenated error correction code; Wireless; Engineering; Block code","score_opus":0.027021587991403324,"score_gpt":0.23941203853554788,"score_spread":0.21239045054414454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108119177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010031446,0.0006138989,0.98611104,0.00016053425,0.000081727296,0.000017857343,0.00002624837,0.00024160076,0.0027157338],"genre_scores_gemma":[0.59551305,0.0018645826,0.39376795,0.00032448437,0.00018554144,0.000068418965,0.00012524417,0.000054238826,0.008096457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994105,0.00019719092,0.000025722407,0.00006544998,0.000244308,0.000056799217],"domain_scores_gemma":[0.9988219,0.0005101468,0.00010106707,0.00011140791,0.00042482137,0.000030550636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739976,0.0004927581,0.00046622992,0.00038244392,0.00043478902,0.00066344184,0.00054368004,0.0009210627,0.0012184543],"category_scores_gemma":[0.002739007,0.00023069953,0.00034580412,0.00047037087,0.00057112216,0.00089196773,0.000511188,0.0008796305,0.000879965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007704849,0.00007407413,0.0024205481,0.00060328154,0.00020572626,0.0011081479,0.00045531374,0.38848868,0.09316667,0.14624123,0.005263971,0.36120182],"study_design_scores_gemma":[0.000023118657,0.00017115216,0.00023587687,0.000034525365,0.00006389503,0.0007545677,0.00003605297,0.95418024,0.03039605,0.007688928,0.006362511,0.00005306043],"about_ca_topic_score_codex":0.00093867665,"about_ca_topic_score_gemma":0.0013123506,"teacher_disagreement_score":0.0012184543,"about_ca_system_score_codex":0.0003522473,"about_ca_system_score_gemma":0.000923889,"threshold_uncertainty_score":0.004093349},"labels":[],"label_agreement":null},{"id":"W3109578553","doi":"10.1109/isit45174.2021.9517887","title":"Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computation; Computer science; Soft-decision decoder; Algorithm; Decoding methods; Cyclic redundancy check; Projection (relational algebra)","score_opus":0.06993549167368075,"score_gpt":0.33168369198599124,"score_spread":0.2617482003123105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109578553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04914351,0.00035848632,0.9462208,0.00009344426,0.000032025786,0.00006765282,0.00008394923,0.0018788222,0.0021212727],"genre_scores_gemma":[0.4559702,0.00023203102,0.5401162,0.00008114399,0.00005501935,0.000103574144,0.0002598639,0.00009175328,0.0030903206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906653,0.00023429556,0.000049410322,0.00013018704,0.00041582255,0.00010376626],"domain_scores_gemma":[0.9990005,0.00033313193,0.00011058442,0.00025548346,0.00025577453,0.00004441585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006142301,0.000713351,0.00072181964,0.0006261536,0.00057395955,0.0006678454,0.00073953526,0.0004452044,0.0012096456],"category_scores_gemma":[0.001520268,0.00029522722,0.0004796871,0.00081058504,0.00042062474,0.00069868204,0.0011175361,0.000811876,0.00055567134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061160116,0.00013288122,0.001675248,0.00020564017,0.00012059577,0.00051792484,0.00026546518,0.28972396,0.118537195,0.0370684,0.0033126299,0.54782844],"study_design_scores_gemma":[0.000021655595,0.00014891262,0.0004568812,0.00001425521,0.000026728647,0.00028930022,0.000017497508,0.93220127,0.057939235,0.006153123,0.0027099235,0.00002117554],"about_ca_topic_score_codex":0.0023591667,"about_ca_topic_score_gemma":0.004205563,"teacher_disagreement_score":0.0023591667,"about_ca_system_score_codex":0.00054532755,"about_ca_system_score_gemma":0.001257656,"threshold_uncertainty_score":0.004690826},"labels":[],"label_agreement":null},{"id":"W3115468775","doi":"10.1109/isit45174.2021.9518153","title":"Parallelism Versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Science Foundation","keywords":"Decoding methods; Latency (audio); Sublinear function; Binary logarithm; Parallel computing; Upper and lower bounds; List decoding; Combinatorics; Computer science; Discrete mathematics; Mathematics; Algorithm; Arithmetic; Block code; Concatenated error correction code; Telecommunications","score_opus":0.04386477951458097,"score_gpt":0.31537168096345036,"score_spread":0.2715069014488694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115468775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24342169,0.0015863138,0.7391394,0.0006613604,0.00011273914,0.00021233206,0.00032520917,0.00093690923,0.013604045],"genre_scores_gemma":[0.9168722,0.001482166,0.07604361,0.00013474537,0.0001387216,0.00018701798,0.0003133424,0.00016129094,0.004666919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975533,0.00046609575,0.00011150574,0.0002782991,0.0010398014,0.0005509177],"domain_scores_gemma":[0.9932231,0.0042363955,0.00063230976,0.00080706534,0.0009330648,0.00016811905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858496,0.0011271025,0.0006274389,0.0006577088,0.0005765131,0.0014274836,0.0008626612,0.0004687166,0.0030992266],"category_scores_gemma":[0.010656853,0.00034265142,0.00030096335,0.001151874,0.0010882008,0.0025073648,0.001258634,0.0008205152,0.0007615166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019646802,0.00014287936,0.0028740293,0.0003384121,0.00006240568,0.0004637866,0.0003524393,0.7253409,0.0722425,0.09867365,0.0019101939,0.09563414],"study_design_scores_gemma":[0.000064825035,0.00029031406,0.0006104573,0.00003002622,0.000026291109,0.0002263896,0.00007576206,0.9482523,0.020887498,0.027868794,0.0016352733,0.000032067805],"about_ca_topic_score_codex":0.0028804303,"about_ca_topic_score_gemma":0.0036377802,"teacher_disagreement_score":0.0030992266,"about_ca_system_score_codex":0.0015306358,"about_ca_system_score_gemma":0.0037951767,"threshold_uncertainty_score":0.011105537},"labels":[],"label_agreement":null},{"id":"W3115550904","doi":"","title":"Zipper Codes: High-rate Spatially-coupled Codes with Algebraic Component Codes","year":2020,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität München","keywords":"Component (thermodynamics); Block code; Concatenated error correction code; Computer science; Linear code; Mathematics; Zipper; Tornado code; Algebraic number; Theoretical computer science; Algorithm; Physics; Decoding methods","score_opus":0.015559999991080995,"score_gpt":0.2878656337931759,"score_spread":0.27230563380209494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115550904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500839,0.0006648923,0.9490095,0.00018104639,0.00009353661,0.000086713386,0.000170947,0.0007195641,0.014065452],"genre_scores_gemma":[0.70074743,0.0013333568,0.28002876,0.00035175518,0.00013142645,0.00030369833,0.0003549889,0.00027376664,0.01647485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.00015647589,0.000025015139,0.000083826075,0.00028241242,0.00006991864],"domain_scores_gemma":[0.9985868,0.0005079501,0.00021941969,0.00028510147,0.00034258817,0.00005826737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044470734,0.00063500786,0.00045077535,0.00091605005,0.0005945176,0.0011585613,0.001001942,0.00081997,0.0029808655],"category_scores_gemma":[0.0031753983,0.00029456257,0.00040204386,0.0012730234,0.0012130915,0.001547181,0.0011956994,0.001128281,0.0010324725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013454065,0.00003786734,0.00084055756,0.00014918575,0.000040702664,0.0002731263,0.00023542927,0.23350471,0.02155366,0.68643886,0.0027301535,0.054061197],"study_design_scores_gemma":[0.00002739349,0.00008961418,0.00033349002,0.000050542953,0.0000200949,0.00042161756,0.00005839726,0.8253939,0.015236606,0.14621915,0.012099168,0.000050007024],"about_ca_topic_score_codex":0.0014704171,"about_ca_topic_score_gemma":0.0016124202,"teacher_disagreement_score":0.0029808655,"about_ca_system_score_codex":0.0009698351,"about_ca_system_score_gemma":0.0009818167,"threshold_uncertainty_score":0.009971976},"labels":[],"label_agreement":null},{"id":"W3118220768","doi":"10.1109/jlt.2020.3046473","title":"Low-Complexity Rate- and Channel-Configurable Concatenated Codes","year":2020,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Huawei Technologies","keywords":"Concatenated error correction code; Decoding methods; Computer science; Forward error correction; Coding gain; Code rate; Low-density parity-check code; Error detection and correction; Channel (broadcasting); Serial concatenated convolutional codes; Bit error rate; Algorithm; Coding (social sciences); Computational complexity theory; Electronic engineering; Mathematics; Telecommunications; Block code; Engineering","score_opus":0.03122433610419903,"score_gpt":0.2560607306562759,"score_spread":0.22483639455207685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118220768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17257676,0.000581509,0.81634325,0.00018359278,0.000079237616,0.0001295828,0.00025979872,0.0019518699,0.007894289],"genre_scores_gemma":[0.6922346,0.00018930603,0.30271792,0.000058602785,0.000036547484,0.00007908506,0.0002580914,0.00010855526,0.0043172888],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994197,0.00008173626,0.000031594645,0.000071989605,0.0003249835,0.0000700076],"domain_scores_gemma":[0.9987644,0.00029407037,0.0002868446,0.00024370827,0.00036336886,0.000047703183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029283573,0.000550091,0.0003683132,0.00051127863,0.0003671143,0.000581778,0.0008356515,0.00045039607,0.0012559461],"category_scores_gemma":[0.0014884816,0.00019595215,0.00024489223,0.000526584,0.00033836195,0.000592451,0.00055188447,0.0005929789,0.00056940754],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060676766,0.00013713232,0.0036173356,0.00031609676,0.00010328423,0.0005638902,0.00018315487,0.27659446,0.4747993,0.041759796,0.0026082983,0.19871047],"study_design_scores_gemma":[0.00003369211,0.00032791996,0.001184908,0.00003366696,0.000059996957,0.00065403926,0.00001591542,0.59621656,0.38947,0.0033930335,0.008539966,0.000070361966],"about_ca_topic_score_codex":0.0008787228,"about_ca_topic_score_gemma":0.0020196692,"teacher_disagreement_score":0.0012559461,"about_ca_system_score_codex":0.00074378087,"about_ca_system_score_gemma":0.00088909717,"threshold_uncertainty_score":0.0053964853},"labels":[],"label_agreement":null},{"id":"W3120100215","doi":"10.1109/lcomm.2021.3051463","title":"Input-Distribution-Aware Successive Cancellation List Decoding of Polar Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Decoding methods; Computer science; Polar code; Reduction (mathematics); Code (set theory); Parallel computing; List decoding; Algorithm; Latency (audio); Block (permutation group theory); Set (abstract data type); Block code; Concatenated error correction code; Telecommunications; Mathematics","score_opus":0.03907823316342272,"score_gpt":0.31394910339522136,"score_spread":0.2748708702317986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120100215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04435338,0.00035543984,0.94657016,0.00021261681,0.00005977342,0.00004587487,0.00012822342,0.0010433905,0.0072312052],"genre_scores_gemma":[0.787938,0.00055089063,0.20606838,0.00016308166,0.00005536787,0.0000622896,0.00032169317,0.00010996638,0.004730421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00009451786,0.000018662948,0.000054405977,0.0002553409,0.000073612275],"domain_scores_gemma":[0.9991627,0.00031466933,0.00009429427,0.00014277687,0.00025513172,0.00003044967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032370703,0.0004533955,0.00030883646,0.0004637356,0.0003669625,0.00070519187,0.0005014302,0.0002894902,0.001051371],"category_scores_gemma":[0.001942868,0.000147248,0.00022643243,0.00066846085,0.00049320265,0.00048762374,0.0005931663,0.000553507,0.0005747497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056232477,0.000083381725,0.002236506,0.00035630498,0.000058810223,0.0005241113,0.0003127316,0.4154234,0.18161985,0.06808249,0.004247469,0.32649258],"study_design_scores_gemma":[0.000020486148,0.000071728595,0.00024652414,0.000017768789,0.000013475255,0.00020739665,0.00001996098,0.9042501,0.08476752,0.0077151954,0.0026531166,0.000016700003],"about_ca_topic_score_codex":0.0021334533,"about_ca_topic_score_gemma":0.0038007963,"teacher_disagreement_score":0.0021334533,"about_ca_system_score_codex":0.0005061284,"about_ca_system_score_gemma":0.0017527489,"threshold_uncertainty_score":0.004242003},"labels":[],"label_agreement":null},{"id":"W3122586336","doi":"10.1109/tcomm.2020.3030057","title":"Capacity-Approaching Polar Codes With Long Codewords and Successive Cancellation Decoding Based on Improved Gaussian Approximation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Additive white Gaussian noise; Decoding methods; Algorithm; Code word; Polar code; Code (set theory); Binary symmetric channel; Channel capacity; Polar; Gaussian; Mathematics; Binary number; List decoding; Channel (broadcasting); Low-density parity-check code; Concatenated error correction code; Computer science; Linear code; Telecommunications; Block code; Physics; Arithmetic","score_opus":0.03976994118903215,"score_gpt":0.26594717886165586,"score_spread":0.2261772376726237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122586336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040089037,0.00027358014,0.9541273,0.00013402624,0.000036302616,0.000028666427,0.00003731245,0.00019343688,0.005080396],"genre_scores_gemma":[0.5819472,0.0007011991,0.41270486,0.00013076713,0.000041241678,0.00010059451,0.00013273802,0.00008251809,0.0041588517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.0001889892,0.000018431458,0.000044673117,0.00026632138,0.00006550118],"domain_scores_gemma":[0.99900347,0.0005456342,0.00010580255,0.00010923293,0.0002001654,0.000035762292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007194644,0.00060593477,0.00046796506,0.0005412855,0.0003159823,0.00056677655,0.00055044,0.00061670406,0.00077123666],"category_scores_gemma":[0.0028864585,0.00024000152,0.000485336,0.00073717703,0.0010314903,0.0007445744,0.00091476226,0.0009737256,0.00040406393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018350875,0.000027957965,0.00062716525,0.00008749108,0.00003104952,0.00022440971,0.00020636007,0.69623196,0.023402154,0.24648255,0.00063888455,0.031856522],"study_design_scores_gemma":[0.000009483849,0.000043745313,0.00006357856,0.000008924371,0.000006312348,0.000100184654,0.000012620079,0.97765017,0.007347555,0.013800078,0.0009435495,0.000013818686],"about_ca_topic_score_codex":0.0016365898,"about_ca_topic_score_gemma":0.0011824224,"teacher_disagreement_score":0.0016365898,"about_ca_system_score_codex":0.0006639042,"about_ca_system_score_gemma":0.00090868666,"threshold_uncertainty_score":0.004817009},"labels":[],"label_agreement":null},{"id":"W3125334338","doi":"","title":"1New Codes on Graphs Constructed by Connecting Spatially Coupled Chains","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Code (set theory); Chain (unit); Algorithm; Concatenated error correction code; Theoretical computer science; Tanner graph; Error floor; Block code; Physics","score_opus":0.018049020123868297,"score_gpt":0.26694885729156026,"score_spread":0.24889983716769196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125334338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42997855,0.0003056917,0.5497917,0.00025261872,0.00009393012,0.000088251116,0.0002449831,0.00046717445,0.018777156],"genre_scores_gemma":[0.8872205,0.00023379466,0.10602642,0.00009585119,0.000033860997,0.00008708319,0.00026531116,0.000084596366,0.0059525436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997609,0.00007127314,0.000009906932,0.000046555444,0.00008681484,0.000024632373],"domain_scores_gemma":[0.9993771,0.00018056607,0.00010144838,0.00014389887,0.0001448985,0.000052065152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015608889,0.00033425278,0.00022158006,0.0005475401,0.00052022387,0.00045262964,0.00043109487,0.00061940664,0.0014400664],"category_scores_gemma":[0.0011139171,0.00021051563,0.00023751297,0.00049869367,0.0007314323,0.0006340007,0.00082240003,0.0005660685,0.00036533654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017432863,0.00008568683,0.0018157251,0.00018200392,0.000053631775,0.0006262173,0.0003296563,0.3276385,0.12463983,0.50115573,0.0017468994,0.041551784],"study_design_scores_gemma":[0.000018048744,0.0001094209,0.0009896803,0.000030731182,0.000021242091,0.00035172273,0.000046117042,0.78653157,0.032327462,0.17294177,0.0066026016,0.000029543347],"about_ca_topic_score_codex":0.0005477729,"about_ca_topic_score_gemma":0.0009684062,"teacher_disagreement_score":0.0014400664,"about_ca_system_score_codex":0.00038965436,"about_ca_system_score_gemma":0.00033974284,"threshold_uncertainty_score":0.0048175454},"labels":[],"label_agreement":null},{"id":"W3126241668","doi":"10.1109/tcomm.2021.3057625","title":"Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Phase-shift keying; Algorithm; Quadrature amplitude modulation; Keying; Modulation (music); QAM; Pulse-amplitude modulation; Binary number; Computer science; Estimator; Bit error rate; Mathematics; Decoding methods; Theoretical computer science; Statistics; Telecommunications; Arithmetic","score_opus":0.11458966318581643,"score_gpt":0.3540887267497274,"score_spread":0.23949906356391099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126241668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026449881,0.00009832595,0.9725118,0.000039880062,0.000008020391,0.000024270395,0.000018212166,0.00010415036,0.00074540917],"genre_scores_gemma":[0.66772854,0.0002694425,0.33045864,0.00004454521,0.000029246883,0.00008519698,0.00015436421,0.00005179491,0.0011782781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.0002837346,0.00003070222,0.00007314855,0.0003607948,0.00005546373],"domain_scores_gemma":[0.996894,0.0022508774,0.00027065762,0.00017684365,0.00035477796,0.000052846968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013572179,0.0005657511,0.000487478,0.0007983685,0.00021384248,0.00057787466,0.0006373856,0.0003494914,0.0007263155],"category_scores_gemma":[0.0064036422,0.00033676895,0.00032628552,0.0005777816,0.00055368745,0.00072338176,0.00072111253,0.00078056863,0.00016414351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022536948,0.000054568503,0.002449219,0.00015879182,0.00005023568,0.00014484617,0.00014396258,0.83778435,0.025005136,0.043840922,0.00047792942,0.08966472],"study_design_scores_gemma":[0.0000029622618,0.000012004484,0.00018607074,0.000004676733,0.0000022391735,0.000017108152,0.0000035343373,0.9941934,0.002404404,0.0030660168,0.00010348103,0.000004154851],"about_ca_topic_score_codex":0.0012719762,"about_ca_topic_score_gemma":0.0012270258,"teacher_disagreement_score":0.0013572179,"about_ca_system_score_codex":0.00069673976,"about_ca_system_score_gemma":0.0006999576,"threshold_uncertainty_score":0.0071777105},"labels":[],"label_agreement":null},{"id":"W3130019250","doi":"10.1109/globecom42002.2020.9348092","title":"Construction of Polar Codes with Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Traverse; Code (set theory); Polar code; Reinforcement learning; Algorithm; Decoding methods; Sorting; Polar; Frame (networking); Equivalence (formal languages); Artificial intelligence; Mathematics; Telecommunications; Programming language","score_opus":0.015385246054281782,"score_gpt":0.23080855131730604,"score_spread":0.21542330526302425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130019250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014861914,0.00005899321,0.9820654,0.000081157916,0.000021122401,0.000049987735,0.000025433033,0.00017308885,0.0026628566],"genre_scores_gemma":[0.58110046,0.00032274597,0.4132708,0.00016603053,0.000034250246,0.00026325134,0.00019539086,0.00011949449,0.0045276326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993699,0.00022548996,0.000026343938,0.000097480704,0.0002023115,0.00007850713],"domain_scores_gemma":[0.9979673,0.001228817,0.00017154917,0.00018022333,0.00034019444,0.00011185189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091072876,0.0006537844,0.0005129593,0.00060288195,0.0003840908,0.0005922994,0.000797537,0.00062476465,0.00232609],"category_scores_gemma":[0.005061667,0.00033126347,0.0004304972,0.00038974243,0.0014529674,0.0009129385,0.0016761993,0.0012030486,0.00050654396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018831575,0.00006763565,0.00090504216,0.00014831568,0.000024454273,0.00017127454,0.00017701599,0.77259594,0.0070491983,0.13766997,0.0014388821,0.07956393],"study_design_scores_gemma":[0.000024827688,0.000052399806,0.000047928785,0.000012309928,0.0000052020127,0.000041265255,0.000018448716,0.97057897,0.0030887597,0.024953004,0.0011661383,0.00001067568],"about_ca_topic_score_codex":0.0015716125,"about_ca_topic_score_gemma":0.001075344,"teacher_disagreement_score":0.00232609,"about_ca_system_score_codex":0.0006151693,"about_ca_system_score_gemma":0.0013909659,"threshold_uncertainty_score":0.007781565},"labels":[],"label_agreement":null},{"id":"W3131701009","doi":"10.1109/tcomm.2021.3060797","title":"Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Tanner graph; Algorithm; Error floor; Invariant (physics); Computer science; Constraint (computer-aided design); Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.0372330144525903,"score_gpt":0.2670990262776684,"score_spread":0.2298660118250781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131701009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13741876,0.0001994907,0.85533243,0.00012809433,0.00004461682,0.00010655486,0.00008793532,0.00032485795,0.00635723],"genre_scores_gemma":[0.66931814,0.00026255613,0.3275324,0.00009554113,0.00001797131,0.00015127928,0.0001329157,0.000056389108,0.0024327731],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983907,0.000025450012,0.000009330385,0.000027155598,0.000081198,0.00001782379],"domain_scores_gemma":[0.9996916,0.00007661706,0.00006138502,0.000078310884,0.000067834175,0.000024322311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017320293,0.00029335354,0.00021959045,0.00034201326,0.0003325675,0.00027376213,0.000501558,0.0002872624,0.00064812176],"category_scores_gemma":[0.0005997836,0.000180186,0.00024588188,0.00029976148,0.00053014176,0.00032885253,0.000587781,0.00048132084,0.00019273035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112368216,0.00009391205,0.0013080213,0.0004318826,0.000071785944,0.00043965873,0.00024951933,0.13145256,0.6072076,0.18584631,0.0008202892,0.07196616],"study_design_scores_gemma":[0.000058023983,0.00023818275,0.00078750117,0.000032163258,0.000056507844,0.0005754875,0.000049369068,0.6699796,0.2968655,0.023171432,0.0081363665,0.00004983297],"about_ca_topic_score_codex":0.00038911487,"about_ca_topic_score_gemma":0.0008534982,"teacher_disagreement_score":0.00064812176,"about_ca_system_score_codex":0.0003040229,"about_ca_system_score_gemma":0.00070409453,"threshold_uncertainty_score":0.0022059083},"labels":[],"label_agreement":null},{"id":"W3132925507","doi":"10.1109/tcomm.2021.3078776","title":"Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Sequential decoding; Computer science; Schedule; List decoding; Scheduling (production processes); Tanner graph; Algorithm; Berlekamp–Welch algorithm; Node (physics); Theoretical computer science; Concatenated error correction code; Block code; Mathematical optimization; Mathematics","score_opus":0.022493775674910444,"score_gpt":0.27730869346690273,"score_spread":0.2548149177919923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132925507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04287226,0.00020937041,0.9545184,0.00013235323,0.000021851378,0.00003890603,0.00007758098,0.00021810227,0.0019111959],"genre_scores_gemma":[0.67841977,0.00032566595,0.31806892,0.00006660139,0.000020840265,0.00009746323,0.00020161345,0.000045115925,0.0027539625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00011917502,0.000026034573,0.000059870014,0.00017738223,0.000057446767],"domain_scores_gemma":[0.99820197,0.0010209393,0.00018761067,0.00017251098,0.00036368376,0.000053236003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073876005,0.0005028563,0.00035569165,0.0006312106,0.000328583,0.0004915595,0.00086390454,0.00045929715,0.0007009449],"category_scores_gemma":[0.0045654504,0.00024739487,0.00027747857,0.0010999286,0.0006336998,0.0008466609,0.00070836226,0.0007453436,0.00017651072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015414304,0.000030214573,0.0007828108,0.0000797259,0.000024032846,0.000073699324,0.00010555843,0.86485726,0.009263792,0.041797385,0.00086093956,0.08197044],"study_design_scores_gemma":[0.000013171276,0.000036306727,0.00009120688,0.000004489621,0.000005779331,0.000020426742,0.0000071960335,0.98978007,0.003815041,0.0057904506,0.00042902248,0.000006878589],"about_ca_topic_score_codex":0.005758988,"about_ca_topic_score_gemma":0.0065166927,"teacher_disagreement_score":0.005758988,"about_ca_system_score_codex":0.00087519706,"about_ca_system_score_gemma":0.0014830473,"threshold_uncertainty_score":0.011450946},"labels":[],"label_agreement":null},{"id":"W3133855535","doi":"10.1049/cmu2.12148","title":"Enhanced BP decoding schemes of polar codes","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Belief propagation; Soft-decision decoder; Frame (networking); Reliability (semiconductor); Maximum a posteriori estimation; A priori and a posteriori; Polar; Mathematics; Telecommunications; Maximum likelihood; Statistics","score_opus":0.043271131127285666,"score_gpt":0.3307641410048815,"score_spread":0.28749300987759585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133855535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014548615,0.0005058071,0.9816337,0.00015309558,0.00008607562,0.00003825612,0.000052032537,0.00019240157,0.0027899314],"genre_scores_gemma":[0.44515833,0.0010796238,0.5478247,0.0002492806,0.00013978948,0.00012961894,0.00019045356,0.0000599765,0.005168277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880815,0.00045758515,0.00006129563,0.00012057843,0.00044959542,0.00010279546],"domain_scores_gemma":[0.99789375,0.00077305146,0.00017721811,0.00029053751,0.000796661,0.000068745765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255157,0.0007640109,0.0005850063,0.0009713989,0.00039435938,0.00081746647,0.00072733406,0.00079491286,0.0016371983],"category_scores_gemma":[0.004137487,0.00028626615,0.00033739576,0.00081849104,0.0007428886,0.0011542592,0.0011884696,0.0012857665,0.00074019906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013294172,0.000107570246,0.0011243352,0.00041221836,0.00008344583,0.00043456876,0.0003910472,0.30699328,0.07637765,0.201198,0.0029797005,0.40856877],"study_design_scores_gemma":[0.00007171403,0.00014443177,0.00019545159,0.00004899874,0.00002640759,0.00023696083,0.000029710563,0.94051355,0.0321108,0.021659877,0.0049230126,0.000038963324],"about_ca_topic_score_codex":0.0011219848,"about_ca_topic_score_gemma":0.00080870296,"teacher_disagreement_score":0.0016371983,"about_ca_system_score_codex":0.00046762038,"about_ca_system_score_gemma":0.00093866675,"threshold_uncertainty_score":0.0059523582},"labels":[],"label_agreement":null},{"id":"W3136518070","doi":"10.1109/tcomm.2021.3065976","title":"ADMM Check Node Penalized Decoders for LDPC Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Low-density parity-check code; Code word; Algorithm; Node (physics); Mathematics; Parity-check matrix; Computer science; Mathematical optimization","score_opus":0.06324101790705305,"score_gpt":0.3371862364926889,"score_spread":0.27394521858563586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136518070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064129517,0.00014637496,0.991867,0.00009988684,0.000027073596,0.000020600888,0.000035286623,0.00013864727,0.0012522305],"genre_scores_gemma":[0.2814595,0.00033130628,0.7119495,0.00018658635,0.000044993816,0.00016034451,0.0002299128,0.00008121781,0.0055565704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.0001726619,0.000018179404,0.000046970483,0.00016006429,0.000022656934],"domain_scores_gemma":[0.99901354,0.0005741873,0.00010512151,0.00009027003,0.00018999589,0.000026843138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339798,0.00066949276,0.00048473768,0.00036723597,0.00029130394,0.00052808586,0.00071347604,0.00079230196,0.0015348421],"category_scores_gemma":[0.0030132988,0.00025074722,0.00027528146,0.0006012531,0.0005594853,0.0006250678,0.00059056265,0.001156219,0.00041005894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014322516,0.000037906473,0.00061193935,0.00013754849,0.00004091629,0.00011231264,0.00006412785,0.8350158,0.009384297,0.055144656,0.0024559821,0.09685125],"study_design_scores_gemma":[0.000006705546,0.000016773101,0.000034438923,0.0000050260933,0.0000023889393,0.000021504846,0.0000020384964,0.99452114,0.0016724312,0.0030688052,0.0006443712,0.0000043907316],"about_ca_topic_score_codex":0.0015718918,"about_ca_topic_score_gemma":0.0025987197,"teacher_disagreement_score":0.0015718918,"about_ca_system_score_codex":0.0006302152,"about_ca_system_score_gemma":0.0010959134,"threshold_uncertainty_score":0.0051345825},"labels":[],"label_agreement":null},{"id":"W3144476509","doi":"","title":"Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth","year":2011,"lang":"en","type":"article","venue":"中国科学:信息科学(英文版)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Circulant matrix; Mathematics; Block code; Permutation matrix; Permutation (music); Random permutation; Block (permutation group theory); Turbo code; Algorithm; Discrete mathematics; Error detection and correction; Combinatorics; Decoding methods","score_opus":0.04253862161378742,"score_gpt":0.27169947270175154,"score_spread":0.22916085108796413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144476509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021316253,0.00020107388,0.97538924,0.00014102874,0.000029701196,0.000052991345,0.00005237048,0.00028629205,0.002531078],"genre_scores_gemma":[0.2557641,0.00043617905,0.7405592,0.00007108695,0.000029799467,0.00019683354,0.00022899188,0.00008768186,0.002626116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995968,0.000100041674,0.000015995694,0.00004920879,0.00021267027,0.000025292034],"domain_scores_gemma":[0.99900514,0.00048431125,0.000094343435,0.00020012031,0.00019002057,0.000026067957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035011434,0.00032604046,0.0002691392,0.00066420547,0.00043178894,0.0004056977,0.000645917,0.00036586422,0.0010921921],"category_scores_gemma":[0.002067792,0.00022076754,0.00032913542,0.00047480178,0.0007091684,0.0007851185,0.00062652613,0.0007589173,0.00040216517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014731241,0.00008673605,0.001741474,0.0005503616,0.00004299794,0.00031206626,0.0003434825,0.21655285,0.12872006,0.36578158,0.00389793,0.28182316],"study_design_scores_gemma":[0.000039657276,0.00009335131,0.00052023644,0.00003243961,0.00001860187,0.00039932883,0.000027200425,0.90369856,0.050734565,0.034594387,0.009804676,0.000036944984],"about_ca_topic_score_codex":0.0012822951,"about_ca_topic_score_gemma":0.0016440918,"teacher_disagreement_score":0.0012822951,"about_ca_system_score_codex":0.0005990184,"about_ca_system_score_gemma":0.0011243563,"threshold_uncertainty_score":0.0043461323},"labels":[],"label_agreement":null},{"id":"W3146449583","doi":"","title":"Dependency-aware unequal erasure protection codes","year":2006,"lang":"zh","type":"article","venue":"浙江大学学报：A卷英文版","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Erasure; Computer science; Algorithm; Programming language","score_opus":0.025386682901946567,"score_gpt":0.2566117253306316,"score_spread":0.23122504242868502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146449583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028893372,0.0007954474,0.95643336,0.0005845179,0.00013697738,0.000055637673,0.0005456394,0.00095989276,0.01159517],"genre_scores_gemma":[0.8730198,0.00082108,0.11847061,0.00020744212,0.00011458063,0.00009346878,0.0007707851,0.00016886121,0.006333401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999278,0.00016131194,0.000033939334,0.00011956664,0.00027728535,0.00012984381],"domain_scores_gemma":[0.99813664,0.0005999222,0.00024024241,0.0005874805,0.00038217058,0.00005348053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006240523,0.00053029717,0.0005629974,0.0009318508,0.00056124304,0.000436666,0.001083868,0.00056821207,0.0037132318],"category_scores_gemma":[0.003095484,0.0002463916,0.00041239872,0.00084765657,0.00071904354,0.0008812148,0.0017282383,0.0009858129,0.0010383426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006130865,0.000057400117,0.0017230255,0.00025664692,0.00009385512,0.00048495526,0.0003524345,0.36298192,0.06005585,0.2923117,0.019083466,0.26198566],"study_design_scores_gemma":[0.000038577564,0.00010181191,0.0006961185,0.00006049658,0.0000457919,0.00051339186,0.000032014945,0.84679097,0.030224934,0.10614319,0.015291198,0.00006144609],"about_ca_topic_score_codex":0.0011579986,"about_ca_topic_score_gemma":0.0015516107,"teacher_disagreement_score":0.0037132318,"about_ca_system_score_codex":0.00071616756,"about_ca_system_score_gemma":0.0009645011,"threshold_uncertainty_score":0.012421966},"labels":[],"label_agreement":null},{"id":"W3155950182","doi":"10.1109/lcomm.2021.3137203","title":"Error Floor Analysis of LDPC Column Layered Decoders","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Schedule; Computer science; Algorithm; Word error rate; Scheduling (production processes); Column (typography); Decoding methods; Frame (networking); Mathematical optimization; Mathematics; Speech recognition; Telecommunications","score_opus":0.06555428777193542,"score_gpt":0.334487312338807,"score_spread":0.2689330245668716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155950182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35289103,0.00048742516,0.6418946,0.00012114357,0.000022400332,0.00002741318,0.00017957416,0.00056890474,0.003807559],"genre_scores_gemma":[0.9782965,0.00015633085,0.019979963,0.000024181256,0.000005056307,0.000020003803,0.00007932328,0.000050385952,0.0013882896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.00010819017,0.00001947476,0.000050510265,0.00021131922,0.00008766179],"domain_scores_gemma":[0.9983448,0.00091129716,0.00022109503,0.00013711498,0.0003331969,0.00005245366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181081,0.0005501605,0.00041785356,0.00053232466,0.00025393986,0.0005435624,0.0005069603,0.0004233951,0.0010175223],"category_scores_gemma":[0.003551331,0.0002492677,0.00026935895,0.00039537178,0.0007535208,0.0007399413,0.00052686414,0.00049016,0.00020721264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345393,0.000010715885,0.00095779455,0.00004702277,0.000022620934,0.00008677753,0.00004849397,0.97108513,0.012383069,0.010542927,0.0001598935,0.0045720916],"study_design_scores_gemma":[0.00000103794,0.000011695092,0.00010925333,0.0000029350767,0.0000032295418,0.000015345753,0.0000053956273,0.99614054,0.0025682617,0.0010874424,0.000051623567,0.0000032588287],"about_ca_topic_score_codex":0.0043475265,"about_ca_topic_score_gemma":0.002377721,"teacher_disagreement_score":0.0043475265,"about_ca_system_score_codex":0.0010649089,"about_ca_system_score_gemma":0.00093675574,"threshold_uncertainty_score":0.008644462},"labels":[],"label_agreement":null},{"id":"W3161348053","doi":"10.1109/icassp39728.2021.9414311","title":"Towards Practical Near-Maximum-Likelihood Decoding of Error-Correcting Codes: An Overview","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Algorithm; Code (set theory); Berlekamp–Welch algorithm; Limit (mathematics); Field (mathematics); Implementation; Block (permutation group theory); Noisy-channel coding theorem; Theoretical computer science; Computer engineering; Concatenated error correction code; Block code; Mathematics; Programming language","score_opus":0.11089231243510338,"score_gpt":0.3919479717937379,"score_spread":0.2810556593586345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161348053","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019151212,0.10809393,0.8744497,0.0012873455,0.00035171822,0.00006833745,0.00008793593,0.00044039896,0.013305506],"genre_scores_gemma":[0.04831627,0.32731143,0.6130705,0.0009548315,0.0023024555,0.00021334174,0.0006296661,0.00032973633,0.0068717883],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870086,0.00037905228,0.00010364501,0.00018054442,0.0005829935,0.000052778258],"domain_scores_gemma":[0.99787736,0.0013502688,0.00007629363,0.00014307322,0.0005123977,0.000040754057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015545749,0.0010898235,0.00092188147,0.0021310223,0.00036637523,0.002577028,0.0011757414,0.0023188374,0.002925665],"category_scores_gemma":[0.0048071765,0.0008509735,0.00055232015,0.003057866,0.0012767179,0.0032569729,0.0012944512,0.0028699902,0.003202911],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009661519,0.000098294026,0.0005992373,0.0036616267,0.00008225746,0.00021349578,0.00022083425,0.051606826,0.0072827647,0.27601668,0.012778443,0.64734304],"study_design_scores_gemma":[0.000043225762,0.00044291466,0.00073215563,0.0016961468,0.00008160751,0.0024615338,0.0001259702,0.31372645,0.016967459,0.25627667,0.40728673,0.0001591881],"about_ca_topic_score_codex":0.0010259994,"about_ca_topic_score_gemma":0.0008332367,"teacher_disagreement_score":0.002925665,"about_ca_system_score_codex":0.00095390656,"about_ca_system_score_gemma":0.0014784688,"threshold_uncertainty_score":0.009787321},"labels":[],"label_agreement":null},{"id":"W3162667157","doi":"10.1109/icassp39728.2021.9414908","title":"High-Throughput VLSI Architecture for Soft-Decision Decoding with ORBGRAND","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Throughput; Very-large-scale integration; Code (set theory); Algorithm; Parallel computing; Block (permutation group theory); Reliability (semiconductor); Error detection and correction; Code rate; Computer engineering; Computer hardware; Embedded system; Mathematics; Telecommunications","score_opus":0.01402993869607088,"score_gpt":0.26414196456019795,"score_spread":0.25011202586412706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162667157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20223981,0.0026031528,0.73485804,0.0008463323,0.0003350562,0.00028838826,0.0008263616,0.0145625835,0.043440327],"genre_scores_gemma":[0.7122772,0.00050256046,0.27356774,0.00039693026,0.000067181354,0.00014235348,0.0010099252,0.00014550294,0.01189066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981445,0.000025789852,0.000011519435,0.000032184264,0.00008411006,0.00003189819],"domain_scores_gemma":[0.999806,0.000045772915,0.000021603497,0.000037581063,0.000074398806,0.000014755661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019713651,0.0003747024,0.00033111603,0.0005893276,0.00028771386,0.0006391159,0.0011220616,0.00034955988,0.006191482],"category_scores_gemma":[0.0004612287,0.00019728694,0.00018225326,0.00050593424,0.00020472951,0.00058917736,0.0005489382,0.00038813995,0.0017559513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085336476,0.00022754709,0.0036908644,0.0007317602,0.00013997915,0.0006475553,0.00024323491,0.03569085,0.35587537,0.04212135,0.022434562,0.5373435],"study_design_scores_gemma":[0.0003186455,0.0017515745,0.003142103,0.00017190281,0.00018071858,0.0016817055,0.00012804488,0.44399467,0.43229213,0.011558058,0.10461479,0.00016562884],"about_ca_topic_score_codex":0.0014339561,"about_ca_topic_score_gemma":0.0027835271,"teacher_disagreement_score":0.006191482,"about_ca_system_score_codex":0.00069775607,"about_ca_system_score_gemma":0.00079870934,"threshold_uncertainty_score":0.020712614},"labels":[],"label_agreement":null},{"id":"W3164065772","doi":"10.1109/tvlsi.2021.3072866","title":"Parallel and Flexible 5G LDPC Decoder Architecture Targeting FPGA","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Low-density parity-check code; Field-programmable gate array; Computer hardware; Embedded system; Gate array; Scheduling (production processes); Parallel computing; Computer architecture; Decoding methods; Algorithm; Engineering","score_opus":0.014273802751559966,"score_gpt":0.2541533053275753,"score_spread":0.23987950257601534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164065772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30874434,0.0011989208,0.6234511,0.00037786295,0.00024704356,0.0004388013,0.0007915616,0.008721061,0.05602922],"genre_scores_gemma":[0.79389155,0.0003541998,0.19272052,0.00013656438,0.000034984543,0.000108684624,0.0005334163,0.000072327246,0.012147783],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998815,0.0000117100535,0.000006146965,0.000028681085,0.000048698035,0.000023170787],"domain_scores_gemma":[0.9999,0.000012747712,0.000012902617,0.000023973644,0.00004068374,0.000009740288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006897756,0.00034249303,0.00018174654,0.0003605541,0.0002467374,0.00035069493,0.00060770684,0.00027685994,0.0025628326],"category_scores_gemma":[0.000161742,0.00012949505,0.00013887441,0.00026349694,0.00011547649,0.00035539287,0.00019403841,0.0002571057,0.0007890573],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007204518,0.00016601814,0.0017966299,0.00046756235,0.00009414824,0.0008885332,0.00015047086,0.07547816,0.60152745,0.019557016,0.013152231,0.28600138],"study_design_scores_gemma":[0.00014805069,0.0009619319,0.0028378263,0.000055825192,0.00006818048,0.0016948693,0.00004684546,0.57041633,0.37184182,0.0022659642,0.04958958,0.00007267485],"about_ca_topic_score_codex":0.0027219171,"about_ca_topic_score_gemma":0.005609225,"teacher_disagreement_score":0.0027219171,"about_ca_system_score_codex":0.00046009754,"about_ca_system_score_gemma":0.00062215136,"threshold_uncertainty_score":0.0085734725},"labels":[],"label_agreement":null},{"id":"W3167322117","doi":"10.1109/ieeeconf51394.2020.9443561","title":"Hardware Implementation of Fixed-Point Decoder for Low-Density Lattice Codes","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Field-programmable gate array; Floating point; Additive white Gaussian noise; Throughput; Clock rate; Decoding methods; Parallel computing; Lattice phase equaliser; Algorithm; Computer hardware; Chip; White noise","score_opus":0.031980508696575385,"score_gpt":0.3199514104271406,"score_spread":0.2879709017305652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167322117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09037001,0.0004175854,0.89546347,0.00016421784,0.00012581583,0.0001201645,0.00014510483,0.0033230053,0.009870625],"genre_scores_gemma":[0.59126014,0.0002184636,0.40388364,0.00008647447,0.00002268881,0.00008654798,0.00023020153,0.000070052265,0.0041418616],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974674,0.000045493904,0.000013347978,0.000027350141,0.0001368325,0.000030187442],"domain_scores_gemma":[0.9996555,0.00008912171,0.00003282387,0.000047962065,0.00015611424,0.000018519895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024403004,0.00033377067,0.00032982964,0.00037808495,0.00036646935,0.0005479199,0.0008342091,0.0003636325,0.0023732553],"category_scores_gemma":[0.0007575156,0.00012119851,0.00016659162,0.0002739462,0.00023241919,0.00039364572,0.00022380419,0.00042965263,0.0009204705],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007419136,0.00024666186,0.003572252,0.00063458906,0.000115872994,0.0007211944,0.00028241085,0.2692819,0.27784967,0.049692206,0.00597727,0.3908841],"study_design_scores_gemma":[0.000073000076,0.00037901476,0.0005576179,0.000034566685,0.000024281026,0.0004355732,0.00002966927,0.8026473,0.18235385,0.0022385996,0.011188249,0.000038362457],"about_ca_topic_score_codex":0.0029542923,"about_ca_topic_score_gemma":0.003934512,"teacher_disagreement_score":0.0029542923,"about_ca_system_score_codex":0.0007004357,"about_ca_system_score_gemma":0.0011325582,"threshold_uncertainty_score":0.007939279},"labels":[],"label_agreement":null},{"id":"W31701574","doi":"10.1002/hpm.2915","title":"Characterizing the Gilbert-Elliott Parameter Space under LDPC Decoding","year":2002,"lang":"en","type":"article","venue":"The International Journal of Health Planning and Management","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Economic Research Forum","keywords":"Low-density parity-check code; Decoding methods; Convergence (economics); Parameter space; Mathematics; Algorithm; Space (punctuation); Selection (genetic algorithm); Computer science; Statistics; Artificial intelligence","score_opus":0.07021639429479112,"score_gpt":0.3306216517394076,"score_spread":0.2604052574446165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31701574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49639758,0.0016747082,0.47266287,0.002515277,0.000061821396,0.00018124058,0.0022729258,0.00084376824,0.023389833],"genre_scores_gemma":[0.96734893,0.0008839859,0.024301004,0.0002364089,0.00006932528,0.00027188138,0.0012969734,0.00022172669,0.0053698895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973416,0.0012796947,0.00007425379,0.00033905383,0.00035516007,0.0006102669],"domain_scores_gemma":[0.96456945,0.030292967,0.0017741254,0.0015737019,0.0012653,0.0005244572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049962886,0.0011006204,0.0015467429,0.0037814514,0.0012519754,0.0032186222,0.0016531966,0.0024240492,0.005048347],"category_scores_gemma":[0.040431052,0.0006873302,0.0007612043,0.0020248669,0.0042772256,0.003561683,0.0027002154,0.0023847374,0.0008487671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037800125,0.00004227448,0.003958249,0.00014668662,0.00007219111,0.00033231452,0.00052275474,0.56655794,0.0014662103,0.41112313,0.002691758,0.01270847],"study_design_scores_gemma":[0.000041496554,0.000039734434,0.0007715069,0.00006437203,0.0000143993975,0.000112891226,0.00009416363,0.74460745,0.0008888475,0.2522342,0.0010711297,0.000059904352],"about_ca_topic_score_codex":0.007306806,"about_ca_topic_score_gemma":0.0038842054,"teacher_disagreement_score":0.007306806,"about_ca_system_score_codex":0.0025672512,"about_ca_system_score_gemma":0.0022029392,"threshold_uncertainty_score":0.026423216},"labels":[],"label_agreement":null},{"id":"W3173223865","doi":"10.1109/twc.2021.3091719","title":"Spinal Codes Over Fading Channel: Error Probability Analysis and Encoding Structure Improvement","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Concatenation (mathematics); Fading; Computer science; Decoding methods; Rayleigh fading; Algorithm; Concatenated error correction code; Block code; Encoding (memory); Mathematics; Artificial intelligence; Arithmetic","score_opus":0.03614213453917068,"score_gpt":0.3043910470875691,"score_spread":0.2682489125483984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173223865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06798782,0.0012350488,0.92395145,0.0003558749,0.00006442855,0.000047813654,0.00013097699,0.0003034797,0.0059231254],"genre_scores_gemma":[0.87326425,0.0015357273,0.12208022,0.0001433453,0.000103606195,0.00007783314,0.00015172196,0.000054844455,0.002588492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00016255539,0.000039025235,0.000119717,0.0004071226,0.00013866439],"domain_scores_gemma":[0.9960522,0.0016042155,0.00056891004,0.00052629877,0.0011602422,0.00008819921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197188,0.0009640198,0.0005939719,0.00088256557,0.0005110365,0.0006246352,0.0006357354,0.00065824436,0.0011714736],"category_scores_gemma":[0.0064264885,0.00022308453,0.00033450846,0.0011606247,0.0009890816,0.001298747,0.00074965606,0.0008345684,0.00031481893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023306604,0.00005610344,0.0022392827,0.00020808648,0.000043857217,0.00041438287,0.00026868584,0.76063913,0.03818968,0.108821146,0.0018407885,0.08704583],"study_design_scores_gemma":[0.000005863938,0.00007866489,0.00040727583,0.000020316946,0.000016772827,0.00021799967,0.000024791845,0.97541445,0.01029676,0.012386292,0.0011111824,0.000019638126],"about_ca_topic_score_codex":0.004225261,"about_ca_topic_score_gemma":0.0032141933,"teacher_disagreement_score":0.004225261,"about_ca_system_score_codex":0.0012146316,"about_ca_system_score_gemma":0.0015955232,"threshold_uncertainty_score":0.008812845},"labels":[],"label_agreement":null},{"id":"W3175016672","doi":"10.1109/pimrc50174.2021.9569719","title":"Coded Faster-than-Nyquist Signaling for Short Packet Communications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"","keywords":"Low-density parity-check code; Computer science; Network packet; Bit error rate; Latency (audio); Nyquist rate; Algorithm; Computational complexity theory; Detector; Electronic engineering; Decoding methods; Computer network; Telecommunications; Engineering; Sampling (signal processing)","score_opus":0.09139193239147327,"score_gpt":0.3473828429296085,"score_spread":0.2559909105381353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175016672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13803941,0.0013275343,0.85572535,0.00043242503,0.00008593251,0.00009803923,0.00005909475,0.0003623816,0.0038698777],"genre_scores_gemma":[0.82528,0.00082528737,0.17178294,0.00010995816,0.000041573414,0.00007940712,0.0000572008,0.00003304809,0.0017906578],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.0002175319,0.000022405653,0.0000645373,0.00033114056,0.000055839806],"domain_scores_gemma":[0.99845576,0.00085300195,0.0002968724,0.0001648629,0.00018229769,0.000047137437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082876673,0.0005352611,0.00036937688,0.0004205245,0.00028805007,0.0006459,0.0005072842,0.00076799205,0.0009348263],"category_scores_gemma":[0.0026841597,0.00015877635,0.00015646305,0.00048873475,0.0005845989,0.00064394024,0.00040345348,0.00072169653,0.00020113242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007177573,0.00019860789,0.002946027,0.0004324459,0.00007319725,0.00039164588,0.0003400641,0.26375267,0.4242429,0.15188535,0.0012058872,0.15381338],"study_design_scores_gemma":[0.000019474135,0.00018522839,0.00046400307,0.000034169112,0.000014087973,0.00014015776,0.000021769454,0.9138141,0.074173704,0.00823771,0.0028700584,0.000025491467],"about_ca_topic_score_codex":0.00096228864,"about_ca_topic_score_gemma":0.0013973356,"teacher_disagreement_score":0.00096228864,"about_ca_system_score_codex":0.00078808225,"about_ca_system_score_gemma":0.0009897565,"threshold_uncertainty_score":0.005717933},"labels":[],"label_agreement":null},{"id":"W3182656491","doi":"10.1109/lcomm.2021.3095895","title":"Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequential decoding; Convolutional code; Decoding methods; List decoding; Algorithm; Computer science; Viterbi algorithm; Metric (unit); Viterbi decoder; Serial concatenated convolutional codes; Block code; Theoretical computer science; Concatenated error correction code","score_opus":0.14654994843227864,"score_gpt":0.345389028460019,"score_spread":0.19883908002774037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182656491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22417521,0.0012942933,0.76227945,0.00037718163,0.00009568622,0.00010341876,0.0001754322,0.0008224958,0.010676805],"genre_scores_gemma":[0.8395486,0.0008644412,0.15556161,0.00008754801,0.000073084804,0.00008229364,0.00026320937,0.00008660863,0.0034327332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987618,0.00033504562,0.000057008914,0.00014966386,0.0005418509,0.00015462308],"domain_scores_gemma":[0.99435586,0.003488986,0.0004967063,0.0005252617,0.0010284982,0.00010462081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886997,0.0010020636,0.0006446151,0.0006406292,0.00050854124,0.001293846,0.00055377954,0.00088224316,0.0016532423],"category_scores_gemma":[0.0057398337,0.00021995588,0.00030218673,0.000919838,0.00086193247,0.0012512846,0.00095249113,0.00062767696,0.00056744844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001578968,0.00010032948,0.003805083,0.0003973493,0.000094857605,0.00034488115,0.00019800515,0.6051131,0.0936796,0.05596499,0.001503953,0.23721886],"study_design_scores_gemma":[0.000019385041,0.00036488814,0.00036402527,0.000028688388,0.000019379127,0.0003144012,0.00004001682,0.95012283,0.03690812,0.010860131,0.00093547086,0.000022587155],"about_ca_topic_score_codex":0.002326653,"about_ca_topic_score_gemma":0.004186943,"teacher_disagreement_score":0.002326653,"about_ca_system_score_codex":0.0010335437,"about_ca_system_score_gemma":0.0018099757,"threshold_uncertainty_score":0.00749892},"labels":[],"label_agreement":null},{"id":"W3182847896","doi":"10.1109/isit50566.2022.9834826","title":"Trade-Based LDPC Codes","year":2022,"lang":"en","type":"preprint","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Parity-check matrix; Mathematics; Girth (graph theory); Tanner graph; Matrix (chemical analysis); Parity (physics); Invariant (physics); Exponent; Discrete mathematics; Combinatorics; Algorithm; Decoding methods; Error floor","score_opus":0.015301224535699081,"score_gpt":0.2753598591568853,"score_spread":0.2600586346211862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182847896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20394906,0.00039937883,0.7753966,0.00026110437,0.00007737764,0.00013935735,0.0005774792,0.0010152372,0.018184507],"genre_scores_gemma":[0.8997591,0.0002349644,0.09313027,0.000115469986,0.000028694027,0.000091902184,0.00030410712,0.00007788502,0.0062575187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997067,0.00004292342,0.000016183958,0.000066330744,0.00011988563,0.00004797701],"domain_scores_gemma":[0.9991358,0.00024044805,0.000092155,0.00026869235,0.00021867355,0.00004422742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023749823,0.00025261435,0.00022193485,0.00049088965,0.0003229087,0.0005243399,0.00033586766,0.00043504543,0.0025759144],"category_scores_gemma":[0.0011218897,0.00020274943,0.00022251562,0.0005787362,0.0005728113,0.00056432956,0.0005369152,0.00075283647,0.00063729665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006998116,0.00013578135,0.0031604546,0.0003772181,0.00005437639,0.00069045974,0.0003123437,0.2200151,0.20397039,0.35855567,0.0061840606,0.20584439],"study_design_scores_gemma":[0.000085592066,0.0002875358,0.0025377658,0.000055723875,0.00003353426,0.00093943864,0.00006731525,0.69988924,0.12452471,0.1533954,0.01813755,0.00004621464],"about_ca_topic_score_codex":0.0006405626,"about_ca_topic_score_gemma":0.000916998,"teacher_disagreement_score":0.0025759144,"about_ca_system_score_codex":0.00042493342,"about_ca_system_score_gemma":0.00045616215,"threshold_uncertainty_score":0.008617282},"labels":[],"label_agreement":null},{"id":"W3186617254","doi":"10.1109/gcwkshps52748.2021.9682042","title":"A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes","year":2021,"lang":"en","type":"preprint","venue":"2021 IEEE Globecom Workshops (GC Wkshps)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Node (physics); Tree (set theory); Search tree; Metric (unit); List decoding; Algorithm; Sequential decoding; Computer science; Breadth-first search; Scheme (mathematics); Mathematics; Search algorithm; Theoretical computer science; Concatenated error correction code; Block code; Combinatorics","score_opus":0.0410918582760855,"score_gpt":0.30157197799004926,"score_spread":0.2604801197139638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186617254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002089998,0.00021069135,0.99612635,0.000035703604,0.000014564735,0.000023879318,0.00003190558,0.00025323452,0.0012135764],"genre_scores_gemma":[0.104909904,0.0006289454,0.89108175,0.0000903124,0.00004505002,0.00011244427,0.0002448184,0.000097871954,0.002788845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943966,0.0001402078,0.0000307762,0.00005016605,0.00029314935,0.00004612377],"domain_scores_gemma":[0.9992986,0.00034769875,0.000057347344,0.0000697801,0.00020509433,0.000021510465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036998765,0.0004960428,0.0004573286,0.0009395137,0.0004334166,0.00061711564,0.0006588415,0.0006754813,0.0027625128],"category_scores_gemma":[0.0021290996,0.00022280987,0.0004223812,0.0011642682,0.00034358716,0.00089025806,0.00062905165,0.00074836414,0.0015200553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020357722,0.000063657484,0.0005223237,0.00035515893,0.00006019238,0.000261901,0.00022076287,0.23643559,0.07601644,0.10859363,0.004796919,0.5724699],"study_design_scores_gemma":[0.00002121923,0.0001124266,0.00012338205,0.000029236022,0.000016179294,0.00033068605,0.0000236119,0.95347196,0.016573975,0.022117058,0.007156657,0.000023707096],"about_ca_topic_score_codex":0.0019437381,"about_ca_topic_score_gemma":0.0031039612,"teacher_disagreement_score":0.0027625128,"about_ca_system_score_codex":0.0005173856,"about_ca_system_score_gemma":0.0013187922,"threshold_uncertainty_score":0.009241581},"labels":[],"label_agreement":null},{"id":"W3187188191","doi":"10.1364/ofc.2021.w6a.39","title":"Dynamic Decoding of Zipper Codes","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Zipper; Decoding methods; Computer science; Throughput; Reduction (mathematics); Sequential decoding; Convolutional code; Algorithm; Mathematics; Block code; Telecommunications; Wireless","score_opus":0.013290237998632453,"score_gpt":0.2795430825989936,"score_spread":0.26625284460036114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187188191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12460427,0.0006778536,0.8546957,0.00021656949,0.00011340511,0.00008678835,0.00031610395,0.0060581304,0.013231341],"genre_scores_gemma":[0.70381296,0.00062194635,0.27768242,0.0003821205,0.00010479052,0.00015593936,0.0006567853,0.00046022626,0.01612288],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.00004569783,0.000022007971,0.00010227188,0.00018511806,0.000087128596],"domain_scores_gemma":[0.99917716,0.00017309334,0.0000872647,0.000221398,0.00030051146,0.000040502517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020793048,0.00047440978,0.00057832734,0.00084885897,0.00069695263,0.0009320785,0.0010806472,0.0006522652,0.0033018056],"category_scores_gemma":[0.0013350574,0.000293273,0.00027679314,0.0009852129,0.0004921547,0.0014472627,0.00080051215,0.00073934573,0.00185661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008276943,0.000109865425,0.0026513524,0.0002334266,0.00008681527,0.00086600607,0.0002792299,0.10158262,0.4154755,0.06630199,0.009661409,0.40192404],"study_design_scores_gemma":[0.000037122678,0.0001810008,0.0005839493,0.000028353736,0.000033549764,0.0004979979,0.00004518293,0.5896159,0.37752745,0.014093043,0.017294763,0.0000618143],"about_ca_topic_score_codex":0.002403508,"about_ca_topic_score_gemma":0.004527097,"teacher_disagreement_score":0.0033018056,"about_ca_system_score_codex":0.00074201735,"about_ca_system_score_gemma":0.0010252481,"threshold_uncertainty_score":0.011045635},"labels":[],"label_agreement":null},{"id":"W3193581512","doi":"10.22215/etd/2014-10497","title":"High Speed Low Error Floor Hardware Implementation and Fast and Accurate Error Floor Estimation of LDPC Decoders","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Quantization (signal processing); Algorithm; Belief propagation; Error detection and correction; Soft-decision decoder; Parallel computing","score_opus":0.01613055894756251,"score_gpt":0.3188848907489462,"score_spread":0.3027543318013837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193581512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2124676,0.00055395515,0.7709387,0.00020272433,0.000057191988,0.000098735894,0.00020524609,0.002546334,0.012929483],"genre_scores_gemma":[0.67139894,0.0005839197,0.31899628,0.000051831776,0.00003060669,0.000071285285,0.0003199671,0.00014767316,0.0083995955],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998031,0.000028581853,0.000010109493,0.00002823852,0.000109407876,0.000020493924],"domain_scores_gemma":[0.9996935,0.000083162595,0.00003067845,0.000065624794,0.00011719688,0.000009983933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015090301,0.00032205493,0.00016505222,0.0004009775,0.00019374354,0.0004097432,0.00033725152,0.0001774779,0.0016949616],"category_scores_gemma":[0.00072540034,0.00017087017,0.0000867181,0.0002952244,0.00019488689,0.00041911218,0.00021738974,0.0003236592,0.0005484095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034483272,0.00008643489,0.001686316,0.0002999552,0.000027904918,0.00018646271,0.00019072057,0.079590425,0.601057,0.03233647,0.0022557997,0.2819377],"study_design_scores_gemma":[0.000039154744,0.00021296239,0.0010704062,0.000032050506,0.000020727373,0.00025118352,0.00003093947,0.31742272,0.6630433,0.0037327835,0.014120402,0.000023330675],"about_ca_topic_score_codex":0.0008127255,"about_ca_topic_score_gemma":0.0015736918,"teacher_disagreement_score":0.0016949616,"about_ca_system_score_codex":0.0003857702,"about_ca_system_score_gemma":0.00065218593,"threshold_uncertainty_score":0.00567019},"labels":[],"label_agreement":null},{"id":"W3195862112","doi":"10.1109/istc57237.2023.10273447","title":"Energy Optimization of Faulty Quantized Min-Sum LDPC Decoders","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Decoding methods; Computer science; Voltage; Soft-decision decoder; Energy consumption; Quantization (signal processing); Low-density parity-check code; Code word; Energy (signal processing); Algorithm; Mathematics; Electrical engineering; Engineering","score_opus":0.05262341443340374,"score_gpt":0.3045514267461886,"score_spread":0.2519280123127849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195862112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45815408,0.0005669189,0.5340267,0.0003566442,0.000034079567,0.000036781003,0.00017856366,0.00081696245,0.005829304],"genre_scores_gemma":[0.96434724,0.000086900596,0.03414829,0.000027678638,0.000005179616,0.000017275945,0.00005152055,0.000057095254,0.0012587933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997372,0.00008292055,0.000010923412,0.00004221381,0.00008854442,0.000038174883],"domain_scores_gemma":[0.9995524,0.00022928842,0.000057312704,0.000057281995,0.00008872398,0.00001487125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032628517,0.0004931218,0.0004689289,0.00020955915,0.00024528833,0.0007314525,0.0005760119,0.00041553658,0.0011353672],"category_scores_gemma":[0.0013570387,0.00019603194,0.0001497467,0.000358273,0.0004897663,0.00051344774,0.00039599795,0.0003179862,0.0001712463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014126036,0.000016672935,0.0004561171,0.00004894143,0.000015627113,0.00006974804,0.000036587822,0.96125644,0.018342325,0.0057061827,0.00031010472,0.013600069],"study_design_scores_gemma":[0.000009630081,0.00003709137,0.0001331489,0.0000035697424,0.000005591421,0.000023127199,0.000011388933,0.9870727,0.010814602,0.00169615,0.00018915525,0.000003887359],"about_ca_topic_score_codex":0.00231789,"about_ca_topic_score_gemma":0.003090563,"teacher_disagreement_score":0.00231789,"about_ca_system_score_codex":0.0012072013,"about_ca_system_score_gemma":0.00078822457,"threshold_uncertainty_score":0.008758903},"labels":[],"label_agreement":null},{"id":"W3196187157","doi":"10.1186/s13638-021-02042-x","title":"Flexible soft-output decoding of polar codes","year":2021,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center","keywords":"Decoding methods; Computer science; Latency (audio); Computational complexity theory; Low latency (capital markets); Sequential decoding; List decoding; Algorithm; Polar; Scheme (mathematics); Parallel computing; Computer engineering; Concatenated error correction code; Telecommunications; Computer network; Mathematics; Block code","score_opus":0.0558006069953394,"score_gpt":0.3078307148086842,"score_spread":0.2520301078133448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196187157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033535734,0.0002457608,0.96174,0.00016248788,0.000056267527,0.000023773513,0.000042213145,0.0001577278,0.004035997],"genre_scores_gemma":[0.8454189,0.0005300598,0.1489812,0.00019390973,0.000065078915,0.00005552,0.00009740839,0.00006108558,0.004596734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992471,0.0002456386,0.000031717907,0.00010378837,0.00026277185,0.00010909111],"domain_scores_gemma":[0.99878925,0.0005659972,0.0001308652,0.00015995483,0.0003062299,0.000047748385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061584945,0.0006216594,0.0004472037,0.00044128866,0.00038086943,0.0008293632,0.00047624655,0.00055903086,0.0014991609],"category_scores_gemma":[0.0028633412,0.00018361046,0.00028349174,0.0006054089,0.0010097346,0.001063602,0.0011400882,0.0009768547,0.0004966716],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006007563,0.00005504951,0.001180386,0.00025159807,0.000051823143,0.0005119941,0.00027029615,0.605651,0.069721095,0.19018498,0.0014797791,0.13004123],"study_design_scores_gemma":[0.0000153192,0.000056948415,0.00007238574,0.000013829559,0.000005964839,0.00008505876,0.000021944661,0.96609503,0.014549224,0.017962085,0.0011086715,0.00001362874],"about_ca_topic_score_codex":0.0010695012,"about_ca_topic_score_gemma":0.0007365738,"teacher_disagreement_score":0.0014991609,"about_ca_system_score_codex":0.00040839723,"about_ca_system_score_gemma":0.00066864275,"threshold_uncertainty_score":0.005015135},"labels":[],"label_agreement":null},{"id":"W3196371665","doi":"10.1109/sips52927.2021.00036","title":"High-Throughput VLSI Architecture for GRAND Markov Order","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Interleaving; Throughput; Code word; Soft-decision decoder; BCH code; Parallel computing; Algorithm; Markov chain; Code (set theory); Telecommunications; Wireless","score_opus":0.017338787399742584,"score_gpt":0.274707906463882,"score_spread":0.2573691190641394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196371665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33855975,0.002186059,0.587043,0.0010179459,0.00032921942,0.00030496845,0.0007204243,0.014480275,0.055358324],"genre_scores_gemma":[0.85667956,0.0003449318,0.12576015,0.00026969175,0.000056676858,0.00008465421,0.0006724448,0.00010464871,0.016027289],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980813,0.000026134632,0.000010328283,0.000037739752,0.000073035706,0.000044529617],"domain_scores_gemma":[0.9997516,0.000060414026,0.000030899933,0.00004017463,0.00009799845,0.000018910845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016667329,0.00038394876,0.0002514657,0.0003988238,0.0003208111,0.00056764676,0.0010676322,0.00034295116,0.0062298244],"category_scores_gemma":[0.00046547834,0.00019369423,0.00019921447,0.00037294315,0.00016792616,0.0006432848,0.00040983848,0.00038751418,0.0014147338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008761835,0.00034662883,0.0043960093,0.0005410438,0.00017775579,0.00080216315,0.00038586924,0.05664003,0.4457421,0.050316446,0.03482886,0.40494692],"study_design_scores_gemma":[0.00016051579,0.0019696679,0.0035220045,0.00008809298,0.00019101065,0.0011485695,0.00013379237,0.59560794,0.31980416,0.0105965445,0.06664564,0.00013218523],"about_ca_topic_score_codex":0.0027612967,"about_ca_topic_score_gemma":0.0065572597,"teacher_disagreement_score":0.0062298244,"about_ca_system_score_codex":0.00079046836,"about_ca_system_score_gemma":0.0008570003,"threshold_uncertainty_score":0.020840824},"labels":[],"label_agreement":null},{"id":"W3196800729","doi":"10.1109/tit.2021.3099020","title":"Error Floor Analysis of LDPC Row Layered Decoders","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Computer science; Algorithm; Scheduling (production processes); Flooding (psychology); Schedule; Error floor; Decoding methods; Mathematics; Mathematical optimization","score_opus":0.013671819245897388,"score_gpt":0.25843046877430004,"score_spread":0.24475864952840265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196800729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25332344,0.00034133787,0.74112314,0.00013939272,0.000019008778,0.00002659106,0.0001375406,0.00035056114,0.004539024],"genre_scores_gemma":[0.96958536,0.00018338513,0.028346783,0.00003157686,0.000007613856,0.000022475511,0.000073892115,0.00004296997,0.0017058525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.00012101828,0.000015764857,0.000036483503,0.0002109049,0.000067195964],"domain_scores_gemma":[0.9982576,0.0010767442,0.0002009233,0.00013866914,0.00028004378,0.000046154444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058847247,0.00047828633,0.00036623204,0.0004215046,0.0002013358,0.0004785508,0.0004523096,0.0003679149,0.0008990759],"category_scores_gemma":[0.003215075,0.0002271172,0.00024806662,0.00034272854,0.0006984031,0.00069621444,0.0005555779,0.0004802661,0.00019151327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050773466,0.000011802308,0.0006909318,0.000036882582,0.00001791768,0.00006794363,0.000040038798,0.96597975,0.009256378,0.01926968,0.00013656549,0.004441305],"study_design_scores_gemma":[0.0000012017592,0.000011343374,0.000099426325,0.0000026650755,0.0000026439475,0.000012924578,0.0000050711606,0.99571145,0.001895888,0.0021982724,0.00005586883,0.0000032579592],"about_ca_topic_score_codex":0.002783154,"about_ca_topic_score_gemma":0.0020152684,"teacher_disagreement_score":0.002783154,"about_ca_system_score_codex":0.0009698572,"about_ca_system_score_gemma":0.0008631184,"threshold_uncertainty_score":0.0070368648},"labels":[],"label_agreement":null},{"id":"W3197579900","doi":"10.1109/isit45174.2021.9518194","title":"A Lego-Brick Approach to Coding for Asymmetric Channels and Channels with State","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Encoder; Block code; Algorithm; Hamming code; Computer science; Hamming distance; Coding (social sciences); Variable-length code; Theoretical computer science; Decoding methods; Mathematics","score_opus":0.03132538722507919,"score_gpt":0.2615496515017324,"score_spread":0.23022426427665324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197579900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025040016,0.0002242696,0.9897898,0.00017434049,0.00007868122,0.000043748827,0.00003357962,0.00007971521,0.0070717577],"genre_scores_gemma":[0.28646496,0.0015544086,0.6953428,0.0006003207,0.00028854952,0.0004959457,0.0001729717,0.0001777463,0.014902312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992404,0.00027509144,0.00003107072,0.00010026441,0.00027389487,0.00007927145],"domain_scores_gemma":[0.9987998,0.00054506975,0.00011808083,0.00029783518,0.00019140511,0.000047684767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299015,0.00080310996,0.0005603648,0.0012375225,0.00077263836,0.0013788752,0.0013806341,0.0012415957,0.0030941926],"category_scores_gemma":[0.003200172,0.00033336965,0.0006431506,0.0009785527,0.0020462293,0.0020685105,0.002059452,0.0030149235,0.001333711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002144898,0.000014393449,0.00007062651,0.000033104505,0.000007716656,0.00005768658,0.00006907499,0.023671715,0.0030795294,0.95497745,0.0010422728,0.016954923],"study_design_scores_gemma":[0.000009491282,0.00007370507,0.00006959096,0.00006894201,0.000015124459,0.0002779903,0.000037212074,0.39959016,0.0054827994,0.58240336,0.011924732,0.00004682478],"about_ca_topic_score_codex":0.00076805835,"about_ca_topic_score_gemma":0.0010987694,"teacher_disagreement_score":0.0030941926,"about_ca_system_score_codex":0.0010225245,"about_ca_system_score_gemma":0.0009880475,"threshold_uncertainty_score":0.010351121},"labels":[],"label_agreement":null},{"id":"W3198411447","doi":"10.3390/s22030853","title":"Optimizing the Energy Efficiency of Unreliable Memories for Quantized Kalman Filtering","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Kalman filter; Energy consumption; Computer science; Quantization (signal processing); Energy (signal processing); Computation; Filter (signal processing); Reduction (mathematics); Algorithm; Control theory (sociology); Mathematics; Artificial intelligence; Engineering; Statistics","score_opus":0.021895682857355485,"score_gpt":0.25795511357823603,"score_spread":0.23605943072088054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198411447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08911776,0.0004509215,0.9080405,0.00014256734,0.00002858603,0.000024031824,0.000036003657,0.00030240658,0.0018571984],"genre_scores_gemma":[0.9311483,0.0001859,0.06755589,0.000028554648,0.000015450643,0.000042520216,0.000019433082,0.000028219958,0.00097578135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996729,0.00008832949,0.000020540776,0.000047215428,0.00012519969,0.00004582705],"domain_scores_gemma":[0.999368,0.00035683124,0.0000867914,0.00009054921,0.00008630516,0.000011513523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051291334,0.00044948916,0.00047573232,0.0002794578,0.00033840857,0.0006157356,0.0009147475,0.00040039403,0.0009968218],"category_scores_gemma":[0.0021609848,0.00018716318,0.00016434318,0.00047136509,0.00051925937,0.0011206393,0.0005146568,0.00037710206,0.00013511047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023066667,0.00004563971,0.0007362414,0.000081531536,0.00003286744,0.00007265298,0.0000827213,0.88432986,0.019655421,0.02007462,0.00061398966,0.07404372],"study_design_scores_gemma":[0.000011901681,0.000046141977,0.0001365906,0.0000064021506,0.000010690546,0.00001397865,0.000010986605,0.9853898,0.010465378,0.0034068546,0.0004938127,0.0000074678246],"about_ca_topic_score_codex":0.0025946503,"about_ca_topic_score_gemma":0.0031366067,"teacher_disagreement_score":0.0025946503,"about_ca_system_score_codex":0.0006875693,"about_ca_system_score_gemma":0.00053612865,"threshold_uncertainty_score":0.00515908},"labels":[],"label_agreement":null},{"id":"W3199784387","doi":"10.22215/etd/2008-06194","title":"Performance estimation, code construction and decoding of finite-length low-density parity-check codes","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"University of Ottawa","keywords":"Decoding methods; Low-density parity-check code; Computer science; Parity bit; Parity (physics); Statistics; Arithmetic; Mathematics; Algorithm; Physics; Particle physics","score_opus":0.015063206860933334,"score_gpt":0.26211610582082284,"score_spread":0.24705289895988952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199784387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58716506,0.0008571375,0.4048735,0.00068750745,0.000055813656,0.00009127954,0.00052063185,0.0015169244,0.0042320453],"genre_scores_gemma":[0.94799715,0.00023794874,0.04919617,0.000040888644,0.000025909947,0.000054727578,0.0008427829,0.000083455954,0.001521048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.0006221111,0.00005924317,0.00016894523,0.00048729568,0.00014514486],"domain_scores_gemma":[0.9925511,0.005002911,0.00046598318,0.0007396619,0.001134455,0.00010597912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965648,0.00046498186,0.00043281444,0.0008816696,0.0004382705,0.0012784787,0.0006673145,0.0009399282,0.0009556354],"category_scores_gemma":[0.016502734,0.0003030075,0.0002589745,0.0006224254,0.0006390684,0.0010536375,0.0009243675,0.00064166856,0.0004974946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012193115,0.00022465647,0.028535485,0.0003692289,0.00014105137,0.0002198388,0.0003682727,0.62813324,0.07484309,0.031782568,0.0027453566,0.2314179],"study_design_scores_gemma":[0.000022264574,0.000120892175,0.004061525,0.000019468629,0.000020231337,0.00009584313,0.00003546348,0.9490277,0.04070944,0.005356343,0.00050412474,0.00002664243],"about_ca_topic_score_codex":0.0040232083,"about_ca_topic_score_gemma":0.004669748,"teacher_disagreement_score":0.0040232083,"about_ca_system_score_codex":0.0012558772,"about_ca_system_score_gemma":0.0018540835,"threshold_uncertainty_score":0.010395408},"labels":[],"label_agreement":null},{"id":"W3202263695","doi":"10.1109/access.2021.3140151","title":"Fast Successive-Cancellation List Flip Decoding of Polar Codes","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; List decoding; Algorithm; Sequential decoding; Polar code; Error detection and correction; Concatenated error correction code; Block code","score_opus":0.0317137696165214,"score_gpt":0.31451795326518833,"score_spread":0.28280418364866694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202263695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026814219,0.00022902159,0.9686849,0.000114957824,0.000049378046,0.000051458035,0.00010953651,0.0006788216,0.0032676328],"genre_scores_gemma":[0.43763357,0.00059382134,0.555214,0.00020699919,0.0000725457,0.000108619475,0.0005805618,0.00015412625,0.005435752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994825,0.00011294037,0.000025642943,0.000055657798,0.00025787106,0.00006546444],"domain_scores_gemma":[0.99878234,0.0004559209,0.00011878887,0.00015991193,0.0004481275,0.0000348619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048061437,0.0005568564,0.0003827129,0.0006194291,0.00045119555,0.0006469582,0.0006539415,0.00051883905,0.0019562554],"category_scores_gemma":[0.002588666,0.00018651046,0.00034359877,0.0005493399,0.00052929,0.0007973311,0.00073727395,0.0007613349,0.0011137717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056899793,0.000056974204,0.0019039139,0.0002670023,0.00004116178,0.00029597757,0.00027030142,0.29951805,0.07427844,0.055776425,0.004217869,0.5628049],"study_design_scores_gemma":[0.000024258472,0.00011524422,0.00022548494,0.00002545597,0.000009522403,0.00018344389,0.00003491871,0.9368916,0.049319264,0.009160722,0.0039867396,0.000023299684],"about_ca_topic_score_codex":0.00284737,"about_ca_topic_score_gemma":0.004073578,"teacher_disagreement_score":0.00284737,"about_ca_system_score_codex":0.00047807914,"about_ca_system_score_gemma":0.001497662,"threshold_uncertainty_score":0.0065443516},"labels":[],"label_agreement":null},{"id":"W3202758233","doi":"","title":"Optimisation de la Consommation d'Energie pour des Codes LDPC Construits à Partir de Protographes","year":2019,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Low-density parity-check code; Algorithm; Decoding methods","score_opus":0.027536681615627123,"score_gpt":0.26708482380287013,"score_spread":0.23954814218724302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202758233","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5877265,0.0011628413,0.38255334,0.0009435156,0.0001549871,0.00007384518,0.00033435528,0.0021532793,0.024897378],"genre_scores_gemma":[0.9358561,0.00023186216,0.050639044,0.000081257254,0.000021313166,0.00007035261,0.00016207162,0.00041599726,0.012521991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935,0.00016443622,0.000018626446,0.00009623658,0.00024203405,0.00012867493],"domain_scores_gemma":[0.998099,0.0013216482,0.00013801928,0.00012019741,0.00025837016,0.00006275474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062717457,0.00097086735,0.0005293579,0.0006113846,0.0004527772,0.0012617356,0.00043639724,0.0011988361,0.0060334564],"category_scores_gemma":[0.0031884294,0.0002466379,0.0003846377,0.00055807026,0.0006055722,0.00059255806,0.00048657443,0.0006905033,0.0009523836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016952823,0.00009235695,0.0016385257,0.00027112488,0.000086672015,0.00019406363,0.00021775797,0.8009678,0.10403155,0.013633263,0.00125923,0.07591237],"study_design_scores_gemma":[0.00011725139,0.00032052852,0.00330213,0.00004165838,0.00004772487,0.00011004219,0.00009090666,0.8948194,0.09311445,0.0040936726,0.003906632,0.000035536872],"about_ca_topic_score_codex":0.0056686793,"about_ca_topic_score_gemma":0.006640065,"teacher_disagreement_score":0.0060334564,"about_ca_system_score_codex":0.0015637677,"about_ca_system_score_gemma":0.001114349,"threshold_uncertainty_score":0.02018392},"labels":[],"label_agreement":null},{"id":"W3203055641","doi":"10.1109/tcomm.2021.3114764","title":"Weighted Online Fountain Codes With Limited Buffer Size and Feedback Transmissions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Fountain code; Computer science; Overhead (engineering); Transmission (telecommunications); Real-time computing; Computer network; Block code; Decoding methods; Algorithm; Concatenated error correction code; Telecommunications","score_opus":0.029588972418161785,"score_gpt":0.28177046987122895,"score_spread":0.25218149745306717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203055641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06569629,0.0011638578,0.92976826,0.00021395304,0.00008602328,0.000068270645,0.00008739336,0.0007201357,0.0021959515],"genre_scores_gemma":[0.85279745,0.0005085387,0.14409383,0.00019591351,0.00007176111,0.00012167714,0.00008591449,0.00006709622,0.002057796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985177,0.00029143287,0.00007740547,0.00025646898,0.000571473,0.0002855977],"domain_scores_gemma":[0.994578,0.0023073333,0.0007919713,0.00092250167,0.0012545855,0.00014558173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010062611,0.0012877426,0.0008056451,0.0008491429,0.0006908057,0.0009653102,0.0016390582,0.0009895859,0.0010379534],"category_scores_gemma":[0.009158915,0.00026208485,0.00031460647,0.0010677985,0.0010791149,0.0023533201,0.0012103687,0.0010210965,0.0002893098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015495182,0.00018895655,0.004143549,0.00043331378,0.00012253565,0.0007673884,0.00068323786,0.5368965,0.07432237,0.080254816,0.0039010255,0.29673672],"study_design_scores_gemma":[0.000028824594,0.00014993352,0.0003264187,0.000034756464,0.000024280496,0.00032667266,0.000052252868,0.97239065,0.014511005,0.0104591185,0.0016493773,0.00004671181],"about_ca_topic_score_codex":0.0046283603,"about_ca_topic_score_gemma":0.004537329,"teacher_disagreement_score":0.0046283603,"about_ca_system_score_codex":0.001051143,"about_ca_system_score_gemma":0.0017226253,"threshold_uncertainty_score":0.009202838},"labels":[],"label_agreement":null},{"id":"W3203493630","doi":"10.1007/s11277-021-09184-7","title":"Belief Propagation Polar Decoding for Wireless Communication Systems with Noisy Channel Estimates","year":2021,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Channel (broadcasting); Decoding methods; Compensation (psychology); Rayleigh fading; Belief propagation; Polar code; Reliability (semiconductor); Fading; Polar; Algorithm; Wireless; Bit error rate; Variance (accounting); Telecommunications; Physics","score_opus":0.039338300823494675,"score_gpt":0.2927337213077523,"score_spread":0.25339542048425767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203493630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004317705,0.00046020173,0.99314994,0.00030075276,0.000046079196,0.00001573468,0.000089789006,0.000121140896,0.0014988207],"genre_scores_gemma":[0.5032927,0.0049544466,0.47700155,0.00036956358,0.00037112363,0.0003111011,0.0008803567,0.0002489853,0.012570223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985727,0.00060773076,0.0000649641,0.00017154752,0.00043712754,0.00014592773],"domain_scores_gemma":[0.9940333,0.0045074434,0.00029162585,0.00040401958,0.00070117175,0.00006252546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016794708,0.0012207929,0.0011221627,0.0009444936,0.000631936,0.0021101346,0.00093137147,0.0016405392,0.0019274188],"category_scores_gemma":[0.013321939,0.0008319586,0.000560108,0.0018337335,0.0021314959,0.0022548467,0.0021234257,0.0025794562,0.0009783603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024361878,0.00003158591,0.00043787656,0.0002315822,0.00006340858,0.00015691649,0.00023343551,0.77043796,0.0031536794,0.15335985,0.0023174095,0.069332734],"study_design_scores_gemma":[0.000016983626,0.000018252562,0.00007375689,0.00003316156,0.000013697956,0.000046162713,0.00002578852,0.937254,0.0014208421,0.060189236,0.00088900677,0.000019117597],"about_ca_topic_score_codex":0.0056010312,"about_ca_topic_score_gemma":0.0036444264,"teacher_disagreement_score":0.0056010312,"about_ca_system_score_codex":0.0009842428,"about_ca_system_score_gemma":0.0017125697,"threshold_uncertainty_score":0.01113683},"labels":[],"label_agreement":null},{"id":"W3203564128","doi":"10.1007/978-981-16-3637-0_19","title":"On the Performance of 5G Narrow-Band Internet of Things for Industrial Applications","year":2021,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Industrial Internet; Computer science; Internet of Things; Telecommunications; Efficient energy use; Field (mathematics); Engineering; Computer security; Electrical engineering","score_opus":0.04564788563562073,"score_gpt":0.2449997442935063,"score_spread":0.19935185865788557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203564128","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03998828,0.113668755,0.32013753,0.006045576,0.0046356157,0.00009609144,0.0006457553,0.0030355293,0.5117469],"genre_scores_gemma":[0.5268178,0.08388321,0.0932603,0.0022222952,0.0023167229,0.000082759216,0.001102132,0.0007851021,0.28952974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950683,0.00008321965,0.00001196421,0.00005167546,0.00029943776,0.00004694826],"domain_scores_gemma":[0.99956316,0.00021730387,0.000019834928,0.00004069246,0.0001489819,0.000010079883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004474873,0.0007001941,0.00044564428,0.0006775312,0.00036101654,0.0011573932,0.0007102384,0.0008564191,0.010643092],"category_scores_gemma":[0.0011170773,0.00022614504,0.00019271714,0.0011620097,0.0003571645,0.0015302685,0.0004994255,0.00087076763,0.0035245938],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018139166,0.000054371223,0.0006858906,0.00050710473,0.00006211924,0.00017224975,0.00020669834,0.04947891,0.027825307,0.16583462,0.089369684,0.66562164],"study_design_scores_gemma":[0.000014112192,0.0003610847,0.002597535,0.00079850317,0.00012846914,0.00091768155,0.0001865774,0.2769482,0.053006187,0.11008028,0.5548772,0.00008418393],"about_ca_topic_score_codex":0.0016536423,"about_ca_topic_score_gemma":0.003002831,"teacher_disagreement_score":0.010643092,"about_ca_system_score_codex":0.0008432612,"about_ca_system_score_gemma":0.00041362946,"threshold_uncertainty_score":0.035604715},"labels":[],"label_agreement":null},{"id":"W3204736704","doi":"10.1109/tvlsi.2022.3223692","title":"List-GRAND: A Practical Way to Achieve Maximum Likelihood Decoding","year":2022,"lang":"en","type":"preprint","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Reliability (semiconductor); List decoding; Grand strategy; Maximum likelihood; Algorithm; Parallel computing; Mathematics; Statistics; Concatenated error correction code","score_opus":0.0280340564968689,"score_gpt":0.3054145827928697,"score_spread":0.2773805262960008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204736704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007897986,0.0003674453,0.98004913,0.0002111327,0.00006684845,0.000078919504,0.00013699757,0.0055542914,0.0056372625],"genre_scores_gemma":[0.1668823,0.00033429087,0.82230943,0.00047292208,0.0000708029,0.00018369796,0.0006086215,0.0005428688,0.008594963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992549,0.00020111405,0.000048719106,0.0001045686,0.00030948635,0.000081210936],"domain_scores_gemma":[0.9992918,0.00020024722,0.000052841075,0.00022048823,0.00019773052,0.000036837093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067610346,0.0009563504,0.0004980412,0.0008422586,0.0005984802,0.00082752784,0.0010917651,0.00077913626,0.0058416026],"category_scores_gemma":[0.0023535464,0.00032732583,0.00038700455,0.0007440428,0.00064173865,0.00116671,0.0018028154,0.00093636307,0.0033807887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006787049,0.00013102412,0.001251141,0.0004899842,0.00009812224,0.00053614407,0.0003382676,0.06478651,0.09793903,0.1052915,0.026477473,0.7019822],"study_design_scores_gemma":[0.0001653578,0.0004745487,0.00047313518,0.000085421416,0.00005766644,0.00093508593,0.000088486195,0.70666677,0.17826574,0.056014802,0.056657158,0.000115802],"about_ca_topic_score_codex":0.0009089953,"about_ca_topic_score_gemma":0.0026903257,"teacher_disagreement_score":0.0058416026,"about_ca_system_score_codex":0.0004375677,"about_ca_system_score_gemma":0.0010615749,"threshold_uncertainty_score":0.019542158},"labels":[],"label_agreement":null},{"id":"W3206276601","doi":"10.1145/3470642","title":"A High-throughput Parallel Viterbi Algorithm via Bitslicing","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soft output Viterbi algorithm; Viterbi decoder; Computer science; Viterbi algorithm; Throughput; Iterative Viterbi decoding; Parallel computing; Decoding methods; Algorithm; Sequential decoding; Wireless; Telecommunications; Block code","score_opus":0.02045993853133701,"score_gpt":0.2725710921249695,"score_spread":0.2521111535936325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206276601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018112734,0.00043033023,0.9750684,0.00015698273,0.0000979968,0.00010897597,0.00012259172,0.0026096243,0.0032922789],"genre_scores_gemma":[0.2495095,0.00039644187,0.7407058,0.0002250549,0.000090295085,0.00016893282,0.00058763276,0.00026977604,0.008046608],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995109,0.00007311468,0.000031731546,0.00010202687,0.00022958455,0.00005270689],"domain_scores_gemma":[0.9996044,0.000093466864,0.000040263058,0.000119079195,0.000119122014,0.000023664239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382488,0.0005187975,0.0005216507,0.0006319995,0.00054651394,0.0008371933,0.001235023,0.0007423253,0.004436123],"category_scores_gemma":[0.0011899428,0.00036699168,0.00032300878,0.00070209283,0.0004458597,0.0013030544,0.00085925055,0.000999614,0.0022052943],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008564641,0.0002146699,0.0011511846,0.00042861712,0.00013319297,0.00034281553,0.00027370895,0.11195671,0.24321021,0.041956116,0.008233617,0.59124273],"study_design_scores_gemma":[0.00010362839,0.00031291897,0.00041357178,0.00003670714,0.00005281399,0.0004988475,0.000032713175,0.7766895,0.18691427,0.010558927,0.024329085,0.000056973357],"about_ca_topic_score_codex":0.0016194523,"about_ca_topic_score_gemma":0.0020306585,"teacher_disagreement_score":0.004436123,"about_ca_system_score_codex":0.0005929089,"about_ca_system_score_gemma":0.0013381387,"threshold_uncertainty_score":0.014840364},"labels":[],"label_agreement":null},{"id":"W3208657910","doi":"10.1109/tvlsi.2022.3153605","title":"High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Code word; Code (set theory); Latency (audio); Code rate; Throughput; Algorithm; Parallel computing; Computer engineering; Wireless; Telecommunications","score_opus":0.010317694251055023,"score_gpt":0.23361488871180314,"score_spread":0.2232971944607481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208657910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42026296,0.003005872,0.5143121,0.0009873462,0.000421242,0.00033963536,0.000869168,0.015042638,0.044759136],"genre_scores_gemma":[0.81292754,0.00042557114,0.1709378,0.000283271,0.00007182685,0.00014029337,0.00089615176,0.00013782989,0.014179605],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.000023237351,0.000010489669,0.000030917832,0.000058607755,0.000032371398],"domain_scores_gemma":[0.9997905,0.000045958233,0.000034496843,0.00003494498,0.000078181016,0.000015977479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013695836,0.00042642042,0.00027770776,0.00047170822,0.00022830305,0.000557495,0.0012375383,0.00031240098,0.0044931937],"category_scores_gemma":[0.00041944673,0.00019725722,0.00018271821,0.00036630817,0.00015862926,0.00060385093,0.00038706153,0.0003281457,0.0013767352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083992723,0.0002944621,0.0038160488,0.0007229275,0.00015319363,0.00085900375,0.0003342861,0.043107737,0.48208207,0.03573731,0.03567896,0.39637405],"study_design_scores_gemma":[0.00029516252,0.0029493505,0.0035360055,0.00013694259,0.0002100233,0.0011823399,0.00013868122,0.5155684,0.38733274,0.009713802,0.07877779,0.00015883769],"about_ca_topic_score_codex":0.0011632473,"about_ca_topic_score_gemma":0.0026611583,"teacher_disagreement_score":0.0044931937,"about_ca_system_score_codex":0.00061038084,"about_ca_system_score_gemma":0.00062573183,"threshold_uncertainty_score":0.015031278},"labels":[],"label_agreement":null},{"id":"W3209412639","doi":"10.1109/ccece53047.2021.9569125","title":"Novel Design of Irregular Polar Codes for Latency Reduction in Fast Polar Decoders","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Polar; Latency (audio); Decoding methods; Computer science; Polar code; Word error rate; Electronic engineering; Real-time computing; Algorithm; Telecommunications; Engineering; Speech recognition; Physics","score_opus":0.034774288331226345,"score_gpt":0.2779663601907374,"score_spread":0.24319207185951106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209412639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018230617,0.00034922914,0.97593874,0.00012988877,0.00008110337,0.0000764405,0.00008749074,0.0004183141,0.0046881717],"genre_scores_gemma":[0.40426084,0.0010528512,0.588185,0.00020946252,0.000091819966,0.00020205286,0.0003097131,0.00011236432,0.005575907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.00007605021,0.000033301054,0.00006051443,0.0001724356,0.000051838637],"domain_scores_gemma":[0.99899286,0.00022739667,0.00014363602,0.00011212327,0.0004800147,0.000043992266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003403604,0.0006868303,0.00034259135,0.0006357033,0.0004386015,0.00090493506,0.0005819305,0.00048102596,0.0016622213],"category_scores_gemma":[0.0013661106,0.0002592477,0.0002611373,0.00063937664,0.0004610911,0.00067003566,0.0006732255,0.00066479004,0.000763723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008241351,0.00011958121,0.0017946045,0.00046792315,0.00008128214,0.00074038067,0.00041704878,0.20261107,0.31561172,0.14202486,0.0049662953,0.33034113],"study_design_scores_gemma":[0.00007859563,0.00037925388,0.0003137236,0.000069901005,0.00004179329,0.000948962,0.00008223816,0.7725901,0.18435995,0.015674062,0.025404086,0.00005725566],"about_ca_topic_score_codex":0.001037063,"about_ca_topic_score_gemma":0.001494194,"teacher_disagreement_score":0.0016622213,"about_ca_system_score_codex":0.00049389515,"about_ca_system_score_gemma":0.001237368,"threshold_uncertainty_score":0.005560696},"labels":[],"label_agreement":null},{"id":"W3212456593","doi":"10.1109/iccc52777.2021.9580304","title":"Deep Learning Methods for Channel Decoding: A Brief Tutorial","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Low-density parity-check code; Computer science; Deep learning; Artificial neural network; List decoding; Algorithm; Sequential decoding; Artificial intelligence; Channel (broadcasting); Process (computing); Machine learning; Theoretical computer science; Concatenated error correction code; Computer network","score_opus":0.04101544846329722,"score_gpt":0.37014960349797454,"score_spread":0.3291341550346773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212456593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012741565,0.1843513,0.7946126,0.0021104156,0.001521031,0.0000859248,0.00045130998,0.0005781146,0.015015188],"genre_scores_gemma":[0.04405953,0.39849958,0.5009358,0.0027061882,0.006832896,0.0006098719,0.0017857964,0.0007557458,0.043814544],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996369,0.0001042756,0.000037406593,0.000071976,0.00012329392,0.00002604815],"domain_scores_gemma":[0.99944407,0.00038649948,0.000022828928,0.00003972216,0.00008850183,0.000018320203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092050614,0.0015459902,0.0010088149,0.0012741842,0.00026616454,0.0012329157,0.0008657587,0.0016397663,0.007381769],"category_scores_gemma":[0.002126018,0.00080488314,0.000817475,0.0024343391,0.0007707385,0.0018745959,0.0011445873,0.003498207,0.0038268988],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006472227,0.00015206505,0.0005248176,0.0025202914,0.0001330918,0.00017711935,0.00017466214,0.049093235,0.0036146946,0.19000795,0.06124887,0.6922885],"study_design_scores_gemma":[0.00003212977,0.00019937969,0.00089260656,0.0011347175,0.000073126495,0.00058094255,0.000055145425,0.29495373,0.0037167596,0.30449918,0.39374602,0.000116121504],"about_ca_topic_score_codex":0.0022684021,"about_ca_topic_score_gemma":0.0022098129,"teacher_disagreement_score":0.007381769,"about_ca_system_score_codex":0.0007505357,"about_ca_system_score_gemma":0.00071383617,"threshold_uncertainty_score":0.024694443},"labels":[],"label_agreement":null},{"id":"W3212772463","doi":"10.1109/tcsi.2022.3150583","title":"A Fixed Latency ORBGRAND Decoder Architecture With LUT-Aided Error-Pattern Scheduling","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Decoding methods; Computer science; Code word; Latency (audio); Notation; Soft-decision decoder; Algorithm; Parallel computing; Arithmetic; Theoretical computer science; Mathematics","score_opus":0.017065553957910193,"score_gpt":0.22384796712872584,"score_spread":0.20678241317081564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212772463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13820548,0.0012945378,0.82139504,0.00039111215,0.00033449096,0.00026847568,0.0011680651,0.015600119,0.021342656],"genre_scores_gemma":[0.6315749,0.00033398232,0.34982905,0.000258131,0.00007185088,0.00015499526,0.0015386574,0.00018940316,0.016048973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982196,0.000022450115,0.000015088516,0.0000380775,0.00007020617,0.000032152475],"domain_scores_gemma":[0.9997998,0.000024896759,0.00002006252,0.000052555763,0.00008168504,0.00002114676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001841807,0.0004781623,0.00041853506,0.0005060302,0.00036859876,0.00063135085,0.0013615873,0.00031302052,0.0039594127],"category_scores_gemma":[0.0003849108,0.00018981693,0.00021155672,0.0006228425,0.00018018515,0.0005077728,0.0004911244,0.0003896215,0.0014786645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015358638,0.00021304423,0.0025578903,0.0004285517,0.00010816538,0.00060885603,0.00016156315,0.138396,0.20759685,0.026846865,0.021140613,0.6004057],"study_design_scores_gemma":[0.00021757855,0.00069021806,0.0012335797,0.00004953028,0.000079014695,0.00059528096,0.00004886308,0.81781435,0.13946947,0.005661153,0.03406226,0.000078653065],"about_ca_topic_score_codex":0.0044485633,"about_ca_topic_score_gemma":0.009517661,"teacher_disagreement_score":0.0044485633,"about_ca_system_score_codex":0.00090523215,"about_ca_system_score_gemma":0.001568657,"threshold_uncertainty_score":0.013245583},"labels":[],"label_agreement":null},{"id":"W3212795869","doi":"10.1109/istc49272.2021.9594060","title":"Reduced Complexity RPA Decoder for Reed-Muller Codes","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Reed–Muller code; Soft-decision decoder; Block code; Concatenated error correction code; Algorithm","score_opus":0.08190390737798088,"score_gpt":0.3313703746322366,"score_spread":0.24946646725425575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212795869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012760926,0.0004605955,0.9811866,0.00014537814,0.00007207393,0.000047666268,0.00012035972,0.001663814,0.0035424998],"genre_scores_gemma":[0.18537334,0.0005816102,0.80348575,0.00019188854,0.00010001389,0.00013157967,0.00050518935,0.00018412694,0.009446523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990845,0.00023365024,0.000059822924,0.00012879528,0.0004305497,0.000062733845],"domain_scores_gemma":[0.99890494,0.00037294693,0.00009085213,0.00023712618,0.00035600254,0.00003803663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000554118,0.0008460444,0.0006236602,0.0006546227,0.0004299769,0.0009064974,0.00092601636,0.0007023705,0.0031119683],"category_scores_gemma":[0.0023002864,0.0002742713,0.00057411246,0.000707097,0.0003769784,0.0008238393,0.0007367553,0.0012113826,0.00262535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005239959,0.0001304314,0.0008782036,0.00038047382,0.000120134515,0.0004903835,0.00025264284,0.17256661,0.19990872,0.11982716,0.007936036,0.49698526],"study_design_scores_gemma":[0.000031008105,0.00016024969,0.0002490489,0.000033297845,0.00003348934,0.0005778884,0.000017888222,0.8853511,0.09136799,0.011112502,0.011031009,0.000034452445],"about_ca_topic_score_codex":0.0013401124,"about_ca_topic_score_gemma":0.0031825395,"teacher_disagreement_score":0.0031119683,"about_ca_system_score_codex":0.0005882633,"about_ca_system_score_gemma":0.0017735064,"threshold_uncertainty_score":0.010410547},"labels":[],"label_agreement":null},{"id":"W3213976927","doi":"10.1109/istc49272.2021.9594229","title":"Multi Coding Rates Nested Recursive Convolutional Doubly-Orthogonal Codes","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Encoder; Coding (social sciences); Tanner graph; Decoding methods; Block code; Discrete mathematics; Serial concatenated convolutional codes; Concatenated error correction code; Linear code; Mathematics; Algorithm; Computer science; Code rate; Combinatorics; Theoretical computer science; Statistics","score_opus":0.04202779564541497,"score_gpt":0.3089258124863023,"score_spread":0.2668980168408873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213976927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23067378,0.0007518182,0.74991715,0.0001259772,0.0000705917,0.000072169176,0.000247119,0.00062807027,0.017513337],"genre_scores_gemma":[0.8756909,0.00042656803,0.118146464,0.00010537491,0.000036343285,0.00007689677,0.00029382136,0.000073507574,0.0051502087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00007679255,0.000028912673,0.000090035006,0.00022282518,0.00011099925],"domain_scores_gemma":[0.9985386,0.00046056748,0.00020419565,0.00036692704,0.0003578851,0.00007187361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901097,0.00033156964,0.0003360624,0.0005819785,0.00030773925,0.00054873206,0.0006892292,0.00034028545,0.0011703171],"category_scores_gemma":[0.0021241808,0.00013099432,0.00029647673,0.0004163103,0.00067320623,0.0005719829,0.0007797241,0.00053997553,0.0003936028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045228912,0.000085547916,0.003815562,0.00022787783,0.00005318598,0.0006119081,0.00040475812,0.18198325,0.12416022,0.47399843,0.002275666,0.21193127],"study_design_scores_gemma":[0.00004075513,0.00023164011,0.0019126238,0.000057213423,0.00004290542,0.000954994,0.000060189574,0.83415914,0.06757956,0.07702222,0.017857835,0.00008091271],"about_ca_topic_score_codex":0.0016612271,"about_ca_topic_score_gemma":0.0021720324,"teacher_disagreement_score":0.0016612271,"about_ca_system_score_codex":0.0005776344,"about_ca_system_score_gemma":0.0005955901,"threshold_uncertainty_score":0.0041909814},"labels":[],"label_agreement":null},{"id":"W35544945","doi":"10.1139/apnm-2021-0770","title":"Performance and Decoder Complexity Estimates for Families of Low-Density Parity-Check Codes","year":2007,"lang":"en","type":"article","venue":"IPNPR","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Heart and Stroke Foundation of Canada","keywords":"Low-density parity-check code; Algorithm; Soft-decision decoder; Decoding methods; Code rate; Decibel; Computer science; Computational complexity theory; Code (set theory); Statistics; Mathematics; Arithmetic; Theoretical computer science; Telecommunications","score_opus":0.035630271707130595,"score_gpt":0.29927248711504173,"score_spread":0.2636422154079111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35544945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99070144,0.00016748637,0.0009405968,0.00023946282,0.00002638278,0.000027092816,0.0043086824,0.00005503434,0.003533979],"genre_scores_gemma":[0.9946213,0.00009369799,0.0006345525,0.000031437798,0.000007203719,0.00004276083,0.0031926357,0.000019240828,0.001357235],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896085,0.00024732674,0.00007105464,0.00023053736,0.00019385794,0.00029635482],"domain_scores_gemma":[0.9892447,0.004757541,0.0020574755,0.0008692435,0.0021800438,0.00089105737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018955664,0.00038925488,0.00048050992,0.0018064668,0.0010216102,0.0013755477,0.00079970516,0.00067352393,0.010058582],"category_scores_gemma":[0.02384642,0.00027265638,0.0013016645,0.0015475596,0.0006045999,0.00082713756,0.0010291816,0.0007499422,0.0019075051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023360256,0.00004635737,0.98950934,0.00001769135,0.00006989628,0.000068922054,0.000482125,0.00091944693,0.000081467486,0.00027978787,0.0015740634,0.0067172693],"study_design_scores_gemma":[0.000010091705,0.00008267715,0.9929732,0.00002512617,0.00003028151,0.00012933924,0.0011364614,0.004633049,0.00009581749,0.00031623166,0.0005505687,0.000017031434],"about_ca_topic_score_codex":0.225062,"about_ca_topic_score_gemma":0.14537953,"teacher_disagreement_score":0.225062,"about_ca_system_score_codex":0.0023324103,"about_ca_system_score_gemma":0.0023327786,"threshold_uncertainty_score":0.44750398},"labels":[],"label_agreement":null},{"id":"W4205256460","doi":"10.1109/ojcas.2021.3123899","title":"Implementing Convolutional Neural Networks Using Hartley Stochastic Computing With Adaptive Rate Feature Map Compression","year":2021,"lang":"en","type":"article","venue":"IEEE Open Journal of Circuits and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Huawei Technologies; McGill University","keywords":"Computer science; Convolutional neural network; Convolution (computer science); Algorithm; Fourier transform; Fast Fourier transform; Filter (signal processing); Artificial neural network; Mathematics; Artificial intelligence; Computer vision","score_opus":0.05241258883360933,"score_gpt":0.29973710657456926,"score_spread":0.24732451774095993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205256460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06312525,0.00025474594,0.92988193,0.00019617191,0.00007673607,0.000058700793,0.00007932497,0.002172729,0.0041543324],"genre_scores_gemma":[0.68894583,0.00024987062,0.30770633,0.00018192633,0.000038449525,0.00010872469,0.00020901265,0.00010509395,0.0024547458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.000033254364,0.000025184196,0.0000493077,0.00015154158,0.00003563436],"domain_scores_gemma":[0.99966943,0.00011874581,0.000043061304,0.00007829862,0.00007638693,0.00001415541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028188244,0.000461433,0.0002778717,0.00031079384,0.00021332482,0.0005909129,0.0008351651,0.0004073049,0.001250948],"category_scores_gemma":[0.0012132955,0.00018415716,0.000328438,0.0004192147,0.00039245593,0.00084319175,0.0005154133,0.00067773333,0.0003237993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021928058,0.00015549129,0.0014347539,0.00014172895,0.000059189806,0.00031736668,0.00010806258,0.60930836,0.08099151,0.04467512,0.002970435,0.25961876],"study_design_scores_gemma":[0.00000831628,0.00004011281,0.00014524924,0.0000049536743,0.000005962851,0.000045684836,0.0000056973067,0.97552687,0.019831084,0.0029571156,0.0014223424,0.0000066533353],"about_ca_topic_score_codex":0.003515614,"about_ca_topic_score_gemma":0.0053420975,"teacher_disagreement_score":0.003515614,"about_ca_system_score_codex":0.00071725284,"about_ca_system_score_gemma":0.00086558633,"threshold_uncertainty_score":0.006990254},"labels":[],"label_agreement":null},{"id":"W4206560363","doi":"10.1002/cta.3219","title":"Highly accurate division and square root circuits by exploiting signal correlation in stochastic computing","year":2022,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Square root; Division (mathematics); Computer science; Electronic circuit; SIGNAL (programming language); Nonlinear system; Root mean square; Mean squared error; Divisor (algebraic geometry); Square (algebra); Mathematics; Algorithm; Arithmetic; Statistics; Engineering; Discrete mathematics; Electrical engineering","score_opus":0.015023473907507079,"score_gpt":0.27357667417260556,"score_spread":0.2585532002650985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206560363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32102963,0.00044414727,0.6717326,0.00027896118,0.00006325267,0.00004670899,0.000065050124,0.00086706213,0.0054726945],"genre_scores_gemma":[0.92657155,0.00006788911,0.07261851,0.000072796465,0.0000133526,0.000013958058,0.000021558997,0.000014908861,0.0006055329],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996897,0.00005601058,0.000019539688,0.000060697876,0.0001327669,0.000041366427],"domain_scores_gemma":[0.99958044,0.00016438913,0.00010353665,0.000058871054,0.00007249728,0.000020277514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022699812,0.00022437186,0.00019969599,0.00025569857,0.00020307135,0.0004717325,0.0004537113,0.0002909395,0.00074226275],"category_scores_gemma":[0.00089982187,0.00012245591,0.00014948762,0.0003415255,0.00030676645,0.0004531905,0.0003281044,0.00032379501,0.00012383472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034819954,0.000118915355,0.002052234,0.0001965351,0.00006466826,0.0003962326,0.0001708269,0.18764696,0.5047988,0.13432126,0.0015619812,0.16832331],"study_design_scores_gemma":[0.00002302045,0.00023690627,0.0005534516,0.000016763983,0.00002551667,0.00030188615,0.000013988623,0.8113469,0.17432776,0.009625333,0.0035041189,0.000024337314],"about_ca_topic_score_codex":0.00043890014,"about_ca_topic_score_gemma":0.0009536985,"teacher_disagreement_score":0.00074226275,"about_ca_system_score_codex":0.00042844977,"about_ca_system_score_gemma":0.0004514535,"threshold_uncertainty_score":0.0031086802},"labels":[],"label_agreement":null},{"id":"W4210377634","doi":"10.1007/s11265-021-01735-2","title":"Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes","year":2022,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; Intel Corporation","keywords":"Computer science; Fixed point; Lattice (music); Decoding methods; Arithmetic; Algorithm; Mathematics; Physics; Mathematical analysis; Acoustics","score_opus":0.02383310801065427,"score_gpt":0.3114317446696866,"score_spread":0.28759863665903235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210377634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0897157,0.00023324153,0.8948139,0.00020318151,0.000117187956,0.00011640925,0.0001996585,0.00538303,0.009217732],"genre_scores_gemma":[0.59094584,0.000116663745,0.4036516,0.00010933498,0.000023613753,0.000070307164,0.0002741853,0.00008217945,0.0047262404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975365,0.000042365304,0.000013099537,0.000029478064,0.00012898102,0.000032498127],"domain_scores_gemma":[0.9997104,0.00008114985,0.00002143198,0.00004535242,0.00012249137,0.000019101724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022133386,0.00025003843,0.00026877303,0.00035869438,0.00031425006,0.0005731797,0.0009452376,0.00037801522,0.0033086718],"category_scores_gemma":[0.0007177472,0.00014465561,0.00017132191,0.0002975806,0.0002398981,0.00036051666,0.0002664906,0.00044305413,0.0011827664],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009165587,0.00026232452,0.0029681062,0.00034305349,0.000094624804,0.0006816391,0.00024698328,0.23128971,0.31901136,0.04244489,0.008325388,0.39341542],"study_design_scores_gemma":[0.00007345196,0.00026238442,0.0004274337,0.0000213238,0.000014419326,0.00023998338,0.000020297814,0.869922,0.11945513,0.0020148088,0.007517404,0.00003136109],"about_ca_topic_score_codex":0.0046202084,"about_ca_topic_score_gemma":0.0061646346,"teacher_disagreement_score":0.0046202084,"about_ca_system_score_codex":0.00077919045,"about_ca_system_score_gemma":0.0013045328,"threshold_uncertainty_score":0.011068642},"labels":[],"label_agreement":null},{"id":"W4212932240","doi":"10.36227/techrxiv.14233652.v1","title":"Stochastic Dividers for Low Latency Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; National Natural Science Foundation of China; University of Alberta; New Mexico State University; National Science Foundation","keywords":"Stochastic computing; Computer science; Arithmetic; Latency (audio); Computation; Artificial neural network; Parallel computing; Algorithm; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.02556206762920833,"score_gpt":0.27594281800041237,"score_spread":0.25038075037120405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212932240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0460093,0.0025708827,0.93565905,0.00038975544,0.00022772717,0.00009855195,0.00013455896,0.002510276,0.012399901],"genre_scores_gemma":[0.71071804,0.0011142347,0.27869302,0.00030536362,0.0001155136,0.00016827208,0.00019281838,0.00011400364,0.008578746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996973,0.000040516876,0.000026705498,0.0000526504,0.00015124443,0.00003156737],"domain_scores_gemma":[0.9997317,0.00009818237,0.000055146586,0.000032485765,0.00006860238,0.000013734496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841032,0.00044633134,0.00025305696,0.00040277766,0.00028022352,0.0006461947,0.0007814387,0.0003709746,0.0039609494],"category_scores_gemma":[0.00086379633,0.0001980195,0.00027338704,0.00037592655,0.00025721014,0.0007871152,0.0003999595,0.0006791953,0.0006274188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047258174,0.000119345816,0.0009293319,0.0006852621,0.00008960105,0.00039898773,0.00020468049,0.14877741,0.22338259,0.10377076,0.0067024464,0.51446694],"study_design_scores_gemma":[0.00005029502,0.00049039477,0.0005225839,0.000077826124,0.000053784363,0.00031395562,0.000037794132,0.84738415,0.10137391,0.019208735,0.030452283,0.00003433812],"about_ca_topic_score_codex":0.00095340266,"about_ca_topic_score_gemma":0.0023613719,"teacher_disagreement_score":0.0039609494,"about_ca_system_score_codex":0.0007509513,"about_ca_system_score_gemma":0.0004784637,"threshold_uncertainty_score":0.013250649},"labels":[],"label_agreement":null},{"id":"W4212985923","doi":"10.36227/techrxiv.14233652","title":"Stochastic Dividers for Low Latency Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; National Natural Science Foundation of China; University of Alberta; New Mexico State University; National Science Foundation","keywords":"Stochastic computing; Computer science; Latency (audio); Arithmetic; Computation; Artificial neural network; Parallel computing; Algorithm; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.02556206762920833,"score_gpt":0.27594281800041237,"score_spread":0.25038075037120405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212985923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04709144,0.0027008597,0.933529,0.0004118651,0.0002120373,0.00010263648,0.00012675146,0.0020638576,0.013761485],"genre_scores_gemma":[0.6747475,0.0013738872,0.3135095,0.0003078421,0.00012789603,0.00017313674,0.00018670678,0.00010521824,0.0094683925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997348,0.00003661262,0.000023011025,0.000046780933,0.00013145788,0.000027275839],"domain_scores_gemma":[0.9997805,0.00008073244,0.00004760948,0.000027358159,0.000052670046,0.000011196105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025038602,0.0004374201,0.0002575768,0.00039626416,0.00028837734,0.00065091986,0.0006913791,0.00034782762,0.0037479461],"category_scores_gemma":[0.00081340305,0.0001854562,0.00026316204,0.0004196785,0.00026507888,0.00077777647,0.00039863487,0.00063321565,0.00057907554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041408138,0.00009784163,0.0007364076,0.0005953666,0.00007460285,0.00038022458,0.0002183775,0.13176824,0.22439967,0.14763412,0.006242695,0.48743838],"study_design_scores_gemma":[0.000050449937,0.00042308748,0.00042007852,0.00007460783,0.000050621704,0.00032429033,0.000043034866,0.8393315,0.103616044,0.021913704,0.033717535,0.000035030003],"about_ca_topic_score_codex":0.0009338488,"about_ca_topic_score_gemma":0.0023773059,"teacher_disagreement_score":0.0037479461,"about_ca_system_score_codex":0.0007149183,"about_ca_system_score_gemma":0.00050309167,"threshold_uncertainty_score":0.012538135},"labels":[],"label_agreement":null},{"id":"W4220841793","doi":"10.1016/j.tcs.2022.03.034","title":"Fragile complexity of adaptive algorithms","year":2022,"lang":"en","type":"article","venue":"IT University Of Copenhagen (IT University of Copenhagen)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Danmarks Frie Forskningsfond; Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; National Foundation for Science and Technology Development","keywords":"Algorithm; Computer science; Mathematics; Theoretical computer science","score_opus":0.044222596587064754,"score_gpt":0.22849958261624062,"score_spread":0.18427698602917586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220841793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2519954,0.0014120511,0.7180644,0.0037419912,0.00022490082,0.00040188973,0.002438746,0.0046657342,0.01705489],"genre_scores_gemma":[0.78785485,0.00046075904,0.20108157,0.0008122196,0.0002859764,0.00064511754,0.0020277093,0.0008462461,0.0059854886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925074,0.0015971654,0.00073877565,0.0020088193,0.0021121867,0.0010356405],"domain_scores_gemma":[0.96239674,0.024406359,0.0023036252,0.0082543325,0.0017492628,0.00088976964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004223067,0.0013553604,0.0012789122,0.0013831215,0.0018064196,0.00394337,0.0039838497,0.0022904552,0.011888314],"category_scores_gemma":[0.040172935,0.00087518664,0.0019939921,0.0019038571,0.0031144014,0.011324795,0.003964772,0.003952057,0.0018921376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003616947,0.0004093813,0.0137210665,0.0009646171,0.00039890406,0.00036333478,0.000700073,0.49788794,0.032139435,0.2544449,0.017211795,0.17814156],"study_design_scores_gemma":[0.00015416203,0.00029146703,0.0018624658,0.000050548962,0.0001081223,0.0002659036,0.00010441426,0.7646502,0.007776147,0.22044392,0.0042283824,0.00006434003],"about_ca_topic_score_codex":0.0021554795,"about_ca_topic_score_gemma":0.0024318993,"teacher_disagreement_score":0.011888314,"about_ca_system_score_codex":0.0038923596,"about_ca_system_score_gemma":0.0033671455,"threshold_uncertainty_score":0.039770424},"labels":[],"label_agreement":null},{"id":"W4221096776","doi":"10.18280/isi.270102","title":"A Comprehensive Review of Low Density Parity Check Encoder Techniques","year":2022,"lang":"en","type":"review","venue":"Ingénierie des systèmes d information","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vision Group on Science and Technology; Visvesvaraya Technological University","keywords":"Low-density parity-check code; Computer science; Forward error correction; Encoder; Turbo code; Computer engineering; Parity bit; Error detection and correction; Algorithm; Theoretical computer science; Computer hardware; Decoding methods","score_opus":0.04396844722845289,"score_gpt":0.30870562923491723,"score_spread":0.26473718200646434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221096776","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011550821,0.9813075,0.0063625053,0.00040057328,0.0005498158,0.000030220785,0.0001645962,0.00009102601,0.009938733],"genre_scores_gemma":[0.006933963,0.9809027,0.0057840752,0.00033499658,0.00047455673,0.000034461234,0.00033044536,0.000022371272,0.005182399],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973065,0.000033288663,0.00003591065,0.00005043133,0.00012955598,0.000020236783],"domain_scores_gemma":[0.9994273,0.000277504,0.00005641042,0.00003078392,0.0001901919,0.000017905775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003626307,0.0007260754,0.0006239182,0.002643377,0.0002938302,0.00055806275,0.00082242984,0.0006838878,0.006425164],"category_scores_gemma":[0.0011227037,0.00036725574,0.00037759723,0.0023877125,0.00028261277,0.0013339376,0.00045828213,0.000817153,0.0029902803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004759421,0.000060033755,0.00032271878,0.009924396,0.00003740889,0.00016168215,0.00005090613,0.0009436928,0.0037021225,0.006099887,0.019731754,0.9589179],"study_design_scores_gemma":[0.0000072953385,0.0001645386,0.000750395,0.0019815692,0.00007236899,0.0016818015,0.000046249854,0.0008764915,0.0043244786,0.0026765103,0.9873838,0.000034490084],"about_ca_topic_score_codex":0.0009413626,"about_ca_topic_score_gemma":0.0009013484,"teacher_disagreement_score":0.006425164,"about_ca_system_score_codex":0.0003776325,"about_ca_system_score_gemma":0.00090679165,"threshold_uncertainty_score":0.021494329},"labels":[],"label_agreement":null},{"id":"W4225921667","doi":"10.1109/lcomm.2022.3163622","title":"Optimization and Simplification of PCPA Decoder for Reed-Muller Codes","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Algorithm; Computer science; Computational complexity theory; Projection (relational algebra); Pruning; Mathematics","score_opus":0.041252821202650516,"score_gpt":0.29731938619624476,"score_spread":0.25606656499359426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225921667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03464708,0.0002287356,0.9608091,0.00011423606,0.000024334,0.00006637024,0.00013779591,0.00091395783,0.0030584484],"genre_scores_gemma":[0.32807654,0.00031130796,0.66718763,0.00007409975,0.000030441523,0.00015932627,0.00046257392,0.00014348482,0.0035546534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934393,0.00017674548,0.000036973994,0.00006631503,0.0003085096,0.000067523084],"domain_scores_gemma":[0.9991887,0.00035023558,0.0000581646,0.0001102493,0.00026522373,0.0000274338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049730093,0.0008654337,0.000502318,0.00052150927,0.0004265603,0.0007281826,0.0006216857,0.00042615057,0.0020627258],"category_scores_gemma":[0.002186913,0.00032625656,0.00051119726,0.0006854002,0.00033519254,0.0006845728,0.0005923872,0.0006753725,0.0008270646],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003540948,0.00007068488,0.0012447666,0.0001858245,0.00007994643,0.00032101822,0.00017616949,0.6705632,0.06688542,0.036989838,0.0035418884,0.21958712],"study_design_scores_gemma":[0.000012992403,0.000050590057,0.00017726453,0.0000072495836,0.000015318503,0.00011409978,0.000011795179,0.9785186,0.017227994,0.0025540034,0.0012999728,0.000010186345],"about_ca_topic_score_codex":0.0046288483,"about_ca_topic_score_gemma":0.009053061,"teacher_disagreement_score":0.0046288483,"about_ca_system_score_codex":0.0008301119,"about_ca_system_score_gemma":0.0021463383,"threshold_uncertainty_score":0.009203792},"labels":[],"label_agreement":null},{"id":"W4230952094","doi":"10.1002/0471219282.eot359","title":"Product Codes","year":2003,"lang":"en","type":"other","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Product (mathematics); Computer science; Simple (philosophy); Algorithm; Mathematics; Philosophy","score_opus":0.015505900487459272,"score_gpt":0.26106378322441787,"score_spread":0.24555788273695858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230952094","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009284008,0.002632326,0.8148756,0.0008703365,0.0007673513,0.0002475051,0.0011120811,0.0017340486,0.16847676],"genre_scores_gemma":[0.29261288,0.006762338,0.5045602,0.0015273792,0.0012659992,0.0008334425,0.0037820558,0.0011858678,0.1874697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977871,0.0003760505,0.00012510087,0.00045651352,0.0010503572,0.00020479312],"domain_scores_gemma":[0.9964355,0.00091640186,0.00023430138,0.0009569533,0.0013375024,0.00011932095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794567,0.0009860252,0.0008465783,0.0017416584,0.0012400292,0.0030351705,0.0012218741,0.001071525,0.021914693],"category_scores_gemma":[0.0054965033,0.00038683484,0.0006827898,0.0026300289,0.0021009143,0.0029729896,0.0021632449,0.0017885409,0.011528682],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006275767,0.000020939471,0.00024934404,0.00016957326,0.000016054635,0.00014946116,0.00015386975,0.0043390347,0.0025754138,0.8584325,0.019192295,0.114638634],"study_design_scores_gemma":[0.000044108754,0.00008686552,0.00022474118,0.00023650288,0.000032866898,0.0011359752,0.00006931377,0.024080146,0.015604162,0.62184167,0.3365775,0.00006616452],"about_ca_topic_score_codex":0.0010325527,"about_ca_topic_score_gemma":0.00077535,"teacher_disagreement_score":0.021914693,"about_ca_system_score_codex":0.0011505717,"about_ca_system_score_gemma":0.0013503972,"threshold_uncertainty_score":0.073311925},"labels":[],"label_agreement":null},{"id":"W4231388260","doi":"10.22215/etd/2011-07043","title":"A method of lowering the complexity of the sum-product algorithm using graph transformations","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Graph; Combinatorics; Product (mathematics); Mathematics; Algorithm","score_opus":0.08456664445495168,"score_gpt":0.3380923853873098,"score_spread":0.25352574093235813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231388260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00581583,0.00013770032,0.9848897,0.00018494137,0.00015565888,0.00006526045,0.00005251782,0.0026739705,0.006024432],"genre_scores_gemma":[0.097761184,0.00027939826,0.888605,0.00021430198,0.00018240362,0.00018472735,0.0002833984,0.0016224512,0.010867087],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783725,0.000462568,0.00012972762,0.00040359172,0.00096637855,0.00020043687],"domain_scores_gemma":[0.99551743,0.0016618369,0.00017212564,0.0018734334,0.0006492907,0.00012598651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960458,0.0016400159,0.0010509689,0.0019678841,0.0012873926,0.0020717778,0.00242807,0.0009175277,0.01005366],"category_scores_gemma":[0.0065414524,0.0006185032,0.0016144324,0.00202408,0.0019997281,0.0036549605,0.0025651557,0.0032821125,0.0045169294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041459332,0.00031766214,0.00068949495,0.00034284664,0.00013566023,0.0001982105,0.0002665912,0.043948576,0.033111986,0.20947152,0.018697517,0.6924053],"study_design_scores_gemma":[0.00019202786,0.00038383325,0.00056677783,0.00006782333,0.00018070049,0.0008532501,0.00013890707,0.5564697,0.071866095,0.3331485,0.036030844,0.000101500176],"about_ca_topic_score_codex":0.002034724,"about_ca_topic_score_gemma":0.003154279,"teacher_disagreement_score":0.01005366,"about_ca_system_score_codex":0.00097071147,"about_ca_system_score_gemma":0.0023855383,"threshold_uncertainty_score":0.033632874},"labels":[],"label_agreement":null},{"id":"W4231417541","doi":"10.22215/etd/2021-14362","title":"ADMM Decoding of LDPC Codes: Simplification and Improvement","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; List decoding; Low-density parity-check code; Algorithm; Computer science; Scheduling (production processes); Sequential decoding; Belief propagation; Residual; Computational complexity theory; Mathematics; Theoretical computer science; Mathematical optimization; Concatenated error correction code; Block code","score_opus":0.013709123944068875,"score_gpt":0.2901795541285642,"score_spread":0.27647043018449535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231417541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021500655,0.00072365237,0.99209106,0.00025055284,0.00007408178,0.000021162352,0.000052798496,0.00011297599,0.0045236754],"genre_scores_gemma":[0.14558423,0.0038353563,0.834689,0.00035183728,0.00029852812,0.00016857464,0.00061067287,0.00026634344,0.014195518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989686,0.0003895002,0.000044461474,0.0001497147,0.00040041248,0.000047421614],"domain_scores_gemma":[0.9980934,0.0010358668,0.00010946281,0.00028851657,0.00044132557,0.00003141158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016998209,0.0011217474,0.0009674739,0.00073035026,0.00038129953,0.0010817307,0.00086548895,0.00086652127,0.0017506183],"category_scores_gemma":[0.008265197,0.00046963833,0.000716174,0.0013623753,0.0011128309,0.0017205185,0.001240718,0.0030305493,0.0015304754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008982529,0.000053339485,0.0004818906,0.00031065373,0.000056430694,0.00017731146,0.00019436449,0.5886973,0.0060947738,0.18803021,0.00682459,0.20898929],"study_design_scores_gemma":[0.0000075162106,0.000025342912,0.00007680519,0.000029697494,0.000008744838,0.00007518072,0.000010172129,0.9531518,0.0023002652,0.038257472,0.006048336,0.000008655858],"about_ca_topic_score_codex":0.0020699834,"about_ca_topic_score_gemma":0.0017811618,"teacher_disagreement_score":0.0020699834,"about_ca_system_score_codex":0.0009042288,"about_ca_system_score_gemma":0.0012202204,"threshold_uncertainty_score":0.008989632},"labels":[],"label_agreement":null},{"id":"W4233353082","doi":"10.1145/764813.764814","title":"Iterative decoding in analog CMOS","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CMOS; Computer science; Low-density parity-check code; Decoding methods; Turbo code; Electronic engineering; Electronic circuit; Hamming distance; Coding (social sciences); Algorithm; Electrical engineering; Engineering; Mathematics","score_opus":0.01920809034637836,"score_gpt":0.2750883874898317,"score_spread":0.25588029714345334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233353082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021127695,0.0011123552,0.9494,0.00023912152,0.00017077712,0.00006968343,0.000069892216,0.000978587,0.026831856],"genre_scores_gemma":[0.5276066,0.0014272437,0.45691255,0.0003664385,0.000107772954,0.00009957545,0.000109297274,0.00006442411,0.0133061465],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999688,0.00004641564,0.000019757636,0.00004251567,0.00017682,0.000026429287],"domain_scores_gemma":[0.99974316,0.00008382308,0.000021853924,0.000035875637,0.0001063608,0.000008962368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022294525,0.0002844206,0.00018091593,0.00027186106,0.00024949238,0.00071726175,0.0005420927,0.0005222731,0.002389127],"category_scores_gemma":[0.00096961384,0.00013456198,0.00020980186,0.0003056868,0.00028664139,0.0007191827,0.00034042544,0.00036164987,0.00087215775],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024418507,0.000073681236,0.0010296805,0.00044392943,0.00006163623,0.0005293763,0.00036088904,0.11916414,0.2317221,0.24704976,0.003191003,0.39612955],"study_design_scores_gemma":[0.0000796973,0.0004545936,0.00059557555,0.00014157605,0.000073706135,0.0013042652,0.00007919166,0.67402565,0.20499377,0.056389898,0.06179606,0.00006604084],"about_ca_topic_score_codex":0.0009844769,"about_ca_topic_score_gemma":0.0013559465,"teacher_disagreement_score":0.002389127,"about_ca_system_score_codex":0.00048692888,"about_ca_system_score_gemma":0.00047288617,"threshold_uncertainty_score":0.007992446},"labels":[],"label_agreement":null},{"id":"W4236216728","doi":"10.22215/etd/2008-07687","title":"Design and FPGA implementation of Min-Sum algorithm and its variants","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Intel Corporation","keywords":"Field-programmable gate array; Computer science; Arithmetic; Combinatorics; Algorithm; Mathematics; Operating system","score_opus":0.0270890520909588,"score_gpt":0.31463500960100727,"score_spread":0.28754595751004847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236216728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18134066,0.0036087579,0.7547169,0.0005351827,0.0006697489,0.00039675747,0.00061709515,0.0068797744,0.051235206],"genre_scores_gemma":[0.59209526,0.0008948196,0.38233936,0.00018137456,0.00010147795,0.00014386108,0.0006737327,0.00012867761,0.023441412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.00002480209,0.000013688317,0.00003245562,0.00006554027,0.000030159063],"domain_scores_gemma":[0.99985385,0.000024636116,0.000014275244,0.00003175885,0.00006533642,0.000010056675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014643533,0.0004127444,0.0002873791,0.0005588308,0.00032044275,0.0007564202,0.0007581573,0.00032339917,0.008071751],"category_scores_gemma":[0.0003217551,0.00018131918,0.00018962247,0.0005090718,0.00012842988,0.00042970997,0.00017001841,0.00027904887,0.0019194083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011374258,0.0001724375,0.002519087,0.0005751051,0.0001657618,0.0005316953,0.00019139991,0.043700013,0.16850868,0.022656355,0.013495292,0.7463467],"study_design_scores_gemma":[0.0005446052,0.0025647478,0.0067815296,0.00015644354,0.00022252781,0.0050762207,0.00028386948,0.33892286,0.4963265,0.007754317,0.14126097,0.000105394145],"about_ca_topic_score_codex":0.0013742835,"about_ca_topic_score_gemma":0.0024586748,"teacher_disagreement_score":0.008071751,"about_ca_system_score_codex":0.000376111,"about_ca_system_score_gemma":0.00059526035,"threshold_uncertainty_score":0.027002692},"labels":[],"label_agreement":null},{"id":"W4238310787","doi":"10.1002/9781118694077.ch3","title":"Decoding","year":2014,"lang":"en","type":"other","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Decoding methods; A priori and a posteriori; Key (lock); Computer science; Maximum a posteriori estimation; Algorithm; Maximum likelihood; Mathematics; Statistics; Philosophy; Computer security","score_opus":0.011340238009035693,"score_gpt":0.2532283741451989,"score_spread":0.2418881361361632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238310787","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035286155,0.012464931,0.51363194,0.0033841077,0.003974028,0.00025105383,0.002947723,0.0034792242,0.4563384],"genre_scores_gemma":[0.08099288,0.0334445,0.3365669,0.003855508,0.0022841387,0.00051887735,0.010754199,0.004346088,0.5272369],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986343,0.00022104886,0.00009452109,0.00024628712,0.0006463467,0.00015750233],"domain_scores_gemma":[0.998896,0.00028661796,0.000045837183,0.0002615454,0.00047031973,0.00003960032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090010266,0.0015844052,0.00095707644,0.0019686653,0.0014444422,0.0039458377,0.0017334438,0.0018234381,0.06489328],"category_scores_gemma":[0.0037396408,0.00043064923,0.00075082574,0.0019530607,0.0008569885,0.0035789828,0.0023645116,0.0016596271,0.0569304],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006831498,0.000041729334,0.000351838,0.00047792093,0.000028814595,0.00021350029,0.00028880817,0.008835997,0.0029903634,0.37081215,0.1379862,0.47790438],"study_design_scores_gemma":[0.000010768901,0.000038167418,0.00018303403,0.00027161368,0.000013460459,0.0007858911,0.0001200584,0.010858757,0.00549593,0.122942686,0.85924226,0.00003734676],"about_ca_topic_score_codex":0.0012334408,"about_ca_topic_score_gemma":0.0015154817,"teacher_disagreement_score":0.06489328,"about_ca_system_score_codex":0.0013062087,"about_ca_system_score_gemma":0.001268156,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4238520526","doi":"10.22215/etd/2007-06436","title":"Deterministic design and performance analysis of low-density parity-check codes in the presence of channel estimation error","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Parity (physics); Channel (broadcasting); Statistics; Mathematics; Computer science; Arithmetic; Algorithm; Telecommunications; Physics; Particle physics","score_opus":0.03258064332437866,"score_gpt":0.3247106313183559,"score_spread":0.29212998799397727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238520526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.334995,0.0024615447,0.64326906,0.0016286458,0.00014842168,0.00021544847,0.000432669,0.00087860355,0.015970608],"genre_scores_gemma":[0.9823533,0.00027972067,0.015948137,0.00006879645,0.000048910373,0.000062090854,0.00007722087,0.00004173731,0.0011199951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623436,0.001511933,0.00011814112,0.00036624583,0.0012230243,0.00054634776],"domain_scores_gemma":[0.9724864,0.021291645,0.0019796004,0.0014589916,0.0025577496,0.0002256045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042804168,0.0008021646,0.00067331624,0.0009589859,0.0008401753,0.0018287445,0.0012984063,0.0010573248,0.0017239914],"category_scores_gemma":[0.022041466,0.00077490014,0.00042900624,0.0007068986,0.0014043374,0.0013136575,0.0012353436,0.0009846968,0.00029414162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003157752,0.000068598034,0.002168938,0.00017243932,0.00007189861,0.00011300556,0.00010899035,0.93061143,0.0076656956,0.042498928,0.0006701312,0.015534066],"study_design_scores_gemma":[0.000024265013,0.00009681027,0.00038337416,0.000013695163,0.00002505784,0.000042438853,0.000013943983,0.98999244,0.0036318607,0.005554969,0.00020683704,0.000014437245],"about_ca_topic_score_codex":0.0034989365,"about_ca_topic_score_gemma":0.004780276,"teacher_disagreement_score":0.0042804168,"about_ca_system_score_codex":0.0034631635,"about_ca_system_score_gemma":0.0037120027,"threshold_uncertainty_score":0.025127113},"labels":[],"label_agreement":null},{"id":"W4239377843","doi":"10.22215/etd/2007-08035","title":"A comparison of rateless codes for wireless communication systems","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer science; Wireless; Telecommunications","score_opus":0.04905069650617674,"score_gpt":0.4070024422615681,"score_spread":0.3579517457553914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239377843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3812872,0.04254509,0.5001207,0.0016445582,0.0017696117,0.0006406191,0.0021920195,0.0037122115,0.06608805],"genre_scores_gemma":[0.88751763,0.008143996,0.091088496,0.00027934022,0.00030115191,0.00022965392,0.0014465889,0.00036383336,0.010629378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99370426,0.0017689705,0.00037929806,0.00033515034,0.0033913546,0.0004209416],"domain_scores_gemma":[0.97853684,0.0114370575,0.0009775382,0.002858547,0.0059045963,0.00028543232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040765754,0.0006871871,0.0008025794,0.0021580195,0.0005333577,0.0017392021,0.0013171121,0.0009702718,0.0049145687],"category_scores_gemma":[0.02489863,0.0001913771,0.00050369435,0.0017264903,0.00044125482,0.0024084384,0.0008750257,0.000634754,0.0010646143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00463278,0.00030685117,0.0033263292,0.0017893771,0.00040419813,0.0002229758,0.0002383441,0.2480155,0.025404377,0.08979043,0.009725032,0.6161438],"study_design_scores_gemma":[0.00039485015,0.0045123696,0.0055736066,0.00053678214,0.00047104794,0.0017315646,0.0003031541,0.8425114,0.05258487,0.039380312,0.05179696,0.00020301141],"about_ca_topic_score_codex":0.0015081735,"about_ca_topic_score_gemma":0.0016039182,"teacher_disagreement_score":0.0049145687,"about_ca_system_score_codex":0.0015477688,"about_ca_system_score_gemma":0.0019729468,"threshold_uncertainty_score":0.021559238},"labels":[],"label_agreement":null},{"id":"W4242123923","doi":"10.1002/9781118694077.index","title":"Index","year":2014,"lang":"en","type":"paratext","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Library science; Index (typography); Computer science","score_opus":0.015339356974587139,"score_gpt":0.2767310289075006,"score_spread":0.26139167193291346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242123923","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008375364,0.0022419023,0.012079125,0.0028430782,0.00639281,0.00027122337,0.009615126,0.0034668169,0.96225256],"genre_scores_gemma":[0.0029578148,0.001520073,0.0027701538,0.00047188706,0.001383903,0.000108080574,0.004648193,0.00079454575,0.9853453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991794,0.00011580903,0.00004310033,0.00012998848,0.00047379316,0.000057835226],"domain_scores_gemma":[0.99719304,0.0005665925,0.00012547598,0.00037916494,0.0013342414,0.0004015002],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058803515,0.0013785659,0.0012631586,0.004550572,0.0015789241,0.0046782573,0.0015863668,0.0015977641,0.72798777],"category_scores_gemma":[0.006066414,0.00034344682,0.00037679553,0.006532989,0.0006939016,0.0033420713,0.001604795,0.0013015444,0.6195819],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018257004,0.00003341499,0.000116400224,0.00017757261,0.0000037418683,0.000020548114,0.000016484975,0.0002199513,0.0002808692,0.008454655,0.8601146,0.13054353],"study_design_scores_gemma":[0.00000792114,0.000015831081,0.0002690382,0.00016375189,0.0000055156584,0.000050623723,0.000024648843,0.0007585651,0.00035945675,0.008329238,0.9900064,0.000008942318],"about_ca_topic_score_codex":0.0036763023,"about_ca_topic_score_gemma":0.005574993,"teacher_disagreement_score":0.27201223,"about_ca_system_score_codex":0.0018338285,"about_ca_system_score_gemma":0.0016635695,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4242334628","doi":"10.22215/etd/2011-07244","title":"Low-complexity distributed source coding","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Humanities; Art; Auteur theory; Political science; Art history","score_opus":0.04147501366450531,"score_gpt":0.28473676485864324,"score_spread":0.24326175119413793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242334628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009550225,0.00038284838,0.9755241,0.00044944338,0.00014286516,0.000072379415,0.00027510468,0.0010228128,0.012580165],"genre_scores_gemma":[0.44753376,0.0006485603,0.51522297,0.00029797776,0.00023831516,0.00034313602,0.0012710948,0.00030275033,0.034141473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808913,0.0003549927,0.00008224114,0.00024299622,0.0010697453,0.00016082235],"domain_scores_gemma":[0.99509096,0.002476594,0.00014245482,0.0013100115,0.00090308196,0.00007680509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500509,0.00067106093,0.00076086057,0.0010526689,0.0007323494,0.001908841,0.0016881644,0.0010414728,0.008791985],"category_scores_gemma":[0.006754481,0.00033034637,0.00055407867,0.0013220645,0.0008450493,0.0017667532,0.0020862303,0.0016900903,0.0027603973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045756137,0.00012059064,0.0009483388,0.00034436423,0.00007384849,0.00033260515,0.00024802948,0.23691979,0.021603623,0.31835288,0.016987247,0.40361118],"study_design_scores_gemma":[0.000070966424,0.000046797315,0.00022971709,0.000047384096,0.000022243219,0.00016654325,0.00003364207,0.85074323,0.009213226,0.12937027,0.0100315865,0.000024453848],"about_ca_topic_score_codex":0.0031677927,"about_ca_topic_score_gemma":0.0056604506,"teacher_disagreement_score":0.008791985,"about_ca_system_score_codex":0.0018119608,"about_ca_system_score_gemma":0.0021809214,"threshold_uncertainty_score":0.02941209},"labels":[],"label_agreement":null},{"id":"W4245226583","doi":"10.22215/etd/2007-08279","title":"Design automation and layout optimization of analog decoders","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Engineering","score_opus":0.020875307823719897,"score_gpt":0.308855637399405,"score_spread":0.28798032957568515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245226583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15415697,0.0018978716,0.8047926,0.0005135958,0.0002035689,0.00017112214,0.00046086803,0.0068298588,0.030973604],"genre_scores_gemma":[0.712845,0.0007776619,0.26421928,0.00020308979,0.00007120139,0.000092670816,0.00055439543,0.00058895245,0.020647723],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995328,0.00011249113,0.000030280908,0.00007229802,0.00018580057,0.00006640491],"domain_scores_gemma":[0.99941075,0.00019776312,0.00009166393,0.00008957941,0.0001916753,0.000018592225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027180585,0.000562042,0.00025623597,0.00058861607,0.00029038696,0.0009811415,0.00076409604,0.00031150552,0.0057786163],"category_scores_gemma":[0.0011679995,0.0003070942,0.0002610905,0.0004554257,0.00018940544,0.0004992973,0.0003029997,0.00037503403,0.0013290865],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002785548,0.00015980123,0.0017958446,0.0005305187,0.00006862544,0.00020501367,0.0001679169,0.21023849,0.2662767,0.010668015,0.006940923,0.50266963],"study_design_scores_gemma":[0.00013844646,0.00082218344,0.003631652,0.00009133472,0.00013169332,0.0005575738,0.00013950103,0.5982246,0.33335394,0.006689693,0.05617452,0.00004487088],"about_ca_topic_score_codex":0.001759901,"about_ca_topic_score_gemma":0.005112061,"teacher_disagreement_score":0.0057786163,"about_ca_system_score_codex":0.00081541686,"about_ca_system_score_gemma":0.0009963722,"threshold_uncertainty_score":0.019331396},"labels":[],"label_agreement":null},{"id":"W4247710302","doi":"10.22215/etd/2010-08928","title":"Performance analysis of iterative decoding algorithms with memory","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Arithmetic; Mathematics","score_opus":0.011104688060649643,"score_gpt":0.2760328361704499,"score_spread":0.26492814810980025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247710302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76221585,0.0053216103,0.20082422,0.0009093321,0.00016573675,0.00014813764,0.00070921046,0.0042374446,0.025468452],"genre_scores_gemma":[0.95196414,0.00059222395,0.041818675,0.000097834396,0.00006303268,0.000097631586,0.0006198114,0.00022338502,0.004523476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970368,0.0010158238,0.00018611434,0.00029729417,0.000927125,0.00053685985],"domain_scores_gemma":[0.9804335,0.014706171,0.00075405533,0.0013284183,0.0025392047,0.0002386436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021709679,0.0008842335,0.0007044724,0.0014119147,0.00080193224,0.001566762,0.0012690066,0.0011061335,0.004381619],"category_scores_gemma":[0.020533016,0.00032995103,0.00038155392,0.0016657709,0.0006680867,0.0017137057,0.0011386062,0.0005767112,0.0010459268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047228956,0.00026259286,0.0107335765,0.00035337012,0.00033328997,0.00020425033,0.00029155624,0.704166,0.021800451,0.016984027,0.003981547,0.23616643],"study_design_scores_gemma":[0.000070052716,0.00041890529,0.0013005241,0.000025474163,0.000071025774,0.00017928073,0.00005646841,0.9713789,0.022991562,0.0027243018,0.0007519119,0.00003158933],"about_ca_topic_score_codex":0.005949944,"about_ca_topic_score_gemma":0.006912671,"teacher_disagreement_score":0.005949944,"about_ca_system_score_codex":0.0018742317,"about_ca_system_score_gemma":0.0025587548,"threshold_uncertainty_score":0.014657974},"labels":[],"label_agreement":null},{"id":"W4250473291","doi":"10.1002/9781118694077.ch1","title":"Introduction","year":2014,"lang":"en","type":"other","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Business; Computer science","score_opus":0.006752758457989014,"score_gpt":0.23231354133611629,"score_spread":0.22556078287812728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250473291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085673324,0.014778628,0.009833556,0.008984265,0.012001335,0.0001511986,0.0032176236,0.0015567234,0.94862],"genre_scores_gemma":[0.0033789398,0.008186847,0.0040589776,0.0026240079,0.002178596,0.0000844859,0.0030140944,0.0006403353,0.9758336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991013,0.000095441144,0.00004569509,0.000212546,0.00045988944,0.00008512366],"domain_scores_gemma":[0.999151,0.00017608069,0.000044972676,0.00010191255,0.00038170675,0.00014418828],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054469093,0.0010724559,0.00084440986,0.0013222175,0.0014930448,0.0048892647,0.0018412576,0.0021867694,0.41733593],"category_scores_gemma":[0.0029395323,0.00037542984,0.00063799607,0.0016330415,0.00072506064,0.004073568,0.0022837059,0.0023512398,0.31269643],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026560087,0.000034965826,0.00018567384,0.0002875748,0.000004975566,0.00010279457,0.0003001734,0.0002317128,0.00042660776,0.0345085,0.799651,0.16423944],"study_design_scores_gemma":[9.389367e-7,0.000005580032,0.00006695327,0.00008162604,8.291225e-7,0.0000694797,0.00004678038,0.000026209525,0.000045024048,0.0026026033,0.99705124,0.0000026392668],"about_ca_topic_score_codex":0.001592117,"about_ca_topic_score_gemma":0.002574535,"teacher_disagreement_score":0.5826641,"about_ca_system_score_codex":0.001538788,"about_ca_system_score_gemma":0.0014593737,"threshold_uncertainty_score":0.83109957},"labels":[],"label_agreement":null},{"id":"W4251376418","doi":"10.1007/978-3-319-59782-9_1","title":"Polar Codes","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; École de Technologie Supérieure","funders":"","keywords":"Polar; Geography; Physics; Astronomy","score_opus":0.03250211906446758,"score_gpt":0.2735392866613635,"score_spread":0.24103716759689592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251376418","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016036488,0.0085732285,0.081579186,0.0009881051,0.0030043132,0.000062590094,0.0005388685,0.00063607434,0.903014],"genre_scores_gemma":[0.03722216,0.017082065,0.041046247,0.0011997874,0.0014468216,0.00013551158,0.0013040222,0.0010126692,0.8995507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996101,0.00005196998,0.000013185335,0.000064701504,0.00022093423,0.00003908888],"domain_scores_gemma":[0.9995178,0.00010304426,0.000022639746,0.00009557166,0.00023100096,0.000029898234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025857356,0.001117634,0.0004889854,0.002010056,0.0010689705,0.002476657,0.0006451178,0.00082976825,0.072442904],"category_scores_gemma":[0.0014159092,0.0004095294,0.00028483712,0.0020953245,0.0013003281,0.0023841576,0.0014678241,0.002272974,0.046283145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027892724,0.000015999703,0.00006550132,0.00023377022,0.000005694911,0.000048595743,0.00014516617,0.0012345439,0.0021580607,0.62870425,0.10977112,0.25758943],"study_design_scores_gemma":[0.000004576235,0.000013074903,0.000060410537,0.00016367035,0.000004835081,0.00022016335,0.000050501472,0.0009405102,0.0031117774,0.13359386,0.86182207,0.000014535923],"about_ca_topic_score_codex":0.0007543791,"about_ca_topic_score_gemma":0.0010067995,"teacher_disagreement_score":0.072442904,"about_ca_system_score_codex":0.0009602828,"about_ca_system_score_gemma":0.0009722452,"threshold_uncertainty_score":0.24234563},"labels":[],"label_agreement":null},{"id":"W4253642905","doi":"10.22215/etd/2005-08504","title":"Robust image transmission with rate-compatible low-density parity-check codes over noisy channels","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Parity (physics); Transmission (telecommunications); Computer science; Mathematics; Physics; Telecommunications; Particle physics","score_opus":0.016287891708562947,"score_gpt":0.26019415858105793,"score_spread":0.24390626687249498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253642905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46509683,0.00082137506,0.51564825,0.0011214848,0.00023378902,0.000069603644,0.0003076864,0.0012157547,0.015485227],"genre_scores_gemma":[0.95767766,0.00031659388,0.03649815,0.000086196764,0.0000912878,0.000028753595,0.00010516925,0.00008222678,0.0051139956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994584,0.00011310288,0.000025095995,0.000059143586,0.00027409362,0.00007006194],"domain_scores_gemma":[0.99804807,0.0009346113,0.0003685507,0.00035572666,0.00024475588,0.00004829688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705824,0.0003984542,0.0004051883,0.0004016217,0.00027596075,0.0008303963,0.0004885249,0.0006271815,0.001562507],"category_scores_gemma":[0.0043476033,0.00022378755,0.0001840929,0.00032772735,0.00047888985,0.0008807179,0.00076734874,0.0005745476,0.00043015156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028574786,0.00019805883,0.0024114265,0.0004580622,0.00015894862,0.0014164505,0.00055685884,0.23326087,0.4699387,0.113080345,0.005364662,0.17029811],"study_design_scores_gemma":[0.0001145813,0.00028237136,0.0009944027,0.00005185297,0.00006670191,0.0004916319,0.000060461753,0.78051054,0.19537719,0.019087607,0.0029001818,0.00006252849],"about_ca_topic_score_codex":0.0005468495,"about_ca_topic_score_gemma":0.00058636174,"teacher_disagreement_score":0.001562507,"about_ca_system_score_codex":0.0004044888,"about_ca_system_score_gemma":0.0003514738,"threshold_uncertainty_score":0.005227089},"labels":[],"label_agreement":null},{"id":"W4255746332","doi":"10.22215/etd/2016-11714","title":"Code Design for Incremental Redundancy Hybrid ARQ","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Puncturing; Low-density parity-check code; Computer science; Turbo code; Forward error correction; Algorithm; Code rate; Error detection and correction; Automatic repeat request; Decoding methods; Computer network; Telecommunications; Telecommunications link","score_opus":0.036014314535194984,"score_gpt":0.3123210348762377,"score_spread":0.2763067203410427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255746332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012446791,0.00024205458,0.98519343,0.0000844476,0.00002736388,0.00003828826,0.000030309398,0.00018152285,0.0017557853],"genre_scores_gemma":[0.36846712,0.00041148078,0.6283007,0.0002072371,0.00005641619,0.00019235314,0.00013490063,0.000096622854,0.0021331417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00025571726,0.000041559622,0.00012469286,0.00037551834,0.00006276861],"domain_scores_gemma":[0.997997,0.00086591404,0.00029012345,0.00026374758,0.00054188084,0.00004119549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092886307,0.00046001576,0.00032406676,0.0005589912,0.00034328725,0.00061762845,0.0009993174,0.00061295787,0.0011445944],"category_scores_gemma":[0.0033149014,0.00023917346,0.0002786947,0.0005090796,0.0006917702,0.000681906,0.0007403779,0.00062772626,0.0004820771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001832032,0.00005421403,0.0010663394,0.00031969478,0.000058973845,0.00032348253,0.00036253763,0.48308724,0.051756714,0.26213923,0.002383604,0.19826472],"study_design_scores_gemma":[0.000028930526,0.00013167066,0.00012640588,0.000035554964,0.000016894413,0.00025482388,0.00003406587,0.9447388,0.015740322,0.032198608,0.006665002,0.000028821143],"about_ca_topic_score_codex":0.00072942866,"about_ca_topic_score_gemma":0.0007412269,"teacher_disagreement_score":0.0011445944,"about_ca_system_score_codex":0.00050875527,"about_ca_system_score_gemma":0.0007393535,"threshold_uncertainty_score":0.0049123764},"labels":[],"label_agreement":null},{"id":"W4256753373","doi":"10.22215/etd/2011-07099","title":"New interative decoding algorithms for low-density parity-check (LDPC) codes","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Algorithm; Arithmetic; Mathematics","score_opus":0.04367872415879104,"score_gpt":0.32566747299438464,"score_spread":0.2819887488355936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256753373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008534582,0.00040666756,0.982601,0.00022877134,0.00025470834,0.000102345955,0.00014864687,0.0010465184,0.0066767964],"genre_scores_gemma":[0.095183946,0.0007481397,0.87711614,0.00035042688,0.00028600177,0.00035003808,0.0009606139,0.00048101105,0.02452361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982162,0.00038520823,0.00016788964,0.0002617341,0.0007931135,0.00017576385],"domain_scores_gemma":[0.9967128,0.0013422777,0.00021242711,0.000628847,0.0010214135,0.00008233257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014483946,0.0012195458,0.00081148965,0.0017348686,0.0011978443,0.0030975745,0.0018007461,0.0015395691,0.007578779],"category_scores_gemma":[0.0075809103,0.0005842761,0.00088446436,0.0015244235,0.00090743165,0.0029304062,0.002118233,0.0021432482,0.0049391054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038241362,0.00025019387,0.0013239357,0.00024716914,0.00011777119,0.00018838671,0.00038590335,0.11050173,0.020601619,0.14268124,0.012189521,0.71113],"study_design_scores_gemma":[0.000087524684,0.00011587918,0.00042961276,0.00008555713,0.00005922013,0.00039018472,0.000096268705,0.88327503,0.027580582,0.07185363,0.01596104,0.000065399356],"about_ca_topic_score_codex":0.002130637,"about_ca_topic_score_gemma":0.0058262674,"teacher_disagreement_score":0.007578779,"about_ca_system_score_codex":0.0013422162,"about_ca_system_score_gemma":0.0019240105,"threshold_uncertainty_score":0.02535355},"labels":[],"label_agreement":null},{"id":"W4280540326","doi":"10.1002/cta.3320","title":"A stochastic computing architecture for local contrast and mean image thresholding algorithm","year":2022,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic computing; Computer science; Overhead (engineering); Algorithm; Thresholding; Energy consumption; Energy (signal processing); Pixel; Binary number; Contrast (vision); Image (mathematics); Fault (geology); Artificial intelligence; Mathematics; Engineering; Arithmetic; Statistics","score_opus":0.010906762227304419,"score_gpt":0.27707222199316855,"score_spread":0.26616545976586414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280540326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18353929,0.00033467452,0.8072795,0.00031147845,0.000084314284,0.00008493797,0.00009684988,0.0029087013,0.005360239],"genre_scores_gemma":[0.85638875,0.00007994212,0.14065637,0.00012735497,0.000020699834,0.000050035855,0.00009337031,0.00003571702,0.0025475963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971503,0.0000356479,0.000024951027,0.00006475063,0.00012289351,0.00003671749],"domain_scores_gemma":[0.99970335,0.00006254264,0.00004620013,0.000047697737,0.00012033884,0.000019801042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019190134,0.00022906905,0.00020968867,0.0004894466,0.00048890733,0.0004752043,0.0008636144,0.00027871437,0.0018873906],"category_scores_gemma":[0.0006276626,0.00014156057,0.00020615243,0.00046879036,0.00020733615,0.0004383737,0.00031105056,0.00028597264,0.00033143058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006932145,0.0003081181,0.0041091875,0.000198822,0.000096337055,0.0003151017,0.00025465395,0.12647758,0.32171884,0.030346958,0.006286817,0.5091944],"study_design_scores_gemma":[0.000034293233,0.00040651252,0.0014864748,0.000017955288,0.000045531477,0.00030865206,0.00002709154,0.88248503,0.10578683,0.0037219482,0.0056477846,0.000031814357],"about_ca_topic_score_codex":0.0024939422,"about_ca_topic_score_gemma":0.004427798,"teacher_disagreement_score":0.0024939422,"about_ca_system_score_codex":0.00081858854,"about_ca_system_score_gemma":0.00090367283,"threshold_uncertainty_score":0.00631392},"labels":[],"label_agreement":null},{"id":"W4285407559","doi":"10.1109/cwit55308.2022.9817664","title":"Single-Minimum LDPC Decoding Offset Optimization Methods","year":2022,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Heuristics; Computational complexity theory; Node (physics); Algorithm; Offset (computer science); Sequential decoding; List decoding; Optimization problem; Mathematical optimization; Theoretical computer science; Mathematics; Concatenated error correction code; Block code","score_opus":0.047823237960310176,"score_gpt":0.33661207198090465,"score_spread":0.28878883402059446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285407559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035916471,0.000304616,0.99154246,0.00010435118,0.000020853206,0.00002511206,0.000042512675,0.000159322,0.004209158],"genre_scores_gemma":[0.23885788,0.0007973583,0.7493644,0.00015859684,0.00005132638,0.00025047438,0.00022244468,0.0003121696,0.009985346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975127,0.0000681968,0.000013685914,0.000040545117,0.00009976681,0.0000265693],"domain_scores_gemma":[0.9993523,0.00042479695,0.000036838337,0.000054530465,0.00011431041,0.00001723234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004085226,0.00070576224,0.00071553444,0.0004632737,0.00029991014,0.0005655236,0.0008352948,0.0007005228,0.003929858],"category_scores_gemma":[0.002089293,0.00035817054,0.00037897142,0.0006973177,0.00046888014,0.0006495908,0.00078471866,0.00092088245,0.00086141966],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035076475,0.000024360104,0.00024278062,0.00015841487,0.000022476237,0.000044827997,0.00006133926,0.83588403,0.0025589622,0.067371316,0.0017433456,0.09185298],"study_design_scores_gemma":[0.0000071297823,0.000007346123,0.000028455039,0.000009319817,0.0000027554477,0.000012321061,0.0000048654188,0.98869926,0.00089966506,0.009214739,0.0011101861,0.000003944017],"about_ca_topic_score_codex":0.0023308818,"about_ca_topic_score_gemma":0.0029756534,"teacher_disagreement_score":0.003929858,"about_ca_system_score_codex":0.0008346444,"about_ca_system_score_gemma":0.001299677,"threshold_uncertainty_score":0.0131466985},"labels":[],"label_agreement":null},{"id":"W4285407565","doi":"10.1109/cwit55308.2022.9817675","title":"Protograph-based LDPC codes with chordless short cycles and large minimum distance","year":2022,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Code (set theory); Chord (peer-to-peer); Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Algorithm; Mathematics; Artificial intelligence; Database; Programming language","score_opus":0.011459332708373408,"score_gpt":0.2503949496481004,"score_spread":0.23893561693972698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285407565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48668444,0.0014557333,0.48194775,0.0011606138,0.00011293778,0.000196151,0.0010775956,0.0012720535,0.026092682],"genre_scores_gemma":[0.9106653,0.0007660796,0.079713896,0.00024711632,0.000033156724,0.00017729458,0.000592933,0.0001320796,0.007672099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994584,0.00009633573,0.000028187516,0.0001050803,0.00018639458,0.00012563996],"domain_scores_gemma":[0.9974112,0.001318488,0.00030349032,0.0004965377,0.0003110669,0.00015931713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037298191,0.0007646238,0.0004619758,0.00059309957,0.0007070215,0.0008134689,0.00080219406,0.00080768403,0.0023913602],"category_scores_gemma":[0.0034453215,0.00033343481,0.00035582614,0.00090241403,0.0009521676,0.0011171944,0.0010848669,0.0011121734,0.0006628007],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007952614,0.00016655013,0.0018133125,0.0004549935,0.000084462445,0.00042090256,0.00035349134,0.43963584,0.110112935,0.35647538,0.005596962,0.08408997],"study_design_scores_gemma":[0.0001115477,0.00025201272,0.00079945853,0.00006461946,0.000037032005,0.00041806838,0.000073160554,0.78796583,0.05998852,0.14161633,0.008606078,0.000067355606],"about_ca_topic_score_codex":0.0032563226,"about_ca_topic_score_gemma":0.004888276,"teacher_disagreement_score":0.0032563226,"about_ca_system_score_codex":0.0014533458,"about_ca_system_score_gemma":0.0018546246,"threshold_uncertainty_score":0.010544777},"labels":[],"label_agreement":null},{"id":"W4285506362","doi":"10.1109/twc.2022.3189604","title":"Ising Machines’ Dynamics and Regularization for Near-Optimal MIMO Detection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; National Aeronautics and Space Administration; Universities Space Research Association; National Science Foundation","keywords":"MIMO; Ising model; Computer science; Algorithm; Multi-user MIMO; Wireless; Fading; Theoretical computer science; Mathematics; Channel (broadcasting); Decoding methods; Telecommunications; Physics","score_opus":0.01943089498498642,"score_gpt":0.2709997502281236,"score_spread":0.2515688552431372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285506362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030153444,0.00031369532,0.96436954,0.00063332013,0.00005189187,0.000017032815,0.000039022612,0.00017279023,0.004249306],"genre_scores_gemma":[0.81254977,0.0005353231,0.18102337,0.00030868876,0.0001217269,0.00009870491,0.00010145263,0.00012886114,0.0051320614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.00010695087,0.000009852433,0.000038245187,0.0000848276,0.000029947307],"domain_scores_gemma":[0.9987967,0.0007726346,0.00014833634,0.0001123292,0.000113576476,0.000056350204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070402375,0.00043050313,0.00048489808,0.00040221674,0.00034182583,0.00067660876,0.00065114535,0.0009226166,0.0015565183],"category_scores_gemma":[0.004171979,0.00028353362,0.0003825717,0.00032168548,0.0012370746,0.0012355573,0.0007169631,0.001267542,0.00027324609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036711914,0.00002249346,0.0004989462,0.000055068394,0.000021240317,0.00006096091,0.000073079114,0.6931581,0.0043516145,0.28949285,0.0014417963,0.0107871555],"study_design_scores_gemma":[0.0000025524926,0.0000048107536,0.00005029532,0.0000026950233,0.0000010210656,0.000009969729,0.0000031357592,0.9627154,0.00029950516,0.036643982,0.00026228177,0.0000043622567],"about_ca_topic_score_codex":0.0012141643,"about_ca_topic_score_gemma":0.0010481093,"teacher_disagreement_score":0.0015565183,"about_ca_system_score_codex":0.0008054532,"about_ca_system_score_gemma":0.0007452804,"threshold_uncertainty_score":0.005843997},"labels":[],"label_agreement":null},{"id":"W4287589184","doi":"10.48550/arxiv.2011.12882","title":"Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller\\n Codes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computer science; Computation; Cyclic redundancy check; Soft-decision decoder; Decoding methods; Algorithm; Projection (relational algebra); Selection (genetic algorithm); Code (set theory); Artificial intelligence","score_opus":0.16919987627814995,"score_gpt":0.24214928014510767,"score_spread":0.07294940386695772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287589184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07880994,0.00039113598,0.9159653,0.00011029425,0.00003344547,0.00006371256,0.00008503994,0.0017138671,0.0028272283],"genre_scores_gemma":[0.51841336,0.00021864723,0.47715327,0.00007605726,0.00004667662,0.0000828441,0.00022207918,0.00006350575,0.003723593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.00015964745,0.00003374125,0.00010059193,0.00031489454,0.000080659396],"domain_scores_gemma":[0.99929345,0.00024782278,0.000081684404,0.00016080802,0.0001797896,0.000036469322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076714,0.0005964084,0.00058105425,0.00055758294,0.00053390395,0.0005879082,0.00063086423,0.00036347224,0.0011196556],"category_scores_gemma":[0.0012754033,0.00023771866,0.00035599273,0.0006639599,0.00035541592,0.00057073525,0.0010201188,0.0007045792,0.00041773607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067187217,0.00014666656,0.0022524192,0.00017091256,0.00010547759,0.00048171316,0.00027624788,0.30233812,0.109832056,0.03269077,0.0030496411,0.54798406],"study_design_scores_gemma":[0.000019368224,0.00012987328,0.00053581706,0.000013179609,0.00002002308,0.00022456214,0.000019410736,0.9462354,0.046242144,0.004543478,0.0020007142,0.000015996953],"about_ca_topic_score_codex":0.0027273265,"about_ca_topic_score_gemma":0.0053055575,"teacher_disagreement_score":0.0027273265,"about_ca_system_score_codex":0.0005254343,"about_ca_system_score_gemma":0.0013171547,"threshold_uncertainty_score":0.00542289},"labels":[],"label_agreement":null},{"id":"W4288071811","doi":"10.1109/jlt.2022.3193635","title":"Zipper Codes","year":2022,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zipper; Diagonal; Concatenated error correction code; Block code; Computer science; Serial concatenated convolutional codes; Turbo code; Algorithm; Decoding methods; Linear code; Theoretical computer science; Mathematics","score_opus":0.009033086254132206,"score_gpt":0.243613065919382,"score_spread":0.2345799796652498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288071811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029845696,0.002274862,0.900429,0.00069442426,0.0004001713,0.00031565988,0.0027136107,0.0021667848,0.061159693],"genre_scores_gemma":[0.6336181,0.0045150686,0.2850225,0.0017565505,0.00074120937,0.0011595306,0.003893697,0.0011304121,0.068163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977633,0.00042601133,0.00012199506,0.0003952787,0.0009182984,0.00037503624],"domain_scores_gemma":[0.9955354,0.0015646508,0.00041930267,0.00096622494,0.0013449142,0.0001694603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010383555,0.0008839466,0.0012519677,0.002963274,0.0016257378,0.002636778,0.0015273716,0.0016866302,0.014966342],"category_scores_gemma":[0.007876848,0.00042342456,0.0008472032,0.0028950295,0.0020527656,0.0030695088,0.0016584347,0.0019556864,0.0065278225],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011630587,0.000028773944,0.00059406314,0.00017225619,0.000026934275,0.00027495503,0.00019095301,0.029019363,0.003538159,0.91701746,0.01205719,0.03696368],"study_design_scores_gemma":[0.00004064829,0.00008550255,0.00038214697,0.00011909997,0.000026959897,0.0007084048,0.00010348602,0.15458585,0.0057197683,0.78178036,0.056356944,0.00009091991],"about_ca_topic_score_codex":0.00188554,"about_ca_topic_score_gemma":0.001689052,"teacher_disagreement_score":0.014966342,"about_ca_system_score_codex":0.0014068426,"about_ca_system_score_gemma":0.0015600771,"threshold_uncertainty_score":0.050067365},"labels":[],"label_agreement":null},{"id":"W4289655346","doi":"10.1109/isit50566.2022.9834637","title":"On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Coupling (piping); Enhanced Data Rates for GSM Evolution; Code (set theory); Decoding methods; Probabilistic logic; Computer science; Algorithm; Discrete mathematics; Statistics; Telecommunications","score_opus":0.00882573477938818,"score_gpt":0.2607892121112024,"score_spread":0.2519634773318142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7238952,0.0012051291,0.26956972,0.00044963614,0.000037770402,0.000049828603,0.00024908123,0.00031228425,0.0042312625],"genre_scores_gemma":[0.99263775,0.00034492393,0.0058633634,0.000038087317,0.00002288505,0.000040293653,0.00011380384,0.000056542656,0.00088236557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992754,0.00015605905,0.00003290706,0.00018150774,0.0002750415,0.000079111014],"domain_scores_gemma":[0.991085,0.006155673,0.0011324682,0.00058728317,0.00066522905,0.00037426414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104178,0.00031314857,0.0005365811,0.0013479795,0.00079694326,0.0010335314,0.0012671266,0.00083608995,0.0016290948],"category_scores_gemma":[0.010959226,0.000508312,0.00038743086,0.0008786726,0.0018268323,0.0022365213,0.00085071276,0.00073338585,0.00017351171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047608538,0.00009370341,0.015266293,0.00035400232,0.00014259412,0.000746728,0.0005338176,0.5848375,0.048415396,0.32513636,0.0009140638,0.023083378],"study_design_scores_gemma":[0.000018796884,0.000065633416,0.0031346537,0.000037166476,0.00002947623,0.00035336192,0.0000629434,0.9124144,0.009340511,0.07379726,0.00069534755,0.000050461294],"about_ca_topic_score_codex":0.001303878,"about_ca_topic_score_gemma":0.0012715056,"teacher_disagreement_score":0.0016290948,"about_ca_system_score_codex":0.0013089841,"about_ca_system_score_gemma":0.00067170116,"threshold_uncertainty_score":0.0094973445},"labels":[],"label_agreement":null},{"id":"W4289655494","doi":"10.1109/isit50566.2022.9834504","title":"A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Channel (broadcasting); Computer science; Gaussian; Code (set theory); Decoding methods; Set (abstract data type); Mathematics; Telecommunications; Physics","score_opus":0.01563210318946117,"score_gpt":0.27974107896750317,"score_spread":0.264108975778042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138030555,0.00018745114,0.9843461,0.00010009137,0.00002165627,0.000019979385,0.0000874559,0.00026445967,0.0011698598],"genre_scores_gemma":[0.93122697,0.00050973974,0.06265357,0.00010891962,0.00005390997,0.00017197344,0.0002691353,0.00010682189,0.0048990236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934846,0.00020896608,0.00003063471,0.00014538532,0.0001877581,0.00007883361],"domain_scores_gemma":[0.99861157,0.0007648913,0.00019709943,0.00012820809,0.0002755656,0.000022573964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067935686,0.0007783248,0.0007711668,0.0005588261,0.0004114961,0.000943648,0.0011513996,0.0008658419,0.0014162754],"category_scores_gemma":[0.002400093,0.0003827346,0.00054439355,0.00066801027,0.0009058715,0.0018929123,0.00066789123,0.0013123107,0.0005739051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037859936,0.000016320886,0.00045279643,0.000037510283,0.00001849933,0.000047933343,0.00004585904,0.976424,0.001973147,0.013261784,0.00021283899,0.007471551],"study_design_scores_gemma":[0.000001019333,0.000006762643,0.000036711957,0.0000017256889,0.0000024721594,0.000008627613,0.0000018308231,0.998302,0.00027822764,0.001280411,0.0000771784,0.0000030826873],"about_ca_topic_score_codex":0.005139148,"about_ca_topic_score_gemma":0.0038074523,"teacher_disagreement_score":0.005139148,"about_ca_system_score_codex":0.0008191367,"about_ca_system_score_gemma":0.0008508693,"threshold_uncertainty_score":0.0102184415},"labels":[],"label_agreement":null},{"id":"W4300182065","doi":"10.48550/arxiv.1701.02379","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random\\n Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Combinatorics; Discrete mathematics; Degree (music); Distribution (mathematics); Graph; Decoding methods; Algorithm; Statistics; Mathematical analysis; Physics","score_opus":0.050859673097692785,"score_gpt":0.21288096894637307,"score_spread":0.16202129584868027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300182065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6720424,0.0012125949,0.31374466,0.0007751457,0.000046202887,0.00009233455,0.0004994678,0.00043383215,0.011153256],"genre_scores_gemma":[0.9865137,0.0007108698,0.008593281,0.00010433381,0.00005544626,0.00007123753,0.00029672598,0.00011859021,0.0035359636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993606,0.00022792858,0.00001453389,0.00012691667,0.00016721268,0.00010278417],"domain_scores_gemma":[0.9948704,0.0032113718,0.0006042402,0.00048907014,0.00056463684,0.00026019095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417106,0.0005364561,0.0005372986,0.0017089043,0.00053335796,0.00098841,0.0009259538,0.00078508776,0.0019696953],"category_scores_gemma":[0.008398288,0.0004055297,0.00039506605,0.0009224179,0.001848749,0.0019343613,0.0007865027,0.0008463911,0.00029331888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024328356,0.00008228513,0.0073860087,0.0001288665,0.00006521674,0.00037455646,0.00038426134,0.4386706,0.012452208,0.52502024,0.0019296131,0.013262824],"study_design_scores_gemma":[0.0000103035045,0.00002602414,0.001427231,0.000020238533,0.00000768711,0.00011862672,0.000040915213,0.94337964,0.001940474,0.052404687,0.0005982499,0.000025993431],"about_ca_topic_score_codex":0.0029649737,"about_ca_topic_score_gemma":0.0025186925,"teacher_disagreement_score":0.0029649737,"about_ca_system_score_codex":0.001755428,"about_ca_system_score_gemma":0.00081731187,"threshold_uncertainty_score":0.0127366185},"labels":[],"label_agreement":null},{"id":"W4300293483","doi":"10.48550/arxiv.1708.04706","title":"On Error-Correction Performance and Implementation of Polar Code List\\n Decoders for 5G","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Low-density parity-check code; Polar code; Error detection and correction; Polar; Energy consumption; Computer engineering; Algorithm; Implementation; Throughput; Code (set theory); Latency (audio); Efficient energy use; Wireless; Set (abstract data type); Telecommunications; Electrical engineering; Engineering","score_opus":0.08010558887652235,"score_gpt":0.25932717101603786,"score_spread":0.1792215821395155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300293483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9322598,0.0032928789,0.04048619,0.0004281837,0.00015597648,0.000091668655,0.00074239966,0.0017197999,0.020823123],"genre_scores_gemma":[0.97944355,0.00089375116,0.015144396,0.00011426526,0.000029778183,0.0000339072,0.00068689033,0.000098331424,0.0035551288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863905,0.00027250478,0.0000851027,0.00016927808,0.0005851453,0.00024894445],"domain_scores_gemma":[0.99725527,0.0013861217,0.0002614821,0.00024865023,0.00080186926,0.000046546724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088638,0.0007919789,0.00037047188,0.0009699414,0.00038312448,0.0007731237,0.00092355104,0.00047900176,0.0039542876],"category_scores_gemma":[0.0035840538,0.0001337012,0.00025517374,0.00095593726,0.00030349637,0.0010770357,0.0003679826,0.00030639992,0.000889799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030840812,0.0005343272,0.016809812,0.0010379031,0.00028506946,0.00060506444,0.0003456442,0.508923,0.15562485,0.0069803544,0.006644674,0.29912528],"study_design_scores_gemma":[0.00008491236,0.0020862399,0.006883587,0.00011344176,0.00014563322,0.00041423985,0.00018700033,0.7125656,0.27132425,0.0007996749,0.005336001,0.00005945111],"about_ca_topic_score_codex":0.007438671,"about_ca_topic_score_gemma":0.010211724,"teacher_disagreement_score":0.007438671,"about_ca_system_score_codex":0.0010572205,"about_ca_system_score_gemma":0.0010527285,"threshold_uncertainty_score":0.014790714},"labels":[],"label_agreement":null},{"id":"W4300653865","doi":"10.48550/arxiv.1512.01132","title":"Spatially-coupled Split-component Codes with Iterative Algebraic\\n Decoding","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Binary erasure channel; Decoding methods; Block code; Sequential decoding; Binary symmetric channel; Algorithm; List decoding; Concatenated error correction code; Recursion (computer science); Reed–Muller code; Computer science; Low-density parity-check code; Component (thermodynamics); Mathematics; Channel (broadcasting); Channel capacity","score_opus":0.08084402831915222,"score_gpt":0.21171486366703082,"score_spread":0.1308708353478786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300653865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25411642,0.00019591185,0.7348147,0.00018923513,0.000029105928,0.000057167083,0.000072500115,0.00021178862,0.010313138],"genre_scores_gemma":[0.9218586,0.0001867049,0.0736923,0.00005293454,0.000027416598,0.00006608109,0.00007235681,0.00006243438,0.003981221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.00010742312,0.000018380488,0.000065158834,0.0002946136,0.00008384739],"domain_scores_gemma":[0.99852365,0.0007345324,0.000215941,0.00016524372,0.00027529182,0.00008532861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055502425,0.0006561943,0.00040309018,0.0005847731,0.00047296894,0.0007649696,0.0009437299,0.00076402404,0.0010002442],"category_scores_gemma":[0.0030025868,0.00021288755,0.0004116281,0.000508781,0.0013894354,0.00095854973,0.0012172312,0.0009721544,0.00029077064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000873629,0.00005281155,0.001018,0.00006492885,0.000029654557,0.0001699032,0.00021143697,0.6189744,0.019341582,0.34888768,0.00039259708,0.010769673],"study_design_scores_gemma":[0.0000026339287,0.00001260223,0.000069319205,0.0000029197533,0.0000035255678,0.000027947272,0.000007160648,0.97633445,0.0047720745,0.018586665,0.00017546852,0.000005257581],"about_ca_topic_score_codex":0.002120057,"about_ca_topic_score_gemma":0.002674546,"teacher_disagreement_score":0.002120057,"about_ca_system_score_codex":0.0012190464,"about_ca_system_score_gemma":0.000978722,"threshold_uncertainty_score":0.008844852},"labels":[],"label_agreement":null},{"id":"W4301303211","doi":"10.48550/arxiv.1308.1259","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC\\n Codes","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Node (physics); Tanner graph; Variable (mathematics); Graph; Set (abstract data type); Computer science; Characterization (materials science); Coding (social sciences); Simple (philosophy); Class (philosophy); Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Error floor; Algorithm; Decoding methods; Statistics","score_opus":0.051298623708628525,"score_gpt":0.19129485315532516,"score_spread":0.13999622944669662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301303211","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7398311,0.0003417629,0.24132201,0.00024533045,0.000034716737,0.00009229939,0.0003765059,0.00020633753,0.01754998],"genre_scores_gemma":[0.97171056,0.00025018866,0.022844432,0.00011189481,0.000045534027,0.000091859416,0.00043385586,0.00007917115,0.0044326726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999694,0.00005132397,0.000016650158,0.000094278665,0.000086659966,0.000057057012],"domain_scores_gemma":[0.9982948,0.00089656835,0.00030849152,0.00015761676,0.0001673641,0.00017523623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024373012,0.00034950973,0.0003637133,0.0012488895,0.0007789644,0.000849963,0.000751053,0.0004964035,0.0033110909],"category_scores_gemma":[0.0022470548,0.00032903408,0.00054109434,0.00063946313,0.001498112,0.0011406499,0.0008515226,0.00088769285,0.00024575862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013906487,0.00010473677,0.0071955086,0.00019905556,0.000035194917,0.0005807079,0.0009212622,0.057342127,0.021655364,0.8898735,0.0016769089,0.020276567],"study_design_scores_gemma":[0.00003689357,0.00014782458,0.0042235623,0.000078016514,0.000035039997,0.00085423165,0.0003643425,0.39437476,0.01138175,0.5831844,0.0052582007,0.00006106854],"about_ca_topic_score_codex":0.00095607986,"about_ca_topic_score_gemma":0.00092388096,"teacher_disagreement_score":0.0033110909,"about_ca_system_score_codex":0.00063679175,"about_ca_system_score_gemma":0.00037811018,"threshold_uncertainty_score":0.011076748},"labels":[],"label_agreement":null},{"id":"W4306403363","doi":"10.3390/electronics11203337","title":"The Efficient Design of Lossy P-LDPC Codes over AWGN Channels","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Low-density parity-check code; Additive white Gaussian noise; Lossy compression; Algorithm; Computer science; Turbo code; Robustness (evolution); Distortion (music); Forward error correction; Decoding methods; Channel (broadcasting); Electronic engineering; Telecommunications; Bandwidth (computing); Engineering","score_opus":0.015032844838188645,"score_gpt":0.2528993398867009,"score_spread":0.23786649504851223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306403363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033198364,0.00043160922,0.96427745,0.00009286762,0.000015611387,0.000058441878,0.000049403632,0.00015476985,0.0017215441],"genre_scores_gemma":[0.66977763,0.0012389757,0.3267496,0.000065561995,0.000030390634,0.00015391732,0.000115672665,0.000060817594,0.0018073794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955755,0.00013106818,0.000022341414,0.00005805244,0.0001942555,0.000036807236],"domain_scores_gemma":[0.9993062,0.00031028036,0.00014472264,0.000078788486,0.0001386965,0.000021346043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042683686,0.00050157885,0.00035937122,0.00041931684,0.00024986968,0.00048683397,0.00047046883,0.0004412035,0.0004162645],"category_scores_gemma":[0.0021002046,0.000261611,0.00016992603,0.00052187504,0.00054277445,0.00061418326,0.00041953952,0.0005081696,0.00020992031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012647118,0.00003186708,0.00063561235,0.0002624713,0.00004022779,0.0001798238,0.00011758576,0.7993618,0.08005738,0.04351255,0.0006211792,0.075052954],"study_design_scores_gemma":[0.000016948858,0.0000685798,0.00017306194,0.00001874878,0.000010706926,0.0001316675,0.000011749651,0.9592601,0.031564426,0.0070566325,0.0016745313,0.00001296423],"about_ca_topic_score_codex":0.0008522787,"about_ca_topic_score_gemma":0.0012825375,"teacher_disagreement_score":0.0008522787,"about_ca_system_score_codex":0.00052467437,"about_ca_system_score_gemma":0.0009817114,"threshold_uncertainty_score":0.0038067698},"labels":[],"label_agreement":null},{"id":"W4309001612","doi":"10.3390/electronics11223721","title":"Performance Improvement of Polar Codes via UEP Product Coding","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Polar code; Polar; Algorithm; Decoding methods; Computer science; Coding (social sciences); Additive white Gaussian noise; Concatenated error correction code; Turbo code; Channel (broadcasting); Mathematical optimization; Mathematics; Block code; Telecommunications; Statistics; Physics","score_opus":0.00903922765785835,"score_gpt":0.23315001316841635,"score_spread":0.224110785510558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309001612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11186835,0.0010852906,0.8707521,0.00031390268,0.000095215866,0.00004506343,0.00006593057,0.00045424732,0.015319857],"genre_scores_gemma":[0.86619025,0.0010242392,0.1297876,0.00012257061,0.000043027845,0.00004759021,0.00008698506,0.00004572596,0.0026519992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897015,0.00039064026,0.000034564986,0.00011446815,0.00036448397,0.0001256863],"domain_scores_gemma":[0.99852115,0.00064141146,0.0001661882,0.000176619,0.00045258252,0.00004215072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040667,0.0009894944,0.00049831095,0.00063738134,0.00030798226,0.00080502854,0.00058018736,0.0005485289,0.00095964264],"category_scores_gemma":[0.0038633966,0.00024399749,0.00027517023,0.00087818055,0.0009448419,0.0008821868,0.0011457414,0.00073324546,0.00033190614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006706739,0.000088836336,0.0018267895,0.00020231034,0.00006980688,0.0004178248,0.0003455598,0.54425794,0.086613595,0.17260207,0.0018951391,0.19100943],"study_design_scores_gemma":[0.00001963326,0.000181482,0.00024002229,0.00003300066,0.000023234745,0.00026894122,0.000030756655,0.94521314,0.0385608,0.0126131745,0.0027849607,0.00003083898],"about_ca_topic_score_codex":0.0009778053,"about_ca_topic_score_gemma":0.0009833819,"teacher_disagreement_score":0.0010040667,"about_ca_system_score_codex":0.00046666138,"about_ca_system_score_gemma":0.00095860224,"threshold_uncertainty_score":0.005310118},"labels":[],"label_agreement":null},{"id":"W4309757106","doi":"10.1109/tcomm.2022.3211101","title":"Decoding Reed-Muller Codes With Successive Codeword Permutations","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Code word; Decoding methods; Permutation (music); Algorithm; List decoding; Error detection and correction; Hadamard transform; Computational complexity theory; Computer science; Sequential decoding; Mathematics; Discrete mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.03302514777196357,"score_gpt":0.2903340931662864,"score_spread":0.2573089453943228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309757106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033533137,0.00026888825,0.9623453,0.00007107219,0.00003789891,0.00008611298,0.000093386814,0.0011540639,0.0024100894],"genre_scores_gemma":[0.24902532,0.0002972848,0.74647546,0.00008733875,0.000046721783,0.00018046427,0.00038637026,0.00010523335,0.0033957742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994004,0.00013021329,0.00005150013,0.00007331675,0.0002831732,0.0000614114],"domain_scores_gemma":[0.99927944,0.00022389977,0.00011903537,0.00014801144,0.00021048907,0.000019157438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045023017,0.0006401138,0.00046381654,0.0007337487,0.00038630914,0.00056966516,0.0007945472,0.00041669086,0.0010675519],"category_scores_gemma":[0.0017258248,0.00026390224,0.00040780066,0.00068688986,0.00040314128,0.00057451037,0.0006828809,0.00050296605,0.00075749063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047912958,0.000083123814,0.0012169946,0.0003751323,0.00008135367,0.00036840673,0.0002886618,0.17188439,0.23621492,0.065275945,0.002432874,0.521299],"study_design_scores_gemma":[0.00007930922,0.00027160937,0.00038060985,0.000035131954,0.000031261854,0.0004516446,0.000026451955,0.8107147,0.16726342,0.012300787,0.008406343,0.000038698035],"about_ca_topic_score_codex":0.0017655174,"about_ca_topic_score_gemma":0.002918231,"teacher_disagreement_score":0.0017655174,"about_ca_system_score_codex":0.000503374,"about_ca_system_score_gemma":0.0018167399,"threshold_uncertainty_score":0.0036522746},"labels":[],"label_agreement":null},{"id":"W4312725651","doi":"10.1109/lcomm.2022.3230202","title":"Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Decoding methods; Permutation (music); Constraint (computer-aided design); Algorithm; Computer science; List decoding; Function (biology); Set (abstract data type); Mathematics; Block code; Concatenated error correction code; Physics","score_opus":0.045549186185017944,"score_gpt":0.2814449723953956,"score_spread":0.23589578621037768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312725651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051227458,0.00024889765,0.94290805,0.00014483638,0.000060428738,0.00006374827,0.00008143581,0.00052379,0.0047413604],"genre_scores_gemma":[0.72447443,0.00038378086,0.27006254,0.00018283204,0.000061908795,0.00014198675,0.00019269741,0.000135855,0.0043639527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.00016230764,0.000032377648,0.00009422096,0.0001471216,0.000064399486],"domain_scores_gemma":[0.9991357,0.00024801912,0.00014007844,0.00021278777,0.00022378196,0.000039634837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565785,0.0008156547,0.0003608268,0.0004446916,0.00038321211,0.0005930535,0.00093349925,0.0005383147,0.0016458844],"category_scores_gemma":[0.0018095855,0.00021616656,0.00029168357,0.00043596522,0.00074399525,0.0010479854,0.0007431209,0.00063530053,0.00094484416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008547665,0.0001235792,0.0017593602,0.00028234412,0.00008702756,0.0005052084,0.00038767487,0.2071947,0.2566032,0.24896573,0.0020665713,0.2811698],"study_design_scores_gemma":[0.000053531996,0.0005538163,0.0003570957,0.000052910906,0.000049932823,0.00056771206,0.000053289237,0.7229589,0.21221374,0.049540628,0.013530989,0.00006749728],"about_ca_topic_score_codex":0.0005273045,"about_ca_topic_score_gemma":0.00073543406,"teacher_disagreement_score":0.0016458844,"about_ca_system_score_codex":0.0005085449,"about_ca_system_score_gemma":0.00059207,"threshold_uncertainty_score":0.0055060387},"labels":[],"label_agreement":null},{"id":"W4316661226","doi":"10.1109/tsp.2022.3229949","title":"A Synchro-Set-Aided Breadth-First Sphere Decoder for Polar-Coded MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Decoding methods; MIMO; Computer science; Bit error rate; Algorithm; Error detection and correction; Word error rate; Synchro; Low latency (capital markets); Sequential decoding; Real-time computing; Theoretical computer science; Channel (broadcasting); Speech recognition; Block code; Telecommunications; Engineering; Computer network","score_opus":0.029163317549461866,"score_gpt":0.2729816400387376,"score_spread":0.24381832248927574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316661226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011209807,0.00015618138,0.9867154,0.00008492464,0.000025310073,0.000021071664,0.000058462167,0.00027844656,0.0014504825],"genre_scores_gemma":[0.34780082,0.00044379407,0.6475318,0.0001591612,0.000053175983,0.0000864344,0.00035400622,0.000051384795,0.0035194375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993747,0.0001848813,0.000037278565,0.00007770187,0.00026787582,0.000057580797],"domain_scores_gemma":[0.9993753,0.00024125986,0.000057420108,0.000105167695,0.0001832054,0.000037658494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254811,0.00069962285,0.00054492307,0.000439123,0.00043757964,0.0007002442,0.0006032826,0.00061488966,0.0012583499],"category_scores_gemma":[0.001375327,0.00030003054,0.00036212493,0.0006473773,0.00048510035,0.0007735832,0.0009449854,0.0007674551,0.00079103047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060187286,0.00008866803,0.0011412557,0.0002042814,0.0000711205,0.00031132443,0.00034059744,0.5249872,0.10619226,0.06542478,0.003478737,0.29715785],"study_design_scores_gemma":[0.000026994518,0.00009226285,0.00011055104,0.00001458003,0.000011566688,0.00015479364,0.000019754434,0.96529424,0.026793813,0.0051373937,0.0023182174,0.0000257542],"about_ca_topic_score_codex":0.0021732594,"about_ca_topic_score_gemma":0.0027069938,"teacher_disagreement_score":0.0021732594,"about_ca_system_score_codex":0.0004942243,"about_ca_system_score_gemma":0.0015268532,"threshold_uncertainty_score":0.0043212175},"labels":[],"label_agreement":null},{"id":"W4318483464","doi":"10.3390/e25020252","title":"Lossy P-LDPC Codes for Compressing General Sources Using Neural Networks","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Low-density parity-check code; Lossy compression; Computer science; Artificial neural network; Algorithm; Theoretical computer science; Parallel computing; Decoding methods; Artificial intelligence","score_opus":0.04031979693182523,"score_gpt":0.3099909635200186,"score_spread":0.26967116658819335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318483464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065361604,0.0007237769,0.9286628,0.00030457746,0.00003579825,0.00005341992,0.00006913341,0.00043436614,0.004354618],"genre_scores_gemma":[0.7757768,0.0010661504,0.21827015,0.00012794811,0.000031450385,0.00009061984,0.00011343664,0.000040321833,0.0044831485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986875,0.000025772417,0.0000071046784,0.000019166833,0.000069546186,0.000009693494],"domain_scores_gemma":[0.99980336,0.000080510086,0.000031108568,0.00003868372,0.00003902447,0.000007416848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002340133,0.00024234486,0.0001933606,0.00033239726,0.00021902483,0.0002488149,0.00036912557,0.00027090707,0.00075825985],"category_scores_gemma":[0.00089459907,0.000094594216,0.0001037577,0.00046672323,0.00048207433,0.0008394859,0.00038581196,0.00047070076,0.00012599994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021321855,0.00006992637,0.00081978383,0.000383649,0.000045146302,0.00024466918,0.00020378912,0.43618774,0.12318374,0.15227695,0.0020940234,0.28427738],"study_design_scores_gemma":[0.000012905713,0.000040261126,0.00020411219,0.00001557231,0.000009977747,0.00008118162,0.0000101950345,0.95225286,0.029986445,0.0151054645,0.0022690317,0.000011973719],"about_ca_topic_score_codex":0.0014645534,"about_ca_topic_score_gemma":0.0020245991,"teacher_disagreement_score":0.0014645534,"about_ca_system_score_codex":0.0004728785,"about_ca_system_score_gemma":0.0005106883,"threshold_uncertainty_score":0.0034309626},"labels":[],"label_agreement":null},{"id":"W4320031160","doi":"10.1109/milcom55135.2022.10017929","title":"Performance Variation of Gray Codes for Cropped Gaussian 16PAM Constellations","year":2022,"lang":"en","type":"article","venue":"MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gray code; Algorithm; Quadrature amplitude modulation; Constellation; Computer science; Gaussian; Gray (unit); Phase-shift keying; Mathematics; Mutual information; Theoretical computer science; Decoding methods; Bit error rate; Artificial intelligence; Physics","score_opus":0.045459396979263364,"score_gpt":0.28683013301500015,"score_spread":0.24137073603573678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320031160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516812,0.00061709963,0.04201443,0.00021297003,0.000021696605,0.000031772004,0.00020519036,0.00030492502,0.0049108323],"genre_scores_gemma":[0.99198735,0.00010773013,0.00725398,0.00002999637,0.0000039534366,0.000012256177,0.00010938062,0.00002644087,0.0004690376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989932,0.000317456,0.000039361836,0.00013395505,0.00033691392,0.00017899594],"domain_scores_gemma":[0.99084705,0.0061756927,0.0006003099,0.00075054244,0.0014369511,0.00018953822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013703177,0.00039688472,0.00035849935,0.00087625673,0.00037676032,0.00062139257,0.0003928686,0.00051488297,0.0014047239],"category_scores_gemma":[0.012182822,0.00011993915,0.00016552788,0.0011419408,0.0007112036,0.00060413993,0.00054179906,0.00031755722,0.000230237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023991906,0.000120763594,0.017796494,0.00026871107,0.00016415438,0.00049759744,0.00050828635,0.7215225,0.119131304,0.018006148,0.0013644595,0.11822045],"study_design_scores_gemma":[0.00006374694,0.0010021809,0.010588714,0.000078567566,0.00007280713,0.00076928886,0.00024176085,0.8688217,0.107450716,0.008765975,0.002038189,0.00010630769],"about_ca_topic_score_codex":0.0022547417,"about_ca_topic_score_gemma":0.0020813132,"teacher_disagreement_score":0.0022547417,"about_ca_system_score_codex":0.0010112287,"about_ca_system_score_gemma":0.0008534839,"threshold_uncertainty_score":0.007336974},"labels":[],"label_agreement":null},{"id":"W4321374037","doi":"10.3390/e25020382","title":"Analysis and Optimization of a General Linking Matrix for JSCC Scheme Based on Double LDPC Codes","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Jimei University; Huaqiao University; National Natural Science Foundation of China","keywords":"Low-density parity-check code; Parity-check matrix; Algorithm; Decoding methods; Computer science; Theoretical computer science; Identity matrix; Concatenated error correction code; Mathematics; Block code; Eigenvalues and eigenvectors","score_opus":0.019895303273283364,"score_gpt":0.30194863498803626,"score_spread":0.2820533317147529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321374037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04682278,0.0007172563,0.9418214,0.00030632512,0.000050361792,0.00009276141,0.00009426713,0.00021001579,0.009884775],"genre_scores_gemma":[0.82313013,0.0011274134,0.16929403,0.00010543375,0.00005799114,0.00017585863,0.00020168368,0.000086903216,0.005820604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923944,0.00018173677,0.0000261742,0.0001034804,0.0003592254,0.000089864356],"domain_scores_gemma":[0.99903667,0.00042868257,0.00014691343,0.00008388776,0.00026023586,0.00004363643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496766,0.00089663855,0.0005368543,0.000762308,0.0005854746,0.0010289223,0.0005287175,0.00065671385,0.0028013212],"category_scores_gemma":[0.0024553556,0.00035086615,0.00037592443,0.0011195142,0.0009128955,0.0012440089,0.00082536804,0.0007094932,0.00042446036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094073876,0.000034322908,0.0006399263,0.0001373169,0.000032193642,0.00014254046,0.00012544518,0.8478112,0.0155414855,0.10078559,0.0013214451,0.03333443],"study_design_scores_gemma":[0.0000063235752,0.000021963437,0.000088396664,0.000010153577,0.00000668487,0.00004440842,0.000010289648,0.99246126,0.0020876094,0.0047021587,0.00054848014,0.0000123457885],"about_ca_topic_score_codex":0.003406264,"about_ca_topic_score_gemma":0.003350307,"teacher_disagreement_score":0.003406264,"about_ca_system_score_codex":0.0014885602,"about_ca_system_score_gemma":0.0018954418,"threshold_uncertainty_score":0.010800362},"labels":[],"label_agreement":null},{"id":"W4322706956","doi":"10.1109/tvlsi.2023.3247739","title":"An Energy-Efficient Binary-Interfaced Stochastic Multiplier Using Parallel Datapaths","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Anhui Province; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic computing; Computer science; Binary number; Multiplier (economics); Parallel computing; Adder; Multiplication (music); Computer hardware; Arithmetic; Algorithm; Mathematics; Latency (audio)","score_opus":0.030707753845448955,"score_gpt":0.2900660019154152,"score_spread":0.25935824806996627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322706956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1282789,0.00056157575,0.8622795,0.0002901429,0.0001500368,0.0001248361,0.00017306158,0.0015359328,0.0066059837],"genre_scores_gemma":[0.69914514,0.00022422623,0.2964046,0.000147862,0.00004089238,0.00009610998,0.00016323122,0.00005018637,0.0037275893],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998678,0.000021731112,0.000009940379,0.00002892527,0.000053173055,0.000018471628],"domain_scores_gemma":[0.9998161,0.000046470755,0.000041867876,0.0000228747,0.000057162182,0.000015536565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017946928,0.00033493093,0.00023249655,0.00037863824,0.00032985542,0.0003339906,0.0007350865,0.00024958304,0.0019114391],"category_scores_gemma":[0.00038355624,0.00016454687,0.00018468662,0.00058671256,0.00020233692,0.00052085106,0.00035981278,0.00032224474,0.00033633193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006137878,0.00023733168,0.0016529622,0.0003799323,0.00009169729,0.00047896258,0.00012818369,0.10211637,0.41401002,0.049992885,0.0060469564,0.424251],"study_design_scores_gemma":[0.000103985054,0.00085650134,0.000627589,0.000033164473,0.00005970374,0.0005280585,0.000021185606,0.8332939,0.14192002,0.00814121,0.014373126,0.000041573217],"about_ca_topic_score_codex":0.00048940093,"about_ca_topic_score_gemma":0.0013715521,"teacher_disagreement_score":0.0019114391,"about_ca_system_score_codex":0.00031410955,"about_ca_system_score_gemma":0.0006461556,"threshold_uncertainty_score":0.0063943863},"labels":[],"label_agreement":null},{"id":"W4328123617","doi":"10.1186/s13638-023-02240-9","title":"Early-detection scheme based on sequential tests for low-latency communications","year":2023,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Additive white Gaussian noise; Algorithm; Latency (audio); Spectral efficiency; Coding (social sciences); Orthogonal frequency-division multiplexing; Transmission (telecommunications); Multiplexing; Channel (broadcasting); Telecommunications; Mathematics; Statistics","score_opus":0.0824364019756868,"score_gpt":0.3375009612721402,"score_spread":0.2550645592964534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328123617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11751985,0.00061229407,0.87772393,0.00033036803,0.00012897729,0.00022445973,0.00012378645,0.0016374715,0.0016989014],"genre_scores_gemma":[0.9010347,0.0001359427,0.096595116,0.00016275393,0.000072059185,0.0001634472,0.00009577295,0.000043924225,0.0016963498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968797,0.0007780059,0.00020147565,0.00045276136,0.0011641167,0.0005240191],"domain_scores_gemma":[0.98797244,0.0061876923,0.0012382527,0.0017637614,0.0023517166,0.00048614555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021381504,0.0010186508,0.0012641948,0.0011128309,0.0010746722,0.0011465319,0.0024463686,0.00087624224,0.0023691582],"category_scores_gemma":[0.009722819,0.0003818632,0.0003729003,0.0008067414,0.0012126641,0.0028124964,0.0020480764,0.0015116783,0.0004500551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062520974,0.0008173105,0.0076413252,0.00054278254,0.00019552231,0.0012395952,0.00082711823,0.20238669,0.2718908,0.09187261,0.0044458043,0.41188836],"study_design_scores_gemma":[0.00017422618,0.00085766375,0.000842893,0.00003298376,0.000062333645,0.00038101504,0.000068997324,0.9069511,0.06980153,0.018549502,0.0021786636,0.00009904413],"about_ca_topic_score_codex":0.0018648914,"about_ca_topic_score_gemma":0.0018172943,"teacher_disagreement_score":0.0024463686,"about_ca_system_score_codex":0.0011291418,"about_ca_system_score_gemma":0.0027330248,"threshold_uncertainty_score":0.011307776},"labels":[],"label_agreement":null},{"id":"W4366091874","doi":"10.3390/e25040668","title":"On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Decoding methods; Binary symmetric channel; Probability of error; Binary number; Channel (broadcasting); Algorithm; Mathematics; Code (set theory); Block (permutation group theory); Computer science; Discrete mathematics; Low-density parity-check code; Combinatorics; Telecommunications; Arithmetic","score_opus":0.021839668862213706,"score_gpt":0.2602646994456838,"score_spread":0.23842503058347012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366091874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32469448,0.0020203819,0.65286005,0.00093569746,0.00011548289,0.00009689706,0.00040298686,0.00040384848,0.018470146],"genre_scores_gemma":[0.9707022,0.00197624,0.0215777,0.00012749225,0.00016162953,0.00011526426,0.00019826942,0.00016709752,0.0049741426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972415,0.00091437896,0.000108796594,0.00031843502,0.0011024426,0.00031437655],"domain_scores_gemma":[0.9649191,0.030007923,0.002603571,0.0010053199,0.0011452157,0.00031897504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030659677,0.0013660307,0.0012009855,0.0016346618,0.00072899426,0.001906005,0.0010945408,0.0014090341,0.0035055152],"category_scores_gemma":[0.02672328,0.0007378999,0.00053121493,0.001232695,0.0031570916,0.0032754927,0.0019599285,0.0017516387,0.0004998551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007007595,0.00006396258,0.001998825,0.00034614763,0.00007913735,0.000717888,0.00027102078,0.68768394,0.014636737,0.2763399,0.0011034234,0.016058205],"study_design_scores_gemma":[0.00003092225,0.00008295237,0.0007054846,0.000062892526,0.000031967178,0.00036345652,0.000047152957,0.93361723,0.007832669,0.056590233,0.00058856077,0.000046365683],"about_ca_topic_score_codex":0.0011299148,"about_ca_topic_score_gemma":0.0009519336,"teacher_disagreement_score":0.0035055152,"about_ca_system_score_codex":0.0020320853,"about_ca_system_score_gemma":0.0014148625,"threshold_uncertainty_score":0.01621461},"labels":[],"label_agreement":null},{"id":"W4382365058","doi":"10.1109/itw55543.2023.10161664","title":"On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble Decoding","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Decoding methods; List decoding; Code (set theory); Polar; Sequential decoding; Computer science; Algorithm; Concatenated error correction code; Mathematics; Discrete mathematics; Block code; Physics","score_opus":0.046969713139537086,"score_gpt":0.2966295537155448,"score_spread":0.2496598405760077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382365058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68650335,0.00039902635,0.30474257,0.00051317195,0.000039222756,0.000058201458,0.00031175942,0.0003628832,0.007069893],"genre_scores_gemma":[0.9879501,0.0002958446,0.01035262,0.000043244218,0.000032788714,0.000043269836,0.00023904114,0.00006229383,0.0009807638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913627,0.0002985926,0.000029883802,0.000119829114,0.0002802855,0.00013515113],"domain_scores_gemma":[0.9927281,0.0046714246,0.0006752226,0.00078702974,0.0008628174,0.0002754011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011884624,0.00043072848,0.00040923632,0.0009119188,0.00067187945,0.0008985265,0.00063273543,0.00055330683,0.0015517554],"category_scores_gemma":[0.012313213,0.00022407193,0.00022604284,0.000772122,0.0013679196,0.0017116367,0.0008913688,0.00079245376,0.00031582898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073321175,0.0001270781,0.013110832,0.00014909651,0.000058135116,0.0004795228,0.00047171,0.36170328,0.08381965,0.4848643,0.0022236153,0.052259687],"study_design_scores_gemma":[0.000021285834,0.00012323157,0.0017008283,0.000022427606,0.000010993328,0.00030629817,0.00009779389,0.875613,0.030870639,0.0896364,0.001562862,0.000034216904],"about_ca_topic_score_codex":0.0007116982,"about_ca_topic_score_gemma":0.0006211051,"teacher_disagreement_score":0.0015517554,"about_ca_system_score_codex":0.0008863098,"about_ca_system_score_gemma":0.0010815581,"threshold_uncertainty_score":0.006430626},"labels":[],"label_agreement":null},{"id":"W4385080262","doi":"10.1109/iscas46773.2023.10181781","title":"Hybrid GRAND Sphere Decoding: Accelerated GRAND for Low-Rate Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Latency (audio); Algorithm; List decoding; Concatenated error correction code; Telecommunications; Block code","score_opus":0.04925965235965126,"score_gpt":0.304549585130817,"score_spread":0.25528993277116574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385080262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024401793,0.00039713734,0.96781725,0.00015489865,0.000050235645,0.000060664155,0.000093723385,0.0021204527,0.004903896],"genre_scores_gemma":[0.41370016,0.0004379756,0.57670414,0.00023778212,0.000071111375,0.00010481693,0.0004460867,0.0003300478,0.007967735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991491,0.00029865367,0.0000405268,0.000120051634,0.0002826216,0.00010906304],"domain_scores_gemma":[0.9985727,0.0004800376,0.000070389,0.0004859041,0.0003273066,0.00006366452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008327588,0.0010486816,0.00083830685,0.0005090061,0.0005613872,0.0008461645,0.0011434169,0.00065308507,0.0028421716],"category_scores_gemma":[0.0026537862,0.0002772855,0.00036748932,0.0007152406,0.0008228457,0.0013191861,0.0020557665,0.000997829,0.0015492198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012301576,0.00013477558,0.0019149948,0.00029047934,0.000104620936,0.0005056454,0.00041331333,0.2621394,0.07824425,0.17589794,0.008401892,0.4707225],"study_design_scores_gemma":[0.000038853363,0.00017805447,0.00020994234,0.000023343682,0.000020895113,0.00035385397,0.000029514866,0.91671044,0.04379692,0.030630805,0.007964156,0.000043158194],"about_ca_topic_score_codex":0.001784045,"about_ca_topic_score_gemma":0.0036690806,"teacher_disagreement_score":0.0028421716,"about_ca_system_score_codex":0.00047756356,"about_ca_system_score_gemma":0.0012984236,"threshold_uncertainty_score":0.009507954},"labels":[],"label_agreement":null},{"id":"W4385154226","doi":"10.1109/jlt.2023.3297615","title":"Low-Complexity Zipper-LDPC and Low-Latency Zipper-BCH Concatenated Codes","year":2023,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"BCH code; Concatenated error correction code; Low-density parity-check code; Serial concatenated convolutional codes; Zipper; Computer science; Forward error correction; Reed–Solomon error correction; Decoding methods; Error detection and correction; Turbo code; Algorithm; Block code","score_opus":0.02485985024213565,"score_gpt":0.2801240797430351,"score_spread":0.25526422950089944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385154226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1568665,0.0018281961,0.82369405,0.00039358423,0.000101605496,0.00016697127,0.00034326472,0.001486135,0.015119692],"genre_scores_gemma":[0.8029153,0.0005035171,0.1896591,0.00013571883,0.000053134165,0.00007818049,0.00018530655,0.000042793068,0.0064270436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937266,0.00010503901,0.000029288698,0.0000811773,0.00032901557,0.0000827746],"domain_scores_gemma":[0.9989542,0.00029378422,0.00017689524,0.00022733604,0.0003014141,0.00004640015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030162718,0.00045441207,0.0004027798,0.00069119595,0.0005400685,0.00061168795,0.0007565085,0.0006721872,0.0012843803],"category_scores_gemma":[0.0019475085,0.00021317213,0.00023070657,0.00071694126,0.00048655397,0.0008729168,0.0006829304,0.000576825,0.0005545058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008656741,0.00017572928,0.0030503876,0.0005119862,0.00012146309,0.0012703319,0.0003659402,0.41951397,0.19122122,0.09886855,0.004548264,0.27948654],"study_design_scores_gemma":[0.00003210927,0.00018172362,0.0005988116,0.000028996164,0.00004183264,0.00074580504,0.000029790452,0.8832591,0.09678245,0.009611576,0.00863209,0.000055674045],"about_ca_topic_score_codex":0.0017488278,"about_ca_topic_score_gemma":0.0024877256,"teacher_disagreement_score":0.0017488278,"about_ca_system_score_codex":0.0008994348,"about_ca_system_score_gemma":0.0010588968,"threshold_uncertainty_score":0.006525874},"labels":[],"label_agreement":null},{"id":"W4385950571","doi":"10.1007/978-3-031-31663-0_3","title":"Hardware Architecture for Ordered Reliability Bits GRAND (ORBGRAND)","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Throughput; Reliability (semiconductor); Polar code; Code (set theory); Hardware architecture; Computer hardware; Parallel computing; Algorithm; Software; Physics; Telecommunications; Wireless; Operating system","score_opus":0.03070942117432044,"score_gpt":0.26350586124685627,"score_spread":0.23279644007253583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385950571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015139976,0.010081165,0.63396144,0.0013118376,0.0022964259,0.0002470579,0.0011603703,0.017541833,0.31825992],"genre_scores_gemma":[0.11327613,0.004653324,0.4125416,0.0011240738,0.00038871964,0.0002916155,0.0020879733,0.0022492807,0.46338722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998178,0.000020326053,0.000008810036,0.000025892406,0.000102252656,0.000024975281],"domain_scores_gemma":[0.99980956,0.000026248721,0.000010518183,0.000056408317,0.00008566286,0.000011648798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024883862,0.00060771324,0.00036777006,0.0008941286,0.0005393053,0.0013526073,0.0012740253,0.0006613009,0.045380183],"category_scores_gemma":[0.00041250055,0.0003756679,0.00033813107,0.00097422476,0.00033483928,0.0012513496,0.0008441142,0.0010841726,0.015030426],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001759657,0.000042785978,0.0003012074,0.00051064003,0.000029705685,0.00018762631,0.00016642392,0.006809453,0.038201705,0.2525325,0.12563989,0.575402],"study_design_scores_gemma":[0.000042914915,0.00026204818,0.00056284014,0.00022577001,0.000047753296,0.0006217104,0.000059966642,0.02772962,0.03977997,0.06585239,0.86475843,0.000056607558],"about_ca_topic_score_codex":0.0012464996,"about_ca_topic_score_gemma":0.0025697984,"teacher_disagreement_score":0.045380183,"about_ca_system_score_codex":0.0008279213,"about_ca_system_score_gemma":0.0005904298,"threshold_uncertainty_score":0.15181184},"labels":[],"label_agreement":null},{"id":"W4385950639","doi":"10.1007/978-3-031-31663-0_5","title":"Hardware Architecture for GRAND Markov Order (GRAND-MO)","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Latency (audio); Computer science; Throughput; Decoding methods; Code (set theory); Parallel computing; Algorithm; Telecommunications; Wireless","score_opus":0.025295108458965706,"score_gpt":0.2622409031819719,"score_spread":0.2369457947230062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385950639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018512743,0.0028007843,0.8461817,0.00073676114,0.0007422968,0.00007578831,0.00039416167,0.0064580734,0.12409758],"genre_scores_gemma":[0.30860785,0.002675111,0.5041616,0.0008110112,0.00029241963,0.00016663365,0.0010282772,0.0013472678,0.18090984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998709,0.000014317453,0.00000567497,0.00002503212,0.00006065326,0.000023343164],"domain_scores_gemma":[0.9997348,0.000054621512,0.0000129638765,0.00007947732,0.00010255598,0.000015475754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014750123,0.00043264905,0.00031132056,0.0004900862,0.0006143235,0.0010137584,0.0009459908,0.0005413917,0.02398205],"category_scores_gemma":[0.00048041285,0.00030048453,0.0003264205,0.0005858964,0.00035988243,0.0011671114,0.0006713361,0.00096461276,0.0061320676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013713737,0.000045576668,0.00052525074,0.0002902117,0.000045536126,0.00014692248,0.0001731127,0.021987405,0.029190715,0.5370234,0.04901838,0.3614163],"study_design_scores_gemma":[0.000033757362,0.00020173339,0.0009378682,0.00019574907,0.00007083013,0.0007121146,0.00008073634,0.29453433,0.054448932,0.31801167,0.33068472,0.000087666805],"about_ca_topic_score_codex":0.0021261992,"about_ca_topic_score_gemma":0.006203676,"teacher_disagreement_score":0.02398205,"about_ca_system_score_codex":0.00079149,"about_ca_system_score_gemma":0.00080888363,"threshold_uncertainty_score":0.08022797},"labels":[],"label_agreement":null},{"id":"W4385950659","doi":"10.1007/978-3-031-31663-0_2","title":"Hardware Architecture for GRAND with ABandonment (GRANDAB)","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Codebook; Computer science; Hamming code; Code (set theory); Throughput; Computer hardware; Block (permutation group theory); Code word; Architecture; Parallel computing; Algorithm; Block code; Mathematics; Decoding methods; Wireless; Combinatorics; Telecommunications; Programming language","score_opus":0.02288688796495665,"score_gpt":0.2385340717534676,"score_spread":0.21564718378851094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385950659","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060554626,0.012913299,0.2625072,0.0047451705,0.004864096,0.00009822502,0.00043767595,0.007352836,0.701026],"genre_scores_gemma":[0.041511133,0.005240413,0.0960963,0.0014379037,0.00048379603,0.00009480992,0.0005194878,0.001801325,0.8528148],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981135,0.000020668287,0.0000057765355,0.00002678494,0.00010849473,0.000027096821],"domain_scores_gemma":[0.9997645,0.000035574372,0.000008624702,0.000052334737,0.00012156767,0.000017426448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021395099,0.00072089984,0.0002507073,0.0006921154,0.00079038774,0.0016602294,0.0009382099,0.0007868171,0.05483686],"category_scores_gemma":[0.0006454422,0.00044695142,0.00028724596,0.00073339255,0.0005103367,0.0016940241,0.00094931974,0.0016172581,0.020135604],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006662227,0.000019190598,0.00015470682,0.00018651491,0.00001138938,0.00015360716,0.00026724953,0.0014629166,0.009359327,0.23176512,0.28694436,0.46960896],"study_design_scores_gemma":[0.000008081826,0.000037500435,0.00017077968,0.0001045019,0.000010563068,0.0003759689,0.000043734544,0.00305331,0.0044247587,0.035532143,0.95622206,0.000016666065],"about_ca_topic_score_codex":0.002431188,"about_ca_topic_score_gemma":0.0056446246,"teacher_disagreement_score":0.05483686,"about_ca_system_score_codex":0.00086088997,"about_ca_system_score_gemma":0.0008445153,"threshold_uncertainty_score":0.1834476},"labels":[],"label_agreement":null},{"id":"W4385950678","doi":"10.1007/978-3-031-31663-0_4","title":"Hardware Architecture for List GRAND (LGRAND)","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Very-large-scale integration; Overhead (engineering); Parallel computing; Block (permutation group theory); Throughput; Code (set theory); Architecture; Computer hardware; Computer architecture; Algorithm; Embedded system; Operating system; Mathematics; Programming language; Wireless; Geography; Archaeology","score_opus":0.034508332664340446,"score_gpt":0.2647263016062046,"score_spread":0.23021796894186414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385950678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013827201,0.0062170713,0.48831692,0.0017027954,0.0023278517,0.000299255,0.002291143,0.04101856,0.44399917],"genre_scores_gemma":[0.07141835,0.0024487341,0.23987696,0.0014242656,0.00040758617,0.00021314356,0.0034507532,0.0032920477,0.6774682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997931,0.000023007278,0.0000096952745,0.000040779876,0.00010016978,0.00003338001],"domain_scores_gemma":[0.9997918,0.000029288076,0.000010129288,0.000048469334,0.00010639133,0.000013836291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018628065,0.0008248538,0.00032031263,0.0011162944,0.000743632,0.0017230625,0.0016177477,0.00082892034,0.11068956],"category_scores_gemma":[0.0004717593,0.00046966164,0.000384813,0.0011203121,0.00029492675,0.0020542236,0.0008976896,0.00093266665,0.046583157],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020875508,0.000049736198,0.00037093027,0.0006108728,0.000030374842,0.00025532083,0.00025583623,0.0022693195,0.03852323,0.12536545,0.24670705,0.5853532],"study_design_scores_gemma":[0.00004063091,0.00020853049,0.00058580167,0.00020779697,0.00005575073,0.00065445143,0.00007856611,0.013729774,0.04430712,0.025745513,0.9143256,0.00006039692],"about_ca_topic_score_codex":0.003176348,"about_ca_topic_score_gemma":0.0075897397,"teacher_disagreement_score":0.11068956,"about_ca_system_score_codex":0.0011310967,"about_ca_system_score_gemma":0.0006636657,"threshold_uncertainty_score":0.37029344},"labels":[],"label_agreement":null},{"id":"W4386058569","doi":"10.1587/transfun.2023eal2068","title":"DNN Aided Joint Source-Channel Decoding Scheme for Polar Codes","year":2023,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Decoding methods; Computer science; Joint (building); Channel (broadcasting); Belief propagation; Algorithm; Factor graph; Polar code; Source code; Polar; Telecommunications; Engineering; Physics","score_opus":0.06829875709549948,"score_gpt":0.31812941284437074,"score_spread":0.24983065574887126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386058569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016742539,0.00029460742,0.97816795,0.00022146474,0.00008684478,0.000046526613,0.000115481875,0.0006156393,0.0037090327],"genre_scores_gemma":[0.5255388,0.00048881484,0.46414587,0.00033871728,0.000069844216,0.00010527061,0.00045321163,0.00008274628,0.008776793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994168,0.00013436929,0.000032351698,0.000091703056,0.00024721227,0.000077483],"domain_scores_gemma":[0.99927634,0.000185233,0.00006399498,0.00013864369,0.0002974838,0.00003842997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051674637,0.0008289397,0.00051321264,0.00051188644,0.00054043665,0.0005446803,0.00067156676,0.0007944892,0.0018836709],"category_scores_gemma":[0.0016185682,0.00020877797,0.00032575926,0.00054271444,0.0006944355,0.0011432953,0.0012736614,0.0011199004,0.000725202],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085349317,0.00009821042,0.0015012751,0.00028438622,0.00010130612,0.0004768186,0.00031563456,0.37114987,0.07633604,0.096744016,0.0065502934,0.44558868],"study_design_scores_gemma":[0.000025347808,0.00009066178,0.00012787616,0.000019488794,0.000022946226,0.00016948355,0.000025792884,0.95465523,0.028245237,0.012444544,0.004142674,0.00003072914],"about_ca_topic_score_codex":0.004020683,"about_ca_topic_score_gemma":0.0066805533,"teacher_disagreement_score":0.004020683,"about_ca_system_score_codex":0.0006794565,"about_ca_system_score_gemma":0.001857501,"threshold_uncertainty_score":0.007994592},"labels":[],"label_agreement":null},{"id":"W4386066328","doi":"10.1109/isit54713.2023.10206555","title":"Partial Ordered Statistics Decoding with Enhanced Error Patterns","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; List decoding; Computer science; Algorithm; BCH code; Sequential decoding; Berlekamp–Welch algorithm; Theoretical computer science; Statistics; Mathematics; Concatenated error correction code; Block code","score_opus":0.029558559061141736,"score_gpt":0.29662940737217447,"score_spread":0.2670708483110327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386066328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09003391,0.00021081592,0.9017076,0.0002517284,0.00006698083,0.000050292838,0.00012472564,0.0019947814,0.005559241],"genre_scores_gemma":[0.5800349,0.00026055594,0.41178238,0.0002808631,0.000054031378,0.00008715561,0.00041638187,0.00024173742,0.0068419245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00030352265,0.0000860336,0.00011333758,0.00050743105,0.00012343292],"domain_scores_gemma":[0.9969361,0.0011175682,0.00032415826,0.00081734237,0.00069214264,0.00011267874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067780213,0.00090928253,0.00073372596,0.00064260437,0.00032804435,0.0008179433,0.00077514676,0.0006066663,0.0013711766],"category_scores_gemma":[0.0035810578,0.0002917965,0.00033832,0.0011836027,0.00076920976,0.0010781834,0.0010990985,0.0006615723,0.0010251098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015479929,0.0001688701,0.004951702,0.00023947058,0.00010584848,0.0008189167,0.00041499018,0.17964363,0.22841257,0.06540222,0.0035586625,0.5147351],"study_design_scores_gemma":[0.0000699105,0.00039674892,0.0011016328,0.000035978162,0.00004912893,0.0009554207,0.0000662258,0.75304204,0.21850963,0.019597195,0.006113299,0.00006286358],"about_ca_topic_score_codex":0.0014536198,"about_ca_topic_score_gemma":0.003920743,"teacher_disagreement_score":0.0014536198,"about_ca_system_score_codex":0.00065763923,"about_ca_system_score_gemma":0.0016543312,"threshold_uncertainty_score":0.004771471},"labels":[],"label_agreement":null},{"id":"W4386076962","doi":"10.1109/jcice59059.2023.00017","title":"Low Complexity Lossy Compression Using Polar Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lossy compression; Algorithm; Computer science; Context-adaptive binary arithmetic coding; Variable-length code; Source code; Gaussian; Binary number; Theoretical computer science; Data compression; Mathematics; Decoding methods; Arithmetic; Physics; Artificial intelligence","score_opus":0.09768272768115202,"score_gpt":0.3391155579263479,"score_spread":0.24143283024519588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386076962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036376424,0.0010568574,0.9577923,0.0001830341,0.000051868265,0.000043016014,0.000063193576,0.00040792418,0.004025447],"genre_scores_gemma":[0.61388737,0.0021040284,0.37825,0.00020792331,0.00009953528,0.00009677533,0.00024380273,0.000077181256,0.005033392],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996772,0.000051112776,0.000015007208,0.000039004142,0.00019766668,0.000019966461],"domain_scores_gemma":[0.9995034,0.0002127575,0.00006742035,0.00006517625,0.0001333203,0.000017965416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789595,0.00044982496,0.00034563342,0.00062027836,0.00021722628,0.00059698476,0.00037988307,0.00040657326,0.0011189359],"category_scores_gemma":[0.001401216,0.00016104257,0.00013779424,0.0006667525,0.00046400665,0.0010527109,0.00073294534,0.0005646815,0.0004340827],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067588233,0.000054173397,0.0010057765,0.00036682957,0.000046411795,0.0004648389,0.00026057125,0.10693331,0.27121392,0.118503146,0.0025130364,0.49796206],"study_design_scores_gemma":[0.000070917784,0.00021998731,0.00061257655,0.000082371815,0.000029200297,0.0008020163,0.00006766551,0.78979963,0.16747765,0.02971662,0.011067915,0.000053422667],"about_ca_topic_score_codex":0.00052400364,"about_ca_topic_score_gemma":0.0003492977,"teacher_disagreement_score":0.0011189359,"about_ca_system_score_codex":0.0002763926,"about_ca_system_score_gemma":0.00031411258,"threshold_uncertainty_score":0.0037431717},"labels":[],"label_agreement":null},{"id":"W4386076966","doi":"10.1109/jcice59059.2023.00022","title":"A Novel Probabilistic Shaping Scheme for 16QAM Modulated Polar Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Fujian Province","keywords":"Quadrature amplitude modulation; Phase-shift keying; Additive white Gaussian noise; QAM; Algorithm; Constellation diagram; Computer science; Demodulation; Modulation (music); Electronic engineering; Bit error rate; Decoding methods; Mathematics; Telecommunications; White noise; Physics; Engineering","score_opus":0.08138087808873629,"score_gpt":0.3141620593515269,"score_spread":0.23278118126279063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386076966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058876857,0.0012220376,0.9249734,0.0004213425,0.00017156827,0.00014434663,0.00011313312,0.0005625883,0.013514712],"genre_scores_gemma":[0.6524055,0.0011591947,0.33699107,0.00029111013,0.00014550741,0.0001659857,0.00018208592,0.000051905372,0.008607474],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995371,0.00009497429,0.000022495533,0.00007342132,0.00022810171,0.00004391707],"domain_scores_gemma":[0.99949396,0.00011451758,0.0001017654,0.000096048345,0.0001589816,0.000034775727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331441,0.000490809,0.00033212834,0.00044100295,0.00047582775,0.000504104,0.00057136227,0.00047118403,0.001918832],"category_scores_gemma":[0.00084303826,0.00020230799,0.00028867525,0.0007245178,0.00056832505,0.0009656584,0.0009334864,0.00065323693,0.0005742222],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047369642,0.00007480836,0.0011075912,0.00028919292,0.000053609252,0.00040350892,0.00050519855,0.047680262,0.39620325,0.22251904,0.0022744767,0.32841536],"study_design_scores_gemma":[0.00012076665,0.0006119517,0.00081871595,0.000091795955,0.00006877809,0.0015656359,0.00008917973,0.65337265,0.24428456,0.043772455,0.0550554,0.00014803669],"about_ca_topic_score_codex":0.00041715868,"about_ca_topic_score_gemma":0.0004892262,"teacher_disagreement_score":0.001918832,"about_ca_system_score_codex":0.0005355513,"about_ca_system_score_gemma":0.0006751891,"threshold_uncertainty_score":0.006419122},"labels":[],"label_agreement":null},{"id":"W4387108231","doi":"10.18280/jesa.560402","title":"A High-Throughput Reconfigurable LDPC Codec for Wide Band Digital Communications","year":2023,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vision Group on Science and Technology; Visvesvaraya Technological University","keywords":"Codec; Throughput; Low-density parity-check code; Computer science; Computer architecture; Computer hardware; Telecommunications; Decoding methods; Wireless","score_opus":0.06307225167453125,"score_gpt":0.3083669489949924,"score_spread":0.24529469732046116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387108231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13468213,0.0030315267,0.82863873,0.00068233785,0.00034538496,0.00024710048,0.00043730758,0.0059399717,0.025995554],"genre_scores_gemma":[0.7299774,0.0008221538,0.25242877,0.00019583516,0.00005514568,0.00014903555,0.0003558691,0.00015575581,0.015859976],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997559,0.0000264669,0.000007077882,0.00004389716,0.00015245356,0.000014250002],"domain_scores_gemma":[0.9996896,0.00006120848,0.000051902392,0.000054874978,0.0001254621,0.000016933911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016294494,0.00028906687,0.0001928995,0.00051109446,0.00036030347,0.00039646745,0.0005960464,0.00035900075,0.0014641226],"category_scores_gemma":[0.00051557226,0.00013132388,0.00015056726,0.0004920592,0.00024562274,0.00040179788,0.0002198978,0.00050377334,0.0006490122],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035493023,0.00015134767,0.0023698185,0.0005686292,0.00007707079,0.0006988235,0.00021307019,0.0718528,0.5056722,0.018977039,0.009171891,0.38989237],"study_design_scores_gemma":[0.000060845738,0.00029639128,0.0022330957,0.000055166114,0.000052368887,0.0011335389,0.000038161135,0.55555284,0.39384237,0.0018931488,0.04474543,0.000096724754],"about_ca_topic_score_codex":0.0025959972,"about_ca_topic_score_gemma":0.0039473204,"teacher_disagreement_score":0.0025959972,"about_ca_system_score_codex":0.0007381475,"about_ca_system_score_gemma":0.00075961376,"threshold_uncertainty_score":0.005355656},"labels":[],"label_agreement":null},{"id":"W4387448614","doi":"10.1109/mbits.2023.3322978","title":"Channel Coding for 6G Extreme Connectivity—Requirements, Capabilities, and Fundamental Tradeoffs","year":2023,"lang":"en","type":"article","venue":"IEEE BITS the Information Theory Magazine","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Coding (social sciences); Channel (broadcasting); Computer science; Computer network; Mathematics","score_opus":0.0514779672806878,"score_gpt":0.2731061771956912,"score_spread":0.2216282099150034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387448614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066132374,0.1783287,0.52979493,0.05194828,0.0018116822,0.00013673541,0.00074252754,0.00041240538,0.17069231],"genre_scores_gemma":[0.77659965,0.112388484,0.09613386,0.0029103756,0.002719061,0.00026999175,0.0004690485,0.00013394067,0.008375485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840003,0.0005112165,0.000054627715,0.00013984907,0.00072445616,0.00016980035],"domain_scores_gemma":[0.99383825,0.0040823943,0.0002333833,0.00046418147,0.001202144,0.00017957544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025604435,0.0007806025,0.00057660765,0.0012070931,0.0007607351,0.0029217852,0.0011671542,0.0022234332,0.0035903975],"category_scores_gemma":[0.01061348,0.00044098968,0.0002398334,0.0013818035,0.0024293961,0.0061967005,0.0021374382,0.0028368132,0.0009829716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007472881,0.000027670501,0.0006757785,0.00039235762,0.000018227689,0.0001385425,0.00022873229,0.027492467,0.003542064,0.8631762,0.006809323,0.097423926],"study_design_scores_gemma":[0.00001418529,0.00014018494,0.00071898894,0.00072073203,0.000024324578,0.0008348455,0.0004256151,0.115458496,0.0032712077,0.8237302,0.054584213,0.000076926226],"about_ca_topic_score_codex":0.0014889402,"about_ca_topic_score_gemma":0.0017567447,"teacher_disagreement_score":0.0035903975,"about_ca_system_score_codex":0.0015539563,"about_ca_system_score_gemma":0.0010817657,"threshold_uncertainty_score":0.013541043},"labels":[],"label_agreement":null},{"id":"W4387485598","doi":"10.1109/istc57237.2023.10273508","title":"Unrolled and Pipelined Decoders based on Look-Up Tables for Polar Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Lookup table; Computer science; Decoding methods; Throughput; Soft-decision decoder; Electronic circuit; Parallel computing; Polar code; Video decoder; Code (set theory); Error detection and correction; Algorithm; Computer hardware; Computer engineering; Telecommunications; Electrical engineering; Wireless; Set (abstract data type)","score_opus":0.02469445331066868,"score_gpt":0.2879558887968896,"score_spread":0.26326143548622094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387485598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19872528,0.0009332789,0.7849399,0.00016480044,0.00018376108,0.00014126059,0.00053147884,0.0064072614,0.007972962],"genre_scores_gemma":[0.5323307,0.00040439435,0.458585,0.00012240701,0.00003201783,0.00006362116,0.00052816333,0.00022500166,0.007708667],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984896,0.000023140463,0.000016402662,0.000029159204,0.00006211719,0.000020134179],"domain_scores_gemma":[0.99958664,0.0001258187,0.00006694618,0.000110206674,0.00009388902,0.000016526186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016380766,0.00027809406,0.00019145668,0.0003573748,0.00019664146,0.0006052846,0.00044594728,0.00024921042,0.0036296197],"category_scores_gemma":[0.0007300583,0.00018466814,0.00017729065,0.00041210768,0.00030484746,0.00060199137,0.00021085209,0.00038303426,0.00077980175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001019228,0.00014079007,0.0026211862,0.00054546935,0.00006255206,0.0007493398,0.00037975347,0.074375264,0.51810384,0.04497285,0.004823056,0.35220668],"study_design_scores_gemma":[0.000094611634,0.0007420337,0.0015715732,0.00007558558,0.00007241933,0.0009796424,0.000099202465,0.4001069,0.5594511,0.007682617,0.029044649,0.00007963878],"about_ca_topic_score_codex":0.0012821314,"about_ca_topic_score_gemma":0.0034673803,"teacher_disagreement_score":0.0036296197,"about_ca_system_score_codex":0.00041820045,"about_ca_system_score_gemma":0.00069282384,"threshold_uncertainty_score":0.012142301},"labels":[],"label_agreement":null},{"id":"W4387485745","doi":"10.1109/istc57237.2023.10273491","title":"xSA: A Binary Cross-Entropy Simulated Annealing Polar Decoder","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Additive white Gaussian noise; Polar code; Polar; Binary number; Algorithm; Simulated annealing; Code word; Binary code; Entropy (arrow of time); Electronic engineering; Channel (broadcasting); Telecommunications; Mathematics; Arithmetic; Physics; Engineering","score_opus":0.02618641002360352,"score_gpt":0.3267192362714411,"score_spread":0.3005328262478376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387485745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029291097,0.00024401974,0.96284944,0.00019814499,0.0000755244,0.00008360163,0.00013540126,0.000879256,0.0062434953],"genre_scores_gemma":[0.49738106,0.000253646,0.4948178,0.00026600424,0.000034727786,0.0002029501,0.00025120145,0.00014653218,0.0066460683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974424,0.00010533723,0.000010418992,0.000026117514,0.00009134706,0.000022650707],"domain_scores_gemma":[0.9996006,0.00020594042,0.00003383635,0.00003965676,0.000096215925,0.00002386324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052078994,0.00040145367,0.00049618277,0.00035676107,0.00027332996,0.00060626207,0.0005711595,0.0006964185,0.0021558274],"category_scores_gemma":[0.0012443751,0.00023559137,0.00030342376,0.00032769766,0.00043995303,0.00037627993,0.0006148861,0.0007301209,0.000581365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022759326,0.000056861536,0.0007569206,0.00008582307,0.000049107453,0.000099459714,0.00005434248,0.90531313,0.01326041,0.023669166,0.0018326181,0.054594513],"study_design_scores_gemma":[0.000015311276,0.000031893243,0.000034626526,0.0000032763091,0.0000032693863,0.000019621762,0.000004084921,0.99522287,0.0026743736,0.001311589,0.0006747668,0.0000044102403],"about_ca_topic_score_codex":0.0015536471,"about_ca_topic_score_gemma":0.0022786462,"teacher_disagreement_score":0.0021558274,"about_ca_system_score_codex":0.00040244055,"about_ca_system_score_gemma":0.0011842246,"threshold_uncertainty_score":0.007211983},"labels":[],"label_agreement":null},{"id":"W4387489238","doi":"10.1109/istc57237.2023.10273544","title":"Polar Coded Distribution Matching for Probabilistic Shaping and Stealth Communication","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polar code; Decoding methods; Binary number; Polar; Probabilistic logic; Algorithm; Encoder; Entropy (arrow of time); Mathematics; Encoding (memory); Computer science; Invertible matrix; Divergence (linguistics); Discrete mathematics; Physics; Statistics","score_opus":0.05304551128385226,"score_gpt":0.3192480140571802,"score_spread":0.2662025027733279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387489238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014826117,0.0002030933,0.9795024,0.00019872305,0.00004405268,0.00003229704,0.000048211838,0.00014756566,0.0049975626],"genre_scores_gemma":[0.7793562,0.0005623305,0.21167238,0.0003745807,0.000079316465,0.0001385942,0.00012892543,0.00007554454,0.0076122386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.0002562356,0.000028822244,0.00012915522,0.00026106197,0.0000960626],"domain_scores_gemma":[0.998771,0.000551162,0.00020172838,0.00028032786,0.00013026601,0.000065510416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084530225,0.0005507129,0.0006046572,0.00051146315,0.0004993689,0.0009059418,0.00094546855,0.0010589861,0.002219261],"category_scores_gemma":[0.0035970772,0.0002581292,0.00035500483,0.0007346089,0.0016032319,0.0016160551,0.0020756065,0.0013465021,0.0007320571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029931497,0.000059122412,0.00028861308,0.000100292076,0.00002364095,0.00015254001,0.00013549656,0.16202065,0.026847593,0.74214715,0.0013207502,0.06660482],"study_design_scores_gemma":[0.00003651479,0.000122716,0.000093292256,0.00003342114,0.000013994231,0.00024500577,0.000025956106,0.79319346,0.020676551,0.18083005,0.0046868552,0.0000421224],"about_ca_topic_score_codex":0.00036540045,"about_ca_topic_score_gemma":0.000263073,"teacher_disagreement_score":0.002219261,"about_ca_system_score_codex":0.0008158016,"about_ca_system_score_gemma":0.0007864805,"threshold_uncertainty_score":0.0074241757},"labels":[],"label_agreement":null},{"id":"W4387928595","doi":"10.48550/arxiv.2310.13825","title":"Generalized Spatially-Coupled Product-Like Codes Using Zipper Codes With Irregular Degree","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zipper; Chevron (anatomy); Decoding methods; Algorithm; Degree (music); Computer science; Product (mathematics); Mathematics; Physics; Geometry","score_opus":0.14328961644321161,"score_gpt":0.22569798340696695,"score_spread":0.08240836696375534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387928595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41067436,0.0005066225,0.57268476,0.00025920683,0.00007661233,0.00011009411,0.0001598219,0.0005392436,0.014989282],"genre_scores_gemma":[0.95128727,0.00023551297,0.045436177,0.00005158954,0.000018770168,0.000061555285,0.00006554763,0.000043471267,0.0028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00013811445,0.000019824047,0.000063595224,0.00018125823,0.000076411576],"domain_scores_gemma":[0.9977174,0.0010791554,0.00035180792,0.00041597485,0.00033573777,0.00009988805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005774496,0.0005379069,0.00054805283,0.00069107505,0.00058381434,0.0009909341,0.0008462391,0.00074424734,0.0015846406],"category_scores_gemma":[0.0029436941,0.00032696902,0.00038167395,0.0011023318,0.0013437618,0.001215304,0.00091973506,0.00072168384,0.0002931665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023145047,0.00005161251,0.0021410456,0.00013559469,0.000056447512,0.00045128757,0.00027565775,0.44068497,0.020509992,0.5163369,0.0008138945,0.018311061],"study_design_scores_gemma":[0.000019541261,0.000053811887,0.00023396453,0.000015408867,0.00001543973,0.00014078165,0.000034077937,0.93670875,0.008025006,0.053355977,0.0013673515,0.000029976773],"about_ca_topic_score_codex":0.0015917646,"about_ca_topic_score_gemma":0.0018361091,"teacher_disagreement_score":0.0015917646,"about_ca_system_score_codex":0.0010542093,"about_ca_system_score_gemma":0.0008035961,"threshold_uncertainty_score":0.0076488853},"labels":[],"label_agreement":null},{"id":"W4388427910","doi":"10.1109/blackseacom58138.2023.10299751","title":"Decoding of Polar Codes with Finite Memory","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Sequence (biology); Sequential decoding; Tree (set theory); Binary number; List decoding; Stack (abstract data type); Mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.024175290292292744,"score_gpt":0.26752628012945306,"score_spread":0.24335098983716033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388427910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050523777,0.0003142175,0.94363844,0.000105411396,0.00005566489,0.00005190404,0.0000774738,0.0005405805,0.0046925396],"genre_scores_gemma":[0.51773787,0.0006495927,0.47384527,0.00017362786,0.000075168435,0.00011842774,0.00042918755,0.00013555864,0.006835348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942833,0.00013088275,0.000037745423,0.00006125927,0.00026334487,0.00007844054],"domain_scores_gemma":[0.9987697,0.00055471295,0.00011539835,0.00018111718,0.00034355058,0.00003553128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059101597,0.00045163772,0.00042064418,0.0006422967,0.00044779602,0.0009549172,0.0007124474,0.00046902522,0.0014398441],"category_scores_gemma":[0.0033912335,0.00020470843,0.00032609486,0.00070308713,0.00065468944,0.0010031755,0.0010997002,0.000619231,0.00076656777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010327019,0.0000892749,0.0018911785,0.0003166995,0.00006848574,0.00045928732,0.0003902057,0.3095632,0.069310635,0.14097029,0.0023270568,0.47358102],"study_design_scores_gemma":[0.000055085224,0.0001722953,0.00027973225,0.000029811878,0.000019877998,0.0002876836,0.000055442764,0.89449173,0.06387438,0.035832196,0.0048744986,0.000027210452],"about_ca_topic_score_codex":0.001872994,"about_ca_topic_score_gemma":0.0017861981,"teacher_disagreement_score":0.001872994,"about_ca_system_score_codex":0.00045239777,"about_ca_system_score_gemma":0.0013693874,"threshold_uncertainty_score":0.0048167706},"labels":[],"label_agreement":null},{"id":"W4388440812","doi":"10.18280/isi.280501","title":"Enhancing Data Communication Performance: A Comprehensive Review and Evaluation of LDPC Decoder Architectures","year":2023,"lang":"en","type":"review","venue":"Ingénierie des systèmes d information","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Low-density parity-check code; Computer science; Computer architecture; Computer network; Decoding methods; Telecommunications","score_opus":0.1348483463923471,"score_gpt":0.3809632701025224,"score_spread":0.2461149237101753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388440812","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016685498,0.9914261,0.0030312038,0.00027163423,0.0001660212,0.000019693134,0.000060616898,0.000036279675,0.0033198604],"genre_scores_gemma":[0.0076820115,0.98808986,0.002864319,0.00020327698,0.00014990407,0.00001970212,0.00010094872,0.000014544872,0.00087546697],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994305,0.00010044247,0.00009206481,0.00008602573,0.0002533107,0.00003768414],"domain_scores_gemma":[0.9981839,0.0010608569,0.00014871957,0.00006175702,0.00050699007,0.000037725687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010833333,0.0008353505,0.0009166176,0.0026670382,0.00033585535,0.0011022782,0.0008796691,0.0007922193,0.0025118745],"category_scores_gemma":[0.0028153786,0.00046147345,0.0006798607,0.002749746,0.00039387247,0.0015152112,0.0005615775,0.00084611657,0.0008092734],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009133938,0.00007374434,0.000569904,0.02490655,0.000107322354,0.00014906515,0.00014098716,0.0036811861,0.004539089,0.008910621,0.011853593,0.94497657],"study_design_scores_gemma":[0.000019047933,0.00068383967,0.0020295419,0.010609075,0.0005372179,0.0013811253,0.00019010452,0.004759253,0.01392121,0.004562461,0.96120596,0.000101213824],"about_ca_topic_score_codex":0.0016750308,"about_ca_topic_score_gemma":0.0017024347,"teacher_disagreement_score":0.0026670382,"about_ca_system_score_codex":0.0006226594,"about_ca_system_score_gemma":0.0015938818,"threshold_uncertainty_score":0.008403122},"labels":[],"label_agreement":null},{"id":"W4389309777","doi":"10.1142/s0218126624501664","title":"A Low-Cost and Fault-Tolerant Stochastic Architecture for the Bernsen Algorithm Using Bitstream Correlation","year":2023,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic computing; Bitstream; Computer science; Algorithm; Overhead (engineering); Binary number; Pixel; Noise (video); Thresholding; Fault tolerance; Computer engineering; Image (mathematics); Artificial intelligence; Decoding methods; Mathematics; Arithmetic; Distributed computing","score_opus":0.026208676485155544,"score_gpt":0.2672539993132319,"score_spread":0.24104532282807636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389309777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1900989,0.00080784893,0.79705656,0.00037845285,0.00013918155,0.00014045616,0.00010767359,0.003050842,0.008220139],"genre_scores_gemma":[0.7978236,0.00022048724,0.19736062,0.00018969867,0.00003880461,0.00007095481,0.00013465589,0.000054858923,0.004106307],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997342,0.000036324524,0.000018512206,0.000054227432,0.00012199044,0.000034742745],"domain_scores_gemma":[0.9996481,0.00005876974,0.0000653008,0.00006951751,0.00013746417,0.000020809659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017797443,0.00031973905,0.0002678194,0.0005897054,0.00049386173,0.0005180148,0.001020512,0.0004003887,0.0014628272],"category_scores_gemma":[0.0005582325,0.0001416328,0.00025891472,0.0005758826,0.0002814136,0.0006303654,0.00028401465,0.0004237179,0.0003306567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079517945,0.00033311694,0.0037291197,0.00039155022,0.00018809372,0.0005719725,0.00027718584,0.10480302,0.42642838,0.048125394,0.006644078,0.4077129],"study_design_scores_gemma":[0.000082804705,0.0010442156,0.0026257946,0.000060088103,0.00012886382,0.00095641654,0.0000507739,0.73465306,0.23850046,0.00605699,0.015754124,0.000086354165],"about_ca_topic_score_codex":0.0020261933,"about_ca_topic_score_gemma":0.004383895,"teacher_disagreement_score":0.0020261933,"about_ca_system_score_codex":0.00063127413,"about_ca_system_score_gemma":0.0008669998,"threshold_uncertainty_score":0.004893601},"labels":[],"label_agreement":null},{"id":"W4390691092","doi":"10.1109/tvlsi.2023.3348809","title":"Design of a Stochastic Computing Architecture for the Phansalkar Algorithm","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic computing; Computer science; Algorithm; Key (lock); Architecture; Stochastic process; Binary number; Mathematics; Arithmetic; Computation","score_opus":0.02181472295618142,"score_gpt":0.27455614856555155,"score_spread":0.25274142560937013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390691092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029451814,0.00022637007,0.96454793,0.00019820775,0.00006000493,0.00011527095,0.000048184702,0.0010331812,0.004319014],"genre_scores_gemma":[0.6242417,0.00019495099,0.37141708,0.00021414373,0.000051490133,0.00016951968,0.00011923549,0.000055343415,0.0035365643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966896,0.000051382038,0.000028976776,0.00006991869,0.00013751438,0.000043319462],"domain_scores_gemma":[0.9997328,0.000046582336,0.0000308525,0.00003119859,0.00014125701,0.000017293272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028396593,0.00032140838,0.00028393208,0.00047729505,0.0005732657,0.00064796803,0.0010420653,0.0004297444,0.0017860263],"category_scores_gemma":[0.00053558114,0.00019609924,0.00028742923,0.00036629627,0.0002781434,0.00049882795,0.00031787012,0.0004425394,0.0005628995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004748386,0.00021185161,0.0030342466,0.00027378454,0.00014273117,0.00038780892,0.0002182164,0.31679973,0.22099756,0.075775355,0.006192139,0.37549168],"study_design_scores_gemma":[0.000032016866,0.0002762553,0.0005602914,0.000018338389,0.000039152535,0.0002516036,0.000020180232,0.9342217,0.050383672,0.004018456,0.0101520745,0.000026304026],"about_ca_topic_score_codex":0.0021522504,"about_ca_topic_score_gemma":0.003186554,"teacher_disagreement_score":0.0021522504,"about_ca_system_score_codex":0.0007926063,"about_ca_system_score_gemma":0.0012635328,"threshold_uncertainty_score":0.005974829},"labels":[],"label_agreement":null},{"id":"W4390846322","doi":"10.1007/978-3-031-42478-6_11","title":"Stochastic and Approximate Computing for Deep Learning: A Survey","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"","keywords":"Deep learning; Stochastic computing; Computer science; Artificial intelligence; Computer engineering; Machine learning; Computation; Theoretical computer science; Computer architecture; Artificial neural network; Algorithm","score_opus":0.054952124035563654,"score_gpt":0.2824429923061002,"score_spread":0.22749086827053655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390846322","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002038246,0.26914182,0.70115554,0.0019140502,0.0011531332,0.00005075291,0.00031667316,0.00082732714,0.02340246],"genre_scores_gemma":[0.06302031,0.45097575,0.44567567,0.0012768665,0.004390387,0.00019312838,0.0011056088,0.0007804614,0.032581903],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913627,0.00015753838,0.0000645252,0.0001503798,0.00044775117,0.000043607623],"domain_scores_gemma":[0.9986885,0.0007664039,0.00004500149,0.0002142575,0.00024883213,0.00003704243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706108,0.0011361868,0.0013227478,0.0015119748,0.00038548803,0.0022599043,0.0017527723,0.0013689258,0.0063144127],"category_scores_gemma":[0.0038123927,0.0008475682,0.0007232157,0.0060227592,0.0012958847,0.0034802395,0.0016578403,0.0029164946,0.0028637322],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043687443,0.00010083374,0.00035514982,0.0015066407,0.00005470735,0.000039203842,0.00006539001,0.027401231,0.0012391189,0.19317745,0.038923975,0.73709255],"study_design_scores_gemma":[0.000019765683,0.00011878563,0.0007476823,0.00076115364,0.000044478515,0.0004449491,0.00005995607,0.23215853,0.003038565,0.48363793,0.27890423,0.000064058775],"about_ca_topic_score_codex":0.0028528776,"about_ca_topic_score_gemma":0.0035128754,"teacher_disagreement_score":0.0063144127,"about_ca_system_score_codex":0.0011945241,"about_ca_system_score_gemma":0.0013589691,"threshold_uncertainty_score":0.021123886},"labels":[],"label_agreement":null},{"id":"W4391759548","doi":"10.1109/lcomm.2024.3365091","title":"Shortened Polar Codes Under Automorphism Ensemble Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Polar; List decoding; Computer science; Block code; Algorithm; Automorphism; Block (permutation group theory); Mathematics; Concatenated error correction code; Discrete mathematics; Combinatorics; Physics","score_opus":0.04822192735172226,"score_gpt":0.31186390321949553,"score_spread":0.26364197586777327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391759548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107099086,0.00032158714,0.8820679,0.00021875443,0.00011088241,0.000077168035,0.00016097608,0.00068817404,0.009255507],"genre_scores_gemma":[0.66400355,0.00056721905,0.32640186,0.00020760471,0.000107584,0.000117403535,0.0005180966,0.00013991124,0.00793681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.00010608195,0.000029001189,0.00007056419,0.00019297055,0.00009057338],"domain_scores_gemma":[0.9991358,0.00019629626,0.00009932179,0.00023886462,0.00028718042,0.000042626893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982654,0.00056556886,0.0004080855,0.0005083801,0.0004241301,0.00047034307,0.00050176674,0.0004219229,0.001486081],"category_scores_gemma":[0.0016055072,0.00014640644,0.0002738334,0.0006882957,0.0005478014,0.0009780518,0.00093128445,0.0006351879,0.0008555917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008529696,0.000079471734,0.0020461835,0.00026255843,0.000073599294,0.0007684055,0.00042588508,0.2568058,0.17332953,0.23149152,0.0044773514,0.32938665],"study_design_scores_gemma":[0.00005340715,0.00032574162,0.0004559349,0.000036489353,0.00003986279,0.0005855339,0.00010529585,0.79081064,0.1275604,0.06702184,0.012954271,0.000050538652],"about_ca_topic_score_codex":0.0009742879,"about_ca_topic_score_gemma":0.0010730363,"teacher_disagreement_score":0.001486081,"about_ca_system_score_codex":0.00036069078,"about_ca_system_score_gemma":0.00087690115,"threshold_uncertainty_score":0.004971504},"labels":[],"label_agreement":null},{"id":"W4392172655","doi":"10.1109/tcomm.2024.3369731","title":"Performance-Complexity-Latency Trade-Offs of Concatenated RS-BCH Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"BCH code; Computer science; Concatenated error correction code; Serial concatenated convolutional codes; Turbo code; Decoding methods; Block code; Algorithm","score_opus":0.07034727249593856,"score_gpt":0.3143094297924595,"score_spread":0.24396215729652096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6802579,0.0026407756,0.27510405,0.0010337294,0.00006585404,0.0001946418,0.00046017877,0.00043900078,0.039803855],"genre_scores_gemma":[0.9824723,0.00047961157,0.014992331,0.00005731966,0.00003202916,0.00007050546,0.000086283995,0.000073451105,0.0017362109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712354,0.00090768636,0.00010909103,0.00017029617,0.001150894,0.0005385388],"domain_scores_gemma":[0.9762831,0.019451616,0.0015668613,0.0008677333,0.0015514523,0.0002792714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039042172,0.0013961629,0.0009169626,0.0020381778,0.0008622388,0.0020979543,0.001053054,0.0011465116,0.0019841054],"category_scores_gemma":[0.020397317,0.00044943925,0.0005484311,0.0018924988,0.0014570118,0.0017920118,0.0012174271,0.0008570273,0.00041168203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020776784,0.000056972433,0.00073885865,0.00007289972,0.000023402543,0.00019072159,0.00009483121,0.93900335,0.0055047935,0.043621223,0.00031135973,0.010173798],"study_design_scores_gemma":[0.000013758955,0.00014735444,0.0005132758,0.000034256216,0.000017029819,0.00014657587,0.00005192625,0.9727079,0.0053524524,0.020736653,0.00025429408,0.000024536483],"about_ca_topic_score_codex":0.002009884,"about_ca_topic_score_gemma":0.0023258817,"teacher_disagreement_score":0.0039042172,"about_ca_system_score_codex":0.0028327908,"about_ca_system_score_gemma":0.0019798637,"threshold_uncertainty_score":0.020647764},"labels":[],"label_agreement":null},{"id":"W4392250595","doi":"10.3934/amc.2024007","title":"A criterion for decoding on the binary symmetric channel","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Decoding methods; Binary number; Binary symmetric channel; Channel (broadcasting); Combinatorics; Algorithm; Arithmetic; Channel code; Telecommunications; Computer science","score_opus":0.06436179215317825,"score_gpt":0.3763330940520546,"score_spread":0.31197130189887634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1087347,0.00046485302,0.84353745,0.0029054726,0.00016331808,0.00023122304,0.00088185,0.0010533679,0.042027775],"genre_scores_gemma":[0.8642728,0.000760131,0.11570075,0.0011530517,0.00041078756,0.0007480776,0.0011991098,0.0007669049,0.014988401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994385,0.0010601017,0.0002936867,0.00079028466,0.0025926426,0.00087828457],"domain_scores_gemma":[0.98361546,0.008398197,0.0012473856,0.0022653558,0.0035092158,0.0009643371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009213,0.0012983258,0.0011877816,0.003025012,0.0019532635,0.0027265823,0.0020552608,0.002606736,0.0054984507],"category_scores_gemma":[0.029134797,0.0005597928,0.00080614665,0.0020350271,0.0043314896,0.005202984,0.0051600565,0.0035555386,0.0027122304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018488045,0.00004300824,0.0007418847,0.00008560734,0.000018731103,0.0001757978,0.00021086866,0.033561423,0.008519906,0.9340391,0.003783641,0.018635178],"study_design_scores_gemma":[0.000059978833,0.00013089094,0.00040563647,0.00005927582,0.000015242348,0.0002292491,0.00006997466,0.18553416,0.0139464345,0.7938143,0.0056744865,0.00006042891],"about_ca_topic_score_codex":0.0015905473,"about_ca_topic_score_gemma":0.00078005256,"teacher_disagreement_score":0.0054984507,"about_ca_system_score_codex":0.002987366,"about_ca_system_score_gemma":0.0028898104,"threshold_uncertainty_score":0.02167499},"labels":[],"label_agreement":null},{"id":"W4392745889","doi":"10.1109/peeic59336.2023.10450823","title":"Integration of Quantum Computing Techniques in MIMO System Optimization","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; MIMO; Quantum; Quantum computer; Computer engineering; Computational science; Computer architecture; Distributed computing; Telecommunications; Physics; Quantum mechanics","score_opus":0.02543860654175865,"score_gpt":0.2865633353051522,"score_spread":0.26112472876339354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392745889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022899542,0.0014676035,0.9635246,0.00045420922,0.00007890364,0.000029243254,0.000015232484,0.00008507891,0.011445585],"genre_scores_gemma":[0.8121193,0.0022081942,0.18306468,0.00020317224,0.00009670742,0.000071450326,0.000017079336,0.00004526249,0.0021741076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952304,0.00019763224,0.000015781196,0.00003938579,0.00018793315,0.00003630244],"domain_scores_gemma":[0.99937195,0.00046186335,0.000041135485,0.00006319378,0.000046462606,0.000015471127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117745,0.00034852483,0.00057275564,0.00037913726,0.0004481351,0.00080047175,0.0004402582,0.0006057913,0.0011147574],"category_scores_gemma":[0.0017178996,0.00020641185,0.0003808496,0.000483737,0.0012709027,0.0009744123,0.0008154856,0.00084739743,0.00015417759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033269498,0.00003305886,0.00024845675,0.00010915267,0.000038062855,0.000057507626,0.000074470096,0.60694426,0.0053969063,0.35456687,0.00034002433,0.032157924],"study_design_scores_gemma":[0.000005739317,0.00004983104,0.000090119865,0.000012616983,0.0000069414755,0.000026362088,0.000012836393,0.9360517,0.001555241,0.06084834,0.0013293448,0.000010929298],"about_ca_topic_score_codex":0.00091458316,"about_ca_topic_score_gemma":0.0010244166,"teacher_disagreement_score":0.0011147574,"about_ca_system_score_codex":0.0005649471,"about_ca_system_score_gemma":0.0006398293,"threshold_uncertainty_score":0.0040990114},"labels":[],"label_agreement":null},{"id":"W4393179239","doi":"10.1017/9781009283403.003","title":"Coding for Erasures and Fountain Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fountain code; Fountain; Coding (social sciences); Computer science; Theoretical computer science; Telecommunications; Decoding methods; Block code; Mathematics; Statistics; Art; Concatenated error correction code; Visual arts","score_opus":0.03017507344784999,"score_gpt":0.2313693949536215,"score_spread":0.2011943215057715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179239","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026085875,0.07720481,0.19491568,0.0047445535,0.005883952,0.00017900018,0.001921798,0.002172737,0.710369],"genre_scores_gemma":[0.040529314,0.070998125,0.06444656,0.0023351386,0.0027947964,0.0003088131,0.0027198459,0.0012951909,0.8145723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.000050252384,0.000015865968,0.000041077037,0.00033888433,0.000036193396],"domain_scores_gemma":[0.9990721,0.00043356835,0.00002765531,0.0001418875,0.00030126606,0.000023436445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003863574,0.00082723843,0.00048321922,0.00221936,0.00061513996,0.0013787951,0.0007066052,0.00094053015,0.05686794],"category_scores_gemma":[0.002760127,0.0003191616,0.00037611512,0.0023232433,0.0008616339,0.0020401827,0.000691765,0.0016920222,0.022499194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020707148,0.000013296604,0.000050324732,0.00044363053,0.000008625012,0.00009056629,0.000116531664,0.002932608,0.0014457243,0.37522995,0.35453832,0.26510966],"study_design_scores_gemma":[0.000004481908,0.000026960884,0.00022011306,0.00038188262,0.000005837766,0.00037629533,0.000031572992,0.004165452,0.0012445662,0.14964716,0.84387594,0.000019702142],"about_ca_topic_score_codex":0.0021585196,"about_ca_topic_score_gemma":0.002286044,"teacher_disagreement_score":0.05686794,"about_ca_system_score_codex":0.0010617039,"about_ca_system_score_gemma":0.0009430041,"threshold_uncertainty_score":0.19024223},"labels":[],"label_agreement":null},{"id":"W4396909551","doi":"10.1364/ofc.2024.w4c.2","title":"Generalized Staircase Codes with Arbitrary Bit Degree","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Degree (music); Bit (key); Computer science; Arithmetic; Algorithm; Theoretical computer science; Mathematics; Computer network; Physics","score_opus":0.03360972042386398,"score_gpt":0.2745653964507422,"score_spread":0.2409556760268782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396909551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34554985,0.0011173944,0.61559504,0.0007440339,0.00022338267,0.00012803575,0.00058806874,0.0006688564,0.035385277],"genre_scores_gemma":[0.914508,0.0006420229,0.07373707,0.00029485952,0.00006297362,0.00009651024,0.000214807,0.00007528421,0.010368386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996866,0.0000486036,0.000015338832,0.00004831107,0.0001205438,0.000080510814],"domain_scores_gemma":[0.9991359,0.00019490192,0.000093288,0.0002584534,0.0002452461,0.000072210816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020851038,0.0004065688,0.00031816025,0.0006394172,0.00038379617,0.0009110204,0.0006618573,0.0006608977,0.0019479943],"category_scores_gemma":[0.0015811243,0.00016878147,0.00029192952,0.0009985261,0.00080676645,0.0012542396,0.00077334733,0.001076732,0.0005842015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020862995,0.000033242406,0.00048085875,0.00009846516,0.000018996052,0.00040144735,0.00018879538,0.04779157,0.04084791,0.87172616,0.0022280565,0.035975862],"study_design_scores_gemma":[0.00006369957,0.00015473174,0.0005527534,0.00005826834,0.00001934821,0.00072129705,0.00007916056,0.39094764,0.030074,0.5528608,0.024390891,0.00007744636],"about_ca_topic_score_codex":0.001915394,"about_ca_topic_score_gemma":0.0033291532,"teacher_disagreement_score":0.0019479943,"about_ca_system_score_codex":0.00065491756,"about_ca_system_score_gemma":0.0008361971,"threshold_uncertainty_score":0.006516695},"labels":[],"label_agreement":null},{"id":"W4399828230","doi":"10.1007/978-3-031-54071-4_15","title":"Optimal Real-Time Coding and Control Under Information Constraints: Structural and Existence Results","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Coding (social sciences); Computer science; Control (management); Mathematics; Artificial intelligence; Statistics","score_opus":0.011445853822443851,"score_gpt":0.23353395068598198,"score_spread":0.22208809686353814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029087922,0.0033461368,0.8814704,0.0021668354,0.00021747443,0.000055131433,0.00032080754,0.00019335642,0.08314194],"genre_scores_gemma":[0.7539874,0.010472795,0.18580303,0.000845839,0.0008066043,0.00034668314,0.0005993862,0.00041607095,0.046722233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00021455062,0.000033620818,0.00018614437,0.00028400336,0.000108747314],"domain_scores_gemma":[0.98832417,0.00944991,0.000684911,0.0004990569,0.0009008568,0.00014117624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189612,0.0014261493,0.0013571616,0.0015452867,0.00090400944,0.0025004558,0.0017249165,0.0023649863,0.009351582],"category_scores_gemma":[0.010601133,0.0010533851,0.0011420008,0.0029527813,0.003695979,0.0073157074,0.001661442,0.0037071614,0.0010515247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055321154,0.000035316607,0.00008313096,0.00019782325,0.000013294397,0.000056010802,0.00014369415,0.0489891,0.0012310221,0.92476124,0.0026041656,0.021829942],"study_design_scores_gemma":[0.000014000272,0.00002956007,0.00011773575,0.00006781206,0.000012087741,0.0000825588,0.00005221792,0.14091568,0.0009974056,0.855789,0.0019003171,0.00002154766],"about_ca_topic_score_codex":0.0019525161,"about_ca_topic_score_gemma":0.0015765595,"teacher_disagreement_score":0.009351582,"about_ca_system_score_codex":0.0017931218,"about_ca_system_score_gemma":0.0016922422,"threshold_uncertainty_score":0.031284153},"labels":[],"label_agreement":null},{"id":"W4400877879","doi":"10.1109/jsac.2024.3431579","title":"Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Decoding methods; Binary number; Polar; Sequential decoding; List decoding; Algorithm; Binary code; Quadratic equation; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; Mathematics","score_opus":0.05457634294375869,"score_gpt":0.3419000424481128,"score_spread":0.2873236995043541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400877879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014193614,0.00022434052,0.97847444,0.00018400607,0.000033584027,0.000033224525,0.00006686335,0.00015865128,0.0066313515],"genre_scores_gemma":[0.40747333,0.0008183198,0.5810956,0.00029168715,0.000061624945,0.00015717417,0.00041961108,0.00019037022,0.0094922995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956447,0.00015360197,0.000020572363,0.000064639215,0.00015186328,0.000044892495],"domain_scores_gemma":[0.9993358,0.00039068933,0.00006556372,0.000054230386,0.00013451328,0.000019195206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062178914,0.00067151204,0.0005288062,0.00035234002,0.00030136073,0.00086064107,0.00038459938,0.0006773553,0.002261919],"category_scores_gemma":[0.002091815,0.00030284692,0.00040423518,0.0005264706,0.0006545884,0.0007360234,0.00084480137,0.0009231024,0.0007122345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113282134,0.000034339915,0.000507385,0.0001655746,0.000034749544,0.00012860294,0.00009168042,0.83912426,0.009632967,0.087790765,0.0017826107,0.06059367],"study_design_scores_gemma":[0.000010817543,0.00002959438,0.000054811724,0.000012053889,0.0000041671824,0.000036147998,0.000011815943,0.98490125,0.0035629817,0.010034968,0.0013338546,0.000007533641],"about_ca_topic_score_codex":0.0017970497,"about_ca_topic_score_gemma":0.0024916858,"teacher_disagreement_score":0.002261919,"about_ca_system_score_codex":0.0005059403,"about_ca_system_score_gemma":0.0011895037,"threshold_uncertainty_score":0.0075668097},"labels":[],"label_agreement":null},{"id":"W4402263848","doi":"10.23919/acc60939.2024.10645022","title":"Near-Optimality of Finite-Memory Codes and Reinforcement Learning for Zero-Delay Coding of Markov Sources","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Markov chain; Coding (social sciences); Markov process; Zero (linguistics); Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.021626929265893637,"score_gpt":0.28063196093864345,"score_spread":0.2590050316727498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402263848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16858456,0.00031075193,0.8279638,0.0005537436,0.000032697277,0.00003873592,0.000044309585,0.00017615635,0.0022952354],"genre_scores_gemma":[0.9667175,0.00013122289,0.03157209,0.00007177678,0.000013574045,0.000048739013,0.000039295937,0.000033947526,0.0013718854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994523,0.00023052985,0.000024053601,0.0000838353,0.00011272874,0.00009661484],"domain_scores_gemma":[0.99072826,0.008034068,0.0004386322,0.00017826627,0.00042266084,0.0001981302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018814291,0.00058371224,0.000857935,0.0005183996,0.0004985903,0.0008360943,0.0009377375,0.0010427451,0.0012623828],"category_scores_gemma":[0.011935012,0.00040538478,0.0004229018,0.00036587,0.0022573264,0.001391971,0.00124609,0.0015448357,0.0001450848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063473744,0.000025111425,0.000384768,0.000025927679,0.000011495159,0.000036734942,0.0000491633,0.96287847,0.00082635187,0.031037863,0.00012418634,0.004536437],"study_design_scores_gemma":[0.000006275751,0.00001300254,0.000027379896,0.00000422171,0.000001360008,0.0000038974194,0.0000041637404,0.9880882,0.00038668685,0.011435217,0.000026488427,0.0000031467412],"about_ca_topic_score_codex":0.005369697,"about_ca_topic_score_gemma":0.0034407778,"teacher_disagreement_score":0.005369697,"about_ca_system_score_codex":0.0018101231,"about_ca_system_score_gemma":0.0019421154,"threshold_uncertainty_score":0.013133407},"labels":[],"label_agreement":null},{"id":"W4402475164","doi":"10.1109/tcomm.2024.3459851","title":"Reduced-Complexity Projection-Aggregation List Decoder for Reed-Muller Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Soft-decision decoder; Reed–Muller code; Decoding methods; Projection (relational algebra); Algorithm; Theoretical computer science; Electronic engineering; Telecommunications; Block code; Concatenated error correction code; Engineering","score_opus":0.1000569589430676,"score_gpt":0.36026396986538434,"score_spread":0.26020701092231674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031259768,0.00031378993,0.963274,0.000101281374,0.00004578599,0.00006640421,0.00013897267,0.0020125166,0.0027874862],"genre_scores_gemma":[0.49188298,0.00044662447,0.5017454,0.00015688075,0.000068596804,0.00014084173,0.00044327774,0.0001284528,0.0049869316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996001,0.00008845447,0.000035806253,0.000051348812,0.00018502021,0.000039243612],"domain_scores_gemma":[0.9988305,0.00040441076,0.00013335969,0.00019592809,0.0004019099,0.00003389338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694526,0.0006789115,0.0003430659,0.00057622936,0.00044659688,0.0005832221,0.000777339,0.00036223957,0.002027177],"category_scores_gemma":[0.0015235926,0.0002156371,0.00032948673,0.0007878029,0.00027256724,0.00093399076,0.00051713834,0.0007617431,0.001115052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063528743,0.00017149646,0.0026415857,0.00046780796,0.00012500524,0.00037904552,0.00026413487,0.18844472,0.24526736,0.09254838,0.0052272202,0.4638279],"study_design_scores_gemma":[0.000028064398,0.0003124586,0.00045429563,0.0000231921,0.000046246943,0.00039874524,0.000020674115,0.8262861,0.15980312,0.0070825564,0.005509658,0.00003490819],"about_ca_topic_score_codex":0.0017977639,"about_ca_topic_score_gemma":0.0044521843,"teacher_disagreement_score":0.002027177,"about_ca_system_score_codex":0.00062807725,"about_ca_system_score_gemma":0.0018143904,"threshold_uncertainty_score":0.006781578},"labels":[],"label_agreement":null},{"id":"W4402835080","doi":"10.1109/vtc2024-spring62846.2024.10683654","title":"Low-Complexity Decoder of Analog Fountain Codes for Industrial Internet of Things","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Fountain code; Fountain; Computer science; Internet of Things; Decoding methods; Telecommunications; Embedded system; Linear code; Block code; Art","score_opus":0.07462497066289304,"score_gpt":0.3227426252764472,"score_spread":0.24811765461355417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402835080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035046656,0.0004053545,0.9616903,0.00014168158,0.000040631534,0.00003620881,0.000047320136,0.0003555908,0.0022363004],"genre_scores_gemma":[0.67666465,0.00038346002,0.31912854,0.00023972093,0.000045296336,0.00006889716,0.00019384388,0.000051400264,0.0032241538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.00010660469,0.00003304211,0.000069509515,0.0003096103,0.000056774883],"domain_scores_gemma":[0.99921024,0.00031005594,0.000102440805,0.00010469194,0.00024185532,0.00003079661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549114,0.0004554201,0.00037195924,0.00045420096,0.00038426166,0.00050574186,0.00055640383,0.0005095248,0.0007844372],"category_scores_gemma":[0.0017644941,0.00013790031,0.00029834305,0.00044877845,0.0004512706,0.0006061479,0.00055088487,0.00056587567,0.00024150964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005940338,0.000104616076,0.006157777,0.0004958035,0.00016806721,0.0007377636,0.00035926863,0.34132597,0.15239546,0.083746135,0.0030532214,0.4108618],"study_design_scores_gemma":[0.00002806374,0.00016585605,0.00076010724,0.000030087418,0.000039999486,0.00054654805,0.000033049102,0.935949,0.047704197,0.009884266,0.0048291036,0.000029585384],"about_ca_topic_score_codex":0.0022135538,"about_ca_topic_score_gemma":0.003703887,"teacher_disagreement_score":0.0022135538,"about_ca_system_score_codex":0.00053933746,"about_ca_system_score_gemma":0.0011557477,"threshold_uncertainty_score":0.004401326},"labels":[],"label_agreement":null},{"id":"W4403278120","doi":"10.1109/fpl64840.2024.00052","title":"BitBlender: Scalable Bloom Filter Acceleration on FPGAs with Dynamic Scheduling","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bloom filter; Computer science; Scalability; Field-programmable gate array; Acceleration; Scheduling (production processes); Parallel computing; Dynamic priority scheduling; Real-time computing; Embedded system; Algorithm; Computer network; Operating system; Mathematical optimization; Physics; Mathematics","score_opus":0.016625452174970697,"score_gpt":0.267299876284414,"score_spread":0.2506744241094433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403278120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109222874,0.0016805952,0.83113164,0.0002985758,0.00025275964,0.00040577428,0.0008538948,0.04398621,0.012167756],"genre_scores_gemma":[0.48012337,0.00044317706,0.5093556,0.00030959924,0.00006637314,0.00023917711,0.00096580834,0.0007014116,0.0077954587],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994344,0.000075172,0.000044155153,0.000111079964,0.00023429669,0.00010080484],"domain_scores_gemma":[0.99932134,0.00021788974,0.00010041532,0.00015581399,0.00015478113,0.00004981682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172476,0.0009358364,0.00041336223,0.00090656837,0.0003280409,0.0007927333,0.0013353748,0.00035595117,0.0067867395],"category_scores_gemma":[0.0012267482,0.00033699183,0.00030376966,0.00061673403,0.0003031427,0.0012486783,0.00047498534,0.0004950551,0.0014259225],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020255519,0.00022766479,0.0058166212,0.00061547686,0.00012614626,0.00047397765,0.0002926794,0.09225307,0.21108523,0.01475341,0.028000465,0.6443297],"study_design_scores_gemma":[0.00025040642,0.0007374587,0.0015185707,0.0000681962,0.000055008084,0.0003341292,0.00006088689,0.6982729,0.26186398,0.0051512728,0.031599645,0.0000875159],"about_ca_topic_score_codex":0.004310908,"about_ca_topic_score_gemma":0.0068034804,"teacher_disagreement_score":0.0067867395,"about_ca_system_score_codex":0.0013318027,"about_ca_system_score_gemma":0.0010806817,"threshold_uncertainty_score":0.022703886},"labels":[],"label_agreement":null},{"id":"W4403393381","doi":"10.1134/s0032946024020017","title":"Girth Analysis of Quantum Quasi-Cyclic LDPC Codes","year":2024,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Girth (graph theory); Low-density parity-check code; Combinatorics; Quantum; Discrete mathematics; Algorithm; Decoding methods","score_opus":0.012365420161457868,"score_gpt":0.25938724131423474,"score_spread":0.24702182115277688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403393381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5700425,0.0014851354,0.3981035,0.0011418759,0.000101932514,0.00006386949,0.00043005942,0.0003742205,0.028256908],"genre_scores_gemma":[0.97625536,0.00056317117,0.020378541,0.00012646928,0.00006490436,0.000055714427,0.00018153054,0.00007737898,0.0022969344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.00017858298,0.000020052683,0.000066462104,0.00026860432,0.00009098155],"domain_scores_gemma":[0.99693906,0.0019372279,0.00022048996,0.00036929877,0.00042852687,0.00010545711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350477,0.00038929126,0.00032510993,0.0014794025,0.0005523712,0.0007522925,0.00069656444,0.00067312067,0.0016669887],"category_scores_gemma":[0.005070271,0.00027491612,0.00040741113,0.0008487874,0.0016952455,0.00095925404,0.00097369734,0.0013036733,0.0003001736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020829302,0.00004068,0.0025167814,0.00017004725,0.000048591937,0.00030925925,0.0005548839,0.2601423,0.026436357,0.6843355,0.002170403,0.023066912],"study_design_scores_gemma":[0.000014129496,0.000054613076,0.0012630763,0.000040206723,0.000013793081,0.00017772382,0.00005342352,0.6284549,0.0077044964,0.3602082,0.0019710073,0.000044367906],"about_ca_topic_score_codex":0.0009449562,"about_ca_topic_score_gemma":0.00057567714,"teacher_disagreement_score":0.0016669887,"about_ca_system_score_codex":0.001136196,"about_ca_system_score_gemma":0.0007130865,"threshold_uncertainty_score":0.00824374},"labels":[],"label_agreement":null},{"id":"W4403407815","doi":"10.1109/icc51166.2024.10622985","title":"On the Out-of-Distribution Evaluation of ML-Based End-to-End Communications Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Futurewei Technologies","keywords":"End-to-end principle; Computer science; End user; Telecommunications; Computer network; World Wide Web","score_opus":0.11249573167905515,"score_gpt":0.3680758551219959,"score_spread":0.2555801234429408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403407815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30795744,0.0016962864,0.6805794,0.00073995057,0.00012234584,0.00011028345,0.00021133578,0.0013204709,0.0072625107],"genre_scores_gemma":[0.96542126,0.00038474947,0.032793835,0.00016794183,0.000032595162,0.000030369167,0.00017244072,0.00009479533,0.0009019988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481803,0.0025030812,0.00027816827,0.00040840422,0.0016886125,0.00030368558],"domain_scores_gemma":[0.97548693,0.018407268,0.0013793687,0.0014892793,0.002950596,0.00028661144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006615988,0.0011218276,0.00078092323,0.0010873366,0.0004776068,0.0014391087,0.00079728774,0.0012791351,0.0011504134],"category_scores_gemma":[0.031301904,0.0002079965,0.00027366896,0.0006451584,0.0013372329,0.0023917444,0.0020635691,0.0009768797,0.00039784407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014327024,0.00021821188,0.008693339,0.0003288867,0.0001361691,0.00023339182,0.00015081561,0.83152354,0.01726531,0.008236719,0.0010014889,0.13077942],"study_design_scores_gemma":[0.000018077111,0.0004345832,0.0024539381,0.000035767465,0.000026576396,0.00025644418,0.00006086299,0.9632263,0.030409269,0.0025382661,0.0005141995,0.000025764228],"about_ca_topic_score_codex":0.0017818672,"about_ca_topic_score_gemma":0.0013041892,"teacher_disagreement_score":0.006615988,"about_ca_system_score_codex":0.0013321743,"about_ca_system_score_gemma":0.00078926637,"threshold_uncertainty_score":0.03498906},"labels":[],"label_agreement":null},{"id":"W4405675194","doi":"10.1007/978-3-031-76273-4_11","title":"Introducing Multidimensional Parallel Decoder to Reduce Cost of Implementation and Latency","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Latency (audio); Computer science; Parallel computing; Telecommunications","score_opus":0.044427901337953164,"score_gpt":0.3578496305056158,"score_spread":0.31342172916766264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405675194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008090107,0.0012127779,0.9597301,0.00032414802,0.00037308782,0.000081524886,0.00017663316,0.0043526324,0.025658943],"genre_scores_gemma":[0.07334286,0.0016467816,0.8536799,0.00046246086,0.00022757369,0.00011548578,0.00046796977,0.0007211512,0.06933589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999749,0.00004103853,0.000016140651,0.000055178316,0.000113336515,0.000025385789],"domain_scores_gemma":[0.9994398,0.00012784732,0.000027392192,0.00015920587,0.00022912794,0.000016683938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019636269,0.0008034008,0.00047449183,0.00062571955,0.0005403362,0.0013736378,0.00093080377,0.00078731513,0.0132630505],"category_scores_gemma":[0.00091652764,0.00039438327,0.00041325937,0.001232081,0.0002772136,0.0017663428,0.0008813323,0.0012837383,0.005827905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024627327,0.0001750464,0.0004854521,0.00045021795,0.000072790455,0.00040689672,0.00017438058,0.03055287,0.18698853,0.10464179,0.024879854,0.6509259],"study_design_scores_gemma":[0.000072556875,0.00035831064,0.0004761537,0.00012727061,0.00012461416,0.0026379863,0.00009478474,0.38529417,0.33741185,0.04130992,0.23199731,0.00009508587],"about_ca_topic_score_codex":0.0010624896,"about_ca_topic_score_gemma":0.0025022645,"teacher_disagreement_score":0.0132630505,"about_ca_system_score_codex":0.0006042557,"about_ca_system_score_gemma":0.0007950625,"threshold_uncertainty_score":0.04436934},"labels":[],"label_agreement":null},{"id":"W4405717973","doi":"10.1109/lcomm.2024.3521080","title":"Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Polar; Latency (audio); Forward error correction; Computer network; Telecommunications; Arithmetic; Mathematics","score_opus":0.03960159787015575,"score_gpt":0.3286500417338338,"score_spread":0.289048443863678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16589503,0.00029423911,0.8262635,0.00015671948,0.000047156354,0.000063390544,0.000083145664,0.0005030788,0.0066937385],"genre_scores_gemma":[0.6322993,0.00026517143,0.36429763,0.000077007295,0.000017220249,0.00006331476,0.00012303876,0.000063399406,0.002793983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998215,0.000045769655,0.0000067011065,0.000019305768,0.00007961378,0.000027194435],"domain_scores_gemma":[0.99972385,0.00011879532,0.00004709803,0.000021230038,0.00007949775,0.000009597387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022217516,0.00039291746,0.00019645967,0.00028775088,0.00022075196,0.0003472524,0.00029144756,0.00028448025,0.00081773056],"category_scores_gemma":[0.00073749915,0.0001194151,0.0001669849,0.0003262591,0.00023366458,0.0002675129,0.00028190907,0.00032978153,0.00027552148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024855844,0.00006302091,0.0013270612,0.00013995568,0.000033218494,0.00020677029,0.00014744463,0.69480413,0.12434229,0.040751353,0.0011359159,0.13680029],"study_design_scores_gemma":[0.00003378359,0.00017032189,0.0002188591,0.000011664089,0.000014228448,0.000096565025,0.000028905593,0.95164007,0.041778322,0.0039339736,0.0020606865,0.000012617205],"about_ca_topic_score_codex":0.0014335751,"about_ca_topic_score_gemma":0.0030331193,"teacher_disagreement_score":0.0014335751,"about_ca_system_score_codex":0.00036809297,"about_ca_system_score_gemma":0.0010299997,"threshold_uncertainty_score":0.0028504133},"labels":[],"label_agreement":null},{"id":"W4407710480","doi":"10.1093/mnras/staf285","title":"Neural network-based model of galaxy power spectrum: fast full-shape galaxy power spectrum analysis","year":2025,"lang":"en","type":"article","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Facilities Council; Faculty of Arts and Sciences; Office of Science; Alliance de recherche numérique du Canada; SLAC National Accelerator Laboratory; Durham University; National Energy Research Scientific Computing Center; Conservation Federation of Missouri; Harvard University; High Energy Physics; U.S. Department of Energy","keywords":"Physics; Galaxy; Astrophysics; Spectral density; Interacting galaxy; Power (physics); Type-cD galaxy; Disc galaxy; Galaxy merger; Astronomy; Galaxy formation and evolution","score_opus":0.007816696435529485,"score_gpt":0.2191314728716731,"score_spread":0.2113147764361436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407710480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22504942,0.00018278713,0.7630006,0.00063898193,0.000054607244,0.00007901669,0.0004189569,0.0024468778,0.008128755],"genre_scores_gemma":[0.90381366,0.000059050046,0.091247946,0.00019306818,0.00003087374,0.00013521784,0.00048249288,0.0003022672,0.0037354287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998456,0.000055039323,0.000005336973,0.000026225545,0.00004365411,0.000024111536],"domain_scores_gemma":[0.9993326,0.00035382915,0.000053314554,0.00007148925,0.00013970339,0.00004888445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007861213,0.00047963814,0.0004942573,0.00043301517,0.0004084829,0.00058666477,0.0018709307,0.0010329728,0.0046335324],"category_scores_gemma":[0.0030484798,0.00043191857,0.0004999957,0.00034455728,0.00058672123,0.0007811263,0.0007192649,0.0011666691,0.00077776687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021733147,0.00001170477,0.0007538906,0.0000073415613,0.000011072927,0.000021843902,0.000009447505,0.99370426,0.00035906598,0.0015810983,0.00023401462,0.0032846492],"study_design_scores_gemma":[0.0000015544213,9.647922e-7,0.000046384703,6.673793e-7,4.2043146e-7,0.0000016809689,6.257627e-7,0.9994962,0.00007958797,0.00034214236,0.000029027027,6.999046e-7],"about_ca_topic_score_codex":0.017590187,"about_ca_topic_score_gemma":0.013192911,"teacher_disagreement_score":0.017590187,"about_ca_system_score_codex":0.0012501344,"about_ca_system_score_gemma":0.0008986917,"threshold_uncertainty_score":0.03497559},"labels":[],"label_agreement":null},{"id":"W4408444399","doi":"10.3390/e27030309","title":"Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes","year":2025,"lang":"en","type":"article","venue":"Entropy","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polar; Decoding methods; Flip; Computer science; Algorithm; Arithmetic; Mathematics; Physics; Biology; Genetics","score_opus":0.014221093636434375,"score_gpt":0.2881601617932846,"score_spread":0.2739390681568502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408444399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12814334,0.0014148015,0.8611412,0.0001842635,0.00013416249,0.00026502658,0.00014754159,0.0033041413,0.005265569],"genre_scores_gemma":[0.7727401,0.00063757075,0.22130069,0.00020207759,0.00007828045,0.00021586879,0.00032242746,0.00014741257,0.0043554446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989755,0.00022836785,0.00008064914,0.00011393412,0.0004589816,0.00014256564],"domain_scores_gemma":[0.99720275,0.00080194516,0.00041252602,0.00063330185,0.0008789005,0.00007069857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010507996,0.0007964081,0.0005411199,0.0011368565,0.0008321631,0.00082892907,0.0013939966,0.0005924453,0.0017505133],"category_scores_gemma":[0.0046745753,0.00028541207,0.00040972992,0.000887629,0.00086503464,0.0010939732,0.0010448616,0.0008554493,0.00075068267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021884814,0.00023432217,0.0042148335,0.00060442364,0.00015846081,0.0008541585,0.0006897441,0.12865926,0.2297845,0.07781478,0.0048487764,0.5499482],"study_design_scores_gemma":[0.00012848512,0.0009866034,0.0012311257,0.00009975655,0.00010149171,0.00091325206,0.00009969588,0.5467784,0.4249819,0.01117812,0.013350681,0.00015058294],"about_ca_topic_score_codex":0.0015503746,"about_ca_topic_score_gemma":0.001967679,"teacher_disagreement_score":0.0017505133,"about_ca_system_score_codex":0.0006744023,"about_ca_system_score_gemma":0.0012858178,"threshold_uncertainty_score":0.0058559775},"labels":[],"label_agreement":null},{"id":"W4409156414","doi":"10.1109/ieeeconf60004.2024.10942623","title":"A Layered CPA Decoder for Reed-Muller Codes","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Reed–Muller code; Computer network; Arithmetic; Telecommunications; Concatenated error correction code; Block code; Mathematics","score_opus":0.025373902858978437,"score_gpt":0.3144949823573506,"score_spread":0.2891210794983722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409156414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010830217,0.00020426381,0.9852379,0.00011748513,0.000054062722,0.00005252627,0.00018509675,0.001097209,0.002221263],"genre_scores_gemma":[0.1913223,0.0003924161,0.80208874,0.00013880328,0.000062923944,0.00015212898,0.0006294888,0.000117660136,0.005095661],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994541,0.00011367172,0.00003688902,0.000083541025,0.00026490682,0.000046883953],"domain_scores_gemma":[0.9990759,0.00022513872,0.00007418456,0.00019666899,0.0003578155,0.00007031045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048633604,0.00062526617,0.00043311776,0.0006350862,0.00050933904,0.0011211359,0.0008726274,0.00079466903,0.001938596],"category_scores_gemma":[0.0024502152,0.00031103694,0.00048381957,0.0008172577,0.00041221885,0.0008651142,0.0010932502,0.0014087732,0.0020212105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057810434,0.000119074044,0.0013414432,0.0003522013,0.00015063513,0.0006123824,0.0002671015,0.14678222,0.30661333,0.11672642,0.006907898,0.41954923],"study_design_scores_gemma":[0.00002753987,0.00013878172,0.0003709188,0.000036616788,0.000048938433,0.00058828166,0.000018698458,0.85936016,0.11551215,0.013990642,0.009847829,0.000059448175],"about_ca_topic_score_codex":0.002965519,"about_ca_topic_score_gemma":0.00422989,"teacher_disagreement_score":0.002965519,"about_ca_system_score_codex":0.00067665684,"about_ca_system_score_gemma":0.002367065,"threshold_uncertainty_score":0.006485224},"labels":[],"label_agreement":null},{"id":"W4409461316","doi":"10.1007/s11265-025-01949-8","title":"Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes","year":2025,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Mechanism (biology); Computer science; Polar; Algorithm; Speech recognition; Mathematics; Physics","score_opus":0.02538687802069558,"score_gpt":0.30186264661702383,"score_spread":0.2764757685963283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409461316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07088744,0.0007492289,0.9092526,0.00043596816,0.00036034168,0.00013394174,0.00015450834,0.00071325473,0.01731268],"genre_scores_gemma":[0.84741074,0.0007610384,0.13519669,0.0004465182,0.00018317216,0.00018458081,0.00022420005,0.00019318149,0.015399848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989937,0.00033045778,0.000057776848,0.00013988887,0.0003004351,0.00017773319],"domain_scores_gemma":[0.9981717,0.00060720637,0.00016554771,0.00063057744,0.0003624066,0.00006259744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012007533,0.00080662576,0.0008368599,0.0008860176,0.0010683149,0.0018771089,0.001429109,0.0016669005,0.004841755],"category_scores_gemma":[0.0032344135,0.0003310125,0.00068475446,0.0008821062,0.0012703169,0.0014114563,0.0017380954,0.0012426529,0.0013198955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066089496,0.00007939446,0.00041328731,0.00021493495,0.00006990991,0.0004998202,0.00025109493,0.041693855,0.048434354,0.841468,0.0027401906,0.063474365],"study_design_scores_gemma":[0.00013206492,0.00023747217,0.00033212613,0.00009378534,0.00007082354,0.0008106756,0.00007842929,0.53171015,0.07605968,0.38184798,0.008476493,0.00015029161],"about_ca_topic_score_codex":0.00045688852,"about_ca_topic_score_gemma":0.00050625164,"teacher_disagreement_score":0.004841755,"about_ca_system_score_codex":0.00050791993,"about_ca_system_score_gemma":0.00120759,"threshold_uncertainty_score":0.016197264},"labels":[],"label_agreement":null},{"id":"W4410937742","doi":"10.21608/jesaun.2025.344883.1393","title":"Comparative Analysis of On-Chip FPGA Memory Architectures for Viterbi Decoder Implementation in DVB Systems","year":2025,"lang":"en","type":"article","venue":"JES. Journal of Engineering Sciences/JES. Journal of engineering sciences","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Viterbi decoder; Computer science; Field-programmable gate array; Soft-decision decoder; Digital Video Broadcasting; Viterbi algorithm; Embedded system; Computer hardware; Chip; Computer architecture; Decoding methods; Computer network; Telecommunications","score_opus":0.024469734348579,"score_gpt":0.33856352190935785,"score_spread":0.3140937875607788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410937742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9675472,0.0050854087,0.014692737,0.00012468416,0.0000814357,0.00005962874,0.00031109224,0.00066823163,0.0114295455],"genre_scores_gemma":[0.9860162,0.0010182052,0.00878762,0.000046542173,0.000016167129,0.000031574713,0.0003673801,0.0000510254,0.0036651941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.00006864856,0.000023588002,0.00004963715,0.00009847999,0.000092070666],"domain_scores_gemma":[0.9995276,0.00017165343,0.00006022563,0.00004921641,0.00016945455,0.000021984151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024366712,0.00044071843,0.00025181935,0.0008311297,0.0001885057,0.0005127115,0.0008670395,0.00029184407,0.0050326814],"category_scores_gemma":[0.0008817204,0.00012864327,0.00020606654,0.00060032005,0.00009085142,0.00064944994,0.00016641586,0.00015419729,0.0004813291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004070529,0.00047487725,0.017064523,0.0017082323,0.00034085856,0.0007722757,0.000306779,0.13989012,0.20264976,0.0063425843,0.006950859,0.6194286],"study_design_scores_gemma":[0.00047718987,0.009753918,0.04465866,0.00032539503,0.0008760892,0.0017277473,0.0006175984,0.4260848,0.4683538,0.0016318366,0.04538833,0.00010469342],"about_ca_topic_score_codex":0.0023307365,"about_ca_topic_score_gemma":0.003010658,"teacher_disagreement_score":0.0050326814,"about_ca_system_score_codex":0.0006334136,"about_ca_system_score_gemma":0.000378615,"threshold_uncertainty_score":0.016836047},"labels":[],"label_agreement":null},{"id":"W4413359259","doi":"10.1109/tcomm.2025.3600568","title":"Performance Analysis and Enhancement of P-LDPC Codes for Lossy Compression of Binary Sources","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Low-density parity-check code; Lossy compression; Electronic engineering; Computer science; Binary number; Compression (physics); Decoding methods; Algorithm; Materials science; Mathematics; Engineering; Arithmetic","score_opus":0.026199155251223852,"score_gpt":0.313538639331471,"score_spread":0.2873394840802472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17577033,0.0016055998,0.80995417,0.000559849,0.000036250818,0.000069012625,0.00011276123,0.00054491113,0.011346997],"genre_scores_gemma":[0.9280105,0.0012530077,0.06863693,0.00008828524,0.00003363865,0.000051194005,0.0001134189,0.000057118836,0.001755935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990946,0.00026513374,0.000026659989,0.00008683545,0.00046151772,0.00006528836],"domain_scores_gemma":[0.9956749,0.0026829946,0.00038113625,0.00039157344,0.0008138656,0.000055445238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049684,0.0005915711,0.00034006865,0.0006426037,0.00026854582,0.0006932839,0.00045598717,0.00048414434,0.00096080365],"category_scores_gemma":[0.00728309,0.00020774182,0.00020079843,0.0005826487,0.0006880797,0.0009547045,0.0005890869,0.00066058687,0.00028101358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036165738,0.00005253301,0.0019887297,0.00018861047,0.00003805575,0.0001784283,0.00016867509,0.80868256,0.06091629,0.053004395,0.00081510463,0.07360494],"study_design_scores_gemma":[0.000004414599,0.00005230833,0.00029027124,0.000010479539,0.000006423798,0.00006315001,0.000008467082,0.9804017,0.015462143,0.0032986295,0.00039388926,0.000008127306],"about_ca_topic_score_codex":0.0012221803,"about_ca_topic_score_gemma":0.0011458336,"teacher_disagreement_score":0.0013049684,"about_ca_system_score_codex":0.0011826521,"about_ca_system_score_gemma":0.0009273385,"threshold_uncertainty_score":0.008580744},"labels":[],"label_agreement":null},{"id":"W4414231124","doi":"10.1109/istc65386.2025.11154578","title":"Mixed-Integer ADMM Decoding for LDPC Codes","year":2025,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Low-density parity-check code; Code (set theory); Leverage (statistics); Turbo code; Coding (social sciences); Channel code","score_opus":0.03101417019928075,"score_gpt":0.31021534327175204,"score_spread":0.2792011730724713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414231124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00800861,0.00033995925,0.98933053,0.00015206137,0.00003258603,0.00001485405,0.00002243177,0.00007508641,0.0020239614],"genre_scores_gemma":[0.3447007,0.00046627308,0.64980346,0.00015023952,0.0000436338,0.00011382043,0.00009969625,0.0000636403,0.0045585195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951744,0.00026525912,0.0000166264,0.000046196914,0.00012658491,0.000027942378],"domain_scores_gemma":[0.998541,0.0010739871,0.00010796512,0.00008123237,0.00017148023,0.000024276762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013410898,0.00069471454,0.00051349425,0.0002967986,0.0002746853,0.00061063597,0.0004906677,0.0009115135,0.00091283943],"category_scores_gemma":[0.004175759,0.0002423821,0.0002738334,0.000493224,0.0008116706,0.0007699086,0.00055617606,0.0010211354,0.00024582585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004433734,0.000015000194,0.00018881065,0.000072305964,0.000016670321,0.000033058903,0.000031849737,0.94976646,0.002057119,0.02897566,0.0004379349,0.018360745],"study_design_scores_gemma":[0.000004148321,0.000012715416,0.000013069833,0.000004533635,0.0000010904263,0.000008518055,0.0000026327025,0.99441963,0.0007124643,0.004495642,0.00032349856,0.0000020212406],"about_ca_topic_score_codex":0.0012670248,"about_ca_topic_score_gemma":0.0013783829,"teacher_disagreement_score":0.0013410898,"about_ca_system_score_codex":0.00062461937,"about_ca_system_score_gemma":0.0008213988,"threshold_uncertainty_score":0.0070924163},"labels":[],"label_agreement":null},{"id":"W4415364448","doi":"10.1007/s11265-025-01969-4","title":"On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes","year":2025,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sequential decoding; List decoding; Coding (social sciences); Berlekamp–Welch algorithm; Metric (unit); Computational complexity theory; Partition (number theory)","score_opus":0.03908256154485173,"score_gpt":0.31162368192656775,"score_spread":0.272541120381716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415364448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08134949,0.0011223739,0.9014905,0.0007770024,0.0002748078,0.00015281157,0.00032710918,0.0012096388,0.013296293],"genre_scores_gemma":[0.5671187,0.0018354414,0.41641793,0.00047802948,0.00036181972,0.00025532252,0.0009136417,0.00036245486,0.012256697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767,0.0006660256,0.00008331782,0.00018673032,0.0010708806,0.0003230225],"domain_scores_gemma":[0.9941366,0.00415675,0.0002031441,0.0005665269,0.0008612707,0.00007578629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513664,0.0013337644,0.000918653,0.0009189726,0.00083054864,0.001496548,0.00092120195,0.00073545193,0.004147551],"category_scores_gemma":[0.008244043,0.0003539349,0.000594457,0.0013393111,0.0008705396,0.0015953463,0.0014661365,0.0014988275,0.0011300945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014031064,0.00018865407,0.0017507706,0.00041636507,0.00011954364,0.00039333943,0.00037518414,0.43210793,0.055167492,0.10236714,0.010688704,0.39502183],"study_design_scores_gemma":[0.000054973883,0.00013267108,0.0005127348,0.000040393228,0.0000417209,0.0001891001,0.00006511472,0.94587183,0.021926068,0.028109334,0.0030292035,0.000026864485],"about_ca_topic_score_codex":0.0053424733,"about_ca_topic_score_gemma":0.008263349,"teacher_disagreement_score":0.0053424733,"about_ca_system_score_codex":0.00109746,"about_ca_system_score_gemma":0.0032181237,"threshold_uncertainty_score":0.013874948},"labels":[],"label_agreement":null},{"id":"W4416750297","doi":"10.1109/sips66314.2025.11261323","title":"Simplified Early-Stopping for AED-SC of Polar Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; Polar; Code (set theory); Metric (unit); Path (computing)","score_opus":0.02464598906684219,"score_gpt":0.3102599546654629,"score_spread":0.28561396559862073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416750297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042291798,0.0003481958,0.95154244,0.000120024255,0.00008403484,0.00008810605,0.000107660686,0.0011578623,0.0042599007],"genre_scores_gemma":[0.4488629,0.0004556389,0.54570067,0.00017445273,0.00007599241,0.00009107747,0.0004781694,0.00018368676,0.00397741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998898,0.00027323733,0.00008776906,0.00011393115,0.0005312774,0.00009567961],"domain_scores_gemma":[0.99815816,0.00051009154,0.00013889036,0.0006125837,0.0005122868,0.00006810547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062436465,0.0007334446,0.00050404563,0.00072732056,0.00046077388,0.0007900387,0.0007868141,0.00056771544,0.0016257385],"category_scores_gemma":[0.0032064128,0.00023675419,0.00049299886,0.0007101544,0.0007191659,0.00079090794,0.0010453261,0.0010578316,0.00086788705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090395834,0.00012009682,0.0022021763,0.00029608392,0.00010859916,0.00060596765,0.000308557,0.21637586,0.2625321,0.06596563,0.0028942148,0.4476868],"study_design_scores_gemma":[0.000028179285,0.00025423354,0.00043666232,0.00003205308,0.00003653302,0.0005100015,0.000027517672,0.841796,0.13872954,0.010676794,0.0074254754,0.00004714496],"about_ca_topic_score_codex":0.0021149414,"about_ca_topic_score_gemma":0.0041130455,"teacher_disagreement_score":0.0021149414,"about_ca_system_score_codex":0.0005420917,"about_ca_system_score_gemma":0.0016077254,"threshold_uncertainty_score":0.0054386854},"labels":[],"label_agreement":null},{"id":"W4416923812","doi":"10.1109/dasc66011.2025.11257402","title":"CNN-Based LDPC Decoder for Hubless Full-Mesh VSATPlus <sup>®</sup> System","year":2025,"lang":"","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Low-density parity-check code; Error detection and correction; Forward error correction; Decoding methods; Network packet; Turbo code; Propagation of uncertainty; Channel (broadcasting); Noise (video); Backup","score_opus":0.01918509715806888,"score_gpt":0.2841435737727657,"score_spread":0.26495847661469685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416923812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2970934,0.0006560169,0.66831714,0.0006830326,0.00015887346,0.00014622715,0.00070580165,0.004815888,0.027423661],"genre_scores_gemma":[0.91355455,0.0002029751,0.07430928,0.000114970906,0.000018602457,0.000046333433,0.00037815236,0.00004700387,0.011327988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998827,0.00001439896,0.0000061755113,0.000023962739,0.000050960753,0.000021681402],"domain_scores_gemma":[0.99985325,0.000042668085,0.000014938249,0.000021153073,0.00005870231,0.00000925645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015051129,0.00027764344,0.0002325245,0.00022056999,0.00022739606,0.00034568927,0.00063654024,0.00041381482,0.002467118],"category_scores_gemma":[0.00042875353,0.0001182304,0.00015531419,0.00018071041,0.0002329814,0.00044526215,0.00026919052,0.0003206576,0.0005898432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047302447,0.000098520366,0.0020218913,0.00017321462,0.00006494216,0.00042468298,0.000110575435,0.6795492,0.08490655,0.015234586,0.005749032,0.21119381],"study_design_scores_gemma":[0.000006217473,0.000039035083,0.00015924286,0.0000042482616,0.0000065696227,0.000037254496,0.0000048456695,0.984903,0.013200066,0.00053550047,0.0010993258,0.0000046395126],"about_ca_topic_score_codex":0.010314558,"about_ca_topic_score_gemma":0.01588965,"teacher_disagreement_score":0.010314558,"about_ca_system_score_codex":0.00089421764,"about_ca_system_score_gemma":0.00096762506,"threshold_uncertainty_score":0.020509005},"labels":[],"label_agreement":null},{"id":"W6892593609","doi":"10.5281/zenodo.11210446","title":"Plural marking in Nigerian Pidgin English: A sociolinguistic study of diaspora speakers","year":2024,"lang":"en","type":"book-chapter","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University","funders":"","keywords":"Plural; Pidgin; Diaspora; British English; Morpheme; Sociolinguistics","score_opus":0.03625228080288515,"score_gpt":0.25586348951303456,"score_spread":0.2196112087101494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892593609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99869436,0.00012783302,0.000036217385,0.00003414693,0.000003363163,0.000004662685,0.0000064703377,5.246762e-7,0.0010924252],"genre_scores_gemma":[0.99825376,0.00035775983,0.000088907334,0.00003765568,0.0000032671219,0.0000103870225,0.000016106187,0.0000032511182,0.0012290286],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99945194,0.00022410463,0.00004000787,0.0000801713,0.00007468854,0.00012899179],"domain_scores_gemma":[0.99929893,0.0003344795,0.000121159406,0.00003290357,0.000086599786,0.00012595498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086037786,0.00030589497,0.00039584376,0.0010610406,0.0050502685,0.0021657557,0.00034412445,0.00044240992,0.0015959662],"category_scores_gemma":[0.0016449984,0.00039428327,0.000097350916,0.0013014247,0.0022916573,0.0012932651,0.0020026069,0.0007358192,0.00029255083],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042794712,0.00007098391,0.038735643,0.000050915256,0.0000019376878,0.0015751962,0.9495982,0.00000489867,0.002852162,0.00047689417,0.00010185184,0.0064884243],"study_design_scores_gemma":[0.0000026182497,0.00006887523,0.07721535,0.000046395202,0.0000042342067,0.0013307531,0.9159065,0.000027003047,0.00048011416,0.00008665195,0.0048215375,0.000010012943],"about_ca_topic_score_codex":0.014061802,"about_ca_topic_score_gemma":0.051122762,"teacher_disagreement_score":0.014061802,"about_ca_system_score_codex":0.0009821417,"about_ca_system_score_gemma":0.00087318715,"threshold_uncertainty_score":0.027959943},"labels":[],"label_agreement":null},{"id":"W6929202062","doi":"10.4224/12340988","title":"Scoping study: ice information requirements for marine transportation of natural gas from the High Arctic","year":2005,"lang":"en","type":"report","venue":"NPARC","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"National Research Council Canada; Environment and Climate Change Canada; Canadian Wood Council","funders":"","keywords":"Arctic; Sea ice; Marine transportation; Key (lock); The arctic; Information system","score_opus":0.0377408057360538,"score_gpt":0.317268928552652,"score_spread":0.27952812281659817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929202062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7271327,0.07099188,0.079238534,0.004898923,0.0007254431,0.03082572,0.011403925,0.00027918242,0.07450376],"genre_scores_gemma":[0.8386669,0.06229449,0.057603247,0.0010112018,0.00020039715,0.01805705,0.011556098,0.00012589795,0.010484801],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9841669,0.0075307465,0.003589146,0.0007021851,0.0034768756,0.0005341499],"domain_scores_gemma":[0.8419576,0.12403365,0.0058150413,0.0023610669,0.025235714,0.0005969163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027815362,0.0007295791,0.00085461425,0.007045334,0.0023133722,0.003044594,0.0010945502,0.0016065998,0.0017522983],"category_scores_gemma":[0.09401467,0.00047074,0.0013621405,0.00614783,0.0010187164,0.002633497,0.001519407,0.00080179283,0.0003915911],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020031868,0.0013051566,0.06903706,0.17159218,0.0012967819,0.0100434525,0.11597012,0.023711413,0.017802881,0.01981651,0.038229506,0.5291918],"study_design_scores_gemma":[0.0004031204,0.0039071445,0.12356251,0.18148683,0.0038923002,0.0038780058,0.2805119,0.02732007,0.052682433,0.009232627,0.3127286,0.00039445845],"about_ca_topic_score_codex":0.0358068,"about_ca_topic_score_gemma":0.044059493,"teacher_disagreement_score":0.9641932,"about_ca_system_score_codex":0.0037908508,"about_ca_system_score_gemma":0.013142089,"threshold_uncertainty_score":0.14710343},"labels":[],"label_agreement":null},{"id":"W6987288200","doi":"","title":"A stochastic computing implementation of the disparity energy model for depth perception","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Stochastic computing; Neuromorphic engineering; Resilience (materials science); Massively parallel; Artificial neural network; Efficient energy use; Reduction (mathematics); Product (mathematics); Energy (signal processing)","score_opus":0.023559206550353116,"score_gpt":0.29351839999145496,"score_spread":0.26995919344110186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987288200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11153928,0.0002131045,0.8759148,0.00030945902,0.000070945294,0.00004166278,0.00009048541,0.0008030317,0.011017252],"genre_scores_gemma":[0.8449154,0.0001406739,0.15126327,0.00008371169,0.000015238867,0.000032207045,0.00006194751,0.000034852554,0.003452775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994147,0.0000060575826,0.0000030046808,0.000013090732,0.000028079705,0.000008312901],"domain_scores_gemma":[0.99994326,0.000013288817,0.0000068644144,0.00001210884,0.00001919182,0.0000051827874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008135787,0.00017414901,0.00013429536,0.00013974344,0.00020408111,0.0003401306,0.00051612564,0.00020644513,0.0016869402],"category_scores_gemma":[0.00024169279,0.00009326219,0.00020759946,0.00015226676,0.00017428373,0.0003826162,0.00018205978,0.00029892614,0.00022417172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018438796,0.00011171665,0.001860645,0.00013489212,0.0000508091,0.00031662275,0.00017669858,0.3397264,0.31453905,0.15593632,0.002695619,0.18426679],"study_design_scores_gemma":[0.000008889052,0.00009007813,0.0004877432,0.000006583105,0.000011081547,0.00011755823,0.000012501369,0.9661846,0.021584375,0.0075163827,0.0039702305,0.000010045152],"about_ca_topic_score_codex":0.0026115582,"about_ca_topic_score_gemma":0.0059546726,"teacher_disagreement_score":0.0026115582,"about_ca_system_score_codex":0.00052231917,"about_ca_system_score_gemma":0.00051606464,"threshold_uncertainty_score":0.005643368},"labels":[],"label_agreement":null},{"id":"W6987625987","doi":"","title":"TM Synchronization and Channel Coding--Summary of Concept and Rationale . Green Book. Issue 2. November 2012.CCSDS 130.1-G-2","year":2012,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Center for Long-Term Cybersecurity, University of California Berkeley; Geo-Informatics and Space Technology Development Agency; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; National Commission for Science and Technology; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; National Oceanic and Atmospheric Administration; National Space Organization; China National Space Administration; Belgian Federal Science Policy Office; Chinese Academy of Sciences; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Synchronization (alternating current); Channel (broadcasting); Coding (social sciences); Code (set theory); Time synchronization; Key (lock)","score_opus":0.06510313300424987,"score_gpt":0.337140779444507,"score_spread":0.27203764644025713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987625987","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020550964,0.28172165,0.23347296,0.02334925,0.021148035,0.00043168297,0.0016672998,0.0014360261,0.4347181],"genre_scores_gemma":[0.048727453,0.2993945,0.11302754,0.010592516,0.013344706,0.0007658081,0.0028919273,0.00090791314,0.51034755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989679,0.00017967635,0.00008589445,0.00010892114,0.0006029696,0.000054704153],"domain_scores_gemma":[0.9985806,0.00046344905,0.000104988,0.000108158616,0.0006940054,0.000048853017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014996728,0.0008067279,0.00045110867,0.002900408,0.00060464337,0.0021373264,0.0009799807,0.0017846972,0.01960051],"category_scores_gemma":[0.00279661,0.000504988,0.00030075453,0.002877259,0.0024630632,0.0027746772,0.00082535075,0.0027578848,0.011381903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004907325,0.000036412675,0.0002227371,0.0011798332,0.000011999612,0.00010052088,0.0001783847,0.0016251625,0.0022998282,0.42847544,0.3131572,0.2526635],"study_design_scores_gemma":[0.0000059426293,0.00006419637,0.0003406046,0.0006011458,0.000008463288,0.00034786706,0.00008095703,0.00090607017,0.0017817011,0.041803777,0.9540381,0.000021077974],"about_ca_topic_score_codex":0.00299252,"about_ca_topic_score_gemma":0.0025358459,"teacher_disagreement_score":0.01960051,"about_ca_system_score_codex":0.0014072713,"about_ca_system_score_gemma":0.0025516513,"threshold_uncertainty_score":0.065570235},"labels":[],"label_agreement":null},{"id":"W6990749417","doi":"","title":"Efficient encoders and decoders for polar codes: algorithms and implementations","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Sequential decoding; Encoder; Code (set theory); Polar; Throughput; Implementation","score_opus":0.01870544717480951,"score_gpt":0.2897664817661163,"score_spread":0.2710610345913068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990749417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026159643,0.00078793557,0.9916903,0.00013653711,0.00007275856,0.0000612439,0.00006803739,0.00047670264,0.0040905173],"genre_scores_gemma":[0.06347211,0.002981144,0.9263316,0.00012130104,0.00012507425,0.00021601927,0.00024540856,0.00015093914,0.006356433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933136,0.00014309531,0.00005028222,0.00007292628,0.0003472439,0.00005516936],"domain_scores_gemma":[0.9992613,0.00026713297,0.0000674118,0.00012112596,0.00026372506,0.000019227042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447401,0.00086170825,0.00044283268,0.00091988797,0.0004993896,0.0018443088,0.0009964263,0.0010685123,0.0044198637],"category_scores_gemma":[0.0025940556,0.00042015006,0.00040562986,0.00083825574,0.00073266536,0.0016545525,0.0009138754,0.0015438315,0.004237722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015960097,0.000096328884,0.00058096024,0.000596116,0.000043300523,0.00015180148,0.00028980733,0.1005523,0.034451988,0.3675762,0.006133027,0.48936862],"study_design_scores_gemma":[0.00008809189,0.00019184878,0.00026058283,0.00024762616,0.000043155993,0.00062617613,0.000114312905,0.7238279,0.09660418,0.11046322,0.06744909,0.0000838234],"about_ca_topic_score_codex":0.0010936543,"about_ca_topic_score_gemma":0.0013049577,"teacher_disagreement_score":0.0044198637,"about_ca_system_score_codex":0.0006903139,"about_ca_system_score_gemma":0.001461684,"threshold_uncertainty_score":0.014785886},"labels":[],"label_agreement":null},{"id":"W6992666415","doi":"","title":"Low Density Parity Check Codes For Use In Near-Earth And Deep Space Applications - CCSDS 131.1-O-2-S","year":2007,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; National Commission for Science and Technology; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; U.S. Geological Survey; Indian Space Research Organisation; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office; Chinese Academy of Sciences; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Encoder; Parity bit; Coding (social sciences); Data system; NASA Deep Space Network; Set (abstract data type); Code (set theory); Synchronization (alternating current)","score_opus":0.07611015943607398,"score_gpt":0.36031608225607376,"score_spread":0.2842059228199998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992666415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046587832,0.012626622,0.6120344,0.007428243,0.008129174,0.0017432666,0.016238486,0.009382248,0.28582975],"genre_scores_gemma":[0.43147615,0.017773218,0.3327368,0.0018296028,0.0025916516,0.0028731269,0.031097269,0.0020412544,0.17758098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988661,0.00018191541,0.00005798501,0.0000562137,0.0007647291,0.00007310661],"domain_scores_gemma":[0.99842095,0.0004343225,0.00010769487,0.00027425287,0.0007100883,0.000052672516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012907928,0.00049101765,0.0006301137,0.0021825088,0.0015025596,0.0016390113,0.0008091038,0.0009580458,0.020090485],"category_scores_gemma":[0.0039920695,0.00022357982,0.00022659785,0.0026368995,0.00077033025,0.0011512076,0.0008760677,0.0013103244,0.0048905895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003957864,0.000104551815,0.0007591476,0.0010565448,0.000026765936,0.0002853396,0.00030928248,0.008464345,0.045096315,0.5156334,0.16708975,0.2607787],"study_design_scores_gemma":[0.00014067908,0.00034209184,0.0013068345,0.00056328706,0.000030995656,0.00041152837,0.00010683211,0.030707907,0.07164822,0.11000314,0.7846372,0.00010132657],"about_ca_topic_score_codex":0.0033910351,"about_ca_topic_score_gemma":0.0042580487,"teacher_disagreement_score":0.020090485,"about_ca_system_score_codex":0.0015914866,"about_ca_system_score_gemma":0.0030371926,"threshold_uncertainty_score":0.06720936},"labels":[],"label_agreement":null},{"id":"W7000217762","doi":"","title":"Energy-efficient decoding of low-density parity-check codes","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Schematic; Low-density parity-check code; Decoding methods; Data flow diagram; Block diagram; Node (physics); Transmission (telecommunications); Signal-flow graph; Block code","score_opus":0.014631467811463655,"score_gpt":0.24716443250890713,"score_spread":0.23253296469744347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000217762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058194567,0.0009852637,0.87597966,0.00055542676,0.0001866738,0.000099633726,0.00050168025,0.0012494432,0.062247712],"genre_scores_gemma":[0.6856328,0.0010537381,0.2732526,0.0002364367,0.000091265116,0.00018957122,0.00088312925,0.00025235084,0.038408004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975544,0.00004805179,0.000010188861,0.00002811132,0.00012620818,0.000031999625],"domain_scores_gemma":[0.9997898,0.00007457576,0.000016458775,0.000045190744,0.00006617015,0.00000785666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017005164,0.00029081333,0.00024452453,0.00037481028,0.00029158656,0.0005452979,0.00042338477,0.00046811922,0.005409167],"category_scores_gemma":[0.0010299972,0.0001616976,0.00015531894,0.0003815548,0.00023878222,0.0005630146,0.0006155296,0.00047171005,0.0024556757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000232557,0.000084251384,0.0009265263,0.0003888373,0.000040275878,0.00038044984,0.0002451349,0.1645716,0.13231143,0.40785363,0.012273168,0.28069207],"study_design_scores_gemma":[0.000028484581,0.000074233336,0.00050547504,0.00007090511,0.000011926879,0.00020428628,0.000041091833,0.776238,0.09375648,0.105308495,0.02373417,0.000026483609],"about_ca_topic_score_codex":0.0005880909,"about_ca_topic_score_gemma":0.001258504,"teacher_disagreement_score":0.005409167,"about_ca_system_score_codex":0.00042839668,"about_ca_system_score_gemma":0.00045860506,"threshold_uncertainty_score":0.018095493},"labels":[],"label_agreement":null},{"id":"W7023598186","doi":"","title":"Ontario Continues Wasting Clean Electricity for 7th Consecutive Year: Engineers","year":2021,"lang":"en","type":"other","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Electricity; Wasting; Mains electricity; Government (linguistics); Work (physics)","score_opus":0.01790359019312459,"score_gpt":0.2496022292282991,"score_spread":0.23169863903517451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023598186","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014387463,0.0011800812,0.00087691954,0.05552876,0.0052497718,0.00019708603,0.0044903657,0.0016145109,0.91647506],"genre_scores_gemma":[0.0059816507,0.0002577193,0.00019635011,0.0024580578,0.00010064233,0.000010748284,0.00036205575,0.00009679629,0.99053603],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983846,0.000037456484,0.000025621272,0.00007559595,0.00095136,0.0005255252],"domain_scores_gemma":[0.99635136,0.00014477951,0.000108192406,0.00012776844,0.0021577927,0.0011101387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460474,0.0006152962,0.00035124016,0.0010054829,0.009261081,0.0032037834,0.0010920194,0.0042559146,0.26799366],"category_scores_gemma":[0.0025398713,0.0004457652,0.00049766985,0.0010854525,0.0011617518,0.0008611181,0.0017309167,0.0020641044,0.06789087],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003925052,0.00003359049,0.0018885778,0.000044929933,0.000004064901,0.00016847414,0.00014691829,0.00006585046,0.00057480537,0.0014362194,0.966551,0.029046277],"study_design_scores_gemma":[0.000010934357,0.000019441062,0.006127816,0.000035133053,0.0000051073926,0.000058190933,0.0004135588,0.000106909436,0.00036029468,0.00023363798,0.9926198,0.000009231744],"about_ca_topic_score_codex":0.83522207,"about_ca_topic_score_gemma":0.9717309,"teacher_disagreement_score":0.26799366,"about_ca_system_score_codex":0.0131936185,"about_ca_system_score_gemma":0.05496859,"threshold_uncertainty_score":0.8965281},"labels":[],"label_agreement":null},{"id":"W7102431179","doi":"","title":"Key and Value Weights Are Probably All You Need: On the Necessity of the Query, Key, Value weight Triplet in Encoder-Only and Decoder-Only Transformers","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Institut national de recherche en informatique et en automatique (INRIA); Institute for Catastrophic Loss Reduction","keywords":"Disjoint sets; Weight function; Quadratic equation; Scaling; Function (biology); Transformer; Stability (learning theory)","score_opus":0.021991736747404598,"score_gpt":0.25804908014676936,"score_spread":0.23605734339936477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7102431179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16179529,0.0005683744,0.80490196,0.0051679146,0.00024250407,0.00011702633,0.0007605922,0.0036444783,0.022801822],"genre_scores_gemma":[0.88192093,0.00031123264,0.10500229,0.0008652823,0.00007955964,0.00011885266,0.00058357674,0.0008426526,0.0102756545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988281,0.00035717964,0.000053343367,0.000307215,0.00024736417,0.00020683212],"domain_scores_gemma":[0.9959591,0.0021067315,0.00021243293,0.0011667444,0.00037403477,0.00018107262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022644221,0.00081903365,0.00077926397,0.0003775051,0.0005554029,0.0019818188,0.001714484,0.0012921847,0.010884695],"category_scores_gemma":[0.018058794,0.0005610928,0.00069815223,0.00047692258,0.0020636527,0.007633362,0.003205875,0.00385298,0.0024371035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013218686,0.0002778262,0.004353653,0.00042797328,0.000111050445,0.0006873242,0.00090725505,0.16397451,0.029506363,0.43932557,0.020989025,0.33811757],"study_design_scores_gemma":[0.00006927331,0.00011855849,0.0006787461,0.00005700919,0.0000612116,0.00022961211,0.00017847524,0.6501826,0.017812852,0.3265268,0.0040575974,0.000027254726],"about_ca_topic_score_codex":0.005228152,"about_ca_topic_score_gemma":0.0064129843,"teacher_disagreement_score":0.010884695,"about_ca_system_score_codex":0.0011650177,"about_ca_system_score_gemma":0.0020257363,"threshold_uncertainty_score":0.036412954},"labels":[],"label_agreement":null},{"id":"W7127333907","doi":"10.1109/ccece64018.2025.11364450","title":"Construction-D’ Lattices Based on Raptor Codes for Unconstrained AWGN Channels","year":2025,"lang":"","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Raptor code; Additive white Gaussian noise; Decoding methods; Online codes; Coding (social sciences); Encoding (memory); Block code; Luby transform code; Turbo code","score_opus":0.02211978748483539,"score_gpt":0.29813367845825783,"score_spread":0.27601389097342244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127333907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026124937,0.00036756432,0.9662597,0.0001556242,0.000048193306,0.000062539795,0.00009390995,0.00032786737,0.00655967],"genre_scores_gemma":[0.38805336,0.00053313066,0.60868466,0.00012093275,0.0000451214,0.00016922083,0.00018311308,0.00007599651,0.0021345017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932575,0.00024270148,0.000037697304,0.000068904454,0.000258744,0.00006630485],"domain_scores_gemma":[0.9982218,0.0008538148,0.00018921684,0.0004325772,0.00021737619,0.00008511235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071514654,0.00043915355,0.00048794365,0.0006930144,0.0005888784,0.0007668615,0.000672739,0.0006103561,0.0013863115],"category_scores_gemma":[0.0027918292,0.0003029191,0.0005198165,0.0005791423,0.001251085,0.0009739534,0.0014087055,0.0013626646,0.00074791745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028946777,0.00012590075,0.001346235,0.00036406316,0.000061907114,0.0004311885,0.0003655731,0.33511057,0.058375098,0.40983135,0.0035208256,0.19017787],"study_design_scores_gemma":[0.000034146757,0.0001868988,0.00020802957,0.000047147783,0.000018676097,0.00045486086,0.000050382205,0.8928447,0.046371303,0.04978053,0.0099333795,0.000069978116],"about_ca_topic_score_codex":0.00064019643,"about_ca_topic_score_gemma":0.0008049572,"teacher_disagreement_score":0.0013863115,"about_ca_system_score_codex":0.0005033473,"about_ca_system_score_gemma":0.00086573727,"threshold_uncertainty_score":0.0046376586},"labels":[],"label_agreement":null},{"id":"W7127359156","doi":"10.1109/ccece64018.2025.11364448","title":"Accelerating Belief Propagation with Task-Based Hardware Parallelism","year":2025,"lang":"","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Belief propagation; Convergence (economics); Inference; Parallelism (grammar); Hardware acceleration; Implementation; Hardware architecture; Benchmark (surveying)","score_opus":0.020592807966382614,"score_gpt":0.26881999422658703,"score_spread":0.24822718626020443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127359156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04024084,0.00017757407,0.9539474,0.00030866827,0.00008087433,0.000045844277,0.000050834213,0.0020317219,0.0031162058],"genre_scores_gemma":[0.5750671,0.0001746412,0.42167464,0.000101050195,0.000045980836,0.0000735905,0.00010637828,0.00014098019,0.002615583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.00010644807,0.000022738639,0.00007393798,0.00024407229,0.000069939626],"domain_scores_gemma":[0.99790573,0.0010595326,0.00014608845,0.0004280844,0.00040717048,0.00005338562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083086494,0.0005501985,0.00034830428,0.00047648678,0.00031777073,0.0008996972,0.0013661641,0.0004933559,0.0024932327],"category_scores_gemma":[0.0044614174,0.00025776078,0.00027240824,0.0005572636,0.0004694938,0.0010060176,0.0007559785,0.001167042,0.0006288299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000538002,0.00018727405,0.0023184218,0.00015790254,0.000081746904,0.00015989094,0.0001979737,0.62210894,0.025449814,0.036205407,0.0045827636,0.3080119],"study_design_scores_gemma":[0.00002152386,0.00003851598,0.00009724374,0.0000054670477,0.000007881578,0.000018957171,0.000009413711,0.9868879,0.0065692924,0.005275346,0.00106358,0.0000049663854],"about_ca_topic_score_codex":0.0049065906,"about_ca_topic_score_gemma":0.004569292,"teacher_disagreement_score":0.0049065906,"about_ca_system_score_codex":0.0006889002,"about_ca_system_score_gemma":0.0012000364,"threshold_uncertainty_score":0.009756088},"labels":[],"label_agreement":null},{"id":"W7132874161","doi":"","title":"Implementing a GPU-Assisted LDPC Decoder for 5G New Radio","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Speedup; Decoding methods; Soft-decision decoder; Scheduling (production processes); Block (permutation group theory); Low-density parity-check code; Code (set theory); Graphics processing unit; Block code","score_opus":0.06967151513876953,"score_gpt":0.41179732259025215,"score_spread":0.34212580745148263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132874161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41871718,0.00062417495,0.55694973,0.000316793,0.00013889729,0.0001617654,0.00020731213,0.0032717097,0.019612463],"genre_scores_gemma":[0.67742574,0.0003235863,0.31219035,0.00009508912,0.000017171276,0.000059269078,0.00031883124,0.00017567264,0.00939425],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998617,0.00002480949,0.000005529883,0.0000199929,0.000067443296,0.00002056275],"domain_scores_gemma":[0.99980325,0.000047517395,0.000014812185,0.000044099306,0.00007863704,0.0000116860665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012626647,0.00029402247,0.00021871556,0.00020588862,0.00025081323,0.00044591603,0.0004816169,0.00030398287,0.0019741575],"category_scores_gemma":[0.00066021964,0.00011314954,0.00017867702,0.00024613028,0.00013900214,0.00048710665,0.00024958374,0.00038929703,0.0005438464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008075374,0.00024568223,0.007682906,0.00033903078,0.00013381729,0.0005985853,0.0003975382,0.22437036,0.4148283,0.019197883,0.006154941,0.32524344],"study_design_scores_gemma":[0.000060275986,0.00032646666,0.0015208825,0.000022095432,0.000037439957,0.00026101945,0.000052524192,0.81387854,0.1661588,0.0013196989,0.016338974,0.000023343193],"about_ca_topic_score_codex":0.0037840588,"about_ca_topic_score_gemma":0.006286157,"teacher_disagreement_score":0.0037840588,"about_ca_system_score_codex":0.00050432247,"about_ca_system_score_gemma":0.0007717939,"threshold_uncertainty_score":0.007524073},"labels":[],"label_agreement":null},{"id":"W7133076121","doi":"","title":"Distribution Matching for Probabilistic Shaping and Stealth Communication: Theory and Algorithms","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Government of Ontario","keywords":"Probabilistic logic; Lossy compression; Polar code; Binary number; Matching (statistics); Robustness (evolution); Probability distribution; Coding (social sciences)","score_opus":0.04118277589606449,"score_gpt":0.37863677261217665,"score_spread":0.33745399671611215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133076121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002227916,0.0011775026,0.9918641,0.00021561365,0.000040648632,0.000037461497,0.000034907396,0.00012580135,0.0042761527],"genre_scores_gemma":[0.31635457,0.0091337105,0.65611094,0.0005137335,0.0005120729,0.00076231064,0.00036718586,0.00030732722,0.015938116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986327,0.00046772012,0.00007692469,0.00026364918,0.00041645774,0.00014252597],"domain_scores_gemma":[0.9953016,0.0035153439,0.0003786284,0.00040653493,0.0003084107,0.00008950817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368765,0.0012784676,0.0012515981,0.0016618654,0.00076734315,0.0029618558,0.0019083341,0.0022179983,0.0045359335],"category_scores_gemma":[0.009969177,0.0008574921,0.001167366,0.0026648815,0.0027735296,0.0038026727,0.0026144497,0.0037552353,0.0016506825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006922801,0.000055235607,0.00036839355,0.00020168808,0.000042495773,0.000063574276,0.000162124,0.24538372,0.0020960737,0.6362773,0.0032028325,0.112077355],"study_design_scores_gemma":[0.00001714217,0.00004231156,0.00007522686,0.000059662034,0.000013810518,0.00010230843,0.000025957252,0.68696535,0.0014195472,0.30637962,0.0048680133,0.000031099786],"about_ca_topic_score_codex":0.0015376302,"about_ca_topic_score_gemma":0.0009923021,"teacher_disagreement_score":0.0045359335,"about_ca_system_score_codex":0.002740173,"about_ca_system_score_gemma":0.0015026854,"threshold_uncertainty_score":0.019881427},"labels":[],"label_agreement":null},{"id":"W7140783364","doi":"10.1109/ieeeconf67917.2025.11443908","title":"Bias-Enhanced Successive Cancellation List Decoder for Polar Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar; Encoding (memory); Decoding methods; Code (set theory); Noise (video)","score_opus":0.029323091846209955,"score_gpt":0.3286865542965896,"score_spread":0.29936346245037965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140783364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029352771,0.0008385296,0.9600062,0.00045416894,0.00020033485,0.000052291274,0.0002664535,0.00097349,0.007855764],"genre_scores_gemma":[0.40424436,0.0015226968,0.5710738,0.00054998527,0.00024106858,0.00011185025,0.0006849744,0.00014331455,0.02142796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.000113362345,0.000023096458,0.000041302294,0.00022210005,0.000058168243],"domain_scores_gemma":[0.99914753,0.00029109043,0.000060063037,0.0001167637,0.00035770435,0.0000268752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045404898,0.0005587872,0.00041853407,0.0006034747,0.00042687246,0.00080785033,0.0006058536,0.0006423493,0.0030351214],"category_scores_gemma":[0.0018574948,0.00026029735,0.00021647285,0.0007344332,0.0003426743,0.0006250032,0.0008869168,0.00087677874,0.0018817703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001194091,0.00012899528,0.0013927905,0.00038513984,0.000093931034,0.00040456202,0.0002185656,0.09707056,0.28283098,0.10746972,0.008466687,0.500344],"study_design_scores_gemma":[0.00010030767,0.0002597355,0.000740286,0.00008615362,0.00007118334,0.00064364594,0.00004630222,0.7364889,0.21937332,0.028347326,0.013762719,0.0000801448],"about_ca_topic_score_codex":0.0015920337,"about_ca_topic_score_gemma":0.0034698332,"teacher_disagreement_score":0.0030351214,"about_ca_system_score_codex":0.00035553367,"about_ca_system_score_gemma":0.0013680636,"threshold_uncertainty_score":0.010153532},"labels":[],"label_agreement":null}]}