{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003159462,0.0000824019,0.9824785,0.0017230662,0.0006326018,0.00045713043,7.686383e-7,0.0008066261,0.010659434],"genre_scores_gemma":[0.8611596,0.00002584769,0.13355781,0.0013889435,0.00005651009,0.00007096567,5.610708e-7,0.000015693078,0.003724055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987695,0.00008681442,0.00018932438,0.00039597283,0.00020219742,0.00035616607],"domain_scores_gemma":[0.99806416,0.00076587603,0.00007523013,0.0008757597,0.00015223563,0.000066750414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009816961,0.00015972198,0.00016469373,0.000054339518,0.00032162995,0.000160555,0.0009742871,0.00008221426,0.000012680533],"category_scores_gemma":[0.00041640413,0.000109559405,0.00011283953,0.0003081725,0.000057527537,0.00021934794,0.00016639326,0.00017079238,0.00003411447],"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.00001646034,0.00028712768,0.0012211876,0.00006462291,0.0000675668,0.000009540706,0.0019413164,0.000114373775,0.0025473018,0.9069644,0.067445874,0.019320212],"study_design_scores_gemma":[0.0005177608,0.00028913096,0.0012964878,0.000058747766,0.000031725718,0.0000911953,0.00025206257,0.14578132,0.6627108,0.13607429,0.05205566,0.0008408147],"about_ca_topic_score_codex":0.00012949976,"about_ca_topic_score_gemma":0.0002870161,"teacher_disagreement_score":0.85800016,"about_ca_system_score_codex":0.00003811455,"about_ca_system_score_gemma":0.000054778448,"threshold_uncertainty_score":0.44677028},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7109664,0.000049672915,0.27318916,0.00069505704,0.00020185889,0.0003132817,7.97216e-7,0.00058335357,0.014000394],"genre_scores_gemma":[0.9166437,0.0000034771883,0.08311136,0.00012693,0.000022109307,0.000026405858,3.2366768e-7,0.0000063568323,0.000059335143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858814,0.00006656831,0.00024531022,0.00025350135,0.00065995235,0.00018652334],"domain_scores_gemma":[0.9984677,0.000053790027,0.00012440981,0.0009096643,0.00040561747,0.00003885969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013718816,0.00010771695,0.00014796444,0.00011598595,0.00006258252,0.000027926537,0.001070006,0.000053582236,0.00001349472],"category_scores_gemma":[0.00021708125,0.000095696436,0.000050973515,0.0003064573,0.000036876838,0.00040432866,0.00016048286,0.00009461994,0.000019522082],"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.000110205445,0.0013554824,0.06152442,0.00022258857,0.00023604516,0.000012101611,0.009334206,0.187879,0.12659702,0.15714115,0.0062017716,0.449386],"study_design_scores_gemma":[0.002108487,0.000363953,0.02153616,0.00009512403,0.00004096061,0.000029622108,0.0000351616,0.7166132,0.2418492,0.016957214,0.000069942595,0.00030098573],"about_ca_topic_score_codex":0.000115458075,"about_ca_topic_score_gemma":0.00009074912,"teacher_disagreement_score":0.5287342,"about_ca_system_score_codex":0.00010775111,"about_ca_system_score_gemma":0.00017356763,"threshold_uncertainty_score":0.39023873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040797924,0.00013573993,0.992868,0.00074146123,0.0019229226,0.0013091376,0.0000045241977,0.00079635775,0.0021810264],"genre_scores_gemma":[0.031137533,0.0000054369266,0.967372,0.0007110387,0.0004218668,0.000066151115,0.00001071576,0.00004939569,0.00022589044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995817,0.000108197935,0.0007548525,0.001987302,0.0006120068,0.00072064635],"domain_scores_gemma":[0.99587107,0.0012481011,0.00054716313,0.0017766639,0.00044012596,0.00011687544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035989082,0.00058520195,0.00063604984,0.0007927315,0.00033673493,0.0005981284,0.0030657619,0.0003942693,0.000004690648],"category_scores_gemma":[0.0004412086,0.0005678645,0.00020382548,0.00054168014,0.00046762923,0.0008177549,0.0010819737,0.00076714973,0.00000684018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003972562,0.00001876962,0.00004757858,0.00007175199,0.000004247954,0.000004674881,0.00031091322,0.0010057876,0.0024071336,0.0103856865,0.000028616694,0.98571086],"study_design_scores_gemma":[0.00014680377,0.00022576017,0.00023499959,0.00031079378,0.000009628162,0.000035047357,5.997374e-8,0.63064706,0.031976223,0.33273908,0.002902617,0.0007719168],"about_ca_topic_score_codex":0.00004627224,"about_ca_topic_score_gemma":0.000049813076,"teacher_disagreement_score":0.984939,"about_ca_system_score_codex":0.00061021413,"about_ca_system_score_gemma":0.00050046004,"threshold_uncertainty_score":0.9996773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082752435,0.00002010039,0.98849255,0.00090994564,0.00016297979,0.0009503605,0.000004940907,0.001695185,0.006936399],"genre_scores_gemma":[0.4051729,5.3385173e-7,0.59367895,0.00050958566,0.000060781374,0.00034620843,0.000006061339,0.000012304678,0.0002126629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.000041254847,0.0002502796,0.00042239588,0.00023064997,0.00031495397],"domain_scores_gemma":[0.9985092,0.00027759833,0.000106941996,0.0006590599,0.00028492807,0.0001622593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073055964,0.0001522523,0.0001630113,0.00013598804,0.00014730648,0.00016154003,0.00082636945,0.000079847654,0.000004072655],"category_scores_gemma":[0.00014501424,0.00015148084,0.000081482714,0.00040455113,0.000048858856,0.00029035367,0.00013259133,0.00011320365,0.000026037356],"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.000036419213,0.00023774835,0.001873048,0.00007104994,0.00002636826,0.0000070036413,0.00073370634,0.0001914865,0.0051378766,0.8099228,0.00860001,0.17316246],"study_design_scores_gemma":[0.0019972043,0.00046483628,0.000119619355,0.00005548026,0.000024042523,0.000056262917,0.00022173065,0.82220244,0.024063978,0.04384281,0.1061141,0.0008374644],"about_ca_topic_score_codex":0.00006152408,"about_ca_topic_score_gemma":0.00003835187,"teacher_disagreement_score":0.822011,"about_ca_system_score_codex":0.00014169927,"about_ca_system_score_gemma":0.0003413008,"threshold_uncertainty_score":0.6177209},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066650235,0.0000034231405,0.9886869,0.00079536485,0.00018407078,0.00088243047,0.000004519163,0.0006741167,0.0021041506],"genre_scores_gemma":[0.833619,5.9780496e-7,0.16547325,0.0004226907,0.000025998963,0.00006949015,9.401176e-7,0.000016956796,0.00037107183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981759,0.0002454409,0.0003010671,0.00036626362,0.00056227355,0.00034900758],"domain_scores_gemma":[0.9976862,0.00073519367,0.00016721136,0.0008248407,0.00040128222,0.00018528174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027547057,0.00018128591,0.00022661871,0.00017345902,0.00020003496,0.00016225509,0.0004959426,0.00005545395,0.0000015043611],"category_scores_gemma":[0.0005046053,0.00013073294,0.00006430769,0.0004958726,0.000092459486,0.00010062193,0.00032212737,0.0001890173,0.000015384434],"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.0015755573,0.0019605227,0.012324877,0.00042764656,0.00021116724,0.00013820108,0.03416184,0.18104436,0.04783467,0.2693792,0.19219995,0.25874203],"study_design_scores_gemma":[0.0003773973,0.00047929992,0.00024243203,0.0000943113,0.0000062175545,0.000009860986,0.00029783603,0.86351675,0.13075767,0.0022498253,0.0016986988,0.00026967985],"about_ca_topic_score_codex":0.00080474885,"about_ca_topic_score_gemma":0.0003680553,"teacher_disagreement_score":0.826954,"about_ca_system_score_codex":0.000065775654,"about_ca_system_score_gemma":0.00011774471,"threshold_uncertainty_score":0.5331134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09365402,0.00019901955,0.8933693,0.0012358264,0.00036640433,0.0003924256,0.0000014762247,0.0017234826,0.009058045],"genre_scores_gemma":[0.54321593,0.000004860087,0.45647025,0.00007094062,0.0000513159,0.000015860907,6.586587e-7,0.000007298422,0.00016291736],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877906,0.000057366753,0.00031832274,0.00036883162,0.00022665996,0.00024978176],"domain_scores_gemma":[0.9987953,0.00006401839,0.00021560925,0.0005629815,0.0002944639,0.00006763442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027820832,0.00015306835,0.00020766957,0.00014863224,0.00007501518,0.00006314744,0.0007344928,0.00009013304,0.00003020337],"category_scores_gemma":[0.000088535315,0.00013461613,0.00007804378,0.0003740003,0.00015190477,0.0005443123,0.00022952344,0.00013325647,0.000011727869],"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.00002561587,0.00029986224,0.0058267964,0.000093257346,0.00006275032,0.000009214004,0.0011738271,0.000011673179,0.114294544,0.31538248,0.0029901897,0.5598298],"study_design_scores_gemma":[0.00028866032,0.00020700143,0.00076729566,0.000055198754,0.000010427613,0.00011224056,0.000059447328,0.06771123,0.9228375,0.006739899,0.0009264048,0.0002846811],"about_ca_topic_score_codex":0.000051811723,"about_ca_topic_score_gemma":0.000022573824,"teacher_disagreement_score":0.80854297,"about_ca_system_score_codex":0.000055369288,"about_ca_system_score_gemma":0.00007420165,"threshold_uncertainty_score":0.54894865},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109240174,0.00008478495,0.4034842,0.0013052326,0.0007271502,0.0011531328,0.000023793356,0.0066805873,0.47730094],"genre_scores_gemma":[0.9978232,0.000004022256,0.0012243096,0.000071316616,0.00005202444,3.821298e-8,0.000029765592,0.00044303492,0.0003522883],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983502,0.0005135444,0.00018565268,0.00033826864,0.00037022107,0.00024209236],"domain_scores_gemma":[0.9986812,0.000072012015,0.00010805895,0.00062314805,0.0003743578,0.00014121494],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016120513,0.000118158714,0.00014830218,0.00026261312,0.00038180876,0.00030393375,0.0017832759,0.00004423161,0.00013899492],"category_scores_gemma":[0.0015178823,0.00011177387,0.00004658758,0.00055269984,0.000064616805,0.00027526368,0.0015629632,0.00021357414,0.0014236306],"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.00026107734,0.00026037946,0.000012077654,0.0001705246,0.00005073654,0.000039682534,0.009305395,0.00019407806,0.008135453,0.019124923,0.21950245,0.7429432],"study_design_scores_gemma":[0.0016571262,0.01116974,0.00015298263,0.0004157717,0.000019891206,0.00037035294,0.00024359915,0.026836269,0.12553613,0.0016594551,0.8313011,0.00063761364],"about_ca_topic_score_codex":0.00001706775,"about_ca_topic_score_gemma":1.3293685e-7,"teacher_disagreement_score":0.888583,"about_ca_system_score_codex":0.0001267751,"about_ca_system_score_gemma":0.0000031379648,"threshold_uncertainty_score":0.9993539},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013561241,0.00001701996,0.9785204,0.00065871753,0.00026193605,0.00036813034,0.0000016714455,0.0019796405,0.0046312786],"genre_scores_gemma":[0.48798087,0.0000014104008,0.5110792,0.00061312236,0.000039131384,0.000054293752,0.0000016750255,0.000013519086,0.00021675606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985391,0.000038866696,0.00024526744,0.0005666536,0.00020139168,0.00040870463],"domain_scores_gemma":[0.9987132,0.000114990515,0.000081743856,0.0008166829,0.00014168843,0.0001316995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567235,0.00017160122,0.00017745921,0.0001449532,0.00018244545,0.00017292226,0.0010550569,0.000085933745,0.000008261543],"category_scores_gemma":[0.00014091848,0.00015896394,0.000089642075,0.00030968577,0.00003145878,0.00072732184,0.00017562845,0.00012014988,0.00001908797],"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.000041258238,0.0006544295,0.0009715844,0.000055593162,0.000056113902,0.000044359545,0.005414088,0.00091897155,0.02170836,0.6433797,0.0054036556,0.32135192],"study_design_scores_gemma":[0.0017893796,0.0015191397,0.001825341,0.00010473593,0.000027819591,0.00020409141,0.00018431374,0.18897878,0.2078218,0.58829534,0.007927942,0.0013213246],"about_ca_topic_score_codex":0.00015411546,"about_ca_topic_score_gemma":0.00095913897,"teacher_disagreement_score":0.47441962,"about_ca_system_score_codex":0.00010448834,"about_ca_system_score_gemma":0.00011788174,"threshold_uncertainty_score":0.64823616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01138011,0.000029426077,0.97641236,0.00026631315,0.00012670529,0.000057562742,2.7711903e-7,0.00042290986,0.011304314],"genre_scores_gemma":[0.41074255,0.0000020679672,0.58908814,0.00007945452,0.000009465422,0.0000023348882,9.9671844e-8,0.0000022781423,0.00007360326],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994443,0.000016317741,0.00013474365,0.0001662817,0.00012517191,0.000113153976],"domain_scores_gemma":[0.99951726,0.00006287739,0.000065237306,0.00025348787,0.000073762,0.000027362994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015853225,0.00006345933,0.00009035105,0.00007814016,0.000037481386,0.00004160184,0.0004475436,0.000025907455,0.0000079855345],"category_scores_gemma":[0.000032464588,0.00005440606,0.000032338696,0.00024205737,0.000021274496,0.00039143063,0.00014318722,0.000060021906,0.000011363502],"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.0000017170468,0.00013686549,0.0010265665,0.000020615518,0.000026290347,0.000024665282,0.007662443,0.00016432021,0.0091710985,0.4321737,0.00029006993,0.5493017],"study_design_scores_gemma":[0.00030760764,0.00024224457,0.00073595654,0.00010786238,0.000004688222,0.000034228175,0.00012610189,0.05563726,0.8633674,0.0788091,0.00035550052,0.00027208275],"about_ca_topic_score_codex":0.00008554132,"about_ca_topic_score_gemma":0.00001924782,"teacher_disagreement_score":0.85419625,"about_ca_system_score_codex":0.000028449367,"about_ca_system_score_gemma":0.0000331807,"threshold_uncertainty_score":0.22186148},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003712265,0.0010098682,0.3041918,0.0000329218,0.001151741,0.00044974775,0.000012897748,0.0009803774,0.69213355],"genre_scores_gemma":[0.016229382,0.0022828104,0.08215178,0.0004281452,0.0013012377,0.00010458724,0.000010863018,0.00037239163,0.8971188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99558735,0.00012361821,0.0005214227,0.0014426197,0.0013328686,0.000992095],"domain_scores_gemma":[0.996355,0.0009500607,0.0008178008,0.0011084015,0.0004482829,0.00032045462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011673709,0.0005618227,0.00061256025,0.0012314937,0.00019793063,0.0001580756,0.0041200435,0.00035694457,0.00015551916],"category_scores_gemma":[0.002440201,0.00056025555,0.00016788201,0.0027283644,0.0013448783,0.0006557897,0.0011536657,0.00067372597,0.00017189253],"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.000003190474,0.00039094157,0.0012762056,0.00009627297,0.00006723721,0.00007855175,0.0030087098,0.000028847442,0.000060920025,0.01312232,0.58262426,0.39924252],"study_design_scores_gemma":[0.00051017746,0.00046665425,0.0026940317,0.0025350575,0.000068878784,0.00006072535,0.00027913807,0.007371859,0.001514867,0.0017497314,0.98191553,0.0008333586],"about_ca_topic_score_codex":0.00010386361,"about_ca_topic_score_gemma":0.000115814975,"teacher_disagreement_score":0.39929125,"about_ca_system_score_codex":0.0000914239,"about_ca_system_score_gemma":0.00073966547,"threshold_uncertainty_score":0.9996849},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05885006,0.000028360711,0.9315647,0.00032727583,0.00030148134,0.00019704706,0.0000010347305,0.0018356991,0.0068943477],"genre_scores_gemma":[0.8321271,5.429888e-7,0.16734096,0.00014852821,0.00003408439,0.0000072843122,5.837378e-7,0.00000980904,0.00033111352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990525,0.000021873919,0.00012814946,0.00031859183,0.00025591502,0.00022293536],"domain_scores_gemma":[0.9991506,0.000024475034,0.000062030944,0.00060508744,0.00009039671,0.00006743948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008688857,0.00013206404,0.00013086169,0.00007448306,0.00007823275,0.00017874205,0.00071858685,0.000057577072,0.0000066379735],"category_scores_gemma":[0.00001287396,0.00009220966,0.000021242886,0.00034703387,0.000028944844,0.00030856827,0.00012296843,0.00014319691,0.000021535623],"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.00002525463,0.00011921511,0.0032852606,0.00009441369,0.00006496552,0.00018197422,0.003000271,0.0154703725,0.018106213,0.94957787,0.004031839,0.00604238],"study_design_scores_gemma":[0.006362844,0.0042895004,0.008915242,0.0015396188,0.00007007078,0.0053010783,0.0013355999,0.14863437,0.7060091,0.09745515,0.015070354,0.0050170664],"about_ca_topic_score_codex":0.00033302855,"about_ca_topic_score_gemma":0.00025654022,"teacher_disagreement_score":0.85212266,"about_ca_system_score_codex":0.00007771847,"about_ca_system_score_gemma":0.0000818284,"threshold_uncertainty_score":0.37602007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012888206,0.001829488,0.99238175,0.000177897,0.0012813158,0.0005118468,0.0000021497303,0.0005880223,0.0030986294],"genre_scores_gemma":[0.019063894,0.000073886746,0.9796559,0.0007595934,0.000256443,0.000021082114,0.0000017388936,0.00004106747,0.0001263533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601614,0.00005406427,0.0006136066,0.0017675243,0.00089251966,0.0006561191],"domain_scores_gemma":[0.9971708,0.0008312478,0.00031007695,0.0012747056,0.00021978728,0.00019338987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764689,0.0006027541,0.0006345173,0.000513519,0.00037118807,0.00054598687,0.0023634944,0.00030641494,0.000022350016],"category_scores_gemma":[0.00039401758,0.00056288793,0.000085141786,0.00054492056,0.00087211275,0.0006844014,0.0023708367,0.00077048206,0.000019992869],"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.000011803744,0.00017922366,0.00020591682,0.0003835835,0.000027803162,0.00036640637,0.0043956037,0.017760005,0.0010875202,0.12043122,0.00025693906,0.854894],"study_design_scores_gemma":[0.00017068529,0.0002991974,0.000032895143,0.0012693672,0.000006896673,0.0006240002,2.053055e-7,0.87607694,0.0022072212,0.11735739,0.0010747119,0.00088051317],"about_ca_topic_score_codex":0.00004465209,"about_ca_topic_score_gemma":0.000015703694,"teacher_disagreement_score":0.8583169,"about_ca_system_score_codex":0.00031075,"about_ca_system_score_gemma":0.0005289669,"threshold_uncertainty_score":0.99968225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07701106,0.0010601071,0.89787614,0.018470213,0.00076643645,0.0003127464,0.0000013231564,0.0021000174,0.002401979],"genre_scores_gemma":[0.8822491,0.000024588995,0.10262055,0.014320666,0.00020700038,0.000050156912,0.0000074392656,0.00006116053,0.0004593149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978672,0.00013427588,0.00024892716,0.00052443513,0.00046740327,0.00075772527],"domain_scores_gemma":[0.9985954,0.000075206866,0.00011643324,0.00091142574,0.00011355827,0.00018796723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065163954,0.00023491883,0.00023029292,0.0001826998,0.00011668098,0.00018194804,0.0014399724,0.00008944333,0.000007020049],"category_scores_gemma":[0.0001448413,0.00023780766,0.00010687119,0.000520575,0.00003467462,0.00048565795,0.00027602157,0.00048016335,0.00014628185],"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.000106194675,0.0003037831,0.0075919167,0.000039382387,0.00025866713,0.00031668125,0.006642637,0.001103344,0.08593038,0.06380614,0.78798044,0.045920417],"study_design_scores_gemma":[0.004447415,0.0015791178,0.0011274442,0.00013482611,0.00008567358,0.0006094181,0.00013300536,0.09132687,0.21112491,0.0395101,0.64632684,0.0035943876],"about_ca_topic_score_codex":0.000056139233,"about_ca_topic_score_gemma":0.00007149739,"teacher_disagreement_score":0.80523807,"about_ca_system_score_codex":0.00045406172,"about_ca_system_score_gemma":0.00028425592,"threshold_uncertainty_score":0.9697515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1443881,0.0000059875606,0.8540021,0.0002841317,0.00021479151,0.00033307573,0.0000042314905,0.0003731994,0.0003943571],"genre_scores_gemma":[0.51105577,0.0000022970753,0.48868802,0.00017676328,0.000018338284,0.000018942534,0.0000029719304,0.0000065283166,0.000030400486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886185,0.000028423592,0.00028972412,0.00034223162,0.00022712392,0.00025067182],"domain_scores_gemma":[0.99905485,0.00019367272,0.00015077078,0.000386862,0.0001619709,0.000051867188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047854925,0.00013136999,0.00018307315,0.0001193765,0.000112675036,0.00005583032,0.00044678917,0.000057821624,0.00000996283],"category_scores_gemma":[0.0000538045,0.0001280322,0.00008846,0.0002048315,0.000025909723,0.00026594684,0.00013841265,0.000085401676,0.000006673037],"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.000015868853,0.00031216673,0.0021159465,0.00008985038,0.00004949919,0.000008511944,0.0022287283,0.00009355214,0.016162327,0.22422956,0.0025697576,0.75212425],"study_design_scores_gemma":[0.00064643455,0.0003803379,0.0017858105,0.000060948172,0.000009535103,0.000007867708,0.0002052009,0.017529275,0.93417346,0.04490476,0.00006973522,0.0002266338],"about_ca_topic_score_codex":0.00063603197,"about_ca_topic_score_gemma":0.00066243974,"teacher_disagreement_score":0.9180111,"about_ca_system_score_codex":0.00012152943,"about_ca_system_score_gemma":0.000080155645,"threshold_uncertainty_score":0.52210015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05619287,0.0000194369,0.8696189,0.0029390613,0.0001768486,0.00009494907,2.7069177e-7,0.0004665903,0.07049105],"genre_scores_gemma":[0.8402981,0.0000025881104,0.15618934,0.0004403847,0.0000114005215,0.0000018932132,3.8582737e-8,0.0000027108542,0.0030535432],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994778,0.000026053216,0.00012552015,0.0001243566,0.00013569457,0.000110584355],"domain_scores_gemma":[0.9993406,0.000047516267,0.000059189555,0.0004895142,0.00004266839,0.00002050971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021270309,0.00004887391,0.000060740753,0.000038198436,0.000035125788,0.000021859205,0.00080901565,0.000012803299,0.000015055489],"category_scores_gemma":[0.000037775,0.00003121943,0.000043036373,0.0002479113,0.000023308756,0.00015762531,0.00024197239,0.00006694694,0.0000352038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031389511,0.00011948101,0.016649304,0.000011003705,0.000019110566,0.0000022745596,0.0017201654,0.0005303533,0.01392039,0.08382868,0.08979777,0.7933983],"study_design_scores_gemma":[0.00015294635,0.00008418141,0.016470572,0.000039211616,0.000004699501,0.000026617277,0.000011776796,0.16627002,0.7382573,0.020111594,0.05830141,0.00026967662],"about_ca_topic_score_codex":0.000014134529,"about_ca_topic_score_gemma":0.00016034638,"teacher_disagreement_score":0.79312867,"about_ca_system_score_codex":0.000019566955,"about_ca_system_score_gemma":0.000025221909,"threshold_uncertainty_score":0.15033658},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33688605,0.000016648051,0.6610078,0.00005158807,0.00052903994,0.0006989649,0.00002279456,0.0003760884,0.00041101183],"genre_scores_gemma":[0.8741806,0.000030207335,0.12545544,0.00002219831,0.000041157367,0.000007582243,0.00003360203,0.000020144713,0.00020903371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983322,0.000097916454,0.00030155096,0.0008848622,0.000100903766,0.00028253498],"domain_scores_gemma":[0.9975794,0.00014864389,0.00064327015,0.0011376854,0.00040118757,0.00008980406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030370153,0.0002870419,0.00039354168,0.00040887456,0.00011961953,0.0000620961,0.0014715833,0.00037071336,0.0000065980153],"category_scores_gemma":[0.00006399386,0.00035234448,0.00023618308,0.0004323971,0.0001400634,0.0005239258,0.0010129944,0.0003864993,0.000011139211],"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.00024777118,0.0009175436,0.019176701,0.0031341705,0.0006814329,0.0000924856,0.0033586326,0.07840142,0.025747543,0.8339226,0.008876494,0.025443163],"study_design_scores_gemma":[0.0003989454,0.00014645253,0.0009368931,0.00018386733,0.00007190632,0.0000073430483,0.00009746946,0.8883148,0.012159721,0.09717365,0.0000929216,0.00041601725],"about_ca_topic_score_codex":0.00029167868,"about_ca_topic_score_gemma":0.000019744735,"teacher_disagreement_score":0.8099134,"about_ca_system_score_codex":0.00020126683,"about_ca_system_score_gemma":0.00017654082,"threshold_uncertainty_score":0.99989283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16541052,0.000041608015,0.8273171,0.0006159914,0.0003767145,0.00022014516,9.633306e-7,0.0016386273,0.0043783095],"genre_scores_gemma":[0.3964966,3.5837624e-7,0.6028671,0.00035280196,0.000054348584,0.0000046514224,0.0000015415663,0.000012554853,0.00020999074],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809974,0.00011361504,0.00033126856,0.0005807368,0.0004995393,0.00037506837],"domain_scores_gemma":[0.9982832,0.00008501781,0.00012209889,0.0010242922,0.00019181178,0.00029356443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090169464,0.00020924395,0.00022107844,0.00015187812,0.00010616054,0.00019844824,0.0010339184,0.000056302215,0.00002915373],"category_scores_gemma":[0.00025577884,0.00020074578,0.000083493134,0.00044533022,0.000052517735,0.00060753536,0.00044961914,0.0002107588,0.000049652772],"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.00035600355,0.0017415887,0.12488108,0.00029218983,0.00015143583,0.00042279507,0.004809496,0.0023414195,0.3694279,0.08720354,0.31514737,0.09322521],"study_design_scores_gemma":[0.0007731204,0.00029669536,0.00013538597,0.000109766515,0.000010156071,0.00007652492,0.00007022083,0.64256245,0.33848053,0.013139063,0.0037719735,0.0005741004],"about_ca_topic_score_codex":0.0019772951,"about_ca_topic_score_gemma":0.00006279343,"teacher_disagreement_score":0.64022106,"about_ca_system_score_codex":0.0003485069,"about_ca_system_score_gemma":0.0007381605,"threshold_uncertainty_score":0.8186175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022522241,0.00046779565,0.7793605,0.0009887436,0.00006119289,0.008266624,0.00008423726,0.00029468632,0.20822401],"genre_scores_gemma":[0.6136901,0.0015705948,0.3077931,0.00091133994,0.00022200862,0.0181214,0.000045461336,0.00041223908,0.057233784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987328,0.00002371255,0.00036694919,0.00041174455,0.0002768168,0.00018796344],"domain_scores_gemma":[0.9955281,0.002823602,0.0004330593,0.001015675,0.00016596405,0.0000335893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047216186,0.00030977413,0.00038361474,0.00018323866,0.0002544112,0.00007335247,0.00095213426,0.00014436945,0.0000048880115],"category_scores_gemma":[0.00003751095,0.00017605837,0.00010321914,0.00016186784,0.00017075105,0.000045863075,0.00013546889,0.00031548477,0.000008006262],"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.0000075837543,0.000080250684,0.00000423325,0.00009496344,0.00003592594,3.3927802e-7,0.0004241432,0.00000968209,0.00001713172,0.9917756,0.000398719,0.0071514635],"study_design_scores_gemma":[0.00013959236,0.00026376898,0.000026238937,0.0005534802,0.000045298864,0.00001167662,0.000026657806,0.026364822,0.0002352023,0.96726465,0.004835749,0.00023287928],"about_ca_topic_score_codex":0.000007868931,"about_ca_topic_score_gemma":0.00009655356,"teacher_disagreement_score":0.61143786,"about_ca_system_score_codex":0.000041755393,"about_ca_system_score_gemma":0.000036133446,"threshold_uncertainty_score":0.7179452},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001997801,0.00017183572,0.9923043,0.00038901088,0.00030647643,0.00007034913,4.340935e-7,0.00028430857,0.0044754394],"genre_scores_gemma":[0.8337353,0.0000047018234,0.1656124,0.00027024766,0.00003319696,0.00002245212,2.7411815e-7,0.0000059753083,0.0003154612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.000021400558,0.00013341509,0.00014529136,0.00014409285,0.00012759613],"domain_scores_gemma":[0.99878705,0.0005338843,0.00005933747,0.00040791932,0.00017406585,0.000037744227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045588173,0.000058649966,0.00008055491,0.000039786384,0.00004453346,0.000036823436,0.000765808,0.00003051996,0.0000018416791],"category_scores_gemma":[0.0002810531,0.000037803056,0.00004539641,0.0001191831,0.000023967441,0.00013328074,0.00014941047,0.000030887826,0.000002331976],"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.0000019316283,0.000031005296,0.0002958544,0.000007449456,0.000015868469,6.2364774e-7,0.0009216508,0.0001352391,0.0011590754,0.5876503,0.011580243,0.39820072],"study_design_scores_gemma":[0.0003507684,0.00015189857,0.00022546084,0.000037048274,0.000013391524,0.000019181356,0.00021827896,0.54731077,0.24734063,0.18235224,0.021702059,0.00027823533],"about_ca_topic_score_codex":0.00016691461,"about_ca_topic_score_gemma":0.000036582413,"teacher_disagreement_score":0.8317375,"about_ca_system_score_codex":0.000017576469,"about_ca_system_score_gemma":0.000057936635,"threshold_uncertainty_score":0.15415639},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01515842,0.000035515124,0.97451746,0.0011041923,0.00028329177,0.00029774438,0.0000032825963,0.0013133744,0.0072867256],"genre_scores_gemma":[0.5589955,0.000001713532,0.43926173,0.00034765134,0.00006740951,0.000039089336,0.000006791482,0.000007143248,0.0012729457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869746,0.000040907875,0.000244283,0.00042992466,0.00024443466,0.0003429624],"domain_scores_gemma":[0.99897885,0.00024883842,0.00008593257,0.00043801148,0.00019110958,0.000057271693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040977902,0.00015211111,0.00017793685,0.000075507094,0.00019782835,0.00010326637,0.000644596,0.00009499209,0.000013247325],"category_scores_gemma":[0.00007579316,0.00014694758,0.00011204771,0.0001724705,0.0000775601,0.00031081997,0.00017542724,0.000119261524,0.000032018623],"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.000020525824,0.00020177336,0.010756781,0.00003258257,0.000016953027,0.000006926663,0.00011693499,0.00043306433,0.002841346,0.8772612,0.106620945,0.0016909428],"study_design_scores_gemma":[0.0010991315,0.00022710138,0.02799865,0.000051418978,0.000018531358,0.00006588729,0.000055387904,0.47648022,0.04969729,0.4326083,0.010702827,0.0009952503],"about_ca_topic_score_codex":0.0006737662,"about_ca_topic_score_gemma":0.00060683873,"teacher_disagreement_score":0.5438371,"about_ca_system_score_codex":0.00007902782,"about_ca_system_score_gemma":0.00009416052,"threshold_uncertainty_score":0.5992349},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11446158,0.000090050824,0.87036496,0.00044139774,0.00055189524,0.00009610907,0.0000017660271,0.000765997,0.013226263],"genre_scores_gemma":[0.7930035,0.0000067828378,0.20598955,0.00015998252,0.00013715471,0.0000082829865,9.2547015e-7,0.000006318752,0.00068751647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890727,0.000037497957,0.00025650428,0.0002792558,0.00030170733,0.00021779544],"domain_scores_gemma":[0.99925035,0.00021610402,0.00010899765,0.00024576316,0.00012462989,0.00005417218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038562313,0.00011239185,0.00015090776,0.00020148851,0.0001048842,0.00004431572,0.00046745874,0.000058915328,0.00016398044],"category_scores_gemma":[0.00007778883,0.000109255256,0.00007868743,0.00032648095,0.000045897024,0.0005269003,0.00018573576,0.0001076975,0.000025775666],"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.000021465785,0.00030859836,0.02377292,0.000040089275,0.000097243385,0.0000063750085,0.0016232537,0.004399527,0.09503692,0.7937838,0.02279361,0.05811625],"study_design_scores_gemma":[0.00037544194,0.00008824209,0.0053164503,0.00008638358,0.0000075124403,0.000080691854,0.00002453663,0.5384965,0.43868724,0.00830188,0.008111139,0.00042401772],"about_ca_topic_score_codex":0.00006677286,"about_ca_topic_score_gemma":0.000028421497,"teacher_disagreement_score":0.78548187,"about_ca_system_score_codex":0.000101729456,"about_ca_system_score_gemma":0.00006210971,"threshold_uncertainty_score":0.44553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33085495,0.00011195274,0.64424163,0.0013793907,0.00042347217,0.00088051154,0.000006665401,0.0027420828,0.019359328],"genre_scores_gemma":[0.90583056,0.000021036383,0.08883164,0.0002878914,0.00007411147,0.00004858737,0.0000017561382,0.000021861555,0.0048825573],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979748,0.00009249181,0.00029780634,0.00069693715,0.0003601757,0.0005777469],"domain_scores_gemma":[0.9981252,0.00052208797,0.000043774147,0.0009171992,0.00022661724,0.0001650982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479931,0.00022659054,0.00028569522,0.000117588366,0.00032990624,0.00015379621,0.0010839928,0.00013026602,0.000049950784],"category_scores_gemma":[0.00017516885,0.00021613728,0.0001393259,0.0003372454,0.00007270776,0.00023360351,0.0007434459,0.0002597835,0.0001534067],"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.00016346946,0.003820287,0.14379853,0.0011352374,0.00040863414,0.00045114453,0.010602133,0.0003443412,0.04782839,0.23201379,0.38660458,0.17282946],"study_design_scores_gemma":[0.00053069944,0.0006405575,0.0037714145,0.00010161381,0.00003526396,0.0002688729,0.00006221933,0.645386,0.33901423,0.0037122685,0.005394512,0.0010823834],"about_ca_topic_score_codex":0.00013017091,"about_ca_topic_score_gemma":0.00035446676,"teacher_disagreement_score":0.6450416,"about_ca_system_score_codex":0.00016321374,"about_ca_system_score_gemma":0.00002917186,"threshold_uncertainty_score":0.8813823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009724166,0.000026479189,0.59538776,0.00010095633,0.0001529403,0.00011233115,0.0000015882091,0.0003246436,0.40388358],"genre_scores_gemma":[0.058786057,0.000066934874,0.4794138,0.0008287388,0.00013162078,0.000012781557,0.000019618503,0.00008603694,0.4606544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990038,0.000012425327,0.00030528652,0.00029991358,0.00025044897,0.00012808213],"domain_scores_gemma":[0.998862,0.00006227122,0.0002890297,0.0006391648,0.00011020325,0.000037295315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024019196,0.00016765049,0.00021886478,0.0001912501,0.000027412421,0.000027204376,0.0007291186,0.00013039264,0.00022605552],"category_scores_gemma":[0.0000070458336,0.00016517592,0.00010426202,0.000025618689,0.000025626425,0.00009281194,0.00022867344,0.00013687223,0.00005006178],"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":[4.1781908e-7,0.0000015054367,0.00007427427,0.000017421398,0.000015123252,9.916976e-7,0.00010007154,3.4749914e-7,0.00008249505,0.89800084,0.007149055,0.09455748],"study_design_scores_gemma":[0.000531982,0.00083585386,0.0003281443,0.00031288428,0.000073287694,0.000049368387,0.00006580014,0.0030450628,0.041725617,0.46403417,0.48724404,0.0017537915],"about_ca_topic_score_codex":0.00022958321,"about_ca_topic_score_gemma":0.00035364568,"teacher_disagreement_score":0.480095,"about_ca_system_score_codex":0.000045747634,"about_ca_system_score_gemma":0.00006750128,"threshold_uncertainty_score":0.67356783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18337275,0.000028397737,0.8083633,0.007180596,0.00008985461,0.00018654918,0.0000035227001,0.0006610453,0.000113966504],"genre_scores_gemma":[0.47753966,0.000042397332,0.5206813,0.001592329,0.00002897993,0.000046928304,0.000014718985,0.000019081204,0.000034607874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983454,0.00039766866,0.0002942833,0.00040033157,0.00022478813,0.0003375386],"domain_scores_gemma":[0.9966953,0.00036648026,0.00012857544,0.0025828811,0.00012509896,0.00010170703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005421521,0.00021768356,0.00026771743,0.00014021482,0.0004940208,0.00013934495,0.0023036813,0.000059623755,0.000005312119],"category_scores_gemma":[0.000018857776,0.00017971874,0.000045736255,0.00028600002,0.00044424998,0.00036277017,0.0006006954,0.00032842412,0.000057754853],"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.00006274178,0.000690252,0.004434204,0.0001648685,0.00036310023,0.000035619967,0.016348254,0.005208406,0.7027174,0.03743977,0.0045435103,0.22799185],"study_design_scores_gemma":[0.00029669845,0.000054551274,0.00012476281,0.00006390358,0.000011549717,0.000029849309,0.000008428338,0.97084665,0.02533339,0.00041203073,0.0024956393,0.00032254803],"about_ca_topic_score_codex":0.0002401103,"about_ca_topic_score_gemma":0.000039220227,"teacher_disagreement_score":0.9656382,"about_ca_system_score_codex":0.000043014472,"about_ca_system_score_gemma":0.000019840292,"threshold_uncertainty_score":0.7328717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006047622,0.00007276085,0.9833467,0.000076443386,0.0000380479,0.00026784002,0.000005007275,0.00033692838,0.009808673],"genre_scores_gemma":[0.487317,2.6301322e-7,0.5123601,0.000030058289,0.000027818069,0.0000481312,0.0000074623495,0.0000044060985,0.00020475582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998948,0.000030227724,0.0002811259,0.00031994708,0.00020467046,0.00021605282],"domain_scores_gemma":[0.9992537,0.0001283275,0.00015619505,0.0001653501,0.0002688886,0.000027573493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003051206,0.00012148028,0.0001740719,0.000103960694,0.00013660334,0.00008095295,0.00040062077,0.000051215964,0.0000034596947],"category_scores_gemma":[0.000035611836,0.00010760666,0.00007324613,0.00023480359,0.000066437715,0.00039156614,0.000103571176,0.000073703406,6.2790537e-7],"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.000042697706,0.0003794448,0.013217168,0.00018624339,0.000024424218,0.0000018031559,0.0010428422,0.003553729,0.008816827,0.9458118,0.002804966,0.024118053],"study_design_scores_gemma":[0.00028628993,0.00007800528,0.0016835323,0.00003887626,0.000005105188,0.000021809614,0.00006363661,0.97287214,0.010217972,0.014425229,0.00011239647,0.00019502448],"about_ca_topic_score_codex":0.000030290801,"about_ca_topic_score_gemma":0.000021643085,"teacher_disagreement_score":0.9693184,"about_ca_system_score_codex":0.00003848686,"about_ca_system_score_gemma":0.0001133461,"threshold_uncertainty_score":0.43880722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118083745,0.00029629358,0.86400753,0.00034437623,0.0020488952,0.00072590535,0.000042549585,0.0033092995,0.011141393],"genre_scores_gemma":[0.9836276,0.00006462204,0.013086766,0.0002478216,0.0001694846,0.000003213087,0.000025575857,0.00005024862,0.0027246715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966763,0.00036593998,0.00031525313,0.0017713376,0.0002270357,0.00064411375],"domain_scores_gemma":[0.9959055,0.00015853444,0.0004045842,0.0027454104,0.0003914705,0.00039449148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006866855,0.0005755379,0.0006044686,0.00054358336,0.00020777606,0.00021469608,0.004260839,0.0005290437,0.00003131873],"category_scores_gemma":[0.00020874823,0.0006596203,0.00037531208,0.0007820601,0.00013959533,0.00023035529,0.0045698527,0.0014169416,0.00013333904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043947357,0.00091475714,0.029742517,0.00066238805,0.0011856586,0.006051599,0.006446895,0.625712,0.0001558088,0.17015816,0.14385505,0.014675677],"study_design_scores_gemma":[0.0013788404,0.0002448729,0.0004916862,0.0004564811,0.00021285677,0.00006537289,0.0001473918,0.66433936,0.00095298316,0.30716294,0.02220868,0.0023384898],"about_ca_topic_score_codex":0.0004204756,"about_ca_topic_score_gemma":0.00029799045,"teacher_disagreement_score":0.86554384,"about_ca_system_score_codex":0.0004891188,"about_ca_system_score_gemma":0.0006639824,"threshold_uncertainty_score":0.9995855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034026135,0.0014653463,0.95667905,0.0024544883,0.001012702,0.00071887946,0.00000863325,0.003295782,0.000338994],"genre_scores_gemma":[0.42555633,0.000058520996,0.57186234,0.001784353,0.00036986254,0.00016362658,0.0000028548473,0.000059590133,0.00014255368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959725,0.00036662686,0.000656628,0.00067975564,0.0006878851,0.00163659],"domain_scores_gemma":[0.9963163,0.0003815272,0.00041900945,0.0022978182,0.00017826655,0.00040705912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023097356,0.00053356204,0.00046143067,0.00043956668,0.0008452727,0.00052960246,0.0026249604,0.00033761756,0.000019988911],"category_scores_gemma":[0.0002968739,0.00044564475,0.00025706345,0.0013622735,0.00014525304,0.0018974366,0.0013340882,0.0008601654,0.000034436194],"study_design_candidate":"simulation_or_modeling","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.000030446847,0.0007628291,0.042619888,0.00006025094,0.00019684593,0.00011413142,0.0048723225,0.0023815185,0.031576898,0.34741744,0.011942805,0.5580246],"study_design_scores_gemma":[0.0003887544,0.00014009645,0.007373053,0.00012512437,0.00006580172,0.0009913712,0.00020907869,0.87369794,0.09936983,0.0109780105,0.005460271,0.0012006534],"about_ca_topic_score_codex":0.009955368,"about_ca_topic_score_gemma":0.0004225478,"teacher_disagreement_score":0.87131643,"about_ca_system_score_codex":0.00086793856,"about_ca_system_score_gemma":0.00023216273,"threshold_uncertainty_score":0.99979955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033267129,0.000019008046,0.96387905,0.00022566858,0.0001332052,0.000031745334,3.7960127e-8,0.0004576962,0.03192687],"genre_scores_gemma":[0.57123506,0.0000028053962,0.42800808,0.00012866814,0.000009975815,0.000007761564,6.492806e-8,0.0000026398773,0.0006049321],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994882,0.000016634953,0.00012597904,0.00014199142,0.00010849191,0.00011871709],"domain_scores_gemma":[0.9994475,0.00006148926,0.000047159618,0.0003310375,0.00007977934,0.000033025357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008980569,0.000052527197,0.00007596471,0.000071951166,0.00002144965,0.000033966167,0.00054099935,0.000026625112,0.000065307664],"category_scores_gemma":[0.00001800762,0.000044596596,0.000030133897,0.00019015056,0.000013428022,0.00031016598,0.00019171754,0.000032720578,0.00002466599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5935292e-7,0.000025364596,0.00072108256,0.0000038745416,0.000005164445,0.0000012291913,0.00017550447,0.0000022135282,0.011967663,0.21280952,0.008118105,0.76617014],"study_design_scores_gemma":[0.000082883475,0.000091811766,0.0010689694,0.000021914211,0.0000015257566,0.000017137854,0.000029385204,0.4098402,0.52853686,0.058575332,0.001527356,0.00020666224],"about_ca_topic_score_codex":0.0009705588,"about_ca_topic_score_gemma":0.000015456766,"teacher_disagreement_score":0.76596344,"about_ca_system_score_codex":0.000011622246,"about_ca_system_score_gemma":0.000013828598,"threshold_uncertainty_score":0.18185964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24829045,0.00057378,0.7483327,0.0016643504,0.00028740434,0.00020629236,6.5157167e-7,0.00019540427,0.000449003],"genre_scores_gemma":[0.83013046,0.00038092548,0.16924904,0.00015831916,0.000053457963,0.000008312327,5.516117e-7,0.000015513351,0.0000034116424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868846,0.00037540495,0.0003239779,0.00017661134,0.00022230636,0.00021323653],"domain_scores_gemma":[0.9973099,0.00082800275,0.00034042372,0.0012547112,0.00015884328,0.00010809195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011666785,0.0001566796,0.00021746392,0.00016314509,0.00059356954,0.00023198016,0.0016451827,0.00006670287,0.0000016922917],"category_scores_gemma":[0.000017444998,0.00012339692,0.000038869843,0.00041292704,0.00017768863,0.00020915613,0.00022585815,0.0009126015,8.759951e-7],"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.00027837712,0.0013047089,0.11088487,0.000060759074,0.0002736203,0.00008650904,0.0063198637,0.010195112,0.03222637,0.06541201,0.0007521985,0.7722056],"study_design_scores_gemma":[0.0012922282,0.0015933727,0.0062242234,0.0014953328,0.00005596465,0.0005720746,0.00010726073,0.9642721,0.016044805,0.0023209546,0.0051281643,0.00089356594],"about_ca_topic_score_codex":0.000009561554,"about_ca_topic_score_gemma":0.000052790736,"teacher_disagreement_score":0.95407695,"about_ca_system_score_codex":0.000018479937,"about_ca_system_score_gemma":0.00011627693,"threshold_uncertainty_score":0.5031981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026706977,0.0000456932,0.90931594,0.002970685,0.00071397074,0.0005586999,0.0000012642848,0.0030102357,0.05667653],"genre_scores_gemma":[0.67048454,0.0000044077565,0.32237348,0.0033094194,0.00007649656,0.00010176459,0.000002946993,0.000029805835,0.0036171556],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973684,0.00016485678,0.00043942893,0.00083134737,0.0005006722,0.00069529103],"domain_scores_gemma":[0.9973061,0.00037580405,0.00015287816,0.0016066901,0.0003090728,0.00024944477],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048124808,0.00033591408,0.00031381068,0.00029550394,0.00018158651,0.0003918546,0.0019518799,0.00017794989,0.00088260754],"category_scores_gemma":[0.00019902665,0.00029457753,0.00016242266,0.0007564574,0.0000746141,0.00088619604,0.00045244786,0.00031428205,0.0014312414],"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.000015148483,0.0006970091,0.054002054,0.000101947524,0.00009911282,0.00010988229,0.0012486448,0.00019827159,0.022392394,0.03386711,0.635523,0.2517454],"study_design_scores_gemma":[0.0009779297,0.00054617744,0.026207801,0.00014703542,0.00003472115,0.000080558995,0.000104016144,0.7666484,0.14565922,0.021898158,0.035613056,0.0020829237],"about_ca_topic_score_codex":0.00085945154,"about_ca_topic_score_gemma":0.00023624902,"teacher_disagreement_score":0.7664501,"about_ca_system_score_codex":0.00011527572,"about_ca_system_score_gemma":0.00013726098,"threshold_uncertainty_score":0.99995065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012730309,0.000015280673,0.9896214,0.0067248195,0.00055218954,0.0007219162,0.000024764446,0.0003980558,0.0006685238],"genre_scores_gemma":[0.8041051,0.00004982517,0.19491126,0.00024556447,0.000010166225,0.00048042307,9.140823e-7,0.000016295586,0.0001804659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989464,0.00021417419,0.0002706298,0.00021786314,0.00016856453,0.000182325],"domain_scores_gemma":[0.9917783,0.0043586297,0.0001354423,0.0034769403,0.00020522214,0.00004545056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357165,0.00013836075,0.00014388116,0.0001814915,0.00066973164,0.00006552618,0.003025875,0.0000915898,0.000013242724],"category_scores_gemma":[0.000084142615,0.00011160101,0.00012452558,0.00042564856,0.00017715541,0.00015308455,0.000013212156,0.0005216721,0.000018767798],"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.00009809363,0.0025407854,0.0000050508097,0.000039174636,0.00018930438,6.623955e-7,0.0063873404,0.028107677,0.22522055,0.628308,0.0097998055,0.09930358],"study_design_scores_gemma":[0.00030222017,0.00048720752,0.000013835908,0.00009177249,0.000037920418,0.000013266359,0.00009239951,0.40099254,0.5458926,0.047349606,0.004414804,0.0003118483],"about_ca_topic_score_codex":0.000042340205,"about_ca_topic_score_gemma":0.00020946981,"teacher_disagreement_score":0.80283207,"about_ca_system_score_codex":0.000024701645,"about_ca_system_score_gemma":0.00008273957,"threshold_uncertainty_score":0.56228787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03579692,0.000002041721,0.9596658,0.00016030144,0.0013808055,0.00051227893,0.00007865167,0.00040524598,0.001997978],"genre_scores_gemma":[0.97617775,0.0000069216003,0.022853909,0.00068610796,0.000017229793,0.00010176512,0.000030181183,0.000014166829,0.000111960486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982021,0.0001885891,0.00073039543,0.00018934402,0.00047681024,0.00021277578],"domain_scores_gemma":[0.9982532,0.00017217417,0.0003815448,0.00060294097,0.00046265335,0.00012747027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011418513,0.00019324108,0.000249147,0.00080155453,0.00014805964,0.000050169376,0.000492903,0.000109156856,0.00004260586],"category_scores_gemma":[0.000043417465,0.00020480732,0.000093750416,0.0010267524,0.000050336905,0.0017153772,0.0000072174357,0.00022072849,0.000046112054],"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.0011650561,0.0013241777,0.0000731687,0.00037704324,0.0003642682,0.0000018691035,0.052168608,0.1593409,0.104034215,0.09394222,0.0021590851,0.5850494],"study_design_scores_gemma":[0.0011572771,0.001522308,0.00029182478,0.00046844984,0.00006993638,0.000023599961,0.00141444,0.06977164,0.9150197,0.006553375,0.0031076432,0.0005997972],"about_ca_topic_score_codex":0.00004116955,"about_ca_topic_score_gemma":0.0000055714427,"teacher_disagreement_score":0.9403808,"about_ca_system_score_codex":0.0001595672,"about_ca_system_score_gemma":0.00014666689,"threshold_uncertainty_score":0.83518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58878535,0.00036599181,0.41041493,0.00012805914,0.00009707705,0.00006656891,2.1997212e-7,0.00006678638,0.0000750346],"genre_scores_gemma":[0.9559646,0.00001428211,0.04367745,0.000060516617,0.0002410594,0.0000022374597,2.3485975e-7,0.000016407836,0.000023160239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00009836433,0.00039194818,0.00023717915,0.00046493087,0.00029038798],"domain_scores_gemma":[0.9984407,0.00008709524,0.00046670673,0.00011529748,0.0007602114,0.00012998938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476345,0.00018517775,0.0003089232,0.00028730967,0.00008935126,0.00032295354,0.00035332103,0.00009179845,9.606545e-7],"category_scores_gemma":[0.00006827898,0.0001367218,0.000018899005,0.00084435585,0.0000640453,0.0011725972,0.000036967936,0.00053060433,1.464002e-7],"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.0046750316,0.0011770272,0.23256612,0.00060646597,0.00050845096,0.0031555735,0.032396425,0.04831908,0.058376033,0.00039948671,0.0010723191,0.616748],"study_design_scores_gemma":[0.0098398095,0.02048553,0.014354495,0.011098177,0.00025806195,0.0103069795,0.0014708019,0.65935504,0.2562932,0.012817305,0.000833826,0.0028867577],"about_ca_topic_score_codex":0.0000374683,"about_ca_topic_score_gemma":0.000060309423,"teacher_disagreement_score":0.61386126,"about_ca_system_score_codex":0.00011366079,"about_ca_system_score_gemma":0.00054982764,"threshold_uncertainty_score":0.55753535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26308712,0.0003843422,0.6792995,0.026565421,0.0012268908,0.0016309981,0.00005683545,0.006394594,0.021354293],"genre_scores_gemma":[0.8479873,0.000018402481,0.15056057,0.0012386921,0.00002196672,0.00006242343,0.00003352928,0.000019530873,0.000057585785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980106,0.00055933703,0.0003395385,0.0003974578,0.00038537936,0.0003076862],"domain_scores_gemma":[0.99276376,0.00057557545,0.00020426919,0.005972159,0.00027998572,0.00020427507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007566292,0.00022217577,0.00026405952,0.00018324619,0.00037115888,0.00018244132,0.0043937387,0.00013985796,0.000004597886],"category_scores_gemma":[0.00049634156,0.00023017495,0.00009699463,0.0005545907,0.00018885157,0.00035892692,0.0009998255,0.0005637296,0.00010439925],"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.00032708893,0.009381075,0.09854888,0.00019878762,0.00034368958,0.00008774536,0.02398653,0.0054115304,0.027567001,0.4994782,0.20756955,0.12709993],"study_design_scores_gemma":[0.0013592896,0.00051581167,0.03251353,0.00023717833,0.0000427839,0.000048437993,0.00021245124,0.8719697,0.022999754,0.047705073,0.021231592,0.0011643932],"about_ca_topic_score_codex":0.0004386594,"about_ca_topic_score_gemma":0.0008776739,"teacher_disagreement_score":0.8665582,"about_ca_system_score_codex":0.00023390175,"about_ca_system_score_gemma":0.00026092696,"threshold_uncertainty_score":0.9386262},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08875057,0.0000087444205,0.89813024,0.00013154716,0.00023565526,0.00043666878,6.9250365e-7,0.001513832,0.010792036],"genre_scores_gemma":[0.5537411,5.7123526e-7,0.4456481,0.00010695812,0.000031701766,0.000056011788,0.000001204538,0.000009352046,0.00040497034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989095,0.00003320752,0.00021538032,0.0004188515,0.00015474285,0.00026834497],"domain_scores_gemma":[0.99904156,0.00009649334,0.000110231,0.00045711198,0.00023866507,0.000055935787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035241144,0.00015497665,0.00015562598,0.00018040105,0.0001324551,0.000055968525,0.00058653764,0.00007988238,0.000014396186],"category_scores_gemma":[0.00017119713,0.00013527312,0.00007680998,0.0005708234,0.000019151972,0.00057878887,0.00017413897,0.00011131499,0.00002081641],"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.00013644966,0.0007977861,0.11855964,0.00021831588,0.00023190018,0.000012131562,0.039016772,0.00012540116,0.26894867,0.43601888,0.013073798,0.12286024],"study_design_scores_gemma":[0.00033953905,0.00019277456,0.03805781,0.000032153588,0.0000033465283,0.000011250895,0.000043635937,0.84109867,0.07204301,0.04753038,0.00024950615,0.0003979018],"about_ca_topic_score_codex":0.0001326367,"about_ca_topic_score_gemma":0.00006021521,"teacher_disagreement_score":0.84097326,"about_ca_system_score_codex":0.000068668036,"about_ca_system_score_gemma":0.000042059288,"threshold_uncertainty_score":0.55162776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010010407,0.000030230147,0.98520195,0.0011043067,0.00023801015,0.00016700817,2.851929e-7,0.00095106213,0.0022967386],"genre_scores_gemma":[0.40773147,0.0000037991545,0.5914686,0.0005127139,0.000027650427,0.000004054192,6.093995e-7,0.000005424835,0.00024569413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920803,0.000020615536,0.00015219733,0.00028493328,0.00012967538,0.0002045532],"domain_scores_gemma":[0.9995187,0.00008961649,0.000043090142,0.00019735169,0.000070801456,0.00008042045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020037028,0.00010587231,0.00009930062,0.00013555758,0.00012730993,0.00007633093,0.0003861667,0.000053483673,0.00002039414],"category_scores_gemma":[0.000041122228,0.000095280026,0.00009112926,0.00021503771,0.000014264302,0.00035940937,0.000023502891,0.00007196504,0.0000034016014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004651679,0.00014975473,0.0003155098,0.000019322442,0.000020870464,0.0000049886553,0.0013503345,0.0006388948,0.10233884,0.024043484,0.00977192,0.8612996],"study_design_scores_gemma":[0.00025718386,0.00028114684,0.0002353351,0.00006284049,0.0000070654646,0.000041568896,0.000045059467,0.745395,0.22266139,0.02213159,0.008599081,0.0002827058],"about_ca_topic_score_codex":0.00002976214,"about_ca_topic_score_gemma":0.0000056491076,"teacher_disagreement_score":0.86101687,"about_ca_system_score_codex":0.00006937696,"about_ca_system_score_gemma":0.00005655741,"threshold_uncertainty_score":0.38854066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018030645,0.00009912223,0.9382778,0.00038936923,0.0007692457,0.0000978164,1.7985734e-7,0.0013311991,0.04100463],"genre_scores_gemma":[0.5542241,0.0000018383705,0.44478104,0.00028408165,0.000086343105,0.00000694974,1.9808557e-7,0.0000069070707,0.0006085387],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871844,0.000034165692,0.0001912031,0.00027701887,0.0003393099,0.00043986496],"domain_scores_gemma":[0.99870706,0.0002790638,0.000040468658,0.000722359,0.000052520554,0.00019853891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006125859,0.0001271329,0.00013545317,0.00009247266,0.00007999866,0.0001068648,0.00087310985,0.00009063126,0.00017888553],"category_scores_gemma":[0.00022950581,0.000102861624,0.000065891814,0.00016976596,0.000030000916,0.00081947213,0.00056524493,0.00018201944,0.0007755403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009676907,0.000219827,0.011739612,0.0000063117936,0.000010115175,0.000010005107,0.0011259454,0.0000037126879,0.0025582442,0.12316897,0.04284177,0.8183058],"study_design_scores_gemma":[0.00209025,0.0014652514,0.14057073,0.00036235436,0.00006969217,0.0010976951,0.00039289027,0.21060307,0.28492385,0.12040867,0.23370996,0.0043055615],"about_ca_topic_score_codex":0.000045406116,"about_ca_topic_score_gemma":0.000019897336,"teacher_disagreement_score":0.81400025,"about_ca_system_score_codex":0.00005742228,"about_ca_system_score_gemma":0.000027879945,"threshold_uncertainty_score":0.996826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1682189,0.000006984485,0.7660399,0.0019804873,0.0014365452,0.00021306504,9.78194e-8,0.0013166207,0.060787376],"genre_scores_gemma":[0.7579822,0.000002292329,0.24139877,0.00014533845,0.000015314541,0.00002241857,8.905733e-7,0.00000554107,0.00042723212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.00005031624,0.00018700372,0.00022855742,0.00014468984,0.00017789815],"domain_scores_gemma":[0.9987803,0.00018130234,0.000047646226,0.0008749843,0.00006564553,0.00005011423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641676,0.00008483726,0.00009690019,0.00014327304,0.00006558349,0.00008146612,0.00087324885,0.00010058559,0.000022940883],"category_scores_gemma":[0.00023367305,0.000081139086,0.00003426035,0.00036162656,0.000039634404,0.00044214464,0.00028844102,0.00048724524,0.00006263922],"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.0000208987,0.0005273653,0.035795912,0.00001477482,0.0000101131245,0.0000130742565,0.0026096536,0.00010334355,0.036363877,0.477422,0.018491548,0.42862743],"study_design_scores_gemma":[0.0004539375,0.00019412102,0.06398081,0.000055798584,0.000005073304,0.00013962903,0.00015851036,0.819735,0.08022052,0.024854394,0.009622619,0.00057961536],"about_ca_topic_score_codex":0.00025282038,"about_ca_topic_score_gemma":0.0019430963,"teacher_disagreement_score":0.81963164,"about_ca_system_score_codex":0.00003909228,"about_ca_system_score_gemma":0.000034040793,"threshold_uncertainty_score":0.33087558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33168373,0.00040350686,0.667566,0.00004544831,0.00008906007,0.00013666038,3.6613764e-7,0.000051946525,0.000023316998],"genre_scores_gemma":[0.9588829,0.0000022470222,0.040958196,0.000024029254,0.00009991406,0.000003386302,1.529813e-7,0.00001398736,0.00001517618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981727,0.0001107649,0.00076095486,0.00021370016,0.0005287677,0.00021311392],"domain_scores_gemma":[0.9973342,0.00027008008,0.0011970949,0.0001766041,0.00090266694,0.0001193968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096948264,0.00017315807,0.00044733525,0.0002638024,0.00014259883,0.00030693787,0.0004840768,0.00011217213,6.995184e-7],"category_scores_gemma":[0.00012526114,0.00014242531,0.00007197683,0.0002543274,0.00006373328,0.00083760155,0.00011093608,0.00039290433,7.4022654e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019872716,0.00005184695,0.0006090292,0.0006080533,0.000021722057,0.0000060484354,0.0023683547,0.9512416,0.024760593,0.0001550832,0.000033876688,0.02012393],"study_design_scores_gemma":[0.00018999296,0.00010986945,0.00020103925,0.0015924609,0.000017418444,0.00019882277,0.00016275437,0.99149585,0.0020256066,0.0038609891,8.526885e-7,0.00014434032],"about_ca_topic_score_codex":0.000038443683,"about_ca_topic_score_gemma":0.0000024296487,"teacher_disagreement_score":0.6271992,"about_ca_system_score_codex":0.00007110383,"about_ca_system_score_gemma":0.00017661985,"threshold_uncertainty_score":0.58079356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65798354,0.00018413202,0.33944157,0.00027182035,0.0002543431,0.0014395968,0.000002563725,0.00014108467,0.00028134274],"genre_scores_gemma":[0.9983319,0.000013636003,0.0010775939,0.00021420195,0.000056619778,0.00019854856,0.0000021785204,0.00001849811,0.000086814034],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977453,0.0005305679,0.0005410353,0.0003402297,0.0005813079,0.00026155636],"domain_scores_gemma":[0.9959061,0.0029267317,0.000616018,0.00034099628,0.00017615836,0.00003400151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014610018,0.00022929267,0.00027152782,0.00015625081,0.00038429326,0.00019650074,0.0005349148,0.00006712657,0.0000044284957],"category_scores_gemma":[0.000057895453,0.0001387611,0.00005232052,0.0005219944,0.0001149275,0.00022964054,0.000035285313,0.00020354311,0.0000031080592],"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.0012530414,0.0011209381,0.0032278067,0.0037415498,0.00022901231,0.000017325317,0.013501948,0.04439705,0.6146874,0.107203715,0.048533883,0.16208637],"study_design_scores_gemma":[0.000846443,0.002459631,0.0010567115,0.00315231,0.000042939115,0.000011983812,0.0011355737,0.2433153,0.74610364,0.0013792727,0.00008806144,0.00040815075],"about_ca_topic_score_codex":0.00005552932,"about_ca_topic_score_gemma":0.000004962577,"teacher_disagreement_score":0.34034836,"about_ca_system_score_codex":0.00006231844,"about_ca_system_score_gemma":0.00009031038,"threshold_uncertainty_score":0.56585133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138791045,0.000017070892,0.9795041,0.0015956613,0.0004509512,0.00070574624,0.0000025422019,0.0019419653,0.001902855],"genre_scores_gemma":[0.6376056,0.00000972,0.35823506,0.0011278519,0.00009271277,0.00009791574,0.000011138414,0.000031522202,0.0027884792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981718,0.000085187836,0.0003527241,0.00059302803,0.00028103756,0.0005162433],"domain_scores_gemma":[0.99854726,0.00033265955,0.00012832528,0.0006314276,0.00020299025,0.00015733887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640228,0.00025233152,0.00031661426,0.00013296725,0.00019455444,0.00019019113,0.00095778616,0.00014501398,0.00006521645],"category_scores_gemma":[0.00010627933,0.00021733117,0.00012034154,0.0002616234,0.000029062741,0.0004071756,0.000117006595,0.00013892955,0.000014218324],"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.00041169047,0.00073853007,0.001152043,0.00034914364,0.00015242558,0.00002097333,0.0059722024,0.010274126,0.16298941,0.6845093,0.02416258,0.109267615],"study_design_scores_gemma":[0.00096373644,0.0003732848,0.00022528796,0.000055200748,0.000007410128,0.0000060451184,0.0000034506504,0.9587105,0.01524743,0.008582546,0.015475867,0.00034921948],"about_ca_topic_score_codex":0.00023266237,"about_ca_topic_score_gemma":0.00017471949,"teacher_disagreement_score":0.9484364,"about_ca_system_score_codex":0.000047504633,"about_ca_system_score_gemma":0.0000785862,"threshold_uncertainty_score":0.8862508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21264377,0.000015140063,0.7783077,0.00019268137,0.0004020901,0.00008218729,0.0000013150168,0.0003416656,0.008013472],"genre_scores_gemma":[0.9402977,0.0000018013344,0.05886663,0.00027225167,0.000035802233,0.000008558674,0.0000034445027,0.0000059876907,0.0005078058],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992459,0.00003629711,0.00018195456,0.00013913734,0.00019584376,0.00020089916],"domain_scores_gemma":[0.9993791,0.000043501273,0.00009866683,0.0003039928,0.00011564742,0.000059116355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002763291,0.00007814299,0.00009718563,0.00008808092,0.000036331487,0.0000189149,0.00034411653,0.00005108911,0.00016556328],"category_scores_gemma":[0.000043166314,0.00007134992,0.000040175,0.00021198227,0.000026360522,0.00070054753,0.00015340964,0.00006227859,0.000054044307],"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.000012417912,0.00049133337,0.09687674,0.000026220761,0.00003595301,0.0000013855755,0.0032262802,0.0000025040974,0.49537963,0.3857807,0.0033022184,0.014864626],"study_design_scores_gemma":[0.00028470022,0.00013772058,0.5056747,0.000045869852,0.0000074858544,0.000058367907,0.000030634666,0.011535885,0.469446,0.0026739796,0.009632698,0.00047196526],"about_ca_topic_score_codex":0.000011030323,"about_ca_topic_score_gemma":0.0000014010984,"teacher_disagreement_score":0.7276539,"about_ca_system_score_codex":0.00003102732,"about_ca_system_score_gemma":0.00003559988,"threshold_uncertainty_score":0.29095653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075597977,0.000037447127,0.90933436,0.000956672,0.00042252123,0.00012620246,5.5051842e-8,0.00165825,0.07990468],"genre_scores_gemma":[0.7863386,0.0000013304955,0.21200918,0.00022849638,0.000064790634,0.0000129332075,3.914172e-7,0.000005139596,0.0013391392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993184,0.000037884514,0.00011203936,0.00014498309,0.00015393796,0.0002327337],"domain_scores_gemma":[0.99941003,0.00003020248,0.00004501827,0.0004076756,0.00003348631,0.00007355776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000360602,0.000069384376,0.00005862854,0.00006426197,0.00006782298,0.000046914425,0.00038706747,0.000041685125,0.000023756782],"category_scores_gemma":[0.00005528643,0.000057128895,0.0000250016,0.00024428326,0.000011950486,0.00078155886,0.00014002077,0.00008843482,0.00020379694],"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.0000021605404,0.00017012353,0.02062783,0.000012735905,0.0000075857783,0.000002437655,0.002495471,0.0000018450422,0.010589056,0.8146838,0.015878564,0.1355284],"study_design_scores_gemma":[0.0005886373,0.0005046622,0.12625974,0.00011776486,0.000018970382,0.00025356025,0.00016961398,0.048470337,0.72134006,0.030251179,0.07041902,0.0016064667],"about_ca_topic_score_codex":0.00002725011,"about_ca_topic_score_gemma":0.0000064785604,"teacher_disagreement_score":0.7844326,"about_ca_system_score_codex":0.000038236394,"about_ca_system_score_gemma":0.000017169818,"threshold_uncertainty_score":0.26194653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16445522,0.00030512657,0.83390725,0.00004211194,0.00031026686,0.00009719409,1.0523063e-7,0.00007518921,0.0008075662],"genre_scores_gemma":[0.9601527,0.000003889666,0.03968843,0.000027945014,0.00009109719,0.000003839207,5.012978e-8,0.000011972672,0.000020080844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984266,0.00021152476,0.0005792745,0.00019455615,0.00038071323,0.0002073168],"domain_scores_gemma":[0.99831426,0.0000919999,0.0010233043,0.00013554623,0.00036249857,0.000072418115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012222071,0.00014289946,0.00029847302,0.000425521,0.00009661566,0.00023961553,0.0006053817,0.00008193046,0.0000020539771],"category_scores_gemma":[0.000076864,0.00012135912,0.0000620364,0.00050324795,0.00001844611,0.0021642921,0.000060989478,0.00037228983,0.0000015089836],"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.00047557094,0.0012688207,0.06551151,0.001175564,0.00014842562,0.0009513298,0.16528265,0.008224127,0.11138723,0.0024252257,0.00076788705,0.64238167],"study_design_scores_gemma":[0.0009519755,0.0007940549,0.007431135,0.00440783,0.000027671818,0.0012311141,0.001614226,0.9362047,0.04330436,0.0033000205,0.0000967354,0.00063620205],"about_ca_topic_score_codex":0.000086552674,"about_ca_topic_score_gemma":0.000011254431,"teacher_disagreement_score":0.92798054,"about_ca_system_score_codex":0.00016176919,"about_ca_system_score_gemma":0.00022691801,"threshold_uncertainty_score":0.4948881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2774568,6.4442037e-7,0.7207962,0.00017855247,0.000553725,0.0002712763,0.0000024317992,0.00023789721,0.00050248497],"genre_scores_gemma":[0.79451007,6.276058e-8,0.20514163,0.00024591121,0.000021641714,0.000049501818,0.0000018761174,0.0000069383227,0.000022389517],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991733,0.000024352423,0.00023454192,0.00025242358,0.00016050614,0.00015490547],"domain_scores_gemma":[0.99914795,0.00019543523,0.0001221417,0.00035457397,0.00013886743,0.000041032188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005947825,0.0000936978,0.00010506273,0.00016868048,0.00007502123,0.00004833788,0.0002813899,0.00004113745,0.00008555995],"category_scores_gemma":[0.00009599987,0.00008247739,0.00007237805,0.00014230447,0.000018261682,0.00008185188,0.0000645254,0.00008993412,0.0000036640413],"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.00007001349,0.000061345214,0.0026383305,0.000045480796,0.000012119615,5.036872e-7,0.00071232906,0.00038172677,0.82580936,0.037591055,0.0010190853,0.13165867],"study_design_scores_gemma":[0.00026047684,0.00039501747,0.0012175045,0.00001706444,0.0000052833543,0.0000010580857,0.00010453273,0.44834706,0.54882944,0.0005493588,0.0001783674,0.0000947973],"about_ca_topic_score_codex":0.0000616074,"about_ca_topic_score_gemma":0.00023887806,"teacher_disagreement_score":0.51705325,"about_ca_system_score_codex":0.000034952423,"about_ca_system_score_gemma":0.00005011525,"threshold_uncertainty_score":0.336333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003194521,0.0000803507,0.9731465,0.016640345,0.00026332313,0.00043678796,0.0000046702467,0.0015297217,0.004703782],"genre_scores_gemma":[0.76089054,0.00003088595,0.2374774,0.0013236142,0.000055701148,0.000053915566,0.000023093024,0.000019648134,0.00012521798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978367,0.0006038416,0.00037081706,0.0004635132,0.00036177662,0.00036336976],"domain_scores_gemma":[0.99313223,0.0011312283,0.0002517618,0.0050654537,0.00022627426,0.0001930351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012417049,0.00027855425,0.00037474342,0.00016820108,0.00070064433,0.00023855324,0.0039076474,0.00018013363,0.00000785995],"category_scores_gemma":[0.0009606419,0.00026976093,0.00016915878,0.00058786734,0.000095613315,0.00030193935,0.0008726877,0.0007299076,0.000055183114],"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.00051265024,0.0046316916,0.016319187,0.0003499009,0.0003523658,0.00001447159,0.019764176,0.0020792354,0.03208668,0.61430204,0.21917659,0.090411],"study_design_scores_gemma":[0.001619781,0.00018397688,0.003712068,0.0002699581,0.000027087597,0.000009855812,0.00005327088,0.953746,0.013930272,0.015054362,0.010784203,0.0006091193],"about_ca_topic_score_codex":0.0004156119,"about_ca_topic_score_gemma":0.0008574191,"teacher_disagreement_score":0.95166683,"about_ca_system_score_codex":0.000111773836,"about_ca_system_score_gemma":0.0001615213,"threshold_uncertainty_score":0.99997544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02199876,0.000056549656,0.9742757,0.0017321586,0.0002728842,0.0007113562,0.000045661578,0.00070885103,0.00019808965],"genre_scores_gemma":[0.6763334,0.000105061765,0.32306248,0.0001170161,0.0000035550233,0.00020361276,0.000016849184,0.000017786882,0.00014022691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976938,0.00057529344,0.00069064397,0.0004318959,0.00033055863,0.00027782435],"domain_scores_gemma":[0.99415684,0.0018193114,0.00034048595,0.0029932102,0.00056762673,0.00012250453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006739549,0.00026867155,0.00037659425,0.0002897945,0.0006910887,0.00021235464,0.0021324123,0.00017852007,0.000041646963],"category_scores_gemma":[0.000107544656,0.00024887684,0.00015762883,0.00079128455,0.00023573787,0.0011438589,0.00004116326,0.0006200857,0.00013442534],"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.00013791067,0.0054538506,0.00010576178,0.00012196052,0.00037047005,0.0000028340935,0.011030027,0.025656985,0.12047958,0.005046277,0.012264276,0.8193301],"study_design_scores_gemma":[0.00043531106,0.00014874488,0.0002743649,0.00014506221,0.000027645112,0.000008249859,0.000097469936,0.8552675,0.13714476,0.0060310764,0.00012349547,0.00029629585],"about_ca_topic_score_codex":0.00070502475,"about_ca_topic_score_gemma":0.00031156797,"teacher_disagreement_score":0.8296105,"about_ca_system_score_codex":0.00012625956,"about_ca_system_score_gemma":0.00010252851,"threshold_uncertainty_score":0.99999636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045434916,0.000026001153,0.98324984,0.0003954451,0.0024681871,0.0010957611,0.000004291058,0.0016273803,0.006589581],"genre_scores_gemma":[0.39490965,0.0000051603397,0.60333174,0.00037524066,0.00039380338,0.00012144053,0.00001934023,0.00003044755,0.00081314385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977201,0.00006379858,0.00045693197,0.000986602,0.00033145945,0.00044108316],"domain_scores_gemma":[0.9978784,0.00055594265,0.00030913425,0.00083567266,0.00032576732,0.000095128475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011211961,0.00037320596,0.00036205197,0.0005230613,0.00020252951,0.00034048397,0.0010730478,0.00039364622,0.000006949431],"category_scores_gemma":[0.0002670131,0.0003633579,0.00022308814,0.00024635645,0.000020572483,0.00027779213,0.0010085836,0.0006068662,0.00001725497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017523144,0.0004872872,0.00060702744,0.0008570178,0.00033690702,0.000086695174,0.026121339,0.39695913,0.003914625,0.26881257,0.014378005,0.28726417],"study_design_scores_gemma":[0.00012802712,0.00014513434,0.000026055683,0.00037050265,0.000008380407,0.0000049503733,0.000013889951,0.9433117,0.04611672,0.008857733,0.00057669956,0.00044020446],"about_ca_topic_score_codex":0.000042902,"about_ca_topic_score_gemma":0.000011008932,"teacher_disagreement_score":0.54635257,"about_ca_system_score_codex":0.00031602074,"about_ca_system_score_gemma":0.00008501579,"threshold_uncertainty_score":0.99988186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048185874,0.000001573456,0.9373706,0.0005653355,0.00047972126,0.00010653567,8.93325e-7,0.00066244224,0.01262703],"genre_scores_gemma":[0.5030299,2.0187568e-7,0.49656647,0.0003219739,0.000012144748,0.0000053239064,2.0253323e-7,0.0000057098296,0.000058049824],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989755,0.0000800556,0.00024112538,0.00031952994,0.00019919939,0.00018459908],"domain_scores_gemma":[0.9984724,0.00048169206,0.00011579105,0.00077123,0.0000982162,0.000060678518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065652,0.0001221265,0.00018524114,0.00019204228,0.000045822442,0.000058959704,0.00090186903,0.00004059915,0.00008143256],"category_scores_gemma":[0.00035398066,0.00010351962,0.00008510608,0.0001584373,0.000030943447,0.00018004877,0.00021708813,0.00025388112,0.000015131998],"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.00002556279,0.0001388193,0.0015199193,0.00004036696,0.000013621445,0.000021931906,0.00043865165,0.00005803226,0.6500689,0.0713922,0.0034256566,0.27285632],"study_design_scores_gemma":[0.00007500296,0.00011510735,0.00016321591,0.000031256266,0.0000019615802,0.000013356445,0.0000063486864,0.32043594,0.6763538,0.00244584,0.00025750886,0.0001006773],"about_ca_topic_score_codex":0.00009424886,"about_ca_topic_score_gemma":0.00005865786,"teacher_disagreement_score":0.45484403,"about_ca_system_score_codex":0.000021005117,"about_ca_system_score_gemma":0.000048663936,"threshold_uncertainty_score":0.42214075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016183743,0.000044552417,0.9790038,0.0018893967,0.0003694219,0.00028138256,0.0000047988806,0.0008845854,0.0013383564],"genre_scores_gemma":[0.977536,0.000003845433,0.021363134,0.00064260606,0.000116996474,0.000036517697,0.0000092823675,0.000010581264,0.0002810272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.000071567796,0.00015676177,0.00031180197,0.0001919339,0.0002741047],"domain_scores_gemma":[0.99884397,0.00036060868,0.000077192475,0.0005580156,0.00011932164,0.000040880746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787295,0.0001291729,0.000120193145,0.00003552807,0.00029714868,0.00014104515,0.0008721615,0.00006956836,0.000006980509],"category_scores_gemma":[0.0002450434,0.00008722499,0.00008170842,0.00015314666,0.0000390916,0.0002947633,0.00025223976,0.00012016396,0.00001026532],"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.000042095322,0.00021809916,0.004457784,0.00013897308,0.000073414325,0.000004135482,0.003183752,0.00046566853,0.017334452,0.5929326,0.21749118,0.16365784],"study_design_scores_gemma":[0.00023944404,0.00025962704,0.016872318,0.00006825893,0.000011281906,0.00002225533,0.000026967113,0.9215934,0.015584155,0.02661977,0.018359412,0.00034305733],"about_ca_topic_score_codex":0.000058771067,"about_ca_topic_score_gemma":0.00011711309,"teacher_disagreement_score":0.9613523,"about_ca_system_score_codex":0.00004876968,"about_ca_system_score_gemma":0.000023811577,"threshold_uncertainty_score":0.35569316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018878361,0.0051671476,0.68733805,0.1828408,0.0010201683,0.0029764124,0.000044658285,0.0037448448,0.09798956],"genre_scores_gemma":[0.95137084,0.00019888516,0.04729026,0.0007854696,0.00002049533,0.0002210693,0.000014061779,0.000011980861,0.00008694615],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986708,0.00037864855,0.00027132637,0.00021296546,0.00021707841,0.00024917314],"domain_scores_gemma":[0.9954311,0.0007238078,0.00008680444,0.0035272245,0.00016671905,0.00006429922],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001450295,0.00013872012,0.00014368459,0.00014251434,0.00024988578,0.00013270584,0.0055261254,0.00008360673,0.0000012917557],"category_scores_gemma":[0.00026497064,0.00011073515,0.000058950576,0.00082521775,0.0001172267,0.00042379112,0.00061184476,0.0005332868,0.000020890408],"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.00009432299,0.0053589647,0.005577221,0.00012454618,0.00018867134,0.000051869658,0.3987718,0.0017910334,0.0049329237,0.3068675,0.09511362,0.18112753],"study_design_scores_gemma":[0.0009726564,0.0005485381,0.0031970362,0.00015752141,0.000025387832,0.000066843124,0.0045948173,0.8598064,0.0013711104,0.06653262,0.061950047,0.00077700865],"about_ca_topic_score_codex":0.0004741772,"about_ca_topic_score_gemma":0.0014566152,"teacher_disagreement_score":0.9324925,"about_ca_system_score_codex":0.00007457878,"about_ca_system_score_gemma":0.00013592048,"threshold_uncertainty_score":0.99985445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03657854,0.00017082153,0.95443845,0.0010582788,0.00047609466,0.00021648432,7.7549595e-7,0.00065305695,0.006407482],"genre_scores_gemma":[0.95704776,0.000045598863,0.042455435,0.00023166009,0.000046535963,0.00003480531,3.582179e-7,0.000011360107,0.00012650726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00008340986,0.0004477435,0.00050919165,0.00025060953,0.00041418514],"domain_scores_gemma":[0.99876857,0.00029688378,0.000096945056,0.00068775483,0.00007486792,0.00007500857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040903583,0.00018295014,0.00018394744,0.00024609937,0.00009533291,0.00018044398,0.0013024705,0.00007866979,0.000103821876],"category_scores_gemma":[0.0005055718,0.00018202244,0.00005371639,0.00095451326,0.000079164034,0.00041838296,0.00031018307,0.000286656,0.0005101363],"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.0000035839164,0.00019362092,0.0024981906,0.000012344099,0.0000031635775,0.000048031543,0.0028081157,0.0006131789,0.002779621,0.29009455,0.0001483933,0.7007972],"study_design_scores_gemma":[0.000009530394,0.0000623563,0.00018966722,0.000039509025,0.0000012407297,0.0000083248915,0.000042118605,0.8127038,0.041029375,0.14539218,0.00026668698,0.00025524962],"about_ca_topic_score_codex":0.0002714321,"about_ca_topic_score_gemma":0.0003950034,"teacher_disagreement_score":0.9204692,"about_ca_system_score_codex":0.000050503822,"about_ca_system_score_gemma":0.000014705946,"threshold_uncertainty_score":0.74226594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30418202,0.00007849207,0.66760826,0.025571283,0.00023588481,0.0005585188,0.000014758171,0.00064517325,0.0011056197],"genre_scores_gemma":[0.95138866,0.000016960457,0.0476214,0.00080099015,0.000010487004,0.00011536566,0.000021709171,0.000008001861,0.000016443459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00020154651,0.00026138974,0.00018843671,0.0001736707,0.00016484759],"domain_scores_gemma":[0.99622023,0.00049351505,0.00015459917,0.0029449938,0.00014421169,0.000042450527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022631949,0.000108048414,0.00013123671,0.00008635719,0.00015985148,0.000061369785,0.0025610263,0.00004219042,0.0000058591663],"category_scores_gemma":[0.0001537241,0.000104389386,0.000058280115,0.00036551422,0.0001814083,0.0003055582,0.00027291727,0.00021607209,0.00007941822],"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.000008526062,0.0010304285,0.004836217,0.00008840375,0.00008680967,0.0000022248178,0.0019503969,0.00059533375,0.23481303,0.5460918,0.1803672,0.030129625],"study_design_scores_gemma":[0.0018174847,0.0011750424,0.09862124,0.00133025,0.000120054465,0.00009958079,0.00015615132,0.41667855,0.24021278,0.2035011,0.032980606,0.003307169],"about_ca_topic_score_codex":0.0002665084,"about_ca_topic_score_gemma":0.000018959656,"teacher_disagreement_score":0.6472066,"about_ca_system_score_codex":0.00010020076,"about_ca_system_score_gemma":0.000024909436,"threshold_uncertainty_score":0.47590664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095839,0.000014509925,0.07286141,0.010249184,0.00021792678,0.00046511675,0.0000014420784,0.0003276637,0.006278836],"genre_scores_gemma":[0.9857666,0.0000012289269,0.012709532,0.0008154813,0.0000065257163,0.000015197232,2.4646283e-7,0.0000048535107,0.0006803579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.000103296145,0.00019430261,0.00020760321,0.00025442816,0.00016709967],"domain_scores_gemma":[0.9987454,0.00011694538,0.000083605286,0.0009883447,0.000047572707,0.000018175058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494168,0.000100157275,0.00011329763,0.000065719985,0.00006709688,0.000034127144,0.0015257252,0.000053069594,0.000011537872],"category_scores_gemma":[0.00012544815,0.000052912583,0.00006929556,0.0004616879,0.000053351887,0.0000944494,0.0001600625,0.00019863297,0.000005457844],"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.000008733622,0.00029846746,0.0037921367,0.0000042166153,0.000003502853,0.0000081498,0.00074211956,0.00010938585,0.0038917477,0.95064646,0.0017683627,0.038726732],"study_design_scores_gemma":[0.00040032098,0.00084865297,0.24979141,0.00024548004,0.00002256348,0.000044268796,0.00037393294,0.44536725,0.16325355,0.13893186,0.00013891885,0.0005817956],"about_ca_topic_score_codex":0.00012460329,"about_ca_topic_score_gemma":0.0005596831,"teacher_disagreement_score":0.8117146,"about_ca_system_score_codex":0.00006945399,"about_ca_system_score_gemma":0.000035827798,"threshold_uncertainty_score":0.28352025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043872934,0.000051355557,0.92519635,0.0040251976,0.00028730262,0.00015892273,7.68945e-7,0.0016646804,0.024742512],"genre_scores_gemma":[0.5725147,0.00000235554,0.42307448,0.0013764937,0.00008084749,0.0000060494185,8.3192896e-7,0.0000072837092,0.0029369434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881774,0.000058304246,0.00021414847,0.00040841842,0.00021299692,0.00028837685],"domain_scores_gemma":[0.9990335,0.00010889824,0.00006721777,0.00059349695,0.00011352262,0.000083351224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002307903,0.00015287739,0.00015861286,0.00014469918,0.00009126296,0.00016507572,0.00081256963,0.00006417637,0.00012114377],"category_scores_gemma":[0.00004774753,0.0001305906,0.000061691644,0.00037501464,0.000029265873,0.00064395217,0.00025649797,0.00014771063,0.00027866705],"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.00002102832,0.00045129808,0.0037168255,0.000015856831,0.00009009212,0.000081940176,0.0087777665,0.0005225703,0.018550964,0.4358126,0.17946358,0.35249546],"study_design_scores_gemma":[0.0010759428,0.00054087595,0.006667612,0.00008611623,0.00002145966,0.00016141884,0.000113854585,0.4307731,0.46855462,0.023703385,0.0667037,0.0015979123],"about_ca_topic_score_codex":0.000108393004,"about_ca_topic_score_gemma":0.0003432834,"teacher_disagreement_score":0.52864176,"about_ca_system_score_codex":0.00007703292,"about_ca_system_score_gemma":0.000040135583,"threshold_uncertainty_score":0.532533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002582465,0.00012034359,0.991123,0.0010517724,0.00044103377,0.0005518106,0.00003103659,0.001080757,0.0030177312],"genre_scores_gemma":[0.619749,0.000054861823,0.37947696,0.00015213771,0.000009240658,0.00037214215,0.00000360624,0.000017410855,0.00016460317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984387,0.00021994201,0.0004002882,0.00040346285,0.00022386317,0.0003137094],"domain_scores_gemma":[0.9966671,0.0009652773,0.00014926172,0.0017721127,0.0003460108,0.00010023039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005788753,0.00022620407,0.00021945285,0.00027226578,0.0011847237,0.00019595245,0.001628867,0.00009965697,0.000017876451],"category_scores_gemma":[0.000034538738,0.00024459788,0.00018340752,0.00046924897,0.0001304966,0.0006248386,0.000016145508,0.00049522787,0.000022967488],"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.00005643424,0.001949779,0.001323161,0.00006290019,0.0004018719,0.0000021705175,0.0080908695,0.0033557066,0.0060932357,0.96410674,0.0016047091,0.012952423],"study_design_scores_gemma":[0.0020103368,0.00069301046,0.00027252993,0.00052407867,0.00017113758,0.00022527014,0.00039430664,0.853051,0.0692034,0.04553733,0.026390433,0.0015271408],"about_ca_topic_score_codex":0.00001575894,"about_ca_topic_score_gemma":0.00038484708,"teacher_disagreement_score":0.9185694,"about_ca_system_score_codex":0.00021999022,"about_ca_system_score_gemma":0.00021162008,"threshold_uncertainty_score":0.99744123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013214613,0.000027697339,0.979458,0.00021785081,0.0019500717,0.00083755265,0.0000149948055,0.0028590842,0.0014201476],"genre_scores_gemma":[0.8892238,0.0000018997049,0.109961934,0.000045965415,0.00036864137,0.00015067302,0.0000031614693,0.00006265878,0.00018126842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694633,0.00014815899,0.00069749204,0.0010246731,0.00048603365,0.00069728325],"domain_scores_gemma":[0.9975932,0.0010042187,0.00027788055,0.0007736966,0.00014612843,0.0002048311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008829604,0.00042753172,0.0004390064,0.00035458826,0.0009057475,0.00056688115,0.0009163969,0.00014460715,0.0000031229624],"category_scores_gemma":[0.00015959772,0.00042093746,0.00029842355,0.0006044083,0.00006540014,0.0009851892,0.000008338505,0.00047025882,0.000022660168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116809766,0.00014226972,0.000020069214,0.00019418086,0.000033160923,0.0000055229084,0.00071412517,0.009870794,0.010464015,0.00024632816,0.00016561094,0.9780271],"study_design_scores_gemma":[0.0011985225,0.0008262327,0.000015432563,0.0011315452,0.000054025248,0.00021824705,0.00014892132,0.85393524,0.13746019,0.0002256835,0.0040029795,0.00078295637],"about_ca_topic_score_codex":0.000049696977,"about_ca_topic_score_gemma":0.000008136224,"teacher_disagreement_score":0.97724414,"about_ca_system_score_codex":0.00019171144,"about_ca_system_score_gemma":0.00009866589,"threshold_uncertainty_score":0.9998242},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03900201,0.000005343542,0.9574231,0.0002151759,0.0007192148,0.001118328,0.0000033086812,0.00092253793,0.0005909712],"genre_scores_gemma":[0.8913283,0.0000025030117,0.10816195,0.000109080655,0.000059421487,0.00024523513,0.0000016029525,0.00002616546,0.00006576418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986665,0.000053490377,0.00028243783,0.0004469052,0.00022873869,0.00032189817],"domain_scores_gemma":[0.99839723,0.00075610843,0.00018399116,0.00032597603,0.00025587747,0.00008083105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023183064,0.00019543059,0.00017045652,0.00026199268,0.00045509936,0.00044935526,0.0004305031,0.000078517005,0.000019575577],"category_scores_gemma":[0.000025228672,0.00018648145,0.00007153139,0.00046790243,0.00003593686,0.0015227878,0.000004191811,0.00019450448,0.000019287318],"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.00007692616,0.00019355201,0.0005980422,0.00012865725,0.00006669972,0.0000030605277,0.00212156,0.17441602,0.04245194,0.00021056352,0.00034692071,0.77938604],"study_design_scores_gemma":[0.000533768,0.00021492792,0.00007928853,0.00017216145,0.0000129923355,0.00002408725,0.00009049202,0.7973555,0.20095403,0.0002186411,0.0000761222,0.00026803554],"about_ca_topic_score_codex":0.00014570935,"about_ca_topic_score_gemma":0.000026323876,"teacher_disagreement_score":0.8523263,"about_ca_system_score_codex":0.000092507755,"about_ca_system_score_gemma":0.00004907611,"threshold_uncertainty_score":0.7604493},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46689793,0.0005159723,0.52099526,0.006718841,0.0003762925,0.0008629813,0.000004407709,0.00114732,0.0024809896],"genre_scores_gemma":[0.81104165,0.00004419968,0.18799756,0.0006466265,0.00004412367,0.00020113845,0.0000035464261,0.000015859725,0.000005315528],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985118,0.00026137868,0.00040852593,0.00019929348,0.0002646826,0.00035434758],"domain_scores_gemma":[0.9958882,0.00042097337,0.00019698335,0.0033122606,0.00010857698,0.000073024225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067752,0.00015811475,0.00021457097,0.00026377212,0.0002671542,0.000068562855,0.0034848638,0.000061114064,0.0000018059968],"category_scores_gemma":[0.000081341954,0.00016609266,0.00011152088,0.00066659285,0.00026951416,0.0007215339,0.00054950215,0.00029971893,0.000013072568],"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.0000064150026,0.0010259628,0.37173754,0.000100937876,0.00012774397,0.0000013599201,0.008341098,0.00004972419,0.54125553,0.02251137,0.0100384625,0.044803843],"study_design_scores_gemma":[0.0008500144,0.00033161623,0.18394683,0.0012508486,0.00020558311,0.00021563168,0.0011034234,0.039509047,0.7061702,0.003248504,0.059872426,0.0032958856],"about_ca_topic_score_codex":0.00018305522,"about_ca_topic_score_gemma":0.00003960483,"teacher_disagreement_score":0.3441437,"about_ca_system_score_codex":0.000052212883,"about_ca_system_score_gemma":0.00002450941,"threshold_uncertainty_score":0.67730623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.316233,0.000067482484,0.67817885,0.00063706207,0.0006089724,0.0008216963,0.000003080553,0.002012281,0.001437586],"genre_scores_gemma":[0.8890006,0.000019288787,0.11031585,0.0001792788,0.00006328968,0.00016932702,0.000015194412,0.000019617144,0.00021755505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982068,0.00016961673,0.00042280013,0.00050034275,0.0003181617,0.0003823107],"domain_scores_gemma":[0.99678695,0.00050056825,0.0001543157,0.0020228259,0.00038624476,0.00014911899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775302,0.00021789299,0.00033143495,0.00011952746,0.00034674507,0.00025349966,0.002027026,0.00025232031,0.000006301797],"category_scores_gemma":[0.0004056065,0.00020252755,0.00011085108,0.0003464282,0.00011755663,0.00046662145,0.00045523283,0.0004984646,0.00002521956],"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.00016954921,0.003973597,0.31022418,0.0009168375,0.00030343691,0.00002287801,0.0055075833,0.000042850595,0.16675812,0.36619636,0.067679204,0.07820541],"study_design_scores_gemma":[0.0009769257,0.0004796343,0.045567248,0.00024725375,0.000074544536,0.0001607842,0.00021694577,0.783316,0.15070407,0.0075779986,0.009184718,0.0014938731],"about_ca_topic_score_codex":0.0014399525,"about_ca_topic_score_gemma":0.00311247,"teacher_disagreement_score":0.78327316,"about_ca_system_score_codex":0.0000682829,"about_ca_system_score_gemma":0.000085012594,"threshold_uncertainty_score":0.8258834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21713705,0.00005464375,0.77129126,0.009176626,0.00026026933,0.0001045234,5.588334e-7,0.0005301044,0.0014449755],"genre_scores_gemma":[0.70516276,0.0000054021966,0.29429194,0.00038508407,0.0000625663,0.0000036639392,5.436935e-8,0.000012573612,0.00007595917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998552,0.0000630729,0.0004398937,0.00025655775,0.00035227826,0.0003362025],"domain_scores_gemma":[0.9981301,0.00014216115,0.0004371841,0.0007162121,0.00043958204,0.00013480018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006984699,0.00017540752,0.00038640414,0.0010173265,0.000080277285,0.000063840824,0.0014719808,0.00016016103,0.000005990263],"category_scores_gemma":[0.00037524148,0.0001290642,0.00006762115,0.0010023108,0.000082161154,0.00030909045,0.00029375317,0.000487122,0.000025802656],"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.00024372918,0.00060361513,0.023639847,0.000065254215,0.00023119866,0.0015417222,0.0018551459,0.00018389242,0.084920526,0.57993644,0.029629963,0.27714863],"study_design_scores_gemma":[0.0016961368,0.014849021,0.0025424566,0.00067001133,0.00006726964,0.012678582,0.00027581694,0.0031148414,0.6779543,0.10689437,0.17816243,0.0010947302],"about_ca_topic_score_codex":0.000006789371,"about_ca_topic_score_gemma":0.00003467566,"teacher_disagreement_score":0.5930338,"about_ca_system_score_codex":0.0001025943,"about_ca_system_score_gemma":0.00010187049,"threshold_uncertainty_score":0.5263085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22408226,0.000089609974,0.76205283,0.0002770006,0.0010320353,0.00016081591,0.0000031339514,0.0008361248,0.011466165],"genre_scores_gemma":[0.77964497,0.0000030589613,0.2200207,0.000049310165,0.00009595916,0.0000033497895,0.0000022093714,0.000007147297,0.00017329451],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988574,0.00005780334,0.00024513146,0.00028779774,0.00024051627,0.0003113571],"domain_scores_gemma":[0.99786305,0.00030999415,0.00011479838,0.0015675124,0.000055768982,0.00008884747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750576,0.00011708162,0.0001641959,0.00007276576,0.000045774716,0.00003680741,0.001661742,0.00004524154,0.000018157492],"category_scores_gemma":[0.00039269877,0.0000928628,0.000029834935,0.00018002054,0.000031347696,0.0008256614,0.0015818421,0.00012135726,0.000014751596],"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.000015653131,0.0016043476,0.1702487,0.00021025985,0.00009579278,0.0000075478406,0.004510878,0.0000069985635,0.25125015,0.1380289,0.03983836,0.3941824],"study_design_scores_gemma":[0.0004071166,0.00021539842,0.06330052,0.0002626969,0.000037415633,0.00011965166,0.00029663436,0.21164896,0.71845627,0.0012854497,0.003139125,0.0008307572],"about_ca_topic_score_codex":0.000070822236,"about_ca_topic_score_gemma":0.000016829228,"teacher_disagreement_score":0.55556273,"about_ca_system_score_codex":0.000026644993,"about_ca_system_score_gemma":0.000022213648,"threshold_uncertainty_score":0.3786835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005965631,0.000004690926,0.9829333,0.0017248902,0.0012346389,0.0002004013,2.507343e-7,0.0011968156,0.006739404],"genre_scores_gemma":[0.20578817,3.7146214e-7,0.79217315,0.00060380547,0.00011424665,0.000017463226,4.1874006e-7,0.000009177925,0.0012931882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992304,0.00001266496,0.000133479,0.00028564277,0.00009929394,0.0002385625],"domain_scores_gemma":[0.99914795,0.00014900017,0.000041674586,0.00050731254,0.000064718035,0.00008934822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035585702,0.000094711584,0.00009278285,0.000082453094,0.00009259288,0.00017627836,0.0008133992,0.00006273796,0.00006304535],"category_scores_gemma":[0.00016054898,0.000089934845,0.00005570173,0.00013985948,0.000011726399,0.0003773109,0.00010869241,0.00013063624,0.00001830054],"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.0000069260295,0.000024423269,0.0006853137,0.000016532937,0.000010127292,0.0000031473596,0.0010157678,0.0000021922017,0.16852239,0.36458477,0.11635772,0.34877068],"study_design_scores_gemma":[0.00085351325,0.00035276904,0.001421699,0.00004513004,0.000012454201,0.00009669433,0.00012380109,0.24760357,0.32423773,0.24506307,0.17911895,0.0010706075],"about_ca_topic_score_codex":0.00018315697,"about_ca_topic_score_gemma":0.0004823758,"teacher_disagreement_score":0.3477001,"about_ca_system_score_codex":0.000017349292,"about_ca_system_score_gemma":0.000086014064,"threshold_uncertainty_score":0.36674365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072620235,0.00001975677,0.9228449,0.00015566383,0.00011767348,0.00013775905,4.7763984e-7,0.0003588146,0.0037447163],"genre_scores_gemma":[0.65036947,0.000005244471,0.34932184,0.00004230725,0.000011086721,0.000013120106,4.976013e-7,0.0000031378838,0.00023329949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944633,0.000017088738,0.00015995225,0.0001619466,0.00010730712,0.00010738016],"domain_scores_gemma":[0.9991476,0.00030647288,0.0001338414,0.00023828029,0.00015247996,0.00002131946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018037653,0.000055441327,0.00009633515,0.00007966485,0.00008787891,0.000012049946,0.00037854817,0.000034690638,0.000003857786],"category_scores_gemma":[0.0002764595,0.000050038394,0.000042964515,0.00017803344,0.00002547177,0.00030675903,0.000075136726,0.00003744096,0.0000024671729],"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.00003694747,0.00021344704,0.04642584,0.00012923665,0.00004657916,0.000015233126,0.0087028155,0.00025823107,0.06231892,0.7518187,0.0209927,0.10904135],"study_design_scores_gemma":[0.000293472,0.00024582824,0.003750562,0.000054926302,0.0000053405092,0.00003575173,0.00005966381,0.20320295,0.7756938,0.015810136,0.0006063735,0.00024123662],"about_ca_topic_score_codex":0.000056747132,"about_ca_topic_score_gemma":0.000025038014,"teacher_disagreement_score":0.7360086,"about_ca_system_score_codex":0.000022865222,"about_ca_system_score_gemma":0.000037502232,"threshold_uncertainty_score":0.20405066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031799626,0.000059194528,0.94184154,0.00067550415,0.0006743452,0.0003013503,0.0000062929525,0.0012175177,0.02342463],"genre_scores_gemma":[0.6264232,0.000009879834,0.37288076,0.00022743388,0.0000417965,0.000015498967,0.0000015816402,0.000014107293,0.0003857685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979182,0.000069706846,0.00048750654,0.0005958771,0.0004196719,0.0005090761],"domain_scores_gemma":[0.99852103,0.00020321953,0.00023943273,0.00074296806,0.00017481466,0.000118516116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007741947,0.0002699197,0.00035454883,0.00023904872,0.00014808713,0.00011575806,0.0012985494,0.00014221782,0.0000841742],"category_scores_gemma":[0.0001376293,0.00025011998,0.000106784915,0.00061670074,0.00013872703,0.00079475186,0.00037933845,0.00024656393,0.000021980932],"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.000056594665,0.0006413881,0.0022768092,0.0003480706,0.00021407107,0.00011464501,0.0067267492,0.004199765,0.123787105,0.82274234,0.003017667,0.035874765],"study_design_scores_gemma":[0.002955239,0.0009759842,0.0010866958,0.0010252132,0.000062302664,0.000287868,0.0010130508,0.2018983,0.64310724,0.14444582,0.0009530975,0.0021891948],"about_ca_topic_score_codex":0.0009766198,"about_ca_topic_score_gemma":0.00014445327,"teacher_disagreement_score":0.67829657,"about_ca_system_score_codex":0.00014264193,"about_ca_system_score_gemma":0.00026895746,"threshold_uncertainty_score":0.9999951},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25277138,0.000032293137,0.74497527,0.00024123606,0.00075841096,0.00045328125,5.9374173e-7,0.0006864929,0.00008104977],"genre_scores_gemma":[0.5964047,0.0000049648615,0.40285134,0.00039808525,0.00013217772,0.00017973206,0.0000013193753,0.000015053411,0.000012658876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628425,0.00006060001,0.00049586163,0.0014208939,0.0006121716,0.0011262252],"domain_scores_gemma":[0.99760056,0.00032969975,0.00021578447,0.00094388955,0.0005761144,0.00033397513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013298448,0.00034046118,0.00035042327,0.00056222704,0.00041833846,0.00097063836,0.0032588404,0.00011460177,0.0000029334417],"category_scores_gemma":[0.00011661122,0.00032499598,0.00007513117,0.0019970401,0.0002877155,0.0016418748,0.001032179,0.00024528007,0.000007676424],"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.000049521557,0.0015232417,0.03723226,0.00022100571,0.000030926265,0.000060073802,0.006883993,0.11668827,0.058676552,0.08774294,0.0035584786,0.68733275],"study_design_scores_gemma":[0.00025207,0.00019077407,0.0013475507,0.00009649043,0.0000018422606,0.000036617505,0.000017784658,0.98266923,0.013721244,0.001149863,0.00008763472,0.00042888752],"about_ca_topic_score_codex":0.00016638161,"about_ca_topic_score_gemma":0.000055311448,"teacher_disagreement_score":0.865981,"about_ca_system_score_codex":0.0002067252,"about_ca_system_score_gemma":0.0002938244,"threshold_uncertainty_score":0.9999202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04765946,8.9814336e-7,0.94489664,0.0012338882,0.00046103273,0.00031610578,5.422737e-7,0.000354743,0.005076683],"genre_scores_gemma":[0.83699006,1.3724002e-7,0.16251001,0.00025609726,0.000027341483,0.000021983751,6.463924e-7,0.000005271488,0.00018843188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991268,0.000056584595,0.00016475492,0.00021755189,0.0003259196,0.00010839846],"domain_scores_gemma":[0.99885154,0.00009779494,0.00012882483,0.00075224397,0.00014683486,0.000022784965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039459614,0.00008144672,0.0000753872,0.00008778566,0.00007671611,0.00003505848,0.00062630035,0.000059556558,0.000007855764],"category_scores_gemma":[0.00013944425,0.000054361906,0.00004973554,0.0003826067,0.000033398414,0.00016000975,0.000093786075,0.00019890115,0.000007636909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063848584,0.00023013307,0.0009147569,0.000013710402,0.000004167751,9.489219e-7,0.00039609394,0.0006305996,0.09461112,0.053899426,0.0007266578,0.848566],"study_design_scores_gemma":[0.000115060386,0.00006967681,0.0058402466,0.000016117852,0.0000020468121,0.0000017000787,0.0000029587832,0.7912633,0.20056012,0.001988816,0.000069266,0.00007067851],"about_ca_topic_score_codex":0.000081761194,"about_ca_topic_score_gemma":0.000056431116,"teacher_disagreement_score":0.8484953,"about_ca_system_score_codex":0.000021160433,"about_ca_system_score_gemma":0.000073466785,"threshold_uncertainty_score":0.22168142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032670968,0.000048333168,0.9818938,0.015493102,0.00021835827,0.00080913247,0.00001500501,0.00042650718,0.00076905335],"genre_scores_gemma":[0.850339,0.00010377523,0.14853826,0.00053869374,0.000009178802,0.00027536746,0.000001351868,0.000011641724,0.00018272547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998797,0.00030126306,0.0002906918,0.00023092465,0.0001786008,0.00020149136],"domain_scores_gemma":[0.9944778,0.0021979057,0.00013998168,0.002986867,0.0001475928,0.000049832004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943779,0.00015610195,0.00017261239,0.00021674814,0.00068533455,0.000064561835,0.0027270191,0.000075667616,0.00000875469],"category_scores_gemma":[0.000039303337,0.00012470459,0.00014221239,0.00054853933,0.00012015305,0.00018475066,0.0000074424343,0.0003093606,0.000013372355],"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.0002468825,0.00505327,0.0000025176046,0.00003703921,0.00022924821,0.0000016178577,0.008778759,0.084226325,0.058246184,0.6443351,0.015847174,0.18299592],"study_design_scores_gemma":[0.0005805841,0.0026845303,0.000055358312,0.0002854382,0.000062793035,0.000013073855,0.00016917443,0.64539856,0.27862763,0.0692944,0.0023123918,0.0005160683],"about_ca_topic_score_codex":0.000018947301,"about_ca_topic_score_gemma":0.000013549458,"teacher_disagreement_score":0.8500123,"about_ca_system_score_codex":0.00005852634,"about_ca_system_score_gemma":0.000074757,"threshold_uncertainty_score":0.5271109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50701004,0.000003266422,0.48640946,0.00022889736,0.00022271837,0.00008827761,4.1332888e-7,0.0005237389,0.0055132066],"genre_scores_gemma":[0.8003931,0.0000029066696,0.19937903,0.00016002296,0.000010943779,0.000002945643,6.293688e-7,0.0000045880947,0.000045861525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990826,0.000057703273,0.00021773162,0.00028528195,0.00019197034,0.0001646754],"domain_scores_gemma":[0.9990765,0.00011358671,0.00011877621,0.00051062333,0.00013241383,0.000048091588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000332847,0.00011277255,0.00018404941,0.00011284665,0.00007597877,0.00004227819,0.00041928762,0.00006451094,0.000013299951],"category_scores_gemma":[0.000102574515,0.00010374024,0.00005432697,0.00032166817,0.00008288133,0.0002342258,0.00012216171,0.00014856453,0.000036662466],"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.000019328318,0.00020514149,0.004398139,0.000034127406,0.000013949937,0.00000855857,0.0004680034,0.0005064095,0.01825078,0.96989655,0.0006160637,0.005582939],"study_design_scores_gemma":[0.00026352907,0.00019417876,0.0043949517,0.00007544597,0.0000033077386,0.000021741893,0.00003325711,0.0028348095,0.83595204,0.15604666,0.000021199397,0.00015885891],"about_ca_topic_score_codex":0.00054833025,"about_ca_topic_score_gemma":0.00014125784,"teacher_disagreement_score":0.8177013,"about_ca_system_score_codex":0.000069632246,"about_ca_system_score_gemma":0.00007471494,"threshold_uncertainty_score":0.42304042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6290724,0.0070556286,0.34294993,0.001690283,0.0011615325,0.0023924182,0.00006557066,0.0011297141,0.014482505],"genre_scores_gemma":[0.99736667,0.000041595067,0.0017934487,0.00019172988,0.000113863476,0.00017299809,0.000006730613,0.000021674457,0.00029131235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834746,0.000016533852,0.0003906943,0.0006470416,0.00024161265,0.0003566283],"domain_scores_gemma":[0.9990232,0.00013780606,0.00027388614,0.00015042524,0.00029483825,0.000119846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005226652,0.00023273066,0.00030042714,0.00015786597,0.0003951773,0.00082332816,0.00027090264,0.000134456,0.0000012379016],"category_scores_gemma":[0.000048098977,0.0002231657,0.000040533476,0.0001987015,0.00012717703,0.00080895,0.00007291852,0.00010617921,0.0000010493386],"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.000032790147,0.00018629247,0.19523145,0.004940747,0.00022138057,0.000015057742,0.016576136,0.0001242684,0.012641004,0.7225163,0.039697755,0.007816812],"study_design_scores_gemma":[0.006214358,0.0017187621,0.17485172,0.0042853155,0.0003811463,0.0025040435,0.010678475,0.57739645,0.005572474,0.047614098,0.1630092,0.0057739588],"about_ca_topic_score_codex":0.00047348876,"about_ca_topic_score_gemma":0.00010846252,"teacher_disagreement_score":0.6749022,"about_ca_system_score_codex":0.00005051225,"about_ca_system_score_gemma":0.00005078624,"threshold_uncertainty_score":0.9100433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021091779,0.000011749059,0.9910022,0.00006607933,0.0006916285,0.0000810618,0.00000466282,0.00050088234,0.005532538],"genre_scores_gemma":[0.98030233,0.000017610399,0.019179052,0.0003609304,0.000006600463,0.000029223873,0.000001864522,0.0000050408585,0.00009732231],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990755,0.00010377812,0.00033430068,0.00009380314,0.00026533386,0.00012731798],"domain_scores_gemma":[0.9990231,0.00014112548,0.00017117076,0.00038771582,0.00019858766,0.00007831841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919027,0.00010164337,0.00010789613,0.0003545204,0.00007113262,0.000045416746,0.00036499245,0.00007518352,0.00002739917],"category_scores_gemma":[0.000016137177,0.00010160041,0.000064300955,0.00025759853,0.000057503443,0.0018434667,0.0000026710497,0.000113626564,0.00009700097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012626527,0.00012632231,0.000016374168,0.00004129493,0.00004423891,7.5171704e-7,0.0078797,0.015510899,0.00037322435,0.18926522,0.001555987,0.7850597],"study_design_scores_gemma":[0.0016504079,0.0007152202,0.000075522374,0.00014730412,0.000041802956,0.0000859917,0.0011493186,0.21669851,0.6836352,0.0873555,0.007720919,0.00072433625],"about_ca_topic_score_codex":0.000026505417,"about_ca_topic_score_gemma":0.00000736938,"teacher_disagreement_score":0.97819316,"about_ca_system_score_codex":0.000079100886,"about_ca_system_score_gemma":0.000083454994,"threshold_uncertainty_score":0.41431445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43173236,0.00001572123,0.5599338,0.00050913304,0.0010728919,0.0008341337,0.000016297945,0.0008689689,0.0050167153],"genre_scores_gemma":[0.810546,0.0000063859584,0.18904847,0.00029506552,0.00002372896,0.00006219279,0.0000045462934,0.0000037889681,0.000009842859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99645007,0.000080357575,0.00067445304,0.0006708205,0.001333407,0.0007909218],"domain_scores_gemma":[0.9974902,0.00011112447,0.00074230565,0.0005948171,0.00081764534,0.00024389428],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.004030717,0.00028019265,0.0002852637,0.0005781028,0.002411858,0.0011597099,0.0033728569,0.00009838631,0.000011496044],"category_scores_gemma":[0.0010129841,0.00023822993,0.000096984535,0.0029544574,0.0045554265,0.013021839,0.0005343514,0.00023286506,0.000040714116],"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.0000897818,0.0008642618,0.03948272,0.00045728008,0.000021258764,0.0000035055848,0.04680336,0.000045465487,0.008839241,0.7331769,0.0063321623,0.16388406],"study_design_scores_gemma":[0.00081376464,0.001387172,0.04590771,0.0002457274,0.000015829482,0.00023034906,0.0021352689,0.15713193,0.6394249,0.15075031,0.0005188365,0.001438204],"about_ca_topic_score_codex":0.0003677392,"about_ca_topic_score_gemma":0.000031718726,"teacher_disagreement_score":0.6305857,"about_ca_system_score_codex":0.00015903033,"about_ca_system_score_gemma":0.000590293,"threshold_uncertainty_score":0.99987715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21819316,0.00016459983,0.7791109,0.0008938707,0.00017535026,0.0002154781,0.000002650139,0.00029161441,0.000952371],"genre_scores_gemma":[0.6035073,0.0000033434458,0.396093,0.00030259104,0.00001829826,0.000051304425,0.0000021850594,0.000014002737,0.000007996961],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860704,0.00017925611,0.00032062444,0.00023085305,0.0002625315,0.00039972394],"domain_scores_gemma":[0.9957396,0.00073903764,0.0002507903,0.0030390185,0.0001359584,0.0000956045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073326845,0.00018589628,0.00023386984,0.00023780974,0.0003283179,0.000056607183,0.0028057701,0.00004372202,0.0000032756095],"category_scores_gemma":[0.00006249302,0.00017407867,0.0000538904,0.00071709533,0.00024267347,0.00028627765,0.0006048541,0.00030021905,0.000015957508],"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.000052050036,0.0017830757,0.020017948,0.00014735805,0.00024848361,0.0000058009696,0.013259846,0.19742323,0.72287554,0.024895526,0.0046077445,0.014683409],"study_design_scores_gemma":[0.00060919585,0.00012370347,0.0047986344,0.00053202995,0.00007612759,0.00008578227,0.00017835946,0.9735651,0.019030523,0.00013755227,0.00020002147,0.00066299643],"about_ca_topic_score_codex":0.0002281639,"about_ca_topic_score_gemma":0.000021876727,"teacher_disagreement_score":0.7761418,"about_ca_system_score_codex":0.0001172789,"about_ca_system_score_gemma":0.0000637534,"threshold_uncertainty_score":0.70987225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39917397,0.000012031095,0.5914627,0.00012305354,0.0006627147,0.000102143764,5.249185e-7,0.00063232536,0.007830566],"genre_scores_gemma":[0.7973057,0.0000011896984,0.20230956,0.000062913154,0.00003611262,0.000006641754,2.7711735e-7,0.00000921383,0.00026838641],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989079,0.00002411741,0.00026414555,0.0003235881,0.00023481855,0.00024542693],"domain_scores_gemma":[0.9987747,0.00019388561,0.00012586257,0.0007162629,0.00011565269,0.000073626376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000379833,0.00012872255,0.0001751373,0.00015123351,0.00006876893,0.000055162673,0.0009491708,0.00008607342,0.000088532084],"category_scores_gemma":[0.0002606764,0.00011446477,0.00006598727,0.00032018768,0.000057093308,0.00034875094,0.000304231,0.0002702144,0.000021218144],"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.0000056354897,0.000106736,0.0017222492,0.000023348493,0.0000169574,0.000006915784,0.001012173,0.000050840805,0.7791415,0.17477489,0.0026274826,0.040511306],"study_design_scores_gemma":[0.0003857456,0.00026860248,0.008302607,0.00012849097,0.00001964184,0.000112469475,0.000057533805,0.22946079,0.71407646,0.046131756,0.00029659455,0.0007593328],"about_ca_topic_score_codex":0.00015905102,"about_ca_topic_score_gemma":0.00012254606,"teacher_disagreement_score":0.39813173,"about_ca_system_score_codex":0.000017033359,"about_ca_system_score_gemma":0.000065464395,"threshold_uncertainty_score":0.46677378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049923953,0.000031817483,0.9387483,0.00021760378,0.000119304495,0.00007760033,2.438634e-7,0.0006470355,0.010234112],"genre_scores_gemma":[0.82896423,0.0000012821843,0.1705542,0.00027471155,0.000015726037,0.0000015191695,1.4824234e-7,0.0000032959047,0.00018487002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992158,0.000021810452,0.00018299842,0.00021486958,0.00018732139,0.00017719211],"domain_scores_gemma":[0.99927455,0.00011952834,0.00007719477,0.00042592958,0.00005946529,0.000043354998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022281059,0.00008967826,0.00013749636,0.00011019424,0.000040403294,0.000038479375,0.0006154371,0.000038968796,0.000023164635],"category_scores_gemma":[0.000097507196,0.000080333724,0.000048747348,0.0002708352,0.000018905617,0.00025399597,0.00010277612,0.0000822418,0.000009914285],"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.000015203074,0.0002639764,0.0016240162,0.000024152529,0.000023488179,0.000018007759,0.0020296492,0.00075428217,0.08273892,0.61353827,0.010309815,0.28866023],"study_design_scores_gemma":[0.0005650442,0.0009267525,0.01827153,0.0002459009,0.000018977897,0.000072775416,0.00007087726,0.58725,0.26879728,0.12260259,0.00032155865,0.00085672707],"about_ca_topic_score_codex":0.00003653656,"about_ca_topic_score_gemma":0.000015235362,"teacher_disagreement_score":0.7790403,"about_ca_system_score_codex":0.00002662698,"about_ca_system_score_gemma":0.000027569136,"threshold_uncertainty_score":0.32759142},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5268275,0.000014243656,0.47177958,0.00015093441,0.0002162107,0.00009211532,4.3336237e-7,0.0001692757,0.0007496688],"genre_scores_gemma":[0.93774736,0.0000076268398,0.062137842,0.00004872483,0.000022319042,0.000016974891,0.0000024884944,0.0000057549864,0.000010923001],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923766,0.00003110633,0.0002380001,0.00021282627,0.00015621934,0.0001241873],"domain_scores_gemma":[0.99922466,0.0001411984,0.00011652463,0.00027786862,0.00021539851,0.00002431853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037762467,0.00008464386,0.000107954234,0.00021352243,0.000029930721,0.00005297523,0.0003899425,0.00007956257,0.000005529214],"category_scores_gemma":[0.00074716104,0.00007638607,0.000025946554,0.0006136354,0.000032423974,0.00045560583,0.00004753019,0.00024123004,0.0000061239493],"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.000015588144,0.000186052,0.023550754,0.00008385793,0.000007625724,0.000008166095,0.0066070696,0.00019445947,0.5510015,0.014808451,0.0005824666,0.402954],"study_design_scores_gemma":[0.00009880928,0.00006788588,0.0043727867,0.000108324275,0.0000026354,0.00000998141,0.00010167312,0.07820231,0.90817297,0.008547868,0.00016304027,0.00015170836],"about_ca_topic_score_codex":0.00040113833,"about_ca_topic_score_gemma":0.00585428,"teacher_disagreement_score":0.41091982,"about_ca_system_score_codex":0.000027566444,"about_ca_system_score_gemma":0.00011437792,"threshold_uncertainty_score":0.32668257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06285329,0.000008847978,0.93538797,0.00009100416,0.0004978596,0.0004269047,0.0000029127898,0.00047887687,0.0002523255],"genre_scores_gemma":[0.88979685,0.0000011573405,0.10990248,0.00008064975,0.000039947972,0.00013242506,5.365636e-7,0.000021023909,0.000024957186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987581,0.00005278557,0.00026751487,0.0003112089,0.00029365037,0.00031674863],"domain_scores_gemma":[0.99884754,0.00027166295,0.00017420268,0.00042042258,0.00016473302,0.000121429766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003488603,0.00016108144,0.00016363824,0.00030258563,0.00019382862,0.00007424612,0.0004903754,0.000060140523,0.0000055112027],"category_scores_gemma":[0.000028030885,0.00015688302,0.00005115081,0.00081646757,0.000021670474,0.0010309924,0.0000073478495,0.00017951267,0.000015732086],"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.00019352799,0.0007804138,0.0029137216,0.000114236616,0.00007977823,0.0000022702447,0.02404023,0.2586313,0.15019158,0.0007869461,0.00008005089,0.56218594],"study_design_scores_gemma":[0.00038089414,0.00033062696,0.0011377892,0.000220629,0.000020990577,0.000030066962,0.0003582287,0.4056784,0.5912116,0.000033207867,0.00019624972,0.00040132905],"about_ca_topic_score_codex":0.00017085369,"about_ca_topic_score_gemma":0.0000297219,"teacher_disagreement_score":0.8269435,"about_ca_system_score_codex":0.0000827066,"about_ca_system_score_gemma":0.00002974788,"threshold_uncertainty_score":0.6397504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054763094,0.0000068370014,0.939058,0.0016390202,0.00008355344,0.00021932674,0.0000013355675,0.00034473362,0.0038841027],"genre_scores_gemma":[0.8067971,0.000003536877,0.19287844,0.00013639766,0.00000775117,0.000008681994,0.000004318073,0.0000034042164,0.00016041027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.00002687273,0.00019906861,0.00023459274,0.00014108342,0.00014192965],"domain_scores_gemma":[0.99920464,0.00014300263,0.00010268514,0.00044102457,0.000075319986,0.000033352455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001458033,0.00008186013,0.00013523517,0.00010120766,0.000041251216,0.000030445484,0.00045833897,0.000039735023,0.0000039020047],"category_scores_gemma":[0.000071359646,0.00007013276,0.000077496334,0.00019038256,0.000017789274,0.00018087652,0.000054105225,0.00004576165,6.9180896e-7],"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.000024278484,0.00016871271,0.0066562253,0.000022844351,0.000023747009,0.0000030891508,0.0007892735,0.00013627265,0.010042841,0.8244031,0.0029468345,0.1547828],"study_design_scores_gemma":[0.0003365873,0.00038010726,0.015072297,0.000021958509,0.0000111814525,0.000005468842,0.000083636674,0.6667883,0.09656109,0.22050938,0.000030548665,0.00019944843],"about_ca_topic_score_codex":0.000039218427,"about_ca_topic_score_gemma":0.0002501762,"teacher_disagreement_score":0.75203395,"about_ca_system_score_codex":0.000060507427,"about_ca_system_score_gemma":0.000017937129,"threshold_uncertainty_score":0.2859931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00743202,0.00009830475,0.96794415,0.0056487746,0.00040284815,0.0004132447,0.000014560839,0.0019847008,0.016061423],"genre_scores_gemma":[0.9378332,0.000028331042,0.06087371,0.00090830936,0.000032480824,0.00010221308,0.000032067393,0.000018431014,0.00017129348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977844,0.0009057306,0.00035537194,0.0003651421,0.00030666415,0.00028269066],"domain_scores_gemma":[0.9907601,0.0021964277,0.00021388046,0.006519859,0.00019989707,0.00010984957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268316,0.00019337996,0.00026183252,0.00017186388,0.0005353641,0.00025472444,0.0039954036,0.0001217336,0.000002810826],"category_scores_gemma":[0.00065088546,0.00020023053,0.00009683834,0.0005136268,0.00013809088,0.00022227234,0.000788983,0.0004953183,0.00015791078],"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.000051819643,0.005313624,0.039602086,0.0003797397,0.00014979033,0.000012672927,0.008381038,0.01438511,0.0035260757,0.81943315,0.07735681,0.031408075],"study_design_scores_gemma":[0.00017150868,0.00016860552,0.001974736,0.00017888252,0.000010301028,0.000005181073,0.000039554165,0.9737158,0.000901405,0.0022202434,0.02032996,0.00028383188],"about_ca_topic_score_codex":0.0005547785,"about_ca_topic_score_gemma":0.00037692956,"teacher_disagreement_score":0.9593307,"about_ca_system_score_codex":0.00009555335,"about_ca_system_score_gemma":0.000075475495,"threshold_uncertainty_score":0.81651634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057721555,0.000057602483,0.93328387,0.00077623944,0.00038277777,0.00048808154,0.0000022952581,0.0018770924,0.0054105027],"genre_scores_gemma":[0.7164366,0.000005037024,0.2798299,0.0005158256,0.00008982418,0.00010251854,0.0000016620737,0.000019138346,0.0029994918],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987166,0.000034341443,0.0001727533,0.00046302893,0.00026580374,0.00034749156],"domain_scores_gemma":[0.99883825,0.00015153535,0.00008140435,0.0006400769,0.00019566203,0.00009306095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028210742,0.00018552199,0.00021488032,0.00011355524,0.00023651405,0.000057312034,0.0008294898,0.000043898697,0.0000142793515],"category_scores_gemma":[0.00005487561,0.00014327315,0.00007375654,0.00022866066,0.00007221128,0.00040532995,0.00012255684,0.00011759504,0.000018826498],"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.0005281573,0.0013653663,0.0109006865,0.0003995467,0.00047193805,0.0008681125,0.014751561,0.0015285144,0.027187038,0.094585836,0.7642155,0.08319772],"study_design_scores_gemma":[0.0018913584,0.0021252765,0.0008471045,0.00014980357,0.000027108794,0.0018006006,0.0002722928,0.13924098,0.8255463,0.0060050483,0.020419143,0.0016749746],"about_ca_topic_score_codex":0.000068417365,"about_ca_topic_score_gemma":0.00003178849,"teacher_disagreement_score":0.7983593,"about_ca_system_score_codex":0.0000553425,"about_ca_system_score_gemma":0.00010653842,"threshold_uncertainty_score":0.5842509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002050397,0.0003754681,0.93627304,0.061209418,0.00048420028,0.00055071607,0.0000013455584,0.00056056224,0.00034020896],"genre_scores_gemma":[0.22414011,0.00003322664,0.7679623,0.0072132475,0.00010245983,0.0004671039,0.0000022050183,0.000016442455,0.00006293625],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988778,0.00031511098,0.00020025289,0.00018857975,0.0001606252,0.00025762894],"domain_scores_gemma":[0.99382234,0.0021215715,0.00011396062,0.0037454574,0.00013840653,0.00005826399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016557311,0.00011011443,0.00010349052,0.000037511825,0.00046621353,0.00015664061,0.0053696246,0.00003830505,4.477641e-7],"category_scores_gemma":[0.00018674805,0.00008927725,0.00006273786,0.00038744623,0.00013968277,0.0002341657,0.0004447201,0.0002083781,0.000024640396],"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.000011482448,0.00005331144,0.00030484042,0.0000038116004,0.00004592572,9.615459e-7,0.002163201,0.016143622,0.001517321,0.03238181,0.9317785,0.015595253],"study_design_scores_gemma":[0.00042054302,0.000109514134,0.00018361062,0.000045242694,0.000034490586,0.000028661312,0.000111326226,0.6696085,0.0021855931,0.019577453,0.30729055,0.0004045256],"about_ca_topic_score_codex":0.000052849657,"about_ca_topic_score_gemma":0.00007288641,"teacher_disagreement_score":0.65346485,"about_ca_system_score_codex":0.00010847845,"about_ca_system_score_gemma":0.000078531186,"threshold_uncertainty_score":0.99781877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12519214,0.000061948296,0.8697174,0.0042033787,0.00025670222,0.00016427442,9.712619e-7,0.00029141453,0.00011175029],"genre_scores_gemma":[0.64235735,0.000010379872,0.3569304,0.00065575284,0.000014518956,0.000013462471,0.0000015052476,0.000010748069,0.00000587908],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880654,0.00032085407,0.0003239626,0.00019564928,0.00017667643,0.00017629775],"domain_scores_gemma":[0.9960641,0.00036187132,0.00025603952,0.003165963,0.00012308804,0.000028923976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161712,0.00012070204,0.00015045042,0.00013089132,0.0003656563,0.000079546175,0.0033194995,0.00004318702,0.0000011729269],"category_scores_gemma":[0.00015757377,0.000104778796,0.00007023216,0.0004831195,0.00021001702,0.00030112203,0.00049214065,0.00021809869,0.000009010702],"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.0000058279365,0.0002651246,0.0050555156,0.000058610272,0.00006469765,8.406171e-7,0.0057938835,0.0099932,0.9293122,0.012411853,0.0012239957,0.035814214],"study_design_scores_gemma":[0.00013466763,0.00001800945,0.0015022092,0.00009119906,0.000014816838,0.000009030801,0.00005732844,0.9651894,0.031865187,0.00009556142,0.0008582036,0.0001643651],"about_ca_topic_score_codex":0.0004079912,"about_ca_topic_score_gemma":0.00019159382,"teacher_disagreement_score":0.9551962,"about_ca_system_score_codex":0.000053523487,"about_ca_system_score_gemma":0.000025557913,"threshold_uncertainty_score":0.6168511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10311895,0.00014624301,0.8801417,0.015047425,0.00033946385,0.0004927115,0.000007857378,0.0005144828,0.0001912085],"genre_scores_gemma":[0.6510106,0.000024417923,0.34752098,0.0011922247,0.0000381231,0.00018146448,0.000014875369,0.000011743897,0.000005595553],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894845,0.00012026643,0.00023920221,0.0002182417,0.0001261177,0.0003477146],"domain_scores_gemma":[0.9972265,0.00045012363,0.0001437678,0.0020008725,0.000080035265,0.000098724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006434673,0.00015320396,0.0001599627,0.00014826481,0.0004732865,0.00010420019,0.0016439435,0.000058108966,7.899042e-7],"category_scores_gemma":[0.00007418802,0.00016670563,0.0000564165,0.00024933292,0.00019062764,0.0008164691,0.00045994713,0.00019254329,0.00001334702],"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.000073420866,0.0031365757,0.009177773,0.00082022836,0.0002602291,0.0000039558804,0.045301788,0.001008915,0.46421614,0.08639958,0.13880475,0.25079665],"study_design_scores_gemma":[0.0007051141,0.0001651889,0.015442873,0.0002443153,0.000052899675,0.00005590865,0.00014480292,0.931176,0.038050603,0.010358836,0.0026783072,0.00092513394],"about_ca_topic_score_codex":0.00006246442,"about_ca_topic_score_gemma":0.000028219247,"teacher_disagreement_score":0.9301671,"about_ca_system_score_codex":0.00007718087,"about_ca_system_score_gemma":0.00002235881,"threshold_uncertainty_score":0.6798058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006686278,0.000042674128,0.9942344,0.0017725681,0.00056578097,0.0006471445,0.000011599573,0.0008693231,0.001187905],"genre_scores_gemma":[0.6363006,0.000041569718,0.36276838,0.00023746582,0.000017234366,0.00048479257,0.0000021559827,0.000017447954,0.00013034567],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998813,0.0002334905,0.00025756093,0.00022384759,0.00017027353,0.00030187768],"domain_scores_gemma":[0.9951391,0.0023276755,0.00012146481,0.0021822234,0.00013163223,0.000097898825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065265346,0.00015981772,0.00013748086,0.0002862434,0.0008248358,0.00007899318,0.001502405,0.00009367805,0.000009119504],"category_scores_gemma":[0.000062803694,0.00017128549,0.00010835648,0.00046321962,0.000053197444,0.0007095237,0.000009578961,0.00033475473,0.000051276085],"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.00024065831,0.0058946307,0.0000619098,0.000060049726,0.00026678533,4.9406714e-7,0.010366453,0.020663148,0.05392053,0.39530984,0.01585713,0.49735838],"study_design_scores_gemma":[0.0008943665,0.0007435002,0.00015300594,0.00019107634,0.00007051233,0.000020569732,0.00017654277,0.40844053,0.5601101,0.01593743,0.012421851,0.00084051135],"about_ca_topic_score_codex":0.000016979617,"about_ca_topic_score_gemma":0.000024752042,"teacher_disagreement_score":0.635632,"about_ca_system_score_codex":0.00023154182,"about_ca_system_score_gemma":0.00005807942,"threshold_uncertainty_score":0.698482},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058310083,0.000016068885,0.9917361,0.00003573298,0.0010201588,0.00041820251,0.000029026265,0.00026948654,0.0006442311],"genre_scores_gemma":[0.85717815,0.0000036805866,0.14256607,0.000093014125,0.000014607575,0.000106557534,0.000001933239,0.000006882285,0.000029093871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891406,0.000072000825,0.00041759593,0.000098544486,0.00022095485,0.00027683424],"domain_scores_gemma":[0.9988031,0.0004658248,0.00022371237,0.0003153601,0.0001257467,0.000066264336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013567992,0.0001331474,0.0001592313,0.00038893466,0.00022947523,0.000043252607,0.00033309244,0.00007841006,0.000011310161],"category_scores_gemma":[0.000020657213,0.00012570573,0.0001286447,0.000313176,0.000044147124,0.0009297507,0.00000307585,0.00013874071,0.000021994223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003204385,0.00015098393,0.000002573501,0.00007346152,0.000033729375,9.2441304e-8,0.012390353,0.012414215,0.0010744972,0.016392892,0.00009670442,0.95733845],"study_design_scores_gemma":[0.00045455917,0.00014569463,0.00004350014,0.00011651623,0.000023422359,0.00002038434,0.0007151364,0.56457376,0.43161958,0.0015550056,0.00048671366,0.00024573394],"about_ca_topic_score_codex":0.0000046190808,"about_ca_topic_score_gemma":5.0019156e-7,"teacher_disagreement_score":0.9570927,"about_ca_system_score_codex":0.000082150036,"about_ca_system_score_gemma":0.000039311097,"threshold_uncertainty_score":0.51261306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28820735,0.0000012369175,0.70909244,0.000092906004,0.00009183888,0.00009172813,0.0000015863968,0.00017023996,0.0022506614],"genre_scores_gemma":[0.88570255,0.0000018516477,0.1139876,0.00022618524,0.000010727554,0.000004999733,0.000007489938,0.0000060368343,0.000052553438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991231,0.00008053517,0.00027119915,0.00019907946,0.00020561791,0.0001204564],"domain_scores_gemma":[0.9991719,0.000107014144,0.00018355229,0.00042865938,0.00008400037,0.000024840667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966188,0.00008627464,0.00016522469,0.00012418623,0.000028551523,0.000013040254,0.00044046133,0.000039461967,0.000026380229],"category_scores_gemma":[0.000045900404,0.00008041357,0.000033257147,0.00026097175,0.000022601153,0.00020333346,0.0000912445,0.000054478063,0.0000018350395],"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.0000063109733,0.00008373915,0.0008773423,0.000051286235,0.000014283526,2.449548e-7,0.00031567656,0.00003916736,0.81776273,0.15719883,0.00015910596,0.02349128],"study_design_scores_gemma":[0.00015807114,0.00029256791,0.003930226,0.00013405485,0.0000062410204,0.0000021783203,0.000010201288,0.083353974,0.90275043,0.008991014,0.00023971732,0.00013129573],"about_ca_topic_score_codex":0.000055621826,"about_ca_topic_score_gemma":0.0000032161427,"teacher_disagreement_score":0.5974952,"about_ca_system_score_codex":0.000015813466,"about_ca_system_score_gemma":0.000019897794,"threshold_uncertainty_score":0.32791704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0933339,0.027487183,0.8233275,0.009664377,0.00025508917,0.0047479277,0.000008622563,0.02616835,0.01500707],"genre_scores_gemma":[0.7492809,0.005375127,0.24428618,0.000023309092,0.000011271304,0.0008381343,0.000014282262,0.000014461247,0.00015632999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987248,0.00017706388,0.00036830726,0.00029629684,0.000117729534,0.00031578395],"domain_scores_gemma":[0.99629015,0.0007418147,0.00030066844,0.002391075,0.00024476225,0.000031524123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065335905,0.0001842649,0.000263222,0.00012622394,0.0006246425,0.0004993133,0.0025151588,0.00022154648,0.0000024720332],"category_scores_gemma":[0.0001120051,0.00017526823,0.0000396351,0.00041531335,0.00020562025,0.0006230488,0.0010903069,0.0002617823,0.00001516883],"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.000008617291,0.00006623737,0.0010181486,0.000050715957,0.000050580416,2.1123721e-7,0.0005719086,0.00091986253,0.0024094272,0.43991816,0.028016992,0.52696913],"study_design_scores_gemma":[0.00047093976,0.00038023357,0.001061878,0.0005411564,0.000026257538,0.000028564487,0.003167355,0.7756158,0.0027839676,0.20950812,0.0056516286,0.0007641046],"about_ca_topic_score_codex":0.0002857998,"about_ca_topic_score_gemma":0.000032929085,"teacher_disagreement_score":0.77469593,"about_ca_system_score_codex":0.000056734294,"about_ca_system_score_gemma":0.000027128199,"threshold_uncertainty_score":0.71472305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08055173,0.000053510317,0.89948916,0.0005422652,0.0007660363,0.00014312645,3.7799583e-7,0.002450332,0.016003462],"genre_scores_gemma":[0.7914693,0.0000026484724,0.20749974,0.00047123965,0.00013539307,0.000009578832,6.6907256e-7,0.000013176557,0.000398266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987798,0.000054835025,0.00020806033,0.0002572646,0.00023020702,0.0004698648],"domain_scores_gemma":[0.99888396,0.00021251947,0.00009967791,0.00058340555,0.0000827903,0.00013763936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075813144,0.00013910764,0.00014996833,0.000091626775,0.0001525166,0.00009718863,0.0007636968,0.00006688384,0.00006675087],"category_scores_gemma":[0.00024223965,0.00012780611,0.000054852735,0.00027785677,0.000014403546,0.00060601457,0.00035446323,0.0001629171,0.00012491398],"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.000012955321,0.0004677999,0.037702452,0.000048320657,0.000065460285,0.000023667808,0.014158097,0.00016265067,0.050875075,0.7644631,0.0051507405,0.12686963],"study_design_scores_gemma":[0.0004929111,0.00021315922,0.004734371,0.00006313966,0.000014115986,0.00017193552,0.00023514027,0.86316913,0.1143674,0.0022579003,0.013299084,0.000981685],"about_ca_topic_score_codex":0.00022021393,"about_ca_topic_score_gemma":0.00024637097,"teacher_disagreement_score":0.86300653,"about_ca_system_score_codex":0.000058814006,"about_ca_system_score_gemma":0.000034922767,"threshold_uncertainty_score":0.5211782},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038309167,0.00018112043,0.9907062,0.0041124816,0.000013349313,0.00032730444,5.922808e-7,0.00021468772,0.0006133676],"genre_scores_gemma":[0.58898634,0.00006288417,0.41070306,0.00008979767,0.0000027439899,0.000043105298,0.000002920759,0.0000036056429,0.0001055335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991945,0.00019519804,0.00022408688,0.00015834133,0.00012477332,0.00010312012],"domain_scores_gemma":[0.9972832,0.00034695768,0.0001484219,0.0019874019,0.00018050402,0.00005347155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032363227,0.00007581389,0.0001375064,0.0002176692,0.00013321158,0.00008766805,0.0013290683,0.000043145596,0.000010155383],"category_scores_gemma":[0.00007883623,0.00007459145,0.000041588424,0.0010234715,0.00008224205,0.00037686838,0.0005156074,0.00011043358,0.000011673821],"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.0000120196455,0.0010044201,0.05236587,0.00005819894,0.0012895016,8.36667e-7,0.02318588,0.005393626,0.045963798,0.43769926,0.014913177,0.4181134],"study_design_scores_gemma":[0.00020651445,0.00013425162,0.055818144,0.000039430877,0.00016276153,0.000006571369,0.0002065621,0.85958284,0.0048410115,0.0782978,0.00042868772,0.0002754181],"about_ca_topic_score_codex":0.001773997,"about_ca_topic_score_gemma":0.00032746038,"teacher_disagreement_score":0.8541892,"about_ca_system_score_codex":0.0000331437,"about_ca_system_score_gemma":0.000080602724,"threshold_uncertainty_score":0.3041751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042628944,0.00011221635,0.89399195,0.00025043773,0.0016429576,0.00032635292,0.000002777299,0.0060735713,0.093336836],"genre_scores_gemma":[0.40972233,0.000039170016,0.58715695,0.00037427447,0.000075768985,0.00007501552,0.000007472298,0.000027855322,0.0025211768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982602,0.00009555641,0.000300836,0.0008010664,0.0002385831,0.00030375383],"domain_scores_gemma":[0.9976302,0.00006740427,0.00019782543,0.0018130048,0.00019884671,0.000092737755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039885798,0.0002932935,0.000318796,0.00021163614,0.000059091813,0.00019681458,0.0028579165,0.00029875065,0.00008944883],"category_scores_gemma":[0.00007245278,0.00026738073,0.00013735726,0.00020205558,0.00004425474,0.00016982044,0.0036182462,0.00064946176,0.00015520855],"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.000037600366,0.0007278845,0.0040424215,0.0005207577,0.00041431258,0.0002700965,0.0123645505,0.00012112884,0.0061582467,0.4941543,0.2854928,0.19569588],"study_design_scores_gemma":[0.000430514,0.00038862915,0.0034006771,0.0007678126,0.00006170861,0.00010197449,0.00006173698,0.10293501,0.28993633,0.58080006,0.017406605,0.003708942],"about_ca_topic_score_codex":0.00058697,"about_ca_topic_score_gemma":0.000047854264,"teacher_disagreement_score":0.40545943,"about_ca_system_score_codex":0.000060827733,"about_ca_system_score_gemma":0.0001612579,"threshold_uncertainty_score":0.9999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06692533,0.000003874558,0.92957413,0.00009859677,0.00037099805,0.00023345277,0.0000053371205,0.0005446426,0.002243656],"genre_scores_gemma":[0.9751244,0.000003681928,0.0242828,0.000486968,0.00000998009,0.000058484824,0.0000028812942,0.000009615189,0.000021189579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.00013087784,0.00024509552,0.00013736454,0.00024334269,0.00022354636],"domain_scores_gemma":[0.9987201,0.00064197346,0.00016382616,0.00030946036,0.000078483645,0.00008613495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067368406,0.00016889522,0.00012812021,0.0005480564,0.00031044526,0.00014626775,0.00020759481,0.00007169754,0.000023227689],"category_scores_gemma":[0.00002180004,0.00014814171,0.00004112129,0.00033839987,0.000043369233,0.0048662373,0.0000035813005,0.000271915,0.000047102953],"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.0016918964,0.00092227897,0.0011522071,0.00030949194,0.00021379444,0.000014566442,0.040560417,0.2460835,0.0023949451,0.07263098,0.00030904938,0.6337169],"study_design_scores_gemma":[0.0012889383,0.0017817151,0.00309881,0.00065815606,0.000060370436,0.00029072378,0.0013582308,0.89567983,0.09241299,0.0019819862,0.0004647588,0.00092348014],"about_ca_topic_score_codex":0.000007726798,"about_ca_topic_score_gemma":0.0000020431212,"teacher_disagreement_score":0.9081991,"about_ca_system_score_codex":0.00014207694,"about_ca_system_score_gemma":0.00003267742,"threshold_uncertainty_score":0.60410434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007410736,0.00015429349,0.9886294,0.0005381978,0.0011411288,0.0009438246,0.000053845557,0.00081358704,0.0003149981],"genre_scores_gemma":[0.97768945,0.00002345788,0.021340227,0.00007467417,0.00010209481,0.00047809505,0.000015467895,0.000032960823,0.00024358994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973569,0.00033091014,0.0005450537,0.00071649265,0.00039045236,0.0006601913],"domain_scores_gemma":[0.99728143,0.0014211003,0.00018102437,0.000759211,0.00017335564,0.00018387758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001386842,0.00035882773,0.00044086872,0.0001814119,0.0012662931,0.0005426016,0.0008515411,0.00018144159,0.0000024177873],"category_scores_gemma":[0.00004636856,0.0002809617,0.00019596792,0.0004898427,0.00010367179,0.00036256955,0.000013649528,0.00048360886,0.00000994701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088839726,0.00016088877,0.00034205476,0.00009767343,0.00010813731,0.0000048939487,0.0019471127,0.9631449,0.00070295937,0.002908443,0.0008204392,0.029673664],"study_design_scores_gemma":[0.00060415344,0.0003143455,0.0001405957,0.00017748502,0.00004321924,0.0001119239,0.00094773516,0.99494594,0.0012081243,0.00019118706,0.00089681894,0.0004184646],"about_ca_topic_score_codex":0.00035031783,"about_ca_topic_score_gemma":0.0001840892,"teacher_disagreement_score":0.9702787,"about_ca_system_score_codex":0.0001143848,"about_ca_system_score_gemma":0.00006095083,"threshold_uncertainty_score":0.99996424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05010053,0.00018178555,0.9478927,0.000079285775,0.0003079539,0.00028972956,0.000005155953,0.000976184,0.00016664948],"genre_scores_gemma":[0.7043415,0.0000045812426,0.29544133,0.00006349751,0.000047888232,0.000009331624,0.0000031586737,0.000019517336,0.00006924543],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789137,0.00023908055,0.0004755413,0.0003671646,0.00040766262,0.00061918027],"domain_scores_gemma":[0.9982677,0.00023449401,0.00026954606,0.0008329189,0.00021921145,0.00017610518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012881544,0.0002628881,0.00039113767,0.00018537168,0.00015200092,0.00008098381,0.00082758017,0.00013626367,0.00002126339],"category_scores_gemma":[0.00016950563,0.00023508721,0.000115331735,0.00053296186,0.000113895054,0.0006706593,0.0004909269,0.00018054625,0.000016015249],"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.00010590549,0.0020901577,0.008062802,0.0004827091,0.00039023138,0.00004647199,0.016087735,0.0762437,0.83200336,0.03686154,0.011814258,0.015811156],"study_design_scores_gemma":[0.00016012591,0.00009127185,0.00033703388,0.00012402181,0.000019506393,0.00007774844,0.00013722849,0.57592493,0.42094216,0.0017276219,0.00009049483,0.00036786296],"about_ca_topic_score_codex":0.00017548446,"about_ca_topic_score_gemma":0.000004455627,"teacher_disagreement_score":0.6542409,"about_ca_system_score_codex":0.00011635018,"about_ca_system_score_gemma":0.00007310781,"threshold_uncertainty_score":0.95865786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43547717,0.000007720908,0.56308824,0.000090194764,0.00028802952,0.00016308136,9.0066806e-7,0.000370114,0.0005145742],"genre_scores_gemma":[0.85214484,0.000003947646,0.14753711,0.00019561447,0.00003782621,0.000003128877,0.0000055203627,0.000012476049,0.000059554375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983493,0.00015144057,0.00043454117,0.00041267142,0.00034704182,0.000304972],"domain_scores_gemma":[0.9982152,0.0006938301,0.00027873876,0.0005371304,0.0001985115,0.00007657086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019089871,0.00018794378,0.00024274836,0.00061704434,0.00018087491,0.00008567863,0.00041513704,0.00013864992,0.000006737845],"category_scores_gemma":[0.0006268954,0.00016784428,0.0000655373,0.0012704333,0.000041658986,0.0006112003,0.00017113786,0.00022693418,0.000020822692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003426976,0.0024752647,0.005912296,0.00050570216,0.0001361793,0.000167066,0.00640527,0.47434115,0.14241597,0.1094206,0.0012746031,0.25660318],"study_design_scores_gemma":[0.00011858272,0.00017502622,0.0022762702,0.000055335073,0.000006882084,0.000005795449,0.000022412078,0.75034475,0.24480504,0.002016888,0.000008867346,0.00016414071],"about_ca_topic_score_codex":0.00034933514,"about_ca_topic_score_gemma":0.000036268626,"teacher_disagreement_score":0.41666767,"about_ca_system_score_codex":0.00012718489,"about_ca_system_score_gemma":0.000055333418,"threshold_uncertainty_score":0.68444914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009828593,0.000016283388,0.9086142,0.0023818102,0.00022536739,0.00056461885,9.501035e-7,0.0014535096,0.076914676],"genre_scores_gemma":[0.6463423,9.48843e-7,0.3497912,0.0024296078,0.000012334774,0.000024740115,0.000001354373,0.000011113333,0.0013864143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983292,0.000040931973,0.00022049862,0.0005516986,0.00034912289,0.00050851505],"domain_scores_gemma":[0.9986803,0.00011880221,0.000047153153,0.00091342855,0.00013539898,0.00010493538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635719,0.00017961448,0.00016041979,0.00025170407,0.00014348752,0.00019568269,0.0013201179,0.00007259243,0.000073635376],"category_scores_gemma":[0.000026887064,0.00016357802,0.0001170996,0.0004750227,0.000023899192,0.00032488036,0.00016057544,0.00013335806,0.000071941075],"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.00012580835,0.0013738746,0.0019795161,0.00010711155,0.00009160406,0.00009967207,0.0018625527,0.00070422154,0.0057988246,0.6107039,0.11387726,0.26327565],"study_design_scores_gemma":[0.0045654215,0.0049879868,0.024174063,0.0003471472,0.000037009035,0.000044593016,0.0003229286,0.4490525,0.42200926,0.04110195,0.05015515,0.003201954],"about_ca_topic_score_codex":0.000010094993,"about_ca_topic_score_gemma":0.000005928317,"teacher_disagreement_score":0.6365137,"about_ca_system_score_codex":0.0000667796,"about_ca_system_score_gemma":0.00004937686,"threshold_uncertainty_score":0.66705185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01285585,0.0002186381,0.97325194,0.0111934915,0.0005572033,0.00059847266,0.00000845723,0.0010217312,0.0002942019],"genre_scores_gemma":[0.34369427,0.000036243648,0.65425354,0.0015832812,0.000064497755,0.00029648733,0.000016207083,0.000025089645,0.000030375895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828166,0.00019527251,0.00041949245,0.0004255443,0.0002442943,0.0004337381],"domain_scores_gemma":[0.99477696,0.0014018215,0.00022595943,0.0031827164,0.00025966874,0.0001528799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092651224,0.00024085007,0.00027425858,0.0002576358,0.00053460454,0.00023273389,0.0043682316,0.00009289505,5.6848205e-7],"category_scores_gemma":[0.00030411975,0.00026622516,0.00013572554,0.00044489728,0.00016951167,0.0007068002,0.0008135239,0.00034895455,0.000026755595],"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.0000436156,0.0010285067,0.01035439,0.00013423518,0.0003835162,0.00003477201,0.025030142,0.0058502387,0.16983622,0.005947761,0.19502571,0.5863309],"study_design_scores_gemma":[0.00055911334,0.00007337373,0.0002463941,0.00012175628,0.000017511842,0.000024530687,0.00023213592,0.9878349,0.0046808207,0.0007348615,0.0050451932,0.00042943627],"about_ca_topic_score_codex":0.0001552169,"about_ca_topic_score_gemma":0.00006827076,"teacher_disagreement_score":0.9819846,"about_ca_system_score_codex":0.00020596346,"about_ca_system_score_gemma":0.00009686705,"threshold_uncertainty_score":0.999979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043131746,0.00014208528,0.9908561,0.001031035,0.000644198,0.0017034755,0.000031406285,0.0010891777,0.00018936221],"genre_scores_gemma":[0.5606783,0.00026691984,0.43647626,0.00027065555,0.000030172689,0.0020232452,0.000011237836,0.000044980403,0.00019823873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974338,0.0003383237,0.00064037804,0.0007118777,0.00027220263,0.00060341234],"domain_scores_gemma":[0.9944812,0.0014408495,0.00030520983,0.0028463216,0.0007241056,0.00020228444],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000388581,0.00041221298,0.00042917966,0.00042393513,0.0013376565,0.00081425434,0.004276788,0.00022627399,0.000016615075],"category_scores_gemma":[0.000016602671,0.00043711637,0.0002638007,0.0010350322,0.00020692288,0.0021237058,0.00007766806,0.0008466078,0.000026563275],"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.000013607271,0.0007550936,0.00006542419,0.000021615424,0.00018133355,0.000001927035,0.0031191793,0.0072704656,0.0030112967,0.0015164837,0.0008349925,0.9832086],"study_design_scores_gemma":[0.00051046687,0.00011847016,0.00010296578,0.00022751957,0.00004254479,0.00001908175,0.0002121643,0.9856708,0.011884595,0.000518378,0.00019022952,0.0005027549],"about_ca_topic_score_codex":0.00037054013,"about_ca_topic_score_gemma":0.0004360486,"teacher_disagreement_score":0.98270583,"about_ca_system_score_codex":0.00024765922,"about_ca_system_score_gemma":0.000111683235,"threshold_uncertainty_score":0.99996245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14590104,0.00012341395,0.85265857,0.00040454933,0.00023080876,0.00012519943,1.3089732e-7,0.000360238,0.00019601727],"genre_scores_gemma":[0.7877596,0.0000011992312,0.21115053,0.0010410371,0.000020847829,0.0000060797493,7.690546e-7,0.000013243837,0.0000067054348],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987336,0.00013597836,0.00017591717,0.00033679613,0.00019533632,0.00042237318],"domain_scores_gemma":[0.9994257,0.00013021825,0.00010601372,0.00024084443,0.000051349936,0.000045880155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032905868,0.00014540492,0.00012513182,0.00015115784,0.00018169587,0.00015358595,0.00032493332,0.00003774406,0.0000025367049],"category_scores_gemma":[0.00008676691,0.00016106035,0.000049527665,0.00041366008,0.000021629423,0.0003893558,0.000047578855,0.000251178,0.000009407634],"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.000011991104,0.00012213977,0.0005198676,0.000027457856,0.00010717599,0.00005539807,0.005582365,0.15393189,0.5482169,0.26500592,0.0026236398,0.023795292],"study_design_scores_gemma":[0.00027934904,0.00011620353,0.000034610777,0.00004640519,0.000012845619,0.00015056822,0.000020019865,0.93949,0.048638556,0.010365773,0.00037207676,0.00047355753],"about_ca_topic_score_codex":0.000006148462,"about_ca_topic_score_gemma":0.0000062296917,"teacher_disagreement_score":0.78555816,"about_ca_system_score_codex":0.00034854191,"about_ca_system_score_gemma":0.000097141114,"threshold_uncertainty_score":0.656785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55576575,0.000028616849,0.44198427,0.0017800357,0.00006091193,0.00019360876,0.000009003565,0.000075427706,0.000102414226],"genre_scores_gemma":[0.90529084,0.000017887392,0.09422039,0.0004093882,0.000005574939,0.000021130581,0.00002209389,0.00000812095,0.000004547868],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889386,0.00022300241,0.00029617985,0.00019084677,0.00025787836,0.00013825404],"domain_scores_gemma":[0.997922,0.00024126246,0.00018422361,0.001413084,0.00018690928,0.00005249637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074621045,0.000100772,0.00016692554,0.00022527765,0.00009202236,0.00002472513,0.001160008,0.000035827634,0.000001057699],"category_scores_gemma":[0.000043603828,0.000107101696,0.000026361238,0.0004433428,0.00018574821,0.00015206444,0.00033096163,0.00015869961,0.0000011708403],"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.000025474643,0.00033551527,0.0019962755,0.00006254544,0.00006300089,0.000001162448,0.008443725,0.0037371481,0.95907307,0.015696201,0.00066301547,0.009902857],"study_design_scores_gemma":[0.0011893692,0.00053763407,0.012533258,0.00080670376,0.000058696638,0.000022867762,0.0007242689,0.48020688,0.5017475,0.0010259923,0.0005551501,0.00059167296],"about_ca_topic_score_codex":0.0001102633,"about_ca_topic_score_gemma":0.0000036473323,"teacher_disagreement_score":0.47646973,"about_ca_system_score_codex":0.000068521644,"about_ca_system_score_gemma":0.000054369757,"threshold_uncertainty_score":0.43674803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00948582,0.0014919362,0.88729095,0.020725353,0.00037752462,0.0007947973,0.000017195229,0.002957524,0.07685886],"genre_scores_gemma":[0.55891025,0.00008316569,0.43946335,0.00044263853,0.000025667083,0.00038272576,0.000010313503,0.000011990198,0.0006699128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998576,0.00027414545,0.00030336282,0.00030054114,0.00026942973,0.00027651645],"domain_scores_gemma":[0.9916112,0.00077392877,0.00014520469,0.006975946,0.00039405416,0.00009970374],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00033461786,0.00015354845,0.00015565351,0.0001339781,0.0004344318,0.0002588685,0.009300305,0.000085338004,0.00012445664],"category_scores_gemma":[0.00033531178,0.00016102761,0.00006965889,0.00038611368,0.00022546934,0.0007731713,0.003509402,0.00032740738,0.00035660452],"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.0000034189961,0.00056063535,0.002588021,0.000027575334,0.000061865314,0.0000019818863,0.002941867,0.000049097423,0.048438564,0.6121488,0.29738188,0.035796307],"study_design_scores_gemma":[0.001358876,0.00020514843,0.026172481,0.00037422383,0.000043657597,0.0001533793,0.00083751336,0.24454091,0.038620815,0.25576228,0.42987695,0.0020537558],"about_ca_topic_score_codex":0.0008392276,"about_ca_topic_score_gemma":0.000110732224,"teacher_disagreement_score":0.5494244,"about_ca_system_score_codex":0.000060521437,"about_ca_system_score_gemma":0.00007843182,"threshold_uncertainty_score":0.99605983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026127286,0.000068281406,0.9637609,0.0007400662,0.00028540866,0.0012778973,1.4178853e-7,0.0014284783,0.006311524],"genre_scores_gemma":[0.94048446,0.0000019913753,0.057994623,0.00035165963,0.000014848472,0.00032816705,2.283162e-7,0.000009373045,0.00081466057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988379,0.00010643061,0.00031716796,0.0002977403,0.00015141955,0.00028936705],"domain_scores_gemma":[0.9989613,0.00018341819,0.00008870188,0.000629837,0.00008160809,0.000055121476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560137,0.00013011048,0.0002455799,0.0001772393,0.000038881568,0.00018306982,0.0009002006,0.000060648363,0.000017249364],"category_scores_gemma":[0.00016088062,0.00010351614,0.000041162715,0.00037398556,0.00001627894,0.0005621887,0.00024783285,0.00012021519,0.00015949803],"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.000024477862,0.0020431343,0.015670251,0.047540564,0.0002637006,0.00020423078,0.0419445,0.00032322668,0.1667863,0.65068084,0.03864912,0.035869658],"study_design_scores_gemma":[0.000186436,0.00010986329,0.0008642298,0.0010663482,0.0000031809132,0.000028843817,0.00033769239,0.9667765,0.01171523,0.018570282,0.000006660347,0.00033475217],"about_ca_topic_score_codex":0.00166672,"about_ca_topic_score_gemma":0.00033886457,"teacher_disagreement_score":0.96645325,"about_ca_system_score_codex":0.00008188578,"about_ca_system_score_gemma":0.000027564553,"threshold_uncertainty_score":0.42212656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1098892,0.000022299197,0.8621841,0.00030745694,0.00053583685,0.000085455766,1.0328602e-7,0.0017059884,0.025269547],"genre_scores_gemma":[0.7718188,0.0000015861859,0.22680183,0.000270895,0.000063008796,0.0000034205018,4.308381e-7,0.000011054823,0.0010289623],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986879,0.000036729944,0.00023132002,0.00037389842,0.00027319483,0.00039694118],"domain_scores_gemma":[0.9990485,0.0001447236,0.000067784604,0.0005796607,0.00005899003,0.00010034957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894475,0.00014480499,0.00013422439,0.00018675406,0.00014611101,0.00015622823,0.00081148697,0.00008108358,0.000104864106],"category_scores_gemma":[0.000042687476,0.00012641991,0.00007306621,0.00036253317,0.000033626988,0.00040141144,0.00043017833,0.00018124942,0.000051632196],"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.000038667236,0.00052132236,0.01223442,0.000042568383,0.000060777253,0.00043247192,0.0027209371,0.00001686435,0.1921123,0.12654203,0.023153719,0.64212394],"study_design_scores_gemma":[0.00096499006,0.00047178016,0.053803794,0.00017037352,0.000030033483,0.0002947115,0.0002065202,0.16513033,0.7440559,0.023144694,0.009985727,0.0017410913],"about_ca_topic_score_codex":0.000056951707,"about_ca_topic_score_gemma":0.00006666915,"teacher_disagreement_score":0.6619296,"about_ca_system_score_codex":0.000061667,"about_ca_system_score_gemma":0.00003511,"threshold_uncertainty_score":0.51552546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04386199,0.0000059661315,0.94549775,0.00022320144,0.00011065707,0.00008043346,1.5256558e-7,0.0014731714,0.0087467],"genre_scores_gemma":[0.6684569,8.792969e-7,0.33110252,0.00020228811,0.00001935489,0.000005389234,4.4891067e-7,0.0000055409696,0.00020668685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992659,0.000054491557,0.00009712792,0.00024393699,0.00016009275,0.00017846754],"domain_scores_gemma":[0.99932706,0.0001112954,0.00004678056,0.0003995889,0.000066983375,0.000048299084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033764378,0.00008918589,0.00009156077,0.00007445896,0.0001043698,0.00013720308,0.00043751637,0.000033275017,0.0000050773674],"category_scores_gemma":[0.0000965886,0.000068740825,0.000020501295,0.00019333402,0.000022666545,0.00046294587,0.00010316302,0.000089542256,0.000028630398],"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.00003153086,0.00017152411,0.27493545,0.000051717514,0.000032621516,0.000013185753,0.002509493,0.00016733647,0.118919745,0.47835547,0.0071557066,0.11765623],"study_design_scores_gemma":[0.00051995186,0.0005236312,0.017648952,0.00010939457,0.000008365941,0.000082775914,0.000084262094,0.80440986,0.16191792,0.0062677874,0.007851114,0.0005759501],"about_ca_topic_score_codex":0.00024897742,"about_ca_topic_score_gemma":0.000294019,"teacher_disagreement_score":0.80424255,"about_ca_system_score_codex":0.00003137591,"about_ca_system_score_gemma":0.000013851099,"threshold_uncertainty_score":0.28031695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008808929,0.0005337447,0.9735645,0.010063724,0.0005260541,0.00085540063,0.000028984648,0.00067160605,0.012875068],"genre_scores_gemma":[0.7888284,0.00054283935,0.2091454,0.000503079,0.00024268383,0.00024420785,0.00023215325,0.000019258528,0.00024201015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982219,0.00014937558,0.00042373073,0.0006289973,0.0002661745,0.00030984063],"domain_scores_gemma":[0.99490327,0.0006995025,0.0003400998,0.003393947,0.0005539957,0.0001091762],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00065116805,0.00022672431,0.00021486114,0.00018674173,0.00067351916,0.00075983856,0.0068969755,0.00009519014,0.000022470565],"category_scores_gemma":[0.00006339769,0.00023518204,0.000052801184,0.00024939008,0.00015983198,0.00043436195,0.0028348493,0.000376081,0.000060378345],"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.000004661861,0.0001630108,0.0010073141,0.000013097462,0.00007647589,3.0706894e-7,0.00042315185,0.00012489405,0.00017501334,0.6844324,0.021989664,0.29159003],"study_design_scores_gemma":[0.00016090207,0.000052136398,0.0005316969,0.00011137084,0.0000087192875,0.00001111393,0.000063005245,0.880814,0.000015575932,0.02502989,0.09295496,0.00024661425],"about_ca_topic_score_codex":0.00049387146,"about_ca_topic_score_gemma":0.000116218136,"teacher_disagreement_score":0.88068914,"about_ca_system_score_codex":0.000065909124,"about_ca_system_score_gemma":0.00008484831,"threshold_uncertainty_score":0.9984762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13822742,0.000005392052,0.85963464,0.0005085115,0.00042383245,0.0006062416,0.0000013308761,0.0004587494,0.0001338762],"genre_scores_gemma":[0.65686184,0.0000018937407,0.3428035,0.00012876985,0.000035628014,0.00009069236,0.0000048148036,0.000009601003,0.0000632319],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998918,0.000028020891,0.00018612787,0.0004688877,0.00010984354,0.00028909676],"domain_scores_gemma":[0.99920756,0.00017892454,0.000085528394,0.0002522348,0.0001886022,0.00008716424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002829373,0.00016964032,0.0001630963,0.00009324797,0.00020928055,0.0004131738,0.00048911176,0.000067739085,0.000007348009],"category_scores_gemma":[0.00003871346,0.000112067566,0.00002783698,0.00012358962,0.000057941746,0.0010113312,0.00020063212,0.00015971238,0.0000016702014],"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.00048375738,0.0004340334,0.016769899,0.00040707673,0.00019178046,0.000027499575,0.03621451,0.0028357306,0.73026574,0.02723861,0.0011227897,0.18400855],"study_design_scores_gemma":[0.00043073765,0.0002276553,0.00028841483,0.000016223275,0.0000034863212,0.000014701884,0.000036302128,0.77847207,0.21867463,0.0015097442,0.000119056924,0.00020698046],"about_ca_topic_score_codex":0.000102693535,"about_ca_topic_score_gemma":0.00018813742,"teacher_disagreement_score":0.7756363,"about_ca_system_score_codex":0.000010895965,"about_ca_system_score_gemma":0.000024705801,"threshold_uncertainty_score":0.45699826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10542175,0.00009378416,0.88578886,0.002416607,0.001408175,0.00034309897,0.0000039097686,0.0042781467,0.00024568173],"genre_scores_gemma":[0.94148225,0.000009750787,0.057624105,0.00048363986,0.000035608682,0.0001898727,0.0000012643605,0.000043829106,0.00012966088],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977683,0.00010073826,0.00035621654,0.000783236,0.00041619,0.0005753386],"domain_scores_gemma":[0.9979272,0.00010027465,0.00013656505,0.0014346227,0.00022261048,0.00017872617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043860127,0.0003441655,0.00034375594,0.001242656,0.00025888672,0.00009309218,0.0014146117,0.0005180811,0.000014051271],"category_scores_gemma":[0.000039569597,0.00036118878,0.00017582494,0.0016771534,0.00017827026,0.00037806306,0.000017098293,0.00082269334,0.00014712082],"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.00046064804,0.0059364825,0.0017311944,0.0002531563,0.00064296974,0.002944707,0.0029626214,0.28351256,0.1709628,0.033397336,0.009015786,0.48817974],"study_design_scores_gemma":[0.0011843285,0.0010627385,0.000027965662,0.00016123062,0.00004578012,0.00023894214,0.00009615028,0.37843725,0.60910463,0.0053479206,0.003500603,0.00079245394],"about_ca_topic_score_codex":0.00007080144,"about_ca_topic_score_gemma":0.000040341805,"teacher_disagreement_score":0.8360605,"about_ca_system_score_codex":0.00031900313,"about_ca_system_score_gemma":0.00020213985,"threshold_uncertainty_score":0.999884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050091106,0.000018322096,0.9938244,0.000029762617,0.00018589469,0.00022331341,0.0000064683213,0.00022697283,0.0004757158],"genre_scores_gemma":[0.9537503,0.000007795396,0.046148308,0.000046057685,0.000008254791,0.000021215934,0.0000016627539,0.0000039884612,0.000012422034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991808,0.000045017765,0.00036927857,0.00011130095,0.0001867791,0.00010684716],"domain_scores_gemma":[0.9992324,0.00020755986,0.00017542977,0.00020262232,0.0001264988,0.000055455963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041372058,0.00010064266,0.0001520028,0.00023743382,0.00015673932,0.00013638962,0.00011953247,0.00006799077,8.407616e-7],"category_scores_gemma":[0.000023060238,0.0000981449,0.000024175728,0.00015247034,0.00002644978,0.0012150324,0.0000053402946,0.00009831479,0.000003983699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031003424,0.000009782648,0.0000029523285,0.00005690368,0.0000058449305,2.6616645e-8,0.0018581891,0.8087276,0.000023787334,0.002548417,0.0000036176368,0.18675973],"study_design_scores_gemma":[0.00019846158,0.00008803468,0.000020981275,0.00008038302,0.000007444183,0.000012526568,0.00021372279,0.99888897,0.00014375127,0.0001992175,0.00004690111,0.00009959896],"about_ca_topic_score_codex":0.000074177726,"about_ca_topic_score_gemma":0.00000586619,"teacher_disagreement_score":0.9487412,"about_ca_system_score_codex":0.000034593733,"about_ca_system_score_gemma":0.000023843306,"threshold_uncertainty_score":0.40022326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46316612,0.00012966854,0.5361398,0.0002324944,0.00018701055,0.00012009493,0.0000014382155,0.00002106654,0.0000023033726],"genre_scores_gemma":[0.9045263,0.000004646761,0.09525261,0.000042888198,0.0001578315,0.0000046230866,9.543902e-7,0.0000071214126,0.0000030489437],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.000015495047,0.00028415196,0.00015738563,0.00009664908,0.00021520662],"domain_scores_gemma":[0.99912345,0.00009132644,0.000118711585,0.00009125454,0.00035785834,0.00021742287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021246598,0.00011375274,0.00021949211,0.00020679024,0.00006024727,0.00017867274,0.00020396292,0.000054776905,6.9295595e-7],"category_scores_gemma":[0.00009667251,0.00010638424,0.00003890274,0.00018475293,0.000029976927,0.000488059,0.000022113956,0.00016434453,1.4318218e-7],"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.00014132189,0.0002879539,0.009037,0.0016604451,0.00060515193,0.000073304436,0.008429839,0.05167202,0.5078049,0.0990234,0.005188514,0.31607616],"study_design_scores_gemma":[0.00046081148,0.000464068,0.02076976,0.00011810505,0.000015593117,0.00025628333,0.000013215218,0.9443437,0.031275947,0.002000107,0.00006713462,0.00021528116],"about_ca_topic_score_codex":0.00063952577,"about_ca_topic_score_gemma":0.0004954907,"teacher_disagreement_score":0.8926717,"about_ca_system_score_codex":0.00005239387,"about_ca_system_score_gemma":0.0002740429,"threshold_uncertainty_score":0.43382236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037168574,0.00030659436,0.9466765,0.012586607,0.0006740814,0.0005025565,0.0000063239936,0.001115865,0.00096291915],"genre_scores_gemma":[0.5942802,0.000025375191,0.403135,0.0021802543,0.00006948593,0.0002452302,0.000009013702,0.00001816428,0.000037317106],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985864,0.00022180319,0.00031441962,0.00025132016,0.00014890586,0.00047713015],"domain_scores_gemma":[0.99469423,0.0016366551,0.00017472613,0.0032783053,0.000109121385,0.00010697408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957469,0.00019714203,0.00020516763,0.00020011964,0.00049361645,0.00015685843,0.0033930978,0.000063945634,0.0000037396399],"category_scores_gemma":[0.0002597914,0.0001994246,0.00011935775,0.0004193414,0.00009394091,0.0008625689,0.00054067804,0.00030663915,0.000053741027],"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.000049187795,0.0016392382,0.0321642,0.00027808434,0.00038632762,0.000003548289,0.021651745,0.0014245657,0.5725167,0.12611282,0.19614369,0.04762992],"study_design_scores_gemma":[0.0016239529,0.00020669839,0.006198317,0.00042230208,0.00009955284,0.000039704246,0.00032481592,0.33172053,0.35111713,0.004490968,0.30130517,0.0024508564],"about_ca_topic_score_codex":0.000052566862,"about_ca_topic_score_gemma":0.00002695413,"teacher_disagreement_score":0.55711156,"about_ca_system_score_codex":0.00011199931,"about_ca_system_score_gemma":0.00003544338,"threshold_uncertainty_score":0.8132299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001984125,0.000025396492,0.9567918,0.0027014532,0.00060008705,0.00014355258,4.851152e-7,0.00091641,0.036836684],"genre_scores_gemma":[0.61720014,0.0000016281234,0.37920186,0.0028775278,0.00010665406,0.000019232739,4.577635e-7,0.0000098794935,0.00058264064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998797,0.00010916569,0.00015139092,0.00024416955,0.0002941093,0.0004041566],"domain_scores_gemma":[0.99843377,0.00054455816,0.00006358902,0.0008149528,0.000050706243,0.00009245115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007814004,0.00013779219,0.0001057628,0.000107677864,0.00017784417,0.00010896668,0.000998586,0.00005442834,0.000082310224],"category_scores_gemma":[0.00012660724,0.000078695964,0.00007352351,0.00038880488,0.000029351018,0.0003039895,0.00019206341,0.00019075004,0.00015074297],"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.0000040973914,0.0002843441,0.0152897835,0.00000961351,0.00002077402,0.00001227779,0.0011718179,0.000039136106,0.0012218985,0.09546067,0.06205256,0.824433],"study_design_scores_gemma":[0.00012784325,0.0001267165,0.0043806364,0.000043076514,0.0000074984428,0.00001684819,0.00006544204,0.92236453,0.055047445,0.0019315577,0.015502535,0.0003858531],"about_ca_topic_score_codex":0.00006176078,"about_ca_topic_score_gemma":0.000014156573,"teacher_disagreement_score":0.92232543,"about_ca_system_score_codex":0.000063723135,"about_ca_system_score_gemma":0.000032612686,"threshold_uncertainty_score":0.32091284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4083416,0.000024857045,0.5897666,0.00017651128,0.00016902197,0.000112208916,9.112913e-7,0.0004409593,0.00096731866],"genre_scores_gemma":[0.59551334,0.000007916468,0.40424803,0.00012247598,0.000016681439,0.0000035070057,7.7411556e-7,0.0000071033182,0.000080158825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836165,0.000069436595,0.00038203134,0.00050827145,0.00040946453,0.00026917376],"domain_scores_gemma":[0.9983913,0.00021116756,0.00016989568,0.0008589138,0.0002818359,0.000086917404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069059245,0.00018318114,0.00030509895,0.00016303317,0.00014199584,0.0001223702,0.0008775644,0.00006530516,0.000012552732],"category_scores_gemma":[0.00030902738,0.00016577017,0.000116912575,0.00030443334,0.000073425654,0.0006080959,0.0004907407,0.00019967699,0.000028853987],"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.00014637467,0.001132052,0.014419785,0.00019310822,0.00014716104,0.0004307936,0.008477082,0.0016057963,0.22620443,0.55085886,0.0105730295,0.18581156],"study_design_scores_gemma":[0.00029128813,0.00012712153,0.0030560095,0.00023018017,0.0000055274027,0.000057390524,0.000030670657,0.008314979,0.89100325,0.09655721,0.000088260866,0.00023814244],"about_ca_topic_score_codex":0.00017792411,"about_ca_topic_score_gemma":0.00006434645,"teacher_disagreement_score":0.6647988,"about_ca_system_score_codex":0.00012368042,"about_ca_system_score_gemma":0.00007581809,"threshold_uncertainty_score":0.6759911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4649629,0.00006056642,0.5342263,0.00031132405,0.00006296835,0.00012303519,2.0308225e-7,0.00022229737,0.000030431816],"genre_scores_gemma":[0.66760284,0.000018409486,0.33155927,0.0007363952,0.000048426245,0.000006188371,0.0000011775419,0.000015841433,0.000011445305],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817497,0.0001446471,0.00032694158,0.00045721373,0.00032616087,0.00057006243],"domain_scores_gemma":[0.9988745,0.000084427615,0.00020905414,0.000700749,0.000078671,0.00005262012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006908734,0.00022082108,0.00028925278,0.00015948982,0.000118750395,0.000065719185,0.0010280597,0.000090344234,0.0000023070422],"category_scores_gemma":[0.000026880321,0.00023014113,0.00006191433,0.0003988385,0.00008098778,0.0005649471,0.00022777158,0.00046548079,0.000008851676],"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.00010223216,0.00044058714,0.0024951058,0.00016228696,0.0001494546,0.000011344756,0.0027604548,0.12365089,0.82306445,0.008202545,0.0038025477,0.0351581],"study_design_scores_gemma":[0.00017106911,0.00010429254,0.00026874873,0.000039294468,0.000011689288,0.000039977615,0.000004307459,0.51793486,0.48087093,0.00019392779,0.00009808947,0.00026280392],"about_ca_topic_score_codex":0.00004915385,"about_ca_topic_score_gemma":0.000007655079,"teacher_disagreement_score":0.39428398,"about_ca_system_score_codex":0.0003693931,"about_ca_system_score_gemma":0.000112555244,"threshold_uncertainty_score":0.93848825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07062017,0.0003375628,0.9244628,0.00049342285,0.000059122158,0.00024678808,0.0000020438497,0.0008429644,0.0029351332],"genre_scores_gemma":[0.76376194,0.000120563986,0.23558356,0.0004607584,0.000024236077,0.000020243166,0.000003385405,0.000009522502,0.00001580545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985348,0.00010245259,0.00020545094,0.00054350233,0.0002948214,0.00031899186],"domain_scores_gemma":[0.99897707,0.00010106563,0.00011738654,0.0005589814,0.0001255263,0.00012000189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026678658,0.00022244426,0.00022603646,0.00038420586,0.0002359477,0.0002866742,0.00044893817,0.00007468884,0.000004311449],"category_scores_gemma":[0.00001621201,0.00017929522,0.00009118108,0.0012614463,0.000111607995,0.0005041404,0.000047566387,0.00015613413,0.00000200396],"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.0001879515,0.00044726575,0.064212985,0.00004073743,0.00016330405,0.00015177281,0.003832323,0.00015343732,0.031575803,0.5651297,0.008325597,0.32577914],"study_design_scores_gemma":[0.0026205224,0.0069743674,0.2186074,0.00047918322,0.00018282082,0.0006040921,0.0009305266,0.019079652,0.11177982,0.6295766,0.0059827524,0.003182253],"about_ca_topic_score_codex":0.0000521241,"about_ca_topic_score_gemma":0.000028369632,"teacher_disagreement_score":0.69314176,"about_ca_system_score_codex":0.000008281738,"about_ca_system_score_gemma":0.000020874577,"threshold_uncertainty_score":0.7311447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018213135,0.000056607958,0.9507968,0.00020280706,0.000034109944,0.00010427508,1.6827494e-7,0.0007808985,0.046203014],"genre_scores_gemma":[0.68677515,0.0000047125895,0.31215483,0.0005997686,0.00003653302,0.000016441762,4.0102657e-7,0.0000036303752,0.0004085557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995607,0.000021390328,0.000084902465,0.00016320379,0.000065374195,0.00010438771],"domain_scores_gemma":[0.9993864,0.00023769097,0.000022473774,0.00027613345,0.000032177286,0.000045088444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073735253,0.000045658035,0.00004085216,0.000054339045,0.000086213564,0.00004320464,0.0002637079,0.00002502255,0.000007604452],"category_scores_gemma":[0.000010254276,0.000041874762,0.00001210991,0.00015541282,0.00002631305,0.00013455797,0.0001148207,0.000052875443,0.000018318844],"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.0000012782176,0.000011165771,0.0003263365,0.0000014896212,0.0000013733088,0.0000011758343,0.00008180589,2.8388794e-7,0.0011343213,0.9000419,0.00025580084,0.09814306],"study_design_scores_gemma":[0.0002295828,0.00012099418,0.013794088,0.000021189768,0.000008628886,0.0002900784,0.0001424334,0.0033548546,0.13760617,0.7881942,0.05575746,0.00048034612],"about_ca_topic_score_codex":0.0000043521263,"about_ca_topic_score_gemma":0.000021676835,"teacher_disagreement_score":0.6849538,"about_ca_system_score_codex":0.00001344742,"about_ca_system_score_gemma":0.000007714524,"threshold_uncertainty_score":0.17076033},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006330281,0.000061990075,0.98703223,0.00065171864,0.0004922317,0.0014258306,1.6800757e-7,0.0014281346,0.0025774024],"genre_scores_gemma":[0.43161395,0.0000012626851,0.5657305,0.00027302004,0.00004197594,0.0007108833,2.737638e-7,0.0000111656655,0.0016169605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887085,0.000042555777,0.00029040806,0.0003116634,0.00017952661,0.0003049706],"domain_scores_gemma":[0.9985988,0.00047206137,0.00007931616,0.00058111944,0.00017424831,0.000094459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036489582,0.0001378062,0.0002719982,0.000014990671,0.000080869904,0.00027262684,0.00086219795,0.000064341475,0.000034983466],"category_scores_gemma":[0.00027498687,0.00010384244,0.00009365768,0.00021476534,0.000024476558,0.00043366168,0.00016947679,0.000064129636,0.0002265477],"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.000008822791,0.00039741053,0.00031050187,0.014139899,0.0002006826,0.0000091693,0.0026164479,0.00015434125,0.013179672,0.87550515,0.07665614,0.01682178],"study_design_scores_gemma":[0.0002192836,0.0003114841,0.00007215452,0.00086985854,0.000016601702,0.000036815316,0.00012932537,0.95871603,0.021083811,0.017980976,0.0001455746,0.00041806352],"about_ca_topic_score_codex":0.00004389051,"about_ca_topic_score_gemma":0.0000028494587,"teacher_disagreement_score":0.9585617,"about_ca_system_score_codex":0.00004110217,"about_ca_system_score_gemma":0.000025709794,"threshold_uncertainty_score":0.42345715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051125936,0.000049646384,0.9429273,0.0030737102,0.0002717171,0.00033747609,0.000018597084,0.00026826432,0.0019273431],"genre_scores_gemma":[0.9754402,0.00019621293,0.023959618,0.00017456262,0.0000073224805,0.00008208593,0.0000010521997,0.000014736103,0.0001242059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837846,0.00037348527,0.00046987683,0.00024108695,0.00034082824,0.00019624359],"domain_scores_gemma":[0.99550575,0.001085511,0.0003019081,0.0028547081,0.00019889593,0.00005324351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055057695,0.00016823459,0.00026505112,0.0002600824,0.0007697014,0.000024065563,0.0024805784,0.00007250868,0.000030991723],"category_scores_gemma":[0.000040341925,0.00014096902,0.00019064234,0.0006673096,0.00091414736,0.00020236101,0.00003738014,0.00045586444,0.000008432698],"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.00029622565,0.013149673,0.0003532624,0.00043026835,0.0013377434,0.000017985905,0.12261754,0.13363191,0.10451979,0.529926,0.009398052,0.084321536],"study_design_scores_gemma":[0.00050589105,0.0005467558,0.0007726932,0.00055445055,0.00005553797,0.00010107664,0.00081402593,0.43354923,0.5214776,0.04081261,0.00020282847,0.0006073015],"about_ca_topic_score_codex":0.0005089635,"about_ca_topic_score_gemma":0.00020816257,"teacher_disagreement_score":0.92431426,"about_ca_system_score_codex":0.000071954586,"about_ca_system_score_gemma":0.000087664164,"threshold_uncertainty_score":0.5919998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037980214,0.000046256195,0.90899664,0.00047835946,0.00071450125,0.0004872274,0.00001934233,0.0017233556,0.04955412],"genre_scores_gemma":[0.8381563,0.0000027749845,0.1610062,0.000544849,0.00006535305,0.000061417006,0.000014409755,0.000023355517,0.00012537769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711114,0.00022534921,0.0004981615,0.00078736705,0.00064065395,0.0007372982],"domain_scores_gemma":[0.9982884,0.00028561277,0.00024385996,0.0007061212,0.00030871312,0.0001673192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489768,0.0003443513,0.000348727,0.0003176127,0.00045852584,0.00012127385,0.0013981239,0.00010090141,0.0001426589],"category_scores_gemma":[0.00012345635,0.0003725837,0.0001712515,0.0007889284,0.0002914649,0.00030949956,0.00031201882,0.00052180095,0.00014169725],"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.000059835867,0.0002252966,0.00028066896,0.000009237538,0.000042772965,0.000019352256,0.00040257655,0.00024322652,0.000051959007,0.9778945,0.0011316575,0.019638933],"study_design_scores_gemma":[0.0006744458,0.0012070471,0.021417309,0.00003165595,0.000019287447,0.0003439723,0.000026644877,0.1646006,0.0016166859,0.8067749,0.002668779,0.000618667],"about_ca_topic_score_codex":0.000117312826,"about_ca_topic_score_gemma":0.00032074703,"teacher_disagreement_score":0.8001761,"about_ca_system_score_codex":0.000516586,"about_ca_system_score_gemma":0.0009136642,"threshold_uncertainty_score":0.9998726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022763703,0.00043036023,0.9753226,0.00016903282,0.00011430921,0.0006417592,0.000007888442,0.00028319386,0.00026716018],"genre_scores_gemma":[0.74476177,0.000054259028,0.25447896,0.00011947852,0.00018473835,0.00020402532,0.000007365993,0.000018224942,0.0001711708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988346,0.000040728326,0.00038439117,0.00033668915,0.00018257744,0.00022101417],"domain_scores_gemma":[0.998579,0.00035243877,0.00020220855,0.0005241906,0.00025228588,0.000089828456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019460908,0.00014234114,0.00019292218,0.00016732122,0.00023487674,0.00010352544,0.0004227632,0.00010964577,0.000016973669],"category_scores_gemma":[0.0000975207,0.00014240548,0.000051760486,0.00054127176,0.00003558396,0.00047310122,0.00023853449,0.00017743662,0.000033837827],"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.0000047970834,0.00081713946,0.0022821215,0.00078140636,0.00029176014,0.0000059791846,0.0074203415,0.025467034,0.08957273,0.63077855,0.0015603114,0.24101785],"study_design_scores_gemma":[0.00007954207,0.00002537584,0.00012814149,0.0000639669,0.000013310222,0.000006098189,0.000040311385,0.99438083,0.002770244,0.0014532143,0.0008789307,0.00016001597],"about_ca_topic_score_codex":0.00035921836,"about_ca_topic_score_gemma":0.000006355032,"teacher_disagreement_score":0.9689138,"about_ca_system_score_codex":0.000021765916,"about_ca_system_score_gemma":0.000054827564,"threshold_uncertainty_score":0.5807127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01387866,0.000042251693,0.97612184,0.00030611036,0.0022966692,0.0004160334,4.8548463e-7,0.001502853,0.005435066],"genre_scores_gemma":[0.7761164,0.0000010735713,0.22188132,0.00022107443,0.00035741518,0.000099905534,0.000002977537,0.000014201108,0.0013056918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878114,0.00009532118,0.0002679227,0.0004101194,0.00017642125,0.00026905516],"domain_scores_gemma":[0.998734,0.0003465084,0.00013751496,0.0005188014,0.00020043843,0.00006275075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008741576,0.00014162346,0.00018151898,0.00010356567,0.00022251914,0.00041944257,0.00054611603,0.000080119804,0.0000033947238],"category_scores_gemma":[0.00034296967,0.00012536251,0.000064125314,0.00019016428,0.00001369915,0.00050713524,0.00011453087,0.00008805392,0.000023369661],"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.000012846935,0.00013448631,0.0013148609,0.00017235239,0.00004839625,0.0000029331932,0.0029463645,0.0021210946,0.14124846,0.5068725,0.08430947,0.26081628],"study_design_scores_gemma":[0.00009647266,0.00013648157,0.000018374536,0.000026474976,0.0000042601414,0.000025967813,0.000053888725,0.9403779,0.052440215,0.00060754205,0.006027445,0.00018496247],"about_ca_topic_score_codex":0.00014034193,"about_ca_topic_score_gemma":0.00010258092,"teacher_disagreement_score":0.9382568,"about_ca_system_score_codex":0.000058552538,"about_ca_system_score_gemma":0.000030605883,"threshold_uncertainty_score":0.5112135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7676838,0.000066429464,0.22724365,0.00016306016,0.0004129169,0.0003101633,7.8188714e-7,0.00040784117,0.0037113563],"genre_scores_gemma":[0.9490769,0.0000020870361,0.05066016,0.000056373057,0.00002918365,0.000028219425,3.0838987e-7,0.0000070647375,0.00013969462],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987406,0.00015194477,0.00029596238,0.00025450296,0.0002193243,0.00033767137],"domain_scores_gemma":[0.99899334,0.00012418888,0.000098485856,0.0006168716,0.000098152836,0.00006894231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014676229,0.00012432656,0.00024686605,0.000116743075,0.000026357193,0.00002960737,0.0007459451,0.00007730677,0.0000151395625],"category_scores_gemma":[0.00011607954,0.00010724535,0.000047049703,0.00044516148,0.000048766127,0.00056865095,0.00027833926,0.00015151377,0.000008396222],"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.00003688838,0.0020821092,0.7048135,0.000492841,0.00003430696,0.000014413355,0.026582636,0.00034909282,0.03761366,0.16699682,0.0011388588,0.05984489],"study_design_scores_gemma":[0.00050446484,0.00016329382,0.08200075,0.00015401213,0.0000066130274,0.00002570348,0.00036543727,0.015833717,0.8800027,0.01992337,0.00032796833,0.0006919931],"about_ca_topic_score_codex":0.0002091746,"about_ca_topic_score_gemma":0.00015217652,"teacher_disagreement_score":0.842389,"about_ca_system_score_codex":0.000054509535,"about_ca_system_score_gemma":0.000039866245,"threshold_uncertainty_score":0.43733388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1332174,0.00004062889,0.8652984,0.00050984335,0.00005309313,0.0002135661,0.00005689341,0.00019511116,0.00041506006],"genre_scores_gemma":[0.8177111,0.00013064098,0.18194187,0.000034201963,0.0000034771945,0.000070094226,0.000019145451,0.0000075285416,0.00008192578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989824,0.000111811685,0.00035331532,0.00025925282,0.0001290987,0.00016411385],"domain_scores_gemma":[0.99729896,0.0007396919,0.00017313988,0.0014804233,0.00026873252,0.000039044542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035361483,0.00013771013,0.00028081154,0.0004946687,0.0005988305,0.00007482796,0.0008883109,0.00007546888,0.0000020991229],"category_scores_gemma":[0.000012235359,0.00015016564,0.00014996745,0.0011970106,0.00016332931,0.00033773654,0.000018279725,0.00023371476,8.9526014e-7],"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.00027894494,0.0064620525,0.0659586,0.0005325764,0.004545782,0.0000034374482,0.012933849,0.11608964,0.017056221,0.38429642,0.0005517309,0.39129075],"study_design_scores_gemma":[0.00012189414,0.00008706192,0.0074045034,0.000038316695,0.00023653166,0.0000025975398,0.000043754797,0.97614014,0.014549589,0.0012107868,0.000013046162,0.00015180594],"about_ca_topic_score_codex":0.00034933758,"about_ca_topic_score_gemma":0.0072406144,"teacher_disagreement_score":0.86005044,"about_ca_system_score_codex":0.00010655779,"about_ca_system_score_gemma":0.000040963467,"threshold_uncertainty_score":0.6123577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028852371,0.000009334297,0.96687376,0.00039822454,0.00005283137,0.00036791532,0.000008439061,0.00074642216,0.0026906815],"genre_scores_gemma":[0.7172328,2.730519e-7,0.28199232,0.0006128983,0.000041511244,0.000008961947,0.000010043696,0.000010623667,0.00009051727],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821985,0.000055347344,0.00036659086,0.0006385588,0.0003559963,0.0003636833],"domain_scores_gemma":[0.99708754,0.0001649001,0.00017388718,0.0023364574,0.000109864966,0.00012737364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336991,0.00013173625,0.00016633082,0.00022073026,0.00007887595,0.000056366425,0.0023214344,0.00006291975,0.000014795247],"category_scores_gemma":[0.00020314321,0.000121180965,0.000025816566,0.00066496927,0.0000122696965,0.00034758297,0.0006299092,0.00017011316,0.000024656041],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046857986,0.0004529459,0.005894743,0.000043030905,0.00001590187,0.000007784718,0.0024441585,0.0017250481,0.18662654,0.013637434,0.004582993,0.7845226],"study_design_scores_gemma":[0.00031652304,0.0010476314,0.008624614,0.00014244948,0.000013080257,0.000017000055,0.00021264589,0.3817903,0.5778527,0.008075166,0.02115872,0.00074914494],"about_ca_topic_score_codex":0.0002551974,"about_ca_topic_score_gemma":0.0005568982,"teacher_disagreement_score":0.7837734,"about_ca_system_score_codex":0.000036663223,"about_ca_system_score_gemma":0.000038890874,"threshold_uncertainty_score":0.49416164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041427545,0.00006162159,0.950898,0.0065955943,0.00014047622,0.00045658826,0.00001130486,0.0002836154,0.00012524822],"genre_scores_gemma":[0.49124137,0.000009842051,0.5080457,0.00057418057,0.000007849775,0.00008836802,0.000012336382,0.000010407983,0.000009973347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986534,0.0003236145,0.0003912888,0.00028902633,0.00014029813,0.00020235364],"domain_scores_gemma":[0.9965162,0.0009839582,0.00031146075,0.0019427002,0.00019386043,0.00005177786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080750085,0.00016576554,0.00026188284,0.00018724508,0.00031167417,0.00013099994,0.0016540297,0.00006350344,0.0000011306912],"category_scores_gemma":[0.00034703052,0.0001710688,0.000060194838,0.00034238104,0.00022766567,0.0005576546,0.00027158434,0.00015156023,0.0000029607124],"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.00011346992,0.00048450884,0.0007706429,0.00042275118,0.0003313723,9.4807973e-7,0.017748175,0.04857741,0.5419356,0.24015373,0.012272973,0.13718842],"study_design_scores_gemma":[0.00042842198,0.00007176031,0.00023928366,0.00010898614,0.000026397778,0.00000632903,0.000054276217,0.9749773,0.019723019,0.00356345,0.00059393427,0.00020683814],"about_ca_topic_score_codex":0.00007675548,"about_ca_topic_score_gemma":0.00004063433,"teacher_disagreement_score":0.9263999,"about_ca_system_score_codex":0.00004095849,"about_ca_system_score_gemma":0.00003844023,"threshold_uncertainty_score":0.6975983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018924737,0.00026723061,0.97889525,0.00021185448,0.0013424832,0.0002372691,0.0000036231131,0.000064694716,0.000052872525],"genre_scores_gemma":[0.8256598,0.000015537657,0.17386208,0.00016010179,0.00026221154,0.0000067630376,3.6558106e-7,0.0000111902455,0.0000219552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871665,0.00003763758,0.00056945824,0.00017832237,0.0002756434,0.00022226475],"domain_scores_gemma":[0.99873185,0.00013488917,0.00059042283,0.00015328701,0.00028514984,0.00010439074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329985,0.00012656335,0.00025641176,0.00022019084,0.000097620476,0.00029573898,0.00040438835,0.000035006055,6.275467e-7],"category_scores_gemma":[0.000009695558,0.000113294795,0.000091043854,0.00014203631,0.000013304688,0.000727579,0.00006331182,0.00011471164,6.2542017e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020823582,0.000054030403,0.0001323594,0.000041650223,0.00006138176,0.000009023576,0.0027602809,0.0006738777,0.0057814317,0.0020873828,0.0018188815,0.98657763],"study_design_scores_gemma":[0.004005447,0.0019577716,0.0023098583,0.0010563598,0.00004596019,0.004179394,0.001072754,0.95598954,0.007723068,0.0008910935,0.01991484,0.0008538917],"about_ca_topic_score_codex":0.000020083875,"about_ca_topic_score_gemma":0.0000036205654,"teacher_disagreement_score":0.98572373,"about_ca_system_score_codex":0.000101586746,"about_ca_system_score_gemma":0.00007620878,"threshold_uncertainty_score":0.46200275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017046249,0.0011795462,0.9776107,0.0030112076,0.0002488282,0.00045544148,0.00001028515,0.00038061748,0.000057091856],"genre_scores_gemma":[0.9522562,0.0006265006,0.046443198,0.00043240387,0.000026119911,0.000044324795,0.0000041360568,0.000027962586,0.00013916884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740535,0.00027658595,0.0005536021,0.0007750902,0.00043926403,0.0005500886],"domain_scores_gemma":[0.9979622,0.000283325,0.00013705135,0.001460977,0.00008378747,0.00007265809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825355,0.0002652525,0.00021960781,0.00028471168,0.00038374437,0.00021147978,0.0021177682,0.00014631756,0.000043148266],"category_scores_gemma":[0.000005303888,0.00022157008,0.00009689495,0.00092557224,0.000103082515,0.0012189689,0.000006308212,0.0007990906,0.000021851178],"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.000044661774,0.0004021401,0.000045192242,0.000024330207,0.00007474988,0.000008076277,0.0017704939,0.09695708,0.09591332,0.0002962054,0.00033917883,0.8041246],"study_design_scores_gemma":[0.00028774317,0.00006509773,0.000024673913,0.00007750228,0.000054813605,0.00006468905,0.000034317083,0.76631904,0.22449335,0.00041943075,0.007819845,0.00033952785],"about_ca_topic_score_codex":0.0001689324,"about_ca_topic_score_gemma":0.0011141488,"teacher_disagreement_score":0.93520993,"about_ca_system_score_codex":0.0002732078,"about_ca_system_score_gemma":0.00034560618,"threshold_uncertainty_score":0.9035366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010018113,0.0011309348,0.98657084,0.0013005554,0.00034857084,0.0002774468,0.0000034032003,0.00027632952,0.000073809104],"genre_scores_gemma":[0.8025505,0.0007938258,0.1961217,0.00024256391,0.00021969523,0.000021188032,0.000005787794,0.00003171933,0.000013054723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977268,0.0007827267,0.00052688445,0.0003035378,0.0002328971,0.0004271393],"domain_scores_gemma":[0.9964663,0.0013038848,0.00052438764,0.0012980734,0.00023618429,0.00017117421],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00253429,0.00024151582,0.00034738868,0.00018249877,0.0017264728,0.000524629,0.0016127957,0.00009952826,6.9494695e-7],"category_scores_gemma":[0.000090577036,0.00022807244,0.00012532577,0.00035904185,0.00012631477,0.00028667934,0.00054232177,0.0005845195,0.000001088982],"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.00012834015,0.00052883103,0.0014787037,0.00007288359,0.00026703105,0.000012150552,0.0033451566,0.05860764,0.009118679,0.04050082,0.0035341673,0.8824056],"study_design_scores_gemma":[0.00032143763,0.00020724203,0.000112177666,0.00046485313,0.000025293495,0.00019912788,0.000045960995,0.97735626,0.0008687671,0.0069724303,0.013145673,0.00028075703],"about_ca_topic_score_codex":0.000009869934,"about_ca_topic_score_gemma":0.000011460714,"teacher_disagreement_score":0.9187486,"about_ca_system_score_codex":0.00011240415,"about_ca_system_score_gemma":0.000053412903,"threshold_uncertainty_score":0.9995732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012470165,0.0000037675777,0.9889797,0.00010833112,0.0013080675,0.00051092415,0.0000100977595,0.0010444496,0.00678766],"genre_scores_gemma":[0.9104233,0.0000035193775,0.088093236,0.0010209198,0.00003148535,0.00011767084,0.0000029818455,0.000012907896,0.0002939909],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987709,0.000069316615,0.0004021517,0.00017165196,0.00026646166,0.0003195406],"domain_scores_gemma":[0.9979697,0.0012054641,0.00016635988,0.0004241692,0.0001532032,0.00008112426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095659,0.00017614693,0.00013843924,0.00052889745,0.0003778965,0.00015418287,0.0004867803,0.00011610796,0.000020419402],"category_scores_gemma":[0.000047730686,0.0001737961,0.00011929404,0.00036393767,0.000036615373,0.0015843897,0.0000024728467,0.00024020995,0.0001008234],"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.00039068703,0.00015222577,0.0000015823334,0.0000657705,0.000050334093,0.0000014511556,0.0062460345,0.012927732,0.0010024566,0.26052433,0.00095354737,0.71768385],"study_design_scores_gemma":[0.0010608594,0.00111133,0.000028290193,0.00020170464,0.000027925551,0.00003789762,0.0007186323,0.06308511,0.843153,0.08701486,0.0028781127,0.0006822786],"about_ca_topic_score_codex":0.000004780616,"about_ca_topic_score_gemma":0.0000039334595,"teacher_disagreement_score":0.9091763,"about_ca_system_score_codex":0.00012756232,"about_ca_system_score_gemma":0.00004424448,"threshold_uncertainty_score":0.7087199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012233958,0.00011387105,0.9784964,0.0059349174,0.00026470236,0.00042591343,0.000008908242,0.0006988197,0.0018225098],"genre_scores_gemma":[0.63087904,0.000019563291,0.36717623,0.001692589,0.000020594569,0.0001581468,0.000009050444,0.000013902051,0.000030855408],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998925,0.00013875261,0.0002804617,0.00028183885,0.00012340293,0.00025058354],"domain_scores_gemma":[0.9963715,0.00049601676,0.0001972191,0.0027228976,0.0001550281,0.000057347956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035713986,0.0001413695,0.00014670785,0.0001619318,0.00038406468,0.00008803119,0.0031549581,0.000061106606,0.00000529271],"category_scores_gemma":[0.000093463124,0.00015228636,0.00008646347,0.00032477,0.00011866369,0.00048619986,0.0002808084,0.00017637631,0.000021646114],"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.00011144101,0.0010656586,0.020697499,0.00015770199,0.0003463132,0.000009207194,0.038434274,0.0003896856,0.413162,0.27101654,0.12986758,0.12474211],"study_design_scores_gemma":[0.0025602144,0.0005063617,0.016086744,0.00040729804,0.00018949097,0.000068833724,0.00045004216,0.4810406,0.3466175,0.055957273,0.09277444,0.0033412257],"about_ca_topic_score_codex":0.00028558393,"about_ca_topic_score_gemma":0.00027578734,"teacher_disagreement_score":0.6186451,"about_ca_system_score_codex":0.00008179357,"about_ca_system_score_gemma":0.00004406562,"threshold_uncertainty_score":0.6210058},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32038063,0.0005641539,0.58502907,0.00028952485,0.0038468824,0.00006798847,9.2120894e-7,0.00026114174,0.089559674],"genre_scores_gemma":[0.97709036,0.000043539345,0.022443453,0.0002569905,0.00003867161,1.9044806e-7,1.378922e-7,0.000021838852,0.000104843006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.000769564,0.000402938,0.00016880422,0.00042424636,0.00018137909],"domain_scores_gemma":[0.998442,0.0003137001,0.00039787684,0.00046987893,0.00024538275,0.00013117716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014042549,0.0001425249,0.00020708633,0.00020146347,0.000085876534,0.00011723501,0.0011716149,0.000021413636,0.000009281309],"category_scores_gemma":[0.00056994916,0.00012408385,0.00012483464,0.00042048097,0.000026553018,0.00025449574,0.00007748331,0.00041506608,0.000050295774],"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.000014153659,0.00030993216,0.0021185118,0.0000040436817,0.000045230372,0.00083572714,0.0006659367,0.00005017216,0.0013322973,0.97251636,0.014330393,0.0077772154],"study_design_scores_gemma":[0.0024509903,0.0036976126,0.008505168,0.00037982978,0.000046787965,0.0005802872,0.00010150458,0.0005419443,0.04617187,0.84248,0.094155,0.0008890267],"about_ca_topic_score_codex":0.0000011640485,"about_ca_topic_score_gemma":1.6797586e-7,"teacher_disagreement_score":0.65670973,"about_ca_system_score_codex":0.000052195046,"about_ca_system_score_gemma":0.000054144784,"threshold_uncertainty_score":0.50599927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028795572,0.000039871167,0.983444,0.0114485705,0.00013842498,0.0008940576,0.000036154936,0.00065794314,0.00046142066],"genre_scores_gemma":[0.7840021,0.0001590324,0.21490927,0.00042743149,0.000021221678,0.00021965445,0.000010549707,0.000026329877,0.00022437639],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998252,0.00014658795,0.00049983757,0.00042985496,0.00032667656,0.00034505167],"domain_scores_gemma":[0.99634427,0.00037545434,0.00022832271,0.002639229,0.000276671,0.00013607922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025623452,0.00028964563,0.00030094967,0.0006208731,0.00064481475,0.00009285452,0.0018347611,0.00013648493,0.000014934319],"category_scores_gemma":[0.000006544158,0.00028212208,0.00022432386,0.0013310687,0.0001618773,0.0006867434,0.0000035711746,0.00040420244,0.0000065781574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019825685,0.0028678745,0.0000041918533,0.00006259629,0.00018317864,0.0000010015899,0.0058621564,0.049428023,0.14123248,0.009233628,0.00042656585,0.79050004],"study_design_scores_gemma":[0.002513512,0.0021424205,0.00027220606,0.00061583676,0.00023473751,0.000058194815,0.0002790216,0.4270261,0.5581499,0.005291618,0.002279469,0.0011370507],"about_ca_topic_score_codex":0.00025336668,"about_ca_topic_score_gemma":0.0001733837,"teacher_disagreement_score":0.789363,"about_ca_system_score_codex":0.000152116,"about_ca_system_score_gemma":0.00020330699,"threshold_uncertainty_score":0.9999631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018805152,0.0000055503906,0.97644836,0.00055638776,0.00041027687,0.00026483665,0.0000063574034,0.0007961221,0.0027069487],"genre_scores_gemma":[0.96431947,0.00001893216,0.034405693,0.00093693275,0.000013220113,0.00010536106,0.0000018252025,0.00000634792,0.00019219056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990586,0.00011075369,0.00028328932,0.00014150486,0.00021401573,0.00019180609],"domain_scores_gemma":[0.9990398,0.00029331289,0.00008450479,0.00038585628,0.00010190342,0.000094576135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808411,0.00013647371,0.00011949288,0.00028781508,0.0002417039,0.00024749016,0.00035683892,0.00008711596,0.0001047396],"category_scores_gemma":[0.000016262205,0.00012327511,0.000046250283,0.00024628468,0.000089024135,0.0027266315,0.000005237892,0.00029479404,0.00036061436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023565284,0.000063331165,0.000009808363,0.000029963947,0.000024804951,5.91194e-7,0.0034331537,0.0008955634,0.00036828071,0.18333325,0.0008886547,0.810929],"study_design_scores_gemma":[0.0019102485,0.0011159651,0.0038634094,0.00020481621,0.00004238883,0.00023208292,0.0010766496,0.26513484,0.16031778,0.55783314,0.0066164765,0.0016522148],"about_ca_topic_score_codex":0.00005623856,"about_ca_topic_score_gemma":0.0000054731468,"teacher_disagreement_score":0.9455143,"about_ca_system_score_codex":0.000041045234,"about_ca_system_score_gemma":0.000033385495,"threshold_uncertainty_score":0.50270134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18988001,0.000015671827,0.80906445,0.00015089597,0.00007686335,0.00029349662,0.0000019809381,0.0003331523,0.00018350246],"genre_scores_gemma":[0.7163011,0.000003085112,0.28344762,0.00012640507,0.000013410204,0.000032751646,0.0000022546599,0.0000074620993,0.00006589778],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902433,0.000033840224,0.0002659223,0.00029327787,0.00015818636,0.00022443618],"domain_scores_gemma":[0.99923384,0.0001183265,0.00010136344,0.00038862642,0.00011388445,0.000043985765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032427607,0.0000984797,0.00015355079,0.00011250591,0.00007538083,0.000022919825,0.0005197044,0.000045136014,0.000022170878],"category_scores_gemma":[0.000028582774,0.000098493554,0.000050251583,0.00015214634,0.00003018743,0.00036593896,0.000072331946,0.000053221444,0.0000050239382],"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.000071935094,0.0009148133,0.23033787,0.00015335102,0.000060734288,0.00002972956,0.05474072,0.0008279628,0.053786304,0.009294988,0.02370329,0.6260783],"study_design_scores_gemma":[0.0017621539,0.0012455597,0.037313208,0.00005266704,0.000014144974,0.00007697705,0.0012806996,0.29683635,0.64205605,0.017650736,0.0009784779,0.00073299796],"about_ca_topic_score_codex":0.0006140733,"about_ca_topic_score_gemma":0.0045046997,"teacher_disagreement_score":0.6253453,"about_ca_system_score_codex":0.000033731198,"about_ca_system_score_gemma":0.00009375168,"threshold_uncertainty_score":0.40164503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12028628,0.000038957918,0.8713775,0.0005635322,0.0001406079,0.0004036076,6.124278e-7,0.00040543816,0.0067834514],"genre_scores_gemma":[0.861655,5.8865413e-7,0.13787779,0.00025919487,0.000044447686,0.000023313867,2.9602056e-8,0.000015509906,0.00012409984],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984247,0.000005403415,0.0002855366,0.00034498947,0.00053986383,0.00039952685],"domain_scores_gemma":[0.99894,0.00008362766,0.00024278436,0.00024564483,0.00040325712,0.000084671236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063062,0.00016644683,0.00014235747,0.00012118201,0.00038819018,0.00020320356,0.0026355654,0.00006654617,1.8269988e-7],"category_scores_gemma":[0.00008833021,0.000098466604,0.00010923169,0.00090895925,0.00009439149,0.000306179,0.00023386179,0.00025011817,0.0000012878436],"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.00021790984,0.00064203655,0.0077874223,0.0005930202,0.000058761525,8.775909e-7,0.015201319,0.006076276,0.60183704,0.04006098,0.012775207,0.31474912],"study_design_scores_gemma":[0.000108582215,0.00006950821,0.00057742244,0.00010575137,0.000008041977,0.0000066369303,0.0001091665,0.37554154,0.613835,0.009172355,0.00023191627,0.00023410236],"about_ca_topic_score_codex":0.000009190246,"about_ca_topic_score_gemma":0.0000024614899,"teacher_disagreement_score":0.7413688,"about_ca_system_score_codex":0.0000611363,"about_ca_system_score_gemma":0.00007976403,"threshold_uncertainty_score":0.48975798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41926184,0.0000314569,0.56605947,0.0031935682,0.0002667323,0.00028073526,0.0000019652646,0.00035441224,0.010549827],"genre_scores_gemma":[0.96253693,0.0000049742143,0.03663937,0.00049998815,0.00004441771,0.000009843976,2.5332326e-7,0.000009169355,0.0002550565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985318,0.000129703,0.000390125,0.00030018928,0.00040309885,0.00024506796],"domain_scores_gemma":[0.998498,0.00035749955,0.00028596554,0.0006928233,0.00011914354,0.000046550085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010092136,0.00015484498,0.0002658938,0.000139907,0.00010203507,0.000041000105,0.0011008929,0.0000554423,0.000100404744],"category_scores_gemma":[0.00015515285,0.000104399885,0.00011821295,0.00032186537,0.0002635854,0.00021523284,0.00038378866,0.00016379118,0.000007813385],"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.0000436512,0.00052562915,0.00067709404,0.00014107532,0.0001018935,0.000006003291,0.012905481,0.0043479525,0.03637412,0.8844531,0.011988329,0.04843565],"study_design_scores_gemma":[0.00014888856,0.0001881501,0.000659051,0.00017346654,0.0000063082766,0.000015210769,0.00027079487,0.3240702,0.6197945,0.05434094,0.00009008528,0.00024243741],"about_ca_topic_score_codex":0.0003482007,"about_ca_topic_score_gemma":0.00010990116,"teacher_disagreement_score":0.83011216,"about_ca_system_score_codex":0.000050173596,"about_ca_system_score_gemma":0.000037350797,"threshold_uncertainty_score":0.42573038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025400372,0.00021168371,0.9679207,0.005246464,0.00008721013,0.00026851922,0.000014836342,0.00025458896,0.0005955949],"genre_scores_gemma":[0.55234253,0.000004390089,0.44716862,0.00031992124,0.00002368173,0.000097023694,0.000017062635,0.0000068023605,0.000019976793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895257,0.00010390044,0.0003600053,0.00022071689,0.00016572447,0.00019711076],"domain_scores_gemma":[0.99800277,0.00047337794,0.00026192336,0.0009830107,0.00025316974,0.00002574375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273579,0.0001227217,0.0001637358,0.00015068137,0.00036596265,0.000086860244,0.0016806045,0.000042067804,0.0000011993704],"category_scores_gemma":[0.000041991545,0.0001315243,0.00008540947,0.00029973406,0.00022146819,0.00042355637,0.00020569019,0.00014872524,0.0000021936132],"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.000050799288,0.0007923632,0.020909775,0.00019971607,0.00010847935,0.0000032290206,0.0046786903,0.008555257,0.40887794,0.47708756,0.032510087,0.04622612],"study_design_scores_gemma":[0.0011656347,0.00013290819,0.010651331,0.00047400876,0.000047225065,0.00005820568,0.0001513852,0.9179973,0.041100446,0.020302827,0.0069913585,0.0009273526],"about_ca_topic_score_codex":0.00004623792,"about_ca_topic_score_gemma":0.00009630683,"teacher_disagreement_score":0.90944207,"about_ca_system_score_codex":0.00007468595,"about_ca_system_score_gemma":0.00008294257,"threshold_uncertainty_score":0.5363405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.573306,0.0001347303,0.41534668,0.00027919735,0.0010106704,0.00020048632,0.0000068973864,0.00093174475,0.008783601],"genre_scores_gemma":[0.8826319,0.0000042259862,0.11695584,0.000078122306,0.00014525418,0.000010320594,0.0000031161185,0.0000144135975,0.0001568091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835235,0.0000800796,0.00041269956,0.00044893468,0.0003057059,0.00040023436],"domain_scores_gemma":[0.998748,0.00014638901,0.00025733677,0.00067999156,0.00010476054,0.00006349292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004792549,0.00019822708,0.00030722906,0.00018311777,0.00014823292,0.000110263325,0.0010368768,0.000088607216,0.00003770705],"category_scores_gemma":[0.000081362705,0.00020619232,0.00013020677,0.00047198046,0.00008322316,0.00044446974,0.00038333712,0.00016337339,0.000020269263],"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.00005766845,0.0007685424,0.040343035,0.0002686083,0.00011772209,0.000085407555,0.0032735348,0.0011691423,0.2709716,0.53658265,0.06436612,0.08199597],"study_design_scores_gemma":[0.0008378192,0.0002461589,0.032432258,0.0004044958,0.000029041914,0.00010076817,0.00007215068,0.13460556,0.6791796,0.14360301,0.0072501916,0.0012389637],"about_ca_topic_score_codex":0.0011943753,"about_ca_topic_score_gemma":0.000110551424,"teacher_disagreement_score":0.40820798,"about_ca_system_score_codex":0.00011851316,"about_ca_system_score_gemma":0.000051957733,"threshold_uncertainty_score":0.8408278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025248465,0.000062706815,0.98753536,0.0058564134,0.00023114338,0.0006027763,0.000013804716,0.0007920549,0.002380912],"genre_scores_gemma":[0.30792403,0.000013389077,0.6904281,0.0012448134,0.00003381315,0.00027164072,0.000027106575,0.000018341687,0.000038775415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978586,0.0007206615,0.00037856377,0.0004634825,0.00024429004,0.000334436],"domain_scores_gemma":[0.9920868,0.0027817923,0.0002780481,0.0043140254,0.00043139936,0.00010789724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001898465,0.00020802958,0.00028853118,0.00016021154,0.0009779915,0.00020633895,0.0029706664,0.0001273505,0.0000037969637],"category_scores_gemma":[0.0008521215,0.00022352482,0.0001685452,0.00053362,0.00012754828,0.00023533407,0.0005938063,0.00040286602,0.000016437107],"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.00004102832,0.00090669387,0.00714246,0.000081763465,0.0000898376,0.000001375731,0.0019307164,0.0023001097,0.010967416,0.8686523,0.025337685,0.08254861],"study_design_scores_gemma":[0.00025179103,0.00017302751,0.0008336877,0.00009895249,0.000022126698,0.0000028633988,0.000013874176,0.92857295,0.012484416,0.049269438,0.007997178,0.00027970647],"about_ca_topic_score_codex":0.00023821564,"about_ca_topic_score_gemma":0.002283771,"teacher_disagreement_score":0.9262728,"about_ca_system_score_codex":0.00008540093,"about_ca_system_score_gemma":0.00009612622,"threshold_uncertainty_score":0.9115078},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016055731,0.0000305428,0.9805384,0.0001357284,0.0009924984,0.00034777308,0.000003721207,0.0008362034,0.0010593577],"genre_scores_gemma":[0.57916516,0.0000018533241,0.42046243,0.00011001022,0.00004236936,0.00008097046,5.2904113e-7,0.000024365929,0.000112298665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795914,0.00012555165,0.00046011043,0.0006346879,0.00025020554,0.00057028607],"domain_scores_gemma":[0.9979584,0.0011523523,0.00014029657,0.00055436726,0.00011331255,0.00008124516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013050035,0.00024778894,0.00030074696,0.00041347614,0.00042633121,0.00019378467,0.00067101524,0.00013696469,0.000008650565],"category_scores_gemma":[0.00013743502,0.0002786339,0.00012147709,0.0007208137,0.000036388243,0.0005013199,0.000007942638,0.00036602348,0.000011574958],"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.00004259713,0.00026763135,0.0001649065,0.00016279671,0.00003281415,0.0000068524782,0.0015940256,0.107695736,0.048988685,0.0061121597,0.00013242997,0.83479935],"study_design_scores_gemma":[0.00043375965,0.000116770454,0.00003127666,0.00037921945,0.000014611292,0.000030077628,0.000055895234,0.89030474,0.10445277,0.0029625392,0.00087512506,0.00034318515],"about_ca_topic_score_codex":0.00014229954,"about_ca_topic_score_gemma":0.00007957921,"teacher_disagreement_score":0.8344562,"about_ca_system_score_codex":0.00015807485,"about_ca_system_score_gemma":0.000059765476,"threshold_uncertainty_score":0.99996656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019847648,0.00020941802,0.91599756,0.011799142,0.00015050024,0.00016907374,0.0000044553803,0.0015071809,0.050315034],"genre_scores_gemma":[0.83684003,0.000053358664,0.1622166,0.0006020499,0.000032596025,0.00006142348,0.000008428233,0.000012671669,0.00017285119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873775,0.00030028625,0.00020098044,0.00026487967,0.00025773825,0.00023836132],"domain_scores_gemma":[0.9969944,0.0003654923,0.00009724584,0.0023005637,0.00015798879,0.00008436257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684364,0.0001378064,0.00016365071,0.00011028986,0.00046694095,0.00015034505,0.0037854498,0.000068557085,0.00000991712],"category_scores_gemma":[0.000119945784,0.00014164184,0.00008405222,0.00038864935,0.0001697392,0.0003069743,0.0011139619,0.00032323596,0.00007509948],"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.0000021227504,0.000112272755,0.0011511646,0.00001017755,0.000016021397,6.329496e-7,0.003043066,0.0000024508956,0.0017006836,0.8205592,0.0015762453,0.17182596],"study_design_scores_gemma":[0.00031537344,0.00016364279,0.006735414,0.0001098506,0.000017265635,0.000060797072,0.00037719493,0.8707375,0.0031261274,0.03410376,0.0835828,0.00067027815],"about_ca_topic_score_codex":0.00029861426,"about_ca_topic_score_gemma":0.00027678785,"teacher_disagreement_score":0.87073505,"about_ca_system_score_codex":0.000083853585,"about_ca_system_score_gemma":0.00008724234,"threshold_uncertainty_score":0.70343703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037781617,0.0016128675,0.9910177,0.0021931801,0.00030761756,0.0003948963,0.0000037401223,0.00045770974,0.00023415509],"genre_scores_gemma":[0.70980424,0.0004499683,0.28846475,0.00049038266,0.0002339636,0.00016389404,0.0000011572048,0.00001737302,0.00037427855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.000034984787,0.0001258835,0.0002541821,0.0001437601,0.00020080125],"domain_scores_gemma":[0.99868655,0.00078651495,0.00006225721,0.00034427544,0.00008045018,0.000039952934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035361736,0.000107160464,0.00013738514,0.000051519768,0.00038228088,0.000064491134,0.00059266423,0.000047361616,0.0000011890103],"category_scores_gemma":[0.00009693545,0.00007248582,0.000052858446,0.00018614873,0.00007566795,0.00017943863,0.00014554312,0.00009936292,0.000004095322],"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.0001552331,0.00021569549,0.0010834215,0.000114124705,0.0002644483,0.00008321503,0.013833513,0.0001049273,0.0019521952,0.01251701,0.100587636,0.8690886],"study_design_scores_gemma":[0.002812081,0.00046326336,0.0032699113,0.00006883797,0.000060437098,0.0009259043,0.00017321545,0.9071824,0.0267435,0.019169321,0.03832727,0.0008038564],"about_ca_topic_score_codex":0.000057992445,"about_ca_topic_score_gemma":0.000007249826,"teacher_disagreement_score":0.9070775,"about_ca_system_score_codex":0.000011330876,"about_ca_system_score_gemma":0.000028607388,"threshold_uncertainty_score":0.29558858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012308426,0.00021465725,0.9535285,0.005399821,0.00036867312,0.00023173128,0.000003404452,0.0017406003,0.026204139],"genre_scores_gemma":[0.7872078,0.000020224565,0.21227221,0.00033244054,0.000011492274,0.00003057924,0.000006507522,0.000007460128,0.000111334644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.00018115967,0.00015488066,0.00016459676,0.00017154624,0.00014454269],"domain_scores_gemma":[0.9966113,0.00032043635,0.000076683835,0.0027510624,0.00015450713,0.0000860117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048795703,0.000082493105,0.00008094522,0.00011210517,0.00022591173,0.00012315229,0.0023540896,0.00004642535,0.0000015078471],"category_scores_gemma":[0.00055510213,0.00008690204,0.000036120524,0.000333809,0.000049345123,0.00040732897,0.000673072,0.00023679654,0.00013386579],"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.000011002072,0.0005096822,0.008699877,0.00000705066,0.000022624781,0.00000307088,0.008327764,0.00016393572,0.0063334606,0.8953758,0.05205972,0.028486004],"study_design_scores_gemma":[0.0011007148,0.00052856165,0.0068944017,0.00024134932,0.000020695308,0.00006175429,0.0006679057,0.70086056,0.009669105,0.1673915,0.111625835,0.00093760673],"about_ca_topic_score_codex":0.00022415991,"about_ca_topic_score_gemma":0.00019197351,"teacher_disagreement_score":0.7748993,"about_ca_system_score_codex":0.00012664412,"about_ca_system_score_gemma":0.0000580769,"threshold_uncertainty_score":0.43745235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11004806,0.0000057654806,0.81220466,0.0007571186,0.00057028234,0.00014606927,5.911229e-7,0.0008499192,0.07541753],"genre_scores_gemma":[0.7845098,0.0000018558437,0.2151323,0.00007939249,0.00000684758,0.0000051789075,1.4401526e-7,0.000003878119,0.00026065827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994007,0.000008234307,0.0001495108,0.00016054731,0.00014239344,0.00013866233],"domain_scores_gemma":[0.99934626,0.00004256496,0.000039107457,0.00046765033,0.00006034576,0.0000440583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025988265,0.00006687625,0.00009216234,0.0000874871,0.000027871665,0.000019611354,0.0007113669,0.00004941738,0.000031376585],"category_scores_gemma":[0.000025047346,0.000054146763,0.00006956164,0.00024808059,0.000032531072,0.00021420329,0.000054576307,0.00014334735,0.00000857917],"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.000001974726,0.000059090376,0.001854344,0.000013983888,0.0000064287415,0.0000027404697,0.00062129914,4.7462228e-7,0.09208473,0.81017524,0.0020105646,0.09316913],"study_design_scores_gemma":[0.000114511044,0.00011306409,0.0018998097,0.000010263245,0.0000031088473,0.000025607746,0.000014307249,0.0052487073,0.8660736,0.12238407,0.0039563854,0.00015657813],"about_ca_topic_score_codex":0.00011758488,"about_ca_topic_score_gemma":0.00019372893,"teacher_disagreement_score":0.77398884,"about_ca_system_score_codex":0.0000034863097,"about_ca_system_score_gemma":0.00002674342,"threshold_uncertainty_score":0.2208041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029449186,0.000021351874,0.9728414,0.0016177623,0.00011218476,0.00007668998,1.0724283e-7,0.0011615756,0.021224054],"genre_scores_gemma":[0.6427609,3.494183e-7,0.35557702,0.0007270416,0.000032199572,0.0000078055755,1.2596061e-7,0.0000035657565,0.0008909919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993721,0.000021950354,0.000103407576,0.00021751877,0.00012125211,0.00016371868],"domain_scores_gemma":[0.99946684,0.0000803214,0.000029163273,0.00032830672,0.000047320253,0.000048030117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012310504,0.00007768068,0.00006772317,0.00007347073,0.00005848982,0.000084900414,0.00050680264,0.000026577929,0.000041782838],"category_scores_gemma":[0.000046018486,0.000067925546,0.0000294435,0.00017753572,0.00001625117,0.00045260251,0.00013433395,0.00008313752,0.00019329265],"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.000005611185,0.00014649564,0.0002485126,0.000005357706,0.00002453337,0.000011104535,0.007890284,0.0036470098,0.0024214974,0.3590059,0.036780905,0.5898128],"study_design_scores_gemma":[0.00019621593,0.000119956174,0.0002886805,0.000022176879,0.0000031645368,0.000048747952,0.000056498244,0.96154654,0.021823281,0.010037744,0.005479036,0.00037796306],"about_ca_topic_score_codex":0.000011552858,"about_ca_topic_score_gemma":0.0000558992,"teacher_disagreement_score":0.9578995,"about_ca_system_score_codex":0.000044426288,"about_ca_system_score_gemma":0.000025032517,"threshold_uncertainty_score":0.27699235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014320706,0.0000014144794,0.98344934,0.00008543824,0.00044688518,0.00021043462,5.6511334e-7,0.00043566004,0.0010495688],"genre_scores_gemma":[0.4637346,3.313997e-7,0.53618264,0.000015915797,0.000019072659,0.000010839513,5.9454914e-7,0.0000043357577,0.00003163586],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993908,0.000012340657,0.00018001747,0.00018288205,0.00009729013,0.00013670605],"domain_scores_gemma":[0.9990006,0.0003813167,0.00010095248,0.00026892062,0.00021426195,0.00003393331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036303626,0.000066545785,0.00010003522,0.000076696546,0.00005464064,0.000035496978,0.00040669882,0.00005215995,0.000009066105],"category_scores_gemma":[0.0006238217,0.00006169759,0.000034197776,0.00015898762,0.00002380226,0.0002277974,0.00010269202,0.00009267338,0.0000012316648],"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.000015342881,0.00016832098,0.0029710042,0.00011352272,0.00001825069,0.0000023985726,0.002522117,0.014995573,0.64462984,0.0630281,0.0005349846,0.27100053],"study_design_scores_gemma":[0.00010902105,0.000020749501,0.00005465789,0.000009436514,0.000001482056,0.0000024296723,0.000013559766,0.7860611,0.21349712,0.00014403848,0.00002591954,0.000060494138],"about_ca_topic_score_codex":0.000020638985,"about_ca_topic_score_gemma":0.000019869864,"teacher_disagreement_score":0.77106553,"about_ca_system_score_codex":0.0000068486197,"about_ca_system_score_gemma":0.000024331306,"threshold_uncertainty_score":0.25159544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00934089,0.000019631605,0.97562885,0.0020362684,0.00013311525,0.00033116082,3.7449e-7,0.0015755976,0.010934116],"genre_scores_gemma":[0.37284926,0.0000013188284,0.6261691,0.00039968893,0.000062854444,0.000066366505,0.0000010621249,0.000008343682,0.00044204755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.000019649126,0.00021813966,0.0003177511,0.0001533716,0.00025861608],"domain_scores_gemma":[0.99918777,0.00012856716,0.000087473425,0.00044827073,0.00009511699,0.000052800064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045677027,0.00011655243,0.00012930406,0.00010216186,0.00010559965,0.00012432906,0.00063178927,0.000065427805,0.000013244522],"category_scores_gemma":[0.00013568971,0.00010854885,0.00007022322,0.00022086065,0.000011483507,0.00060699834,0.00013993916,0.00007930925,0.00004495171],"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.000013422583,0.00015020928,0.00089913467,0.00006857256,0.000020956375,0.0000013997096,0.0028781504,0.00025849903,0.024973957,0.11542109,0.015066328,0.8402483],"study_design_scores_gemma":[0.00022315969,0.000040146515,0.0002058679,0.000021821628,0.0000040990703,0.000012295979,0.000034725574,0.8484941,0.14196496,0.0052596503,0.003527178,0.0002120028],"about_ca_topic_score_codex":0.00002055873,"about_ca_topic_score_gemma":0.00006897009,"teacher_disagreement_score":0.8482356,"about_ca_system_score_codex":0.000092044414,"about_ca_system_score_gemma":0.00003523074,"threshold_uncertainty_score":0.44264936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026802953,0.00004828804,0.9718499,0.000071107715,0.00016040418,0.00032900833,0.0000038825515,0.0004636353,0.0002708124],"genre_scores_gemma":[0.8664448,0.0000019047129,0.13330162,0.00006419922,0.000018898349,0.00008809909,3.281879e-7,0.000021763057,0.00005836987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847335,0.00005947652,0.0003663368,0.00043442505,0.00034426828,0.0003221354],"domain_scores_gemma":[0.99885345,0.0002642178,0.00020339449,0.00029906924,0.00027900503,0.00010087297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021822914,0.00022457803,0.0002644395,0.00031927178,0.0003144863,0.0001244437,0.0005967978,0.000099029305,0.000038456623],"category_scores_gemma":[0.0000068214467,0.00022130563,0.00010258653,0.0005735171,0.000100426376,0.0010795034,0.000006900958,0.00036263082,0.000037657526],"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.0000415765,0.00035542986,0.000015669162,0.00010962387,0.000038967813,0.000008688861,0.0031174822,0.0806927,0.112697974,0.00003761322,0.000120816345,0.80276346],"study_design_scores_gemma":[0.0001962635,0.00028131416,0.00007940712,0.000396691,0.000016926764,0.00001865377,0.00019117583,0.86776125,0.13021933,0.0006020155,0.0000014038675,0.0002355965],"about_ca_topic_score_codex":0.00012544064,"about_ca_topic_score_gemma":0.00001328402,"teacher_disagreement_score":0.83964187,"about_ca_system_score_codex":0.000087834145,"about_ca_system_score_gemma":0.0001317133,"threshold_uncertainty_score":0.9024582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15829681,0.00004605698,0.8202718,0.0015401811,0.00035173917,0.0007408513,0.0000011312426,0.0031382502,0.0156131815],"genre_scores_gemma":[0.6760651,0.0000023771497,0.3175894,0.00077187817,0.000052002084,0.000113713795,0.0000026662303,0.000024418117,0.005378463],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980235,0.00011128571,0.00030757595,0.0006410427,0.0003600441,0.00055653905],"domain_scores_gemma":[0.9980862,0.00014275387,0.00013463794,0.0010931,0.00037526162,0.00016800268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039356423,0.00031834724,0.00033572628,0.00017246284,0.00019539581,0.00054779014,0.0013583718,0.00011019316,0.00034777314],"category_scores_gemma":[0.000091095106,0.0002124019,0.000069146634,0.000746351,0.000075116244,0.0012704224,0.00028933966,0.00030196266,0.0009182893],"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.00021115,0.0025914034,0.04736761,0.00062402885,0.00051944575,0.00029033452,0.013231252,0.005016012,0.18923412,0.043023072,0.53620356,0.161688],"study_design_scores_gemma":[0.0011159162,0.0011263834,0.017029075,0.00023261238,0.000025275696,0.00010199498,0.00024736725,0.5613364,0.40485457,0.008873665,0.0035354549,0.0015212634],"about_ca_topic_score_codex":0.0022908666,"about_ca_topic_score_gemma":0.00047124267,"teacher_disagreement_score":0.5563204,"about_ca_system_score_codex":0.0000621837,"about_ca_system_score_gemma":0.0001458481,"threshold_uncertainty_score":0.99985963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034370269,0.002347841,0.99074125,0.00039849573,0.0007724089,0.00034422567,9.25532e-7,0.0003038063,0.0016540425],"genre_scores_gemma":[0.66858166,0.00007757739,0.33046374,0.0005036585,0.00026166072,0.000010889259,3.6263734e-7,0.000030300938,0.000070167494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997272,0.00009296215,0.0007919067,0.00047963948,0.0005878319,0.00077561825],"domain_scores_gemma":[0.9978161,0.00076549134,0.00062105997,0.00024350945,0.00035565803,0.00019818287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039174813,0.00031044037,0.00034439913,0.00057329505,0.000422762,0.00038738077,0.0012604995,0.000105845844,0.00000820151],"category_scores_gemma":[0.00030920858,0.00027267422,0.0001115724,0.0008274477,0.00006745247,0.0024963184,0.0000955553,0.0007826345,0.000007152895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045747423,0.00026010093,0.000311592,0.000082186576,0.000009017001,0.00030214485,0.0015434489,0.022476595,0.0053819264,0.0020675813,0.0002000571,0.96690786],"study_design_scores_gemma":[0.004269333,0.008794587,0.000365631,0.0045622573,0.000028161638,0.002909115,0.00085526815,0.42503843,0.3302324,0.18785821,0.03258127,0.002505312],"about_ca_topic_score_codex":5.802882e-7,"about_ca_topic_score_gemma":0.000006366083,"teacher_disagreement_score":0.96440256,"about_ca_system_score_codex":0.00027041405,"about_ca_system_score_gemma":0.00017658524,"threshold_uncertainty_score":0.9999725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064958804,0.000011675721,0.9764671,0.000022760438,0.00020776203,0.00015914586,4.6469447e-7,0.0007294118,0.015905797],"genre_scores_gemma":[0.48108506,0.0000029038445,0.518822,0.000025603753,0.000006995617,0.000006390165,5.631486e-7,0.0000058414857,0.000044628363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911815,0.00004430237,0.00024878007,0.00025801116,0.00015243304,0.00017834047],"domain_scores_gemma":[0.99905676,0.00006722555,0.000121062396,0.0005270723,0.00017202253,0.000055859527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021017042,0.00010827252,0.00015000186,0.00011674713,0.000034784207,0.000018954328,0.0006652441,0.000064756394,0.00011192281],"category_scores_gemma":[0.0000969544,0.000097520686,0.0000437137,0.00027812165,0.000050844974,0.0003443649,0.00018896694,0.00007958409,0.000026440412],"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.00015128878,0.0034061521,0.02481397,0.00024217286,0.00021278138,0.0001431398,0.057581365,0.02359324,0.065986104,0.11216921,0.00260304,0.7090975],"study_design_scores_gemma":[0.00015712285,0.0000847802,0.00073902245,0.000013391644,0.0000033394906,0.000007477668,0.00003275754,0.7653895,0.23313007,0.00031268038,0.000007886283,0.00012200081],"about_ca_topic_score_codex":0.00018974324,"about_ca_topic_score_gemma":0.000020924828,"teacher_disagreement_score":0.74179626,"about_ca_system_score_codex":0.000024836023,"about_ca_system_score_gemma":0.00004079139,"threshold_uncertainty_score":0.3976778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087023,0.000040568306,0.903038,0.0010492329,0.00030569098,0.00015383011,0.000001221622,0.0010183256,0.007370119],"genre_scores_gemma":[0.63815117,0.0000016592169,0.3601439,0.0014291577,0.000038130984,0.0000066496036,6.1172807e-7,0.000009344935,0.00021938598],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.000028676717,0.00014522496,0.00035750575,0.00024398354,0.00033320708],"domain_scores_gemma":[0.9989084,0.00015125705,0.000059423965,0.00067206303,0.00006515678,0.00014368123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047454817,0.0001492943,0.00013319233,0.00011179955,0.00009129096,0.00007739037,0.00036644022,0.000043848235,0.000017522823],"category_scores_gemma":[0.00012352533,0.00012671178,0.00003714307,0.00017841897,0.000033489778,0.00038901425,0.00022979389,0.0001544104,0.000059927832],"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.00011764787,0.0022994548,0.032167602,0.0001261716,0.00003608749,0.00004073993,0.001207824,0.00010702837,0.6232186,0.10929455,0.06529792,0.16608636],"study_design_scores_gemma":[0.0006856281,0.00029189544,0.025984306,0.0001419346,0.0000070662845,0.00014235378,0.000021190966,0.7416558,0.2230849,0.00067417393,0.0067056655,0.00060504465],"about_ca_topic_score_codex":0.00004659738,"about_ca_topic_score_gemma":0.0000081282005,"teacher_disagreement_score":0.74154884,"about_ca_system_score_codex":0.000037390826,"about_ca_system_score_gemma":0.000025649866,"threshold_uncertainty_score":0.51671565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20995432,0.000009389553,0.7858573,0.0010855828,0.00025307672,0.00035311602,0.000001196352,0.0017131272,0.00077288516],"genre_scores_gemma":[0.51507354,6.1500293e-7,0.48429388,0.0005275473,0.00002302735,0.000031337702,0.0000013510862,0.0000086875825,0.000040036684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841917,0.000048206362,0.00028586446,0.0006108107,0.00023806543,0.00039786022],"domain_scores_gemma":[0.9982662,0.00032007793,0.00009511492,0.00094433734,0.0002616513,0.00011259875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994264,0.0001846156,0.00023137552,0.0001078306,0.00025144056,0.00016045182,0.0008770683,0.00011875734,0.0000062113163],"category_scores_gemma":[0.0005214453,0.00017531007,0.0001445503,0.0003332312,0.00006407975,0.00040745395,0.0002114785,0.00019631773,0.000029358971],"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.00014562886,0.0018709336,0.023876972,0.00071352883,0.00006125923,0.000046430174,0.0016216313,0.009202098,0.08829566,0.8385367,0.0052467785,0.030382412],"study_design_scores_gemma":[0.0007780004,0.00021747909,0.0011758492,0.00010426943,0.000009441499,0.000008921027,0.000028891785,0.11226076,0.7969721,0.087523215,0.00047012558,0.00045094005],"about_ca_topic_score_codex":0.0001827341,"about_ca_topic_score_gemma":0.00022270808,"teacher_disagreement_score":0.75101346,"about_ca_system_score_codex":0.0002068772,"about_ca_system_score_gemma":0.00022078598,"threshold_uncertainty_score":0.7148937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073192706,0.000066370696,0.98150504,0.0014451512,0.00026684155,0.00050921296,0.0000022466695,0.0010190514,0.007866797],"genre_scores_gemma":[0.6003906,0.000003344162,0.39531282,0.00041842688,0.00004548477,0.00013348475,0.0000038060111,0.000011627568,0.0036803866],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902105,0.000028212195,0.00018041133,0.00033768947,0.00015443595,0.00027822162],"domain_scores_gemma":[0.99889964,0.00020833667,0.00008395005,0.00044152775,0.00029755844,0.000069001755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018890272,0.00011889372,0.00012990258,0.00008362871,0.00015544919,0.00026939381,0.0006399736,0.00006617201,0.00013663704],"category_scores_gemma":[0.00011178342,0.00010416324,0.000056468554,0.00021141842,0.00002103393,0.00095529563,0.00013366873,0.00007094171,0.00013436114],"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.000015202856,0.00020335257,0.041552726,0.00017170353,0.00006442179,0.0000033728293,0.0016207568,0.00046398037,0.035096552,0.14780919,0.5073545,0.26564422],"study_design_scores_gemma":[0.00039178669,0.00017403236,0.0041694827,0.00006445488,0.0000089387895,0.000008240978,0.000066942834,0.7696683,0.1584444,0.045265704,0.021162104,0.0005756238],"about_ca_topic_score_codex":0.0007401019,"about_ca_topic_score_gemma":0.00017233608,"teacher_disagreement_score":0.7692043,"about_ca_system_score_codex":0.000053660282,"about_ca_system_score_gemma":0.000047208563,"threshold_uncertainty_score":0.42476535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07244778,0.00018338348,0.91911894,0.005215768,0.00065342674,0.0007385684,0.0000018199308,0.00067965256,0.00096067536],"genre_scores_gemma":[0.81607485,0.000021591022,0.18271348,0.00047908246,0.00007048175,0.00020281854,0.0000010051814,0.000017118067,0.00041960075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986293,0.000027758055,0.00024016136,0.0005237651,0.00016379791,0.00041525182],"domain_scores_gemma":[0.998756,0.00016065511,0.00017928432,0.00062682334,0.00014885697,0.00012839654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025737105,0.00018686672,0.00020491745,0.00008655974,0.0002575085,0.0004845056,0.0007840339,0.00007618408,0.000018263852],"category_scores_gemma":[0.000094263385,0.00016748278,0.00006285856,0.00007730533,0.000045173536,0.0009359246,0.0005962641,0.00009806163,0.000017850924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102736725,0.00063809834,0.05365954,0.000860252,0.00013359351,0.00006427228,0.008454252,0.000010572681,0.031368565,0.08831525,0.20219451,0.6141983],"study_design_scores_gemma":[0.0016005056,0.0010591134,0.010949566,0.00060682424,0.000026773268,0.000058775637,0.0008970231,0.53782445,0.028395196,0.4114292,0.0057120835,0.001440502],"about_ca_topic_score_codex":0.0001258392,"about_ca_topic_score_gemma":0.000063306776,"teacher_disagreement_score":0.7436271,"about_ca_system_score_codex":0.000057967878,"about_ca_system_score_gemma":0.000018092434,"threshold_uncertainty_score":0.682975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20838034,0.00014357164,0.78394854,0.005072972,0.00023121608,0.00068954634,5.9972774e-7,0.0006804889,0.00085270696],"genre_scores_gemma":[0.97318953,0.00006293065,0.024991196,0.00046982124,0.000037685426,0.00012917424,5.494071e-7,0.00000930736,0.0011098213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992111,0.00003834046,0.0001618222,0.00026147225,0.000100923215,0.00022638794],"domain_scores_gemma":[0.9991939,0.0002657148,0.00004993528,0.00031898412,0.000110947905,0.00006050187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039058866,0.00011725348,0.00010086432,0.000039292037,0.0002254477,0.0001489004,0.0005794952,0.000051098144,0.000022555954],"category_scores_gemma":[0.000021868304,0.000069931084,0.000033837776,0.0001659487,0.000021304702,0.00047077032,0.000062716164,0.00010132191,0.000029064533],"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.00004059607,0.0001091191,0.0007519411,0.00016882549,0.00004145345,0.0000013257845,0.0067308345,0.0000794966,0.09243206,0.019784816,0.048788577,0.83107096],"study_design_scores_gemma":[0.00019482261,0.00020496498,0.0026873853,0.000026200782,0.0000049444816,0.000009904679,0.000038891914,0.92071927,0.06743258,0.0012374903,0.0072941217,0.00014945143],"about_ca_topic_score_codex":0.00004431267,"about_ca_topic_score_gemma":0.000009072357,"teacher_disagreement_score":0.92063975,"about_ca_system_score_codex":0.000012518175,"about_ca_system_score_gemma":0.000021794543,"threshold_uncertainty_score":0.2851707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06911885,0.000034314126,0.92068416,0.00041435304,0.00040644075,0.00023826332,7.601987e-7,0.0007930063,0.008309836],"genre_scores_gemma":[0.74598485,0.0000027947692,0.2530241,0.00027359225,0.00016582069,0.000026347263,0.00000519631,0.000017012706,0.00050025916],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987931,0.000054754964,0.0001942876,0.00036305675,0.00029818923,0.00029655843],"domain_scores_gemma":[0.99911916,0.0000987737,0.000105200146,0.0004701104,0.00013688247,0.00006989913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062640273,0.00016826035,0.00013510972,0.00021501933,0.00010896524,0.0001632,0.00044036366,0.00010369208,0.00003809227],"category_scores_gemma":[0.00008223855,0.00012565487,0.000042069754,0.00053321646,0.000037128146,0.00042044424,0.00008404816,0.00026500833,0.000028387303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019388567,0.00018597607,0.0023693112,0.000030771258,0.00003365156,0.000098051285,0.009447294,0.0001364745,0.04159966,0.021783194,0.0049276,0.9191941],"study_design_scores_gemma":[0.0015681059,0.0019280617,0.012481684,0.0005012495,0.000045110228,0.00047950147,0.00040532474,0.045529783,0.8773005,0.033619277,0.024569908,0.0015715227],"about_ca_topic_score_codex":0.00021822873,"about_ca_topic_score_gemma":0.0030396737,"teacher_disagreement_score":0.9176226,"about_ca_system_score_codex":0.000095298914,"about_ca_system_score_gemma":0.000057445697,"threshold_uncertainty_score":0.5124057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0347483,0.0004531043,0.96220005,0.00014096232,0.0019645605,0.00020130901,7.283142e-7,0.00015352789,0.00013746411],"genre_scores_gemma":[0.89624596,6.549783e-7,0.10280624,0.000024596553,0.00084616116,0.000011511641,1.5052653e-7,0.000022149012,0.000042550317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982432,0.000039944367,0.00073847605,0.00021131155,0.00045656334,0.00031046342],"domain_scores_gemma":[0.9972026,0.00036691397,0.0011235924,0.00018444285,0.0010038108,0.00011867969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002031,0.00017347638,0.00036458301,0.0002917902,0.0002947133,0.000780126,0.00097124366,0.000107187465,0.00000141628],"category_scores_gemma":[0.00033792507,0.00014309179,0.00013819043,0.00029767133,0.000047465353,0.0014361383,0.00006136359,0.0005019248,0.0000010532432],"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.00012777829,0.00019676228,0.0008899049,0.0012976847,0.000106756204,0.000085896914,0.0082050655,0.006102946,0.25803736,0.008739293,0.001758492,0.7144521],"study_design_scores_gemma":[0.0008798187,0.0007730626,0.00010782243,0.002474557,0.00007342366,0.004653492,0.00083351927,0.9465335,0.032604612,0.009105182,0.0013286201,0.00063240033],"about_ca_topic_score_codex":0.0000047347685,"about_ca_topic_score_gemma":0.0000058098785,"teacher_disagreement_score":0.9404305,"about_ca_system_score_codex":0.000061297374,"about_ca_system_score_gemma":0.00028948503,"threshold_uncertainty_score":0.7522773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041564826,0.0025202977,0.95494527,0.00010012163,0.000518137,0.00022394242,0.000004740354,0.000049056405,0.000073632946],"genre_scores_gemma":[0.9630845,0.0000064550663,0.036524385,0.00001917015,0.0003206801,0.000008755395,0.0000013998956,0.000013357799,0.000021264239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983659,0.000091779875,0.0007579732,0.000114760165,0.00042716207,0.00024243908],"domain_scores_gemma":[0.9969262,0.00017523098,0.0018308774,0.000113330025,0.0008698066,0.00008455214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015494078,0.00011969189,0.00029451004,0.00023250446,0.0001240928,0.0001386269,0.00044547347,0.000060184477,0.0000028001768],"category_scores_gemma":[0.00005108872,0.000102966675,0.00009886803,0.00025405717,0.00002462487,0.001730922,0.000032490017,0.00011673858,5.076065e-7],"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.00024094294,0.00043462854,0.21751466,0.0050821886,0.00034023076,0.000010533422,0.03044173,0.005183844,0.24059746,0.007273211,0.008927325,0.48395327],"study_design_scores_gemma":[0.004712107,0.0031201509,0.012570734,0.007407782,0.00044409605,0.0010381279,0.018471237,0.30856323,0.628756,0.003866968,0.0092696175,0.0017799734],"about_ca_topic_score_codex":0.000079787285,"about_ca_topic_score_gemma":0.000007487356,"teacher_disagreement_score":0.9215197,"about_ca_system_score_codex":0.00012552988,"about_ca_system_score_gemma":0.0002325282,"threshold_uncertainty_score":0.4198859},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33067587,0.0003207686,0.58451533,0.08044262,0.00024034583,0.0004411426,0.0000012595716,0.00054121064,0.0028214746],"genre_scores_gemma":[0.7550795,0.00003803184,0.24171136,0.0030943423,0.000011558248,0.000047529753,9.932187e-7,0.00000844613,0.000008212854],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988329,0.00039979295,0.00026261195,0.00015706693,0.00016687693,0.00018076343],"domain_scores_gemma":[0.9949432,0.00081080536,0.00017379601,0.003928918,0.00011145432,0.000031803553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276391,0.000100629586,0.000115012794,0.00009022461,0.00030250233,0.00010664134,0.0047635194,0.000034985875,0.000005343904],"category_scores_gemma":[0.0001224241,0.00008021966,0.00007026523,0.0004302812,0.00027260094,0.0005165646,0.00061670394,0.00025962348,0.000048639544],"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.000005483642,0.00033754023,0.03041721,0.00004025685,0.00017077551,0.0000020295631,0.015936842,0.0003274723,0.7090913,0.049125217,0.10692165,0.08762419],"study_design_scores_gemma":[0.00187179,0.0003955623,0.13628383,0.00094686414,0.00018098258,0.0007015371,0.0030432951,0.4754778,0.23125233,0.05692336,0.08908021,0.0038424456],"about_ca_topic_score_codex":0.0023030804,"about_ca_topic_score_gemma":0.0000786061,"teacher_disagreement_score":0.477839,"about_ca_system_score_codex":0.00004836024,"about_ca_system_score_gemma":0.000031171923,"threshold_uncertainty_score":0.88518834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006963098,0.000032246797,0.9871811,0.0024470482,0.00037685252,0.0009040858,0.000024305433,0.0017450941,0.0003261243],"genre_scores_gemma":[0.9045299,0.000035534613,0.09465093,0.000109649685,0.000018554909,0.0005111089,0.000007366872,0.000031840613,0.00010510949],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805266,0.00036819797,0.0004963642,0.00041246007,0.00029166308,0.00037868536],"domain_scores_gemma":[0.99638903,0.00024933318,0.00022665423,0.002687484,0.0003108846,0.00013661306],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038846306,0.00025839423,0.0002491797,0.0003612815,0.001386821,0.00028821515,0.0016962332,0.000151604,0.00002914939],"category_scores_gemma":[0.000030165684,0.00027733855,0.0001672522,0.00096830964,0.00016517562,0.00084811274,0.00004210693,0.0007628537,0.00012252653],"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.000056386012,0.0050286874,0.000062637664,0.00020561967,0.00058313867,0.0000068936283,0.014920521,0.30331358,0.34534773,0.011141585,0.0023006266,0.31703258],"study_design_scores_gemma":[0.00020093174,0.00011424547,0.00007287542,0.00013042001,0.000028584449,0.00003339876,0.00026309513,0.9537328,0.042420775,0.0022028629,0.0004436559,0.0003563726],"about_ca_topic_score_codex":0.001763672,"about_ca_topic_score_gemma":0.00027767298,"teacher_disagreement_score":0.8975668,"about_ca_system_score_codex":0.00032323773,"about_ca_system_score_gemma":0.000095889365,"threshold_uncertainty_score":0.9999679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009544838,0.000007758334,0.98155344,0.000144775,0.00024957358,0.00044676382,0.0000019336376,0.0010705304,0.0069804],"genre_scores_gemma":[0.65355355,7.47929e-7,0.34579024,0.0002111645,0.000012888281,0.00009919148,9.549235e-7,0.000011030233,0.00032024505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991522,0.000019733372,0.0001329124,0.0003338839,0.00014149406,0.000219764],"domain_scores_gemma":[0.999144,0.00010281511,0.00008728674,0.00042568104,0.00018318444,0.000057035373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020653,0.000117312855,0.00010696635,0.00009524722,0.0000857953,0.00008672985,0.000877974,0.0000472471,0.000021667352],"category_scores_gemma":[0.00006144393,0.00009097514,0.000037073212,0.00020584621,0.000021641405,0.0008329512,0.00014682776,0.000061733874,0.000009931435],"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.0024472722,0.0034960795,0.053910106,0.0004102467,0.00055804057,0.000103855215,0.22800387,0.0012529908,0.013063443,0.40944454,0.09988229,0.18742727],"study_design_scores_gemma":[0.0015321815,0.0016235327,0.0095098335,0.00008726482,0.00001547086,0.000031147298,0.00049994164,0.7407946,0.224538,0.017527949,0.0029130352,0.00092706183],"about_ca_topic_score_codex":0.0001807867,"about_ca_topic_score_gemma":0.00038997387,"teacher_disagreement_score":0.7395416,"about_ca_system_score_codex":0.000023811903,"about_ca_system_score_gemma":0.00004268581,"threshold_uncertainty_score":0.37098584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067589683,0.000015384034,0.9805938,0.00043219776,0.00026581995,0.000052922813,1.12365925e-7,0.002930939,0.008949844],"genre_scores_gemma":[0.3824601,4.2861194e-7,0.6163122,0.0008609417,0.000038985883,0.000004422556,3.4142428e-7,0.0000068392765,0.0003157315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913806,0.000062530125,0.00013586991,0.00028461483,0.00015838657,0.00022056205],"domain_scores_gemma":[0.99917233,0.00012680342,0.00004648298,0.000538929,0.000053428415,0.00006204101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040664652,0.000095709904,0.00009092327,0.00006958257,0.00013433727,0.00012975319,0.0007130548,0.00004590021,0.000017396937],"category_scores_gemma":[0.0003231094,0.000087100605,0.000042727166,0.00019308185,0.0000140824495,0.00028338414,0.00022724626,0.00009983597,0.00006762852],"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.0000012304698,0.00005211386,0.025782283,0.000019777932,0.000015558244,0.000006821646,0.0011123136,0.0003131433,0.009273954,0.23330149,0.021040015,0.7090813],"study_design_scores_gemma":[0.00023703296,0.0002025348,0.0020046593,0.00004205039,0.0000056015133,0.000060721784,0.000030894724,0.83083713,0.11541158,0.027842741,0.022591466,0.00073356484],"about_ca_topic_score_codex":0.00009670403,"about_ca_topic_score_gemma":0.00006301106,"teacher_disagreement_score":0.830524,"about_ca_system_score_codex":0.000025989579,"about_ca_system_score_gemma":0.000027069984,"threshold_uncertainty_score":0.35518596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06729572,0.000054695778,0.9190736,0.0042924667,0.0014138641,0.0006874328,0.000010964449,0.00080561585,0.0063656336],"genre_scores_gemma":[0.84400827,0.0000075444173,0.15508239,0.00049634743,0.00019221981,0.000070082846,0.0000013866014,0.00002165895,0.00012009152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975671,0.00018528136,0.0004463864,0.00067343353,0.0005743656,0.0005534427],"domain_scores_gemma":[0.99691856,0.00029730858,0.00024349529,0.0021002942,0.00023470251,0.00020563335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016835928,0.000353341,0.00046439603,0.00018451772,0.0001292135,0.00016416208,0.0037119812,0.00033836198,0.000010048309],"category_scores_gemma":[0.00032154162,0.0002503726,0.00022335046,0.00033876332,0.00012009718,0.00019411038,0.0059120245,0.0011824135,0.000038255876],"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.00008169506,0.00086707424,0.002565495,0.00074857514,0.00035009868,0.000036815316,0.04898396,0.0011533372,0.020133063,0.8909731,0.009351939,0.024754846],"study_design_scores_gemma":[0.00081366743,0.0014311434,0.016336821,0.0030514211,0.00033461282,0.00060730753,0.001021554,0.15276298,0.58993083,0.22403684,0.0034356841,0.006237126],"about_ca_topic_score_codex":0.00053758617,"about_ca_topic_score_gemma":0.0001019035,"teacher_disagreement_score":0.77671254,"about_ca_system_score_codex":0.00012208313,"about_ca_system_score_gemma":0.000107606,"threshold_uncertainty_score":0.9999949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3715866,0.00014132666,0.6255681,0.00093351374,0.00004428647,0.0004969353,0.000020322648,0.0002469079,0.00096198893],"genre_scores_gemma":[0.8980454,0.000114393806,0.101665184,0.00009386019,0.000011035943,0.000021945412,0.00003251054,0.000007697828,0.000007927779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979362,0.00010984951,0.00083695276,0.00022468796,0.00067919533,0.00021314344],"domain_scores_gemma":[0.9976746,0.0004407174,0.00090190605,0.00047215648,0.0004380286,0.00007261211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058356335,0.00022601751,0.00030552343,0.00020340091,0.00018741492,0.00012031886,0.00073385093,0.00012877469,0.000025724583],"category_scores_gemma":[0.000081464954,0.00015241686,0.00008072246,0.00060559437,0.00013649986,0.0020588678,0.000054706037,0.0002654746,0.000010430475],"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.0020112118,0.0016021376,0.045634493,0.00673477,0.00040049473,0.0000059827516,0.10679523,0.02263333,0.055620473,0.12294967,0.005175645,0.63043654],"study_design_scores_gemma":[0.0021865475,0.0008003729,0.023878487,0.004068994,0.00009729722,0.000025709158,0.001417832,0.32711646,0.61369026,0.023898104,0.0018489383,0.0009710036],"about_ca_topic_score_codex":0.0002598132,"about_ca_topic_score_gemma":0.000047366837,"teacher_disagreement_score":0.6294656,"about_ca_system_score_codex":0.000052712232,"about_ca_system_score_gemma":0.00011057094,"threshold_uncertainty_score":0.6215379},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056472942,0.00008657927,0.9405688,0.00051362935,0.00036523148,0.00028906908,0.000016734464,0.0005653257,0.0011216877],"genre_scores_gemma":[0.6789226,0.00011311443,0.3207502,0.00008826869,0.000008058245,0.0000209287,0.0000026242915,0.00001361996,0.0000806118],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981444,0.0002174305,0.0005936834,0.00038134347,0.00036978166,0.0002933998],"domain_scores_gemma":[0.9942519,0.001572474,0.00023055664,0.0034236747,0.00040601572,0.00011538632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347715,0.00021087189,0.00029311524,0.00041373036,0.0007168492,0.000094251605,0.0023435454,0.00009786672,0.000013563526],"category_scores_gemma":[0.000060450737,0.00022824023,0.00019319665,0.0006570068,0.00022397659,0.00053284824,0.00004473422,0.00060783897,0.00003320197],"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.00023876654,0.0050681247,0.00091447006,0.00011371848,0.0003839657,0.000035262678,0.011550117,0.0031643007,0.124180935,0.05826888,0.0022695907,0.79381186],"study_design_scores_gemma":[0.00045995633,0.00021287547,0.0022601446,0.00039897586,0.000050455485,0.000068542206,0.00015959702,0.07134797,0.9099699,0.013669494,0.00090037356,0.0005016959],"about_ca_topic_score_codex":0.00013474179,"about_ca_topic_score_gemma":0.0005064646,"teacher_disagreement_score":0.79331017,"about_ca_system_score_codex":0.00016056368,"about_ca_system_score_gemma":0.0000840175,"threshold_uncertainty_score":0.93073666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05309851,0.000004000547,0.89153767,0.0004303356,0.00006414176,0.00013677601,9.815382e-7,0.00022914042,0.05449848],"genre_scores_gemma":[0.8075189,5.126574e-7,0.1917028,0.0004373906,0.00001409081,0.000002867571,0.0000026806622,0.0000064533724,0.0003142829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877006,0.00009632443,0.00025070892,0.00033763563,0.0002930026,0.000252259],"domain_scores_gemma":[0.9985108,0.00044131212,0.00008816941,0.00076969876,0.0001162569,0.00007379088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795075,0.00012996171,0.00015453194,0.00015191849,0.00008236933,0.00006639188,0.0010234675,0.000071266964,0.000013340144],"category_scores_gemma":[0.00012509542,0.00008323159,0.00006802671,0.0005462113,0.00009859813,0.00020715613,0.00015556667,0.00021101935,0.000004761784],"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.000007952961,0.00013223842,0.0010042965,0.0000028985303,0.000011568519,0.0000039479087,0.0007221434,0.00004558493,0.00004215591,0.9914166,0.00065756537,0.005953068],"study_design_scores_gemma":[0.000057399284,0.00025457688,0.0015511187,0.00000915139,0.000005027223,0.000010725477,0.00031477402,0.98294485,0.0031559526,0.011542816,0.000022239996,0.0001313611],"about_ca_topic_score_codex":0.000064895015,"about_ca_topic_score_gemma":0.00030660146,"teacher_disagreement_score":0.98289925,"about_ca_system_score_codex":0.000074323994,"about_ca_system_score_gemma":0.000033251097,"threshold_uncertainty_score":0.33940858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40186328,0.0000055925707,0.59501004,0.00008224857,0.0002456876,0.00027073207,4.1062842e-7,0.00035974613,0.0021622384],"genre_scores_gemma":[0.8596981,2.865901e-7,0.14004575,0.00014823569,0.000013356971,0.000040854135,4.195959e-7,0.000019942223,0.000033018878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981194,0.0000745927,0.0004833647,0.0005041869,0.00040660173,0.00041186364],"domain_scores_gemma":[0.99863553,0.00026269036,0.00020737833,0.0007127047,0.00009479487,0.00008688318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045719038,0.0002185764,0.00028349026,0.00035076917,0.000077467,0.000085545296,0.0009874193,0.00009207339,0.00006954523],"category_scores_gemma":[0.0003028908,0.00021060281,0.00008242489,0.00048385968,0.00003308433,0.00044183587,0.00037092366,0.00026310392,0.000032169963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044761542,0.0012002409,0.07519893,0.0002792962,0.000050621722,0.00007908933,0.003436174,0.60013044,0.123197295,0.010359961,0.00041507572,0.18560809],"study_design_scores_gemma":[0.00026525548,0.00012374249,0.0033896463,0.00037927178,0.0000029499467,0.000007851169,0.00006930413,0.9285193,0.0665476,0.00043464164,9.636383e-7,0.00025943533],"about_ca_topic_score_codex":0.0009624292,"about_ca_topic_score_gemma":0.00055990746,"teacher_disagreement_score":0.45783487,"about_ca_system_score_codex":0.00026270436,"about_ca_system_score_gemma":0.00011541346,"threshold_uncertainty_score":0.85881335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055490393,0.0000050157055,0.9418857,0.00018765853,0.00014343747,0.00011076781,2.937352e-7,0.00036428514,0.0018124582],"genre_scores_gemma":[0.8817321,3.3560946e-7,0.118019834,0.00014737691,0.00001776807,0.00001275029,5.4998156e-7,0.0000054575758,0.00006384287],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992306,0.000046731413,0.00019848936,0.00020028825,0.00017463168,0.0001492275],"domain_scores_gemma":[0.9992709,0.00011247445,0.00009717671,0.00039401234,0.0000895778,0.000035823683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033152723,0.00007516312,0.00010623195,0.00009231991,0.000036310495,0.00002904207,0.00047848598,0.000027436505,0.000034126653],"category_scores_gemma":[0.00003845934,0.00006849122,0.000035076748,0.00019449579,0.000016363596,0.00018597761,0.00016086322,0.00005137022,0.000014336626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005173468,0.00008498455,0.003430401,0.00003895422,0.000022445567,9.995773e-7,0.0026690527,0.0003744843,0.011803282,0.20805714,0.0033855261,0.77012753],"study_design_scores_gemma":[0.0010659543,0.00078147894,0.02703073,0.00007737036,0.000025789157,0.000037777667,0.0005692567,0.2611951,0.64623094,0.06129168,0.00093528256,0.0007586632],"about_ca_topic_score_codex":0.00023667257,"about_ca_topic_score_gemma":0.00024046472,"teacher_disagreement_score":0.8262417,"about_ca_system_score_codex":0.000021105954,"about_ca_system_score_gemma":0.000029995865,"threshold_uncertainty_score":0.2792991},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45141008,0.00003672093,0.50803876,0.00039586882,0.00068226614,0.00024001431,0.0000020307598,0.0010900625,0.038104206],"genre_scores_gemma":[0.92201793,0.0000074728523,0.077225186,0.00014299812,0.000010471733,0.0000057105303,3.0240236e-7,0.000007850605,0.00058207556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929523,0.000027808925,0.00014750441,0.00024583205,0.0001292322,0.00015436811],"domain_scores_gemma":[0.99935716,0.000044304517,0.000069374495,0.00042244178,0.000056692727,0.000050042756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017839685,0.00010163419,0.0001293143,0.00012231834,0.000036371337,0.000018935021,0.0004505071,0.000051733656,0.000017535262],"category_scores_gemma":[0.000046560337,0.00008596995,0.000028281975,0.00017585864,0.000048423386,0.0001777747,0.00021115266,0.00008278858,0.000009091975],"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.000049479713,0.0005819922,0.019013792,0.00011395911,0.000073998686,0.000060680362,0.020831399,0.000034497396,0.002321739,0.84191096,0.0039704093,0.11103707],"study_design_scores_gemma":[0.00060119247,0.0026281888,0.019488622,0.00029393114,0.000029558021,0.00011324695,0.000888971,0.3994692,0.49051738,0.08434461,0.0004175302,0.0012075846],"about_ca_topic_score_codex":0.00036729185,"about_ca_topic_score_gemma":0.0002220442,"teacher_disagreement_score":0.7575664,"about_ca_system_score_codex":0.000021273889,"about_ca_system_score_gemma":0.0000181774,"threshold_uncertainty_score":0.35057527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27201393,0.000013876833,0.7260807,0.00016531296,0.0002024083,0.00060553395,4.737101e-7,0.0004882272,0.00042951774],"genre_scores_gemma":[0.67148346,0.0000012963725,0.32811728,0.00006204298,0.00001389422,0.0001246338,5.472742e-7,0.000012253068,0.00018459307],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985341,0.000055684905,0.00037557562,0.00038504976,0.00029480652,0.00035480122],"domain_scores_gemma":[0.99871427,0.00024645124,0.00021545698,0.0005139463,0.0002300725,0.00007977618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869347,0.00014945575,0.00022054155,0.0001956844,0.0001256821,0.00009796298,0.0005997666,0.00009764022,0.000025087193],"category_scores_gemma":[0.00030917278,0.00014343641,0.00009648933,0.00033234025,0.000037890775,0.0007259314,0.00018845689,0.00012247066,0.000018589206],"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.00002226142,0.00033998862,0.049436193,0.00015724926,0.00006309219,0.0000010146687,0.00162504,0.00091516814,0.8661698,0.004285693,0.0024080966,0.074576415],"study_design_scores_gemma":[0.0003550759,0.00024262628,0.004536756,0.00007027732,0.000007184609,0.0000035838975,0.00027946805,0.5096778,0.4810048,0.0034942653,0.00009954961,0.00022859682],"about_ca_topic_score_codex":0.002483867,"about_ca_topic_score_gemma":0.0002474428,"teacher_disagreement_score":0.50876266,"about_ca_system_score_codex":0.00011422292,"about_ca_system_score_gemma":0.000040249477,"threshold_uncertainty_score":0.5849167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012088005,0.000088151326,0.9939809,0.0011455785,0.00019513078,0.00066321716,0.0000022489664,0.0011011906,0.002702719],"genre_scores_gemma":[0.18382342,0.000012486861,0.81559455,0.00022037096,0.000110684836,0.00017311443,0.000020455396,0.000021753569,0.00002314335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983155,0.00031040213,0.00038723118,0.0003761035,0.0003164375,0.0002943403],"domain_scores_gemma":[0.9952797,0.00015811305,0.00025083934,0.0037861748,0.0003817654,0.00014337784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720679,0.00021824287,0.00020763639,0.00012371989,0.00034339962,0.00022590383,0.0032672032,0.000073756484,7.937406e-7],"category_scores_gemma":[0.000029659917,0.00023339629,0.00008438641,0.0007452379,0.00010789251,0.0007241925,0.0035232534,0.00036550898,0.000034201337],"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.0000075741987,0.0010380675,0.0012181309,0.00004375484,0.00008858722,0.00000867191,0.0062635792,0.027239582,0.0028097238,0.7928609,0.004977032,0.1634444],"study_design_scores_gemma":[0.00016699031,0.00009060337,0.00008839481,0.000070894916,0.00000914964,0.00001638729,0.0000141278715,0.9376311,0.00085384666,0.05900044,0.0017860901,0.00027200594],"about_ca_topic_score_codex":0.00007664676,"about_ca_topic_score_gemma":0.000012030778,"teacher_disagreement_score":0.9103915,"about_ca_system_score_codex":0.00022459392,"about_ca_system_score_gemma":0.0002303654,"threshold_uncertainty_score":0.95176244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007899372,0.000019273162,0.9949889,0.0023863728,0.0009656054,0.0009291303,0.000008970162,0.00045559183,0.00016713883],"genre_scores_gemma":[0.4499871,0.000047872873,0.54838043,0.00044610543,0.00011195076,0.0004821582,0.0000035665594,0.000020214888,0.0005205717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987209,0.00008683761,0.0002909419,0.00034996506,0.00029110324,0.00026025707],"domain_scores_gemma":[0.99852604,0.0005309495,0.000107310545,0.0006267877,0.00015098015,0.000057920493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043453145,0.0001777794,0.000119295866,0.0001133151,0.0004827812,0.0001877885,0.00057234167,0.00008394332,0.000018743258],"category_scores_gemma":[0.000025362184,0.00014147226,0.00009538367,0.00025268842,0.000042674877,0.00021618504,0.000003983845,0.00022414555,0.000023716248],"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.000009715799,0.00013894807,0.0000022889312,0.000011761593,0.00001134482,2.9018125e-7,0.00049860677,0.03515822,0.00061222736,0.0008895701,0.00045242437,0.9622146],"study_design_scores_gemma":[0.00038341375,0.00072324654,0.000117206844,0.00001710068,0.000026238951,0.0000032122273,0.000022905248,0.957706,0.03394227,0.0008095278,0.006062899,0.00018601732],"about_ca_topic_score_codex":0.00003430527,"about_ca_topic_score_gemma":0.00011309496,"teacher_disagreement_score":0.96202856,"about_ca_system_score_codex":0.000057943627,"about_ca_system_score_gemma":0.00003992501,"threshold_uncertainty_score":0.57690716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004503056,0.000043367665,0.9938188,0.00007393514,0.000020884812,0.0006814729,0.000001852028,0.0002448305,0.00061175687],"genre_scores_gemma":[0.5611215,0.0000025502686,0.43875948,0.00004729475,0.000008874432,0.000030270809,3.7053292e-7,0.0000042340967,0.000025425521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992201,0.00004195858,0.0001642187,0.0003173603,0.00009460732,0.00016181091],"domain_scores_gemma":[0.99606836,0.0033684787,0.0001149327,0.00016307748,0.00023798693,0.00004718176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000569208,0.00009448686,0.00014673508,0.00007438747,0.00016210164,0.000048770617,0.00021854046,0.00004247786,4.799571e-7],"category_scores_gemma":[0.00028011075,0.00008828632,0.000015228347,0.0002381413,0.00010243661,0.00012765329,0.00018522698,0.00005976828,9.502893e-7],"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.00001616655,0.0003277725,0.0034112483,0.0001095598,0.000023134635,3.8628085e-7,0.002020749,0.00023189337,0.0076757725,0.3753372,0.0005122408,0.61033386],"study_design_scores_gemma":[0.00027057767,0.00053357,0.0011901659,0.00004773422,0.000012913681,0.0000072653543,0.00008892203,0.9484391,0.03680223,0.012398581,0.000049004786,0.00015989332],"about_ca_topic_score_codex":0.00003431246,"about_ca_topic_score_gemma":0.0000029306732,"teacher_disagreement_score":0.94820726,"about_ca_system_score_codex":0.0000111637455,"about_ca_system_score_gemma":0.00002829166,"threshold_uncertainty_score":0.36002114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026431852,0.00009251321,0.9646357,0.0016177986,0.0020890313,0.00061823224,0.00026025204,0.0033949532,0.024648331],"genre_scores_gemma":[0.7047182,0.0000109256935,0.29399228,0.00048359437,0.00018038212,0.0001215225,0.00012778466,0.000036502308,0.00032883644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964453,0.00039679324,0.000531791,0.0010333532,0.0008502498,0.0007425133],"domain_scores_gemma":[0.99608374,0.0009972384,0.0005955468,0.0016568465,0.00045073335,0.00021588612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011033899,0.00061942346,0.00072328525,0.00021953954,0.00023553254,0.00051372166,0.002119193,0.000554097,0.00009342075],"category_scores_gemma":[0.0004951783,0.0005450403,0.0002867361,0.00038678167,0.00017909122,0.00031334133,0.0020051424,0.0013587455,0.00007903787],"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.0005002436,0.004876944,0.062470216,0.0009363324,0.0018527114,0.00053158234,0.01711517,0.008818032,0.0012691943,0.5877037,0.25129458,0.06263129],"study_design_scores_gemma":[0.001051745,0.0006087717,0.007522714,0.0011274564,0.00018930608,0.000018110637,0.00022205357,0.8498595,0.10791056,0.021150446,0.006584955,0.0037544142],"about_ca_topic_score_codex":0.00017188358,"about_ca_topic_score_gemma":0.000042126696,"teacher_disagreement_score":0.84104145,"about_ca_system_score_codex":0.0006680601,"about_ca_system_score_gemma":0.00054054323,"threshold_uncertainty_score":0.9997001},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94050765,0.00019079733,0.0535355,0.00219727,0.0007456148,0.0009092945,0.000020502444,0.00040685173,0.00148653],"genre_scores_gemma":[0.35393748,0.000032177206,0.6450075,0.00014985527,0.00042873962,0.0002804891,0.0000029029145,0.000059872393,0.00010098648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966858,2.5649669e-8,0.000893827,0.0005987013,0.00097636547,0.00084524887],"domain_scores_gemma":[0.9967473,0.00066267967,0.00046347658,0.00015425975,0.001694083,0.00027816315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017214285,0.00043797164,0.00054242654,0.00018346723,0.00015758423,0.00024094648,0.0024845917,0.00033317422,0.0000074621553],"category_scores_gemma":[0.0020026444,0.00037567358,0.0008931592,0.0003700383,0.000218401,0.0016490306,0.000546259,0.0004644195,0.0000041726644],"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.0001123221,0.0002451372,0.0008085436,0.00035011276,0.00028665632,6.9855446e-8,0.00075396453,0.000055623805,0.18536775,0.79783136,0.00815933,0.0060291556],"study_design_scores_gemma":[0.0031164857,0.0014629926,0.0031639284,0.0011590377,0.00038324823,0.000122046775,0.001853448,0.44444597,0.48905388,0.038684998,0.014736978,0.0018169951],"about_ca_topic_score_codex":0.000010072632,"about_ca_topic_score_gemma":2.973549e-7,"teacher_disagreement_score":0.75914633,"about_ca_system_score_codex":0.00030137182,"about_ca_system_score_gemma":0.000055510558,"threshold_uncertainty_score":0.9998695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654782,0.000117528165,0.98236716,0.00093214994,0.0009643613,0.0006832278,0.000017667098,0.000978512,0.00028459894],"genre_scores_gemma":[0.7046185,0.000054391843,0.29483488,0.00011689633,0.000022125043,0.00016811377,0.000008500558,0.000018881885,0.00015768479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851584,0.00022122139,0.00035552456,0.00030878512,0.00021556663,0.0003830294],"domain_scores_gemma":[0.99588954,0.00066205626,0.00014103121,0.0028005454,0.00036077996,0.00014601696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006949436,0.00020525682,0.00020778262,0.00022129324,0.0010213241,0.00009617013,0.00152771,0.00014109825,0.000007983787],"category_scores_gemma":[0.00005489757,0.0002226327,0.00015507598,0.00061081845,0.000118350355,0.00053774694,0.000027070588,0.00041261673,0.000066656736],"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.00037251497,0.03551422,0.0036797607,0.0004337589,0.00081391365,0.000002524236,0.041196927,0.17659214,0.19371387,0.08651542,0.005859963,0.45530498],"study_design_scores_gemma":[0.00043859778,0.00010677451,0.002895538,0.00006286455,0.000046296493,0.000012001161,0.000082406994,0.9453574,0.048278768,0.00057309726,0.001749608,0.00039669135],"about_ca_topic_score_codex":0.00009511801,"about_ca_topic_score_gemma":0.00022322749,"teacher_disagreement_score":0.7687652,"about_ca_system_score_codex":0.00018318712,"about_ca_system_score_gemma":0.00007349673,"threshold_uncertainty_score":0.9078699},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52751946,0.0000020476828,0.46219274,0.000041142088,0.00007555207,0.000047773545,2.966151e-7,0.00021977302,0.009901179],"genre_scores_gemma":[0.630016,0.0000010456521,0.36974376,0.000037974125,0.00000796836,0.000004983324,4.3644565e-7,0.0000028738968,0.0001849332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992484,0.000017984261,0.00015474248,0.00024393239,0.00019470725,0.0001402351],"domain_scores_gemma":[0.9990946,0.000087498935,0.000100892066,0.00051948434,0.0001577947,0.000039705566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028915648,0.00009144668,0.00018304035,0.00034858644,0.00006076504,0.000043838678,0.0005584567,0.000035951238,0.000036770147],"category_scores_gemma":[0.000022365857,0.00006663825,0.00005356372,0.0013581228,0.00004510713,0.00043123862,0.00011854137,0.00016209217,0.0000031697848],"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.000027577027,0.00025025025,0.31051794,0.00004808061,0.0012311385,0.000024390785,0.014209835,0.001658056,0.07778724,0.020176409,0.00042120172,0.57364786],"study_design_scores_gemma":[0.00006207703,0.00010270424,0.01574853,0.000009490059,0.000057182973,0.0000073227534,0.00003639806,0.8343304,0.14945237,0.000037546044,0.00002860617,0.00012736773],"about_ca_topic_score_codex":0.00005777561,"about_ca_topic_score_gemma":0.00025347905,"teacher_disagreement_score":0.83267236,"about_ca_system_score_codex":0.00001091962,"about_ca_system_score_gemma":0.00003298746,"threshold_uncertainty_score":0.27174288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030272443,0.00010300343,0.96388453,0.00021421869,0.0013938543,0.00044176984,0.000011212563,0.00068187626,0.002997117],"genre_scores_gemma":[0.3970991,0.000005739085,0.60235906,0.00015381404,0.0001709909,0.00005408104,0.0000047503345,0.000025633153,0.0001268038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775714,0.00006294523,0.0003844368,0.0005119252,0.00047114815,0.00081238855],"domain_scores_gemma":[0.9973554,0.0008539522,0.00013853233,0.0011455338,0.0001758872,0.0003306889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087977917,0.00027224212,0.00031626035,0.00011709999,0.00024573045,0.00023922084,0.0015237075,0.00019050317,0.00002748008],"category_scores_gemma":[0.00055343815,0.00026673614,0.00015508018,0.00014486325,0.00014196147,0.0008485325,0.0007186592,0.00027794967,0.00007465986],"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.00032665062,0.0022830048,0.005385781,0.00038228938,0.00012927955,0.000031963446,0.008760093,0.001127603,0.035576634,0.49319348,0.07411129,0.37869194],"study_design_scores_gemma":[0.0021227524,0.0006723174,0.0033890877,0.00041315603,0.000083691,0.00012052601,0.00022858847,0.6987849,0.16870843,0.10227737,0.020943115,0.0022560554],"about_ca_topic_score_codex":0.000018716448,"about_ca_topic_score_gemma":0.000012463381,"teacher_disagreement_score":0.6976573,"about_ca_system_score_codex":0.000110114306,"about_ca_system_score_gemma":0.000046290228,"threshold_uncertainty_score":0.9999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35256004,0.000002109069,0.6433278,0.00003918056,0.0007808036,0.0000887767,3.3303704e-7,0.00043120052,0.0027697633],"genre_scores_gemma":[0.85440904,0.0000031449065,0.14509954,0.00006426039,0.000056008495,0.000008369192,7.873643e-7,0.000012925282,0.0003459518],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.000028096194,0.00026525155,0.00032028713,0.00022580124,0.00023266127],"domain_scores_gemma":[0.9989709,0.00010773363,0.00015857155,0.000505122,0.00020204263,0.0000556105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045683325,0.00012715143,0.00017025018,0.0001494896,0.00010392744,0.00018501379,0.0007733583,0.000109335306,0.00009901487],"category_scores_gemma":[0.00007182436,0.000119687225,0.00005300055,0.00040423434,0.000051900683,0.00072843663,0.0002774797,0.00021282223,0.0000055471605],"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.00001715319,0.00017837684,0.027530896,0.00011250006,0.00003351191,0.000017398233,0.0033571734,0.06147341,0.69559336,0.17988367,0.0006583971,0.031144125],"study_design_scores_gemma":[0.00010020792,0.000019422798,0.0004476381,0.000019706222,0.0000014212783,0.00000778686,0.000007310013,0.59917295,0.39978245,0.00027384402,0.000040650244,0.00012660703],"about_ca_topic_score_codex":0.000089459536,"about_ca_topic_score_gemma":0.000020163661,"teacher_disagreement_score":0.5376996,"about_ca_system_score_codex":0.000020128673,"about_ca_system_score_gemma":0.000036647096,"threshold_uncertainty_score":0.48807037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12692676,0.00005848504,0.8646076,0.0018033612,0.00022555879,0.00022460408,2.78433e-7,0.0022014086,0.003951963],"genre_scores_gemma":[0.89181197,0.0000044410986,0.10413616,0.0009520372,0.000048222853,0.000042599015,0.0000010763764,0.000020645266,0.002982872],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985755,0.00007370438,0.00023762329,0.00044589388,0.0002654627,0.00040180146],"domain_scores_gemma":[0.998722,0.00027413285,0.000091405454,0.0006400473,0.00015527224,0.00011712257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024844322,0.00021145778,0.00020633255,0.000116547286,0.00014583529,0.0003914495,0.00093314337,0.00013048443,0.00012749806],"category_scores_gemma":[0.00008149051,0.00017873044,0.000073597635,0.00031287738,0.000044220727,0.000630617,0.00032305627,0.00023744893,0.00032684137],"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.000018454668,0.0011180458,0.02691751,0.00024877267,0.00043736314,0.000047150097,0.03243682,0.00499051,0.30586165,0.17265539,0.175169,0.28009933],"study_design_scores_gemma":[0.00047760527,0.00024519276,0.009133384,0.00017093742,0.000017022623,0.00007321294,0.0026049637,0.5567341,0.27984738,0.14817476,0.0011428545,0.0013785751],"about_ca_topic_score_codex":0.0011654736,"about_ca_topic_score_gemma":0.000086365115,"teacher_disagreement_score":0.7648852,"about_ca_system_score_codex":0.000047074573,"about_ca_system_score_gemma":0.000040485556,"threshold_uncertainty_score":0.72884154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027913675,0.00006686071,0.9749153,0.007307992,0.00034217117,0.00065349106,0.000059452508,0.0016379692,0.012225373],"genre_scores_gemma":[0.686495,0.00018623914,0.31216794,0.00026677977,0.000011232522,0.00043840925,0.000012881885,0.00003625986,0.00038523416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975872,0.00069975073,0.00049082853,0.000527799,0.00027088987,0.0004235382],"domain_scores_gemma":[0.9867641,0.001750776,0.0002610941,0.010578263,0.00044601777,0.00019977105],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079701527,0.00036085228,0.00033416806,0.00039201006,0.0018487031,0.00029258485,0.007169632,0.00016591701,0.000036619636],"category_scores_gemma":[0.000026647216,0.0003390504,0.00015231017,0.0013402337,0.0007714449,0.0009228486,0.00009238387,0.0018588542,0.00015743781],"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.00043666217,0.011194564,0.001076887,0.000100352554,0.0014038027,0.00002336447,0.023958553,0.008241239,0.14404806,0.61096907,0.006160044,0.19238739],"study_design_scores_gemma":[0.0019552025,0.0015378359,0.0023210896,0.0004574994,0.0003105366,0.00017029612,0.0010787109,0.81272227,0.1267896,0.021555915,0.028493406,0.0026076455],"about_ca_topic_score_codex":0.000662108,"about_ca_topic_score_gemma":0.011990627,"teacher_disagreement_score":0.804481,"about_ca_system_score_codex":0.00009913056,"about_ca_system_score_gemma":0.00025657972,"threshold_uncertainty_score":0.9999061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010616364,0.000014860124,0.99326676,0.00035455826,0.0023377412,0.0003845144,0.000024008255,0.0009962532,0.0015596959],"genre_scores_gemma":[0.97378665,0.000007252514,0.02481359,0.00086407,0.00007133831,0.00020852125,0.0000041709022,0.000010828849,0.00023360533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893194,0.000086746906,0.00031717637,0.00010989641,0.00021026879,0.0003439666],"domain_scores_gemma":[0.99880195,0.0004085378,0.00013038964,0.00042215147,0.00012388796,0.00011306447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619805,0.0001512562,0.00013454806,0.00030029952,0.00030940675,0.00012720631,0.0004440196,0.000108113294,0.000024522926],"category_scores_gemma":[0.000032560158,0.00014236219,0.00012580374,0.00027869467,0.000045095625,0.003659806,0.0000030199005,0.00020442794,0.00021494832],"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.00010082438,0.00023838492,0.0000069523135,0.00007241771,0.000052462536,1.6144554e-7,0.008921013,0.0016619376,0.00062038685,0.7509344,0.0032403332,0.23415072],"study_design_scores_gemma":[0.001492417,0.00090072374,0.00010994445,0.00016951213,0.00008140411,0.00008925891,0.0011663251,0.2827327,0.47939354,0.13055696,0.10191048,0.0013967443],"about_ca_topic_score_codex":0.000004208441,"about_ca_topic_score_gemma":7.467821e-7,"teacher_disagreement_score":0.972725,"about_ca_system_score_codex":0.00008472576,"about_ca_system_score_gemma":0.00003758336,"threshold_uncertainty_score":0.5805361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1316816,0.00004589199,0.86160135,0.0009221895,0.00027927815,0.00046280233,0.0000027154047,0.0019494897,0.0030546512],"genre_scores_gemma":[0.531425,0.0000017551466,0.46795994,0.0003025136,0.000042815278,0.00006236048,0.0000028150243,0.000016046954,0.00018671708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982533,0.00006766865,0.0003141898,0.0006250323,0.00024718858,0.00049266167],"domain_scores_gemma":[0.9985857,0.0001952488,0.00012561707,0.00083023985,0.00014978198,0.00011341639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092669314,0.00025171108,0.00029054628,0.00018243265,0.00032017904,0.00028767966,0.0012245973,0.000067164736,0.000006763503],"category_scores_gemma":[0.00020051638,0.00023204196,0.00014031022,0.00033112222,0.000067052184,0.0007718088,0.00026136026,0.00021871277,0.000024541958],"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.000017242157,0.00031597324,0.0008012716,0.00013681012,0.000064228305,0.000014330661,0.0016943398,0.001540228,0.035728596,0.93744427,0.0036272563,0.018615453],"study_design_scores_gemma":[0.00067182985,0.00019966632,0.0001834732,0.00008677251,0.000012055457,0.000055245793,0.000066524524,0.06944883,0.78030324,0.1431675,0.005240415,0.00056445325],"about_ca_topic_score_codex":0.00033506015,"about_ca_topic_score_gemma":0.000075054784,"teacher_disagreement_score":0.7942768,"about_ca_system_score_codex":0.00013442273,"about_ca_system_score_gemma":0.0001096939,"threshold_uncertainty_score":0.94623965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0602852,0.00015788888,0.93293375,0.0011482039,0.00017005562,0.0007006432,0.0000015488826,0.0020614935,0.0025412291],"genre_scores_gemma":[0.89240664,0.000027104225,0.10694049,0.00037993368,0.00002880993,0.0000453582,0.000009424348,0.000007276911,0.00015497727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872327,0.00012717923,0.0002991346,0.00034614129,0.00023266925,0.00027158498],"domain_scores_gemma":[0.9980925,0.0002015945,0.000092596616,0.0012428439,0.00028214097,0.000088372704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010584434,0.0001495499,0.00023959596,0.00008059269,0.00022689944,0.00017176403,0.0013329699,0.00012706047,0.0000018148932],"category_scores_gemma":[0.00015233504,0.0001390496,0.00007523698,0.0002889889,0.000040376894,0.00036597275,0.00016792353,0.0001749652,0.000009963216],"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.00020027433,0.0024672267,0.07223002,0.00046579054,0.00019293785,0.000028764283,0.0046760477,0.00027911607,0.038962148,0.45339853,0.16387698,0.26322216],"study_design_scores_gemma":[0.0007071201,0.0005656088,0.05689468,0.0002987508,0.000045708977,0.000086187945,0.0001314387,0.789636,0.1335995,0.013867803,0.0031442775,0.0010228893],"about_ca_topic_score_codex":0.00027155725,"about_ca_topic_score_gemma":0.00016907549,"teacher_disagreement_score":0.83212143,"about_ca_system_score_codex":0.000096153344,"about_ca_system_score_gemma":0.000047592617,"threshold_uncertainty_score":0.5670278},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45390633,7.337494e-7,0.5446042,0.000030489226,0.00023788835,0.00010823902,4.1948599e-7,0.0005468235,0.0005648836],"genre_scores_gemma":[0.8383901,1.3720235e-7,0.16142078,0.00010332468,0.000043927354,0.000001624608,0.0000012182935,0.000011271885,0.00002758634],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849766,0.00009237948,0.00022552865,0.00037910786,0.00043336,0.00037195702],"domain_scores_gemma":[0.99889547,0.0002323926,0.00017712846,0.00046960972,0.00013845845,0.00008696852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045620961,0.00017847963,0.00015432626,0.00028649156,0.00027179855,0.00013533472,0.00037843193,0.00012377101,0.00002223736],"category_scores_gemma":[0.00015361789,0.0001688582,0.00007795534,0.00040730523,0.000020628157,0.00075930153,0.00016861204,0.00019484972,0.0000066459884],"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.00040611354,0.001490844,0.18260327,0.0001782807,0.00006519984,0.00005718737,0.0024813705,0.0072456733,0.49939704,0.012406923,0.0006153064,0.2930528],"study_design_scores_gemma":[0.00015057155,0.000042706015,0.05620823,0.000026578848,0.0000043782356,0.0000042324104,0.0000092203,0.7687012,0.17451516,0.00016079859,0.0000057737684,0.00017114768],"about_ca_topic_score_codex":0.00015642059,"about_ca_topic_score_gemma":0.00016035933,"teacher_disagreement_score":0.76145554,"about_ca_system_score_codex":0.00039282074,"about_ca_system_score_gemma":0.00006293916,"threshold_uncertainty_score":0.68858373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02234737,0.000010856175,0.9763517,0.00041428462,0.000030697967,0.0003760086,7.422819e-7,0.0001591918,0.00030915238],"genre_scores_gemma":[0.59163177,0.0000034271648,0.40806618,0.00027015698,0.0000020393093,0.000012128156,5.242433e-7,0.0000016913557,0.00001205634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994738,0.000038555634,0.0001284571,0.00017633606,0.00008085655,0.000101956146],"domain_scores_gemma":[0.99949646,0.00020772508,0.00006559414,0.00014017164,0.000067991394,0.00002205469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025517718,0.000068438116,0.00008596,0.00010020342,0.000049905455,0.00003853482,0.00015714465,0.000020295547,0.000002493391],"category_scores_gemma":[0.000016251868,0.00005913981,0.00002260489,0.00011852084,0.000013685336,0.00019799391,0.000016623395,0.000026502134,2.913397e-7],"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.0000482979,0.000083187035,0.0005492386,0.000015030294,0.00002158153,0.0000011553192,0.006376119,0.000138752,0.02091214,0.24074355,0.0050957557,0.7260152],"study_design_scores_gemma":[0.0003339898,0.0017036942,0.002036231,0.000018594204,0.0000047623907,0.0000027493302,0.00020121569,0.023929395,0.8690213,0.10258345,0.00003676756,0.00012786253],"about_ca_topic_score_codex":0.000017584134,"about_ca_topic_score_gemma":0.000016863032,"teacher_disagreement_score":0.8481091,"about_ca_system_score_codex":0.000012471885,"about_ca_system_score_gemma":0.000017363514,"threshold_uncertainty_score":0.24116515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6170311,0.00017809543,0.37011966,0.010828352,0.000085044696,0.00030957715,0.000008261621,0.0005110219,0.00092890183],"genre_scores_gemma":[0.76253605,0.000012499067,0.23683254,0.00053319975,0.00001535286,0.000034162593,0.000006260635,0.000013112713,0.000016832211],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998699,0.00021089458,0.0003228059,0.0002976588,0.00023030478,0.00023930891],"domain_scores_gemma":[0.99678755,0.0002424352,0.00023410264,0.0025612724,0.00012597951,0.000048663795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035633787,0.00017367056,0.00024621925,0.00018286731,0.00029190813,0.000095101794,0.0021368666,0.000051849987,0.0000017621508],"category_scores_gemma":[0.000024583811,0.00016767552,0.000051380503,0.00047363737,0.00067347457,0.00035224014,0.00043491556,0.0002594381,0.0000043549367],"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.000049792452,0.0010395463,0.022189151,0.00035301715,0.00015753706,0.000028636456,0.0046267463,0.0020465686,0.8604639,0.082709484,0.014676513,0.011659082],"study_design_scores_gemma":[0.0025874022,0.0004936136,0.07464543,0.0020075268,0.00014937561,0.00037492043,0.0004539276,0.5769106,0.32340077,0.011407989,0.005093956,0.0024745122],"about_ca_topic_score_codex":0.00064484635,"about_ca_topic_score_gemma":0.0006506814,"teacher_disagreement_score":0.57486403,"about_ca_system_score_codex":0.00006734405,"about_ca_system_score_gemma":0.00004404824,"threshold_uncertainty_score":0.68376094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001291994,0.00004640335,0.9960086,0.0004736674,0.0003172158,0.0006421472,0.000029195666,0.0015279067,0.0008256841],"genre_scores_gemma":[0.32678866,0.000028217883,0.67235315,0.00013792735,0.000010595489,0.00058063155,0.0000048104266,0.000021717817,0.000074290874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987143,0.00013588321,0.0003343866,0.00034342307,0.00016232124,0.0003096769],"domain_scores_gemma":[0.9963444,0.00062000495,0.00012657224,0.0025720524,0.00023732183,0.00009966236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668724,0.00018683208,0.00017912043,0.0002766773,0.00087129686,0.00008306644,0.0023860275,0.00006806704,0.000012179646],"category_scores_gemma":[0.000020180625,0.00020527381,0.00018293691,0.0003938397,0.00011873377,0.00037214207,0.000015916825,0.0003637925,0.0000243393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006865154,0.0006715671,0.000008508891,0.000012175562,0.000037424426,0.0000012373698,0.0007874762,0.00014223075,0.0003298516,0.0022340983,0.00013592216,0.99563265],"study_design_scores_gemma":[0.00029102585,0.00022759454,0.000011339813,0.000072367984,0.00003617418,0.0000147122155,0.000043550306,0.8914764,0.100291334,0.0018461901,0.0053924057,0.0002969241],"about_ca_topic_score_codex":0.0001230541,"about_ca_topic_score_gemma":0.00012944195,"teacher_disagreement_score":0.9953357,"about_ca_system_score_codex":0.0000937577,"about_ca_system_score_gemma":0.00011134691,"threshold_uncertainty_score":0.8370823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021488318,0.000030510662,0.95223624,0.005883143,0.00014141202,0.00039345596,6.809163e-7,0.004424861,0.036674794],"genre_scores_gemma":[0.22679509,0.000008039292,0.7699979,0.0015773467,0.00007231558,0.000046036825,8.0094986e-7,0.000007772778,0.0014947174],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999033,0.000020757976,0.00019049573,0.00033658042,0.00014521224,0.00027396876],"domain_scores_gemma":[0.99914855,0.000093019946,0.00004289267,0.0005385135,0.000089112065,0.00008791878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028596187,0.00013081946,0.0001371092,0.0001270703,0.00013436338,0.000086385764,0.0009025696,0.000083593455,0.000013937371],"category_scores_gemma":[0.00005431655,0.00010980302,0.00010671728,0.00028341875,0.000015468542,0.00033291537,0.000042035226,0.00010835124,0.0000074253385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054287275,0.00010287465,0.000026737931,0.0000070924825,0.000003886862,0.000003216365,0.00036072193,8.229083e-7,0.02601672,0.19156533,0.054663848,0.7272433],"study_design_scores_gemma":[0.0001815804,0.0008281408,0.0003841359,0.00006900906,0.000008114758,0.000033780114,0.000020389936,0.012837509,0.6997149,0.12790154,0.15754107,0.0004798579],"about_ca_topic_score_codex":0.000012841055,"about_ca_topic_score_gemma":0.000005008391,"teacher_disagreement_score":0.7267634,"about_ca_system_score_codex":0.00003014446,"about_ca_system_score_gemma":0.000043456716,"threshold_uncertainty_score":0.4477637},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068095185,0.000030497464,0.92999244,0.00066375866,0.000094456,0.0006632693,0.0000070334668,0.00009188299,0.0003614537],"genre_scores_gemma":[0.82873404,0.000056208963,0.17098616,0.000025386715,0.0000033528736,0.00017178198,0.0000024941633,0.0000063117463,0.0000142347835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.000114695365,0.0004424937,0.0001501807,0.00020372924,0.00015126097],"domain_scores_gemma":[0.99679685,0.0013552983,0.00023433227,0.0013810468,0.00021353077,0.000018930075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015167352,0.00009259741,0.0001316415,0.00028564697,0.00026068883,0.000018158295,0.0016205111,0.00005655911,7.492037e-7],"category_scores_gemma":[0.000060607148,0.00008227821,0.000062126004,0.00073709554,0.00012038317,0.00039836168,0.000009835422,0.00020621685,0.0000010007533],"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.00026170583,0.004091058,0.0010089582,0.00066885696,0.000090297166,7.2786355e-7,0.05382625,0.2576699,0.051205415,0.03793954,0.00018852227,0.59304875],"study_design_scores_gemma":[0.00015275393,0.0002056669,0.0011482828,0.00015708953,0.0000111714735,0.00000455415,0.0002271878,0.87302876,0.124171495,0.0007898449,0.000019882642,0.00008331588],"about_ca_topic_score_codex":0.00008064812,"about_ca_topic_score_gemma":0.00051272754,"teacher_disagreement_score":0.7606389,"about_ca_system_score_codex":0.000051374816,"about_ca_system_score_gemma":0.00005590385,"threshold_uncertainty_score":0.3355208},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27042156,0.000009928635,0.7278012,0.0008498653,0.00015129618,0.00029923176,0.00000110006,0.0004500617,0.00001576893],"genre_scores_gemma":[0.6635185,0.0000012062821,0.33626068,0.0001457939,0.000016998603,0.000043085995,0.0000032930964,0.000007852237,0.0000025846077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.000112513706,0.00026561797,0.00038196056,0.00020334385,0.00024232958],"domain_scores_gemma":[0.9990485,0.00047199326,0.000086352135,0.0002154522,0.00012702093,0.000050705865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246124,0.00013015854,0.00014431297,0.00025481085,0.00007749205,0.00007671987,0.0004062433,0.000076936456,1.6089813e-7],"category_scores_gemma":[0.000220328,0.00013245232,0.00005587096,0.0005633674,0.000029208386,0.0006148707,0.00010994622,0.00018775942,0.0000022198692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019642347,0.00011981009,0.00017511916,0.000025657517,0.0000033614322,0.000020206082,0.0016252429,0.9224441,0.0025134177,0.026417213,0.000015434036,0.046444025],"study_design_scores_gemma":[0.00041501212,0.00022060481,0.00090842176,0.000024178458,0.0000011497717,0.00000813092,0.000006390821,0.82420784,0.0018996694,0.17218286,0.0000042548695,0.00012149237],"about_ca_topic_score_codex":0.0000508736,"about_ca_topic_score_gemma":0.000018867137,"teacher_disagreement_score":0.39309692,"about_ca_system_score_codex":0.00008029961,"about_ca_system_score_gemma":0.00006722768,"threshold_uncertainty_score":0.5401249},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083101895,0.00013236923,0.9863115,0.00097020104,0.00018801696,0.00015198879,0.0000042818942,0.00031300864,0.0036184536],"genre_scores_gemma":[0.8514696,0.000295072,0.14802314,0.00011868839,0.0000032160185,0.000006175775,5.4039475e-7,0.000007632337,0.00007597518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910223,0.00007470521,0.0003002954,0.00020493542,0.0001500889,0.00016771944],"domain_scores_gemma":[0.9971971,0.00059485337,0.0001100064,0.0019022833,0.00012738242,0.0000683865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047573342,0.00010628976,0.00013648356,0.00020891901,0.0002623849,0.000024818519,0.0013296829,0.00006359739,0.000011413929],"category_scores_gemma":[0.000014290238,0.0001150097,0.00006196956,0.0005719881,0.0002572887,0.00027144124,0.000017700277,0.0002644806,0.000012229742],"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.00012336714,0.003510282,0.0041303895,0.00015296071,0.00047587877,0.000015186498,0.022038575,0.0037573054,0.095945545,0.19414012,0.0022047756,0.6735056],"study_design_scores_gemma":[0.0012658421,0.00086596864,0.010260859,0.0003167163,0.00014114886,0.0001692305,0.0011815684,0.26255116,0.6944119,0.020641033,0.006868542,0.0013260775],"about_ca_topic_score_codex":0.0002667667,"about_ca_topic_score_gemma":0.0008593795,"teacher_disagreement_score":0.8431594,"about_ca_system_score_codex":0.000042934673,"about_ca_system_score_gemma":0.00005781046,"threshold_uncertainty_score":0.46899593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004529042,0.000042680094,0.9709959,0.00037561907,0.00039366714,0.00037532175,0.0000015970905,0.001749482,0.021536686],"genre_scores_gemma":[0.6714643,0.0000031672823,0.32733446,0.00017441098,0.00007614364,0.000089309746,0.0000011796554,0.000013944167,0.0008430546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894726,0.000016965429,0.0001819386,0.0003883533,0.00014452834,0.00032092785],"domain_scores_gemma":[0.99904794,0.00008901442,0.000076772296,0.00056402036,0.00014878529,0.0000734821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559819,0.00014813851,0.00015532335,0.00010812772,0.00012999876,0.00007876872,0.0009092918,0.00008190888,0.000013614983],"category_scores_gemma":[0.000034568944,0.00013001621,0.00007932674,0.00021565738,0.000026005902,0.00037293477,0.00019828395,0.00010501017,0.000017139104],"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.00018639931,0.00046472586,0.003800449,0.00018511747,0.00013974938,0.000042441487,0.021117117,0.000026087015,0.0058536376,0.71925706,0.013894054,0.23503314],"study_design_scores_gemma":[0.0029906884,0.0016927237,0.0034752097,0.00031153153,0.000057484613,0.00013450187,0.0007751577,0.19440058,0.64626116,0.13831362,0.009456963,0.0021303871],"about_ca_topic_score_codex":0.00031516684,"about_ca_topic_score_gemma":0.00016877464,"teacher_disagreement_score":0.66693527,"about_ca_system_score_codex":0.000030609583,"about_ca_system_score_gemma":0.000041124935,"threshold_uncertainty_score":0.53019077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021796634,0.0000048977963,0.9806467,0.0005637471,0.0004706374,0.00017618656,0.0000038111302,0.0014609414,0.014493386],"genre_scores_gemma":[0.9769516,0.000008242445,0.020194607,0.0025383828,0.00001368716,0.000019751807,0.0000010719186,0.000004107558,0.00026853924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990503,0.00008315925,0.0003068236,0.00012540234,0.00024244793,0.00019185324],"domain_scores_gemma":[0.99906486,0.00015964048,0.00010853704,0.0004975764,0.00010422906,0.00006517967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903253,0.00013505301,0.00011180343,0.0003267001,0.00022664161,0.0001558955,0.000525316,0.00007948111,0.000029240966],"category_scores_gemma":[0.000017032828,0.00013134528,0.00008564612,0.00039948846,0.000028497845,0.0022891099,0.0000013982283,0.00023434675,0.0003220407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056368146,0.00013123678,0.0000016979031,0.000012536523,0.000021168502,0.0000016371622,0.0045602215,0.007823833,0.0008632194,0.16859254,0.001565256,0.8163703],"study_design_scores_gemma":[0.0012983173,0.0012600981,0.0004734843,0.00017775939,0.000038500682,0.0002191609,0.00052757736,0.11532062,0.64423776,0.2247241,0.010481032,0.0012416033],"about_ca_topic_score_codex":0.000005023741,"about_ca_topic_score_gemma":0.0000022873576,"teacher_disagreement_score":0.9747719,"about_ca_system_score_codex":0.000065051005,"about_ca_system_score_gemma":0.000044498793,"threshold_uncertainty_score":0.5356105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3222728,0.00006654648,0.6745548,0.00011725075,0.00021274325,0.00020093872,4.455602e-7,0.0005557603,0.0020187078],"genre_scores_gemma":[0.9574398,0.000008320944,0.042199053,0.00020569145,0.000032050455,0.000012158829,4.8008485e-7,0.0000057455404,0.00009672043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986975,0.000118044125,0.00029050835,0.0004414905,0.00017602829,0.00027640775],"domain_scores_gemma":[0.9991951,0.00022020588,0.00009563623,0.00035083425,0.0000715492,0.00006664769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051289215,0.00015999273,0.00020767904,0.0004157534,0.00011603241,0.00028422213,0.00034736874,0.00008356454,0.0000032923297],"category_scores_gemma":[0.00015943979,0.00015219921,0.000031673084,0.0007684909,0.000028671551,0.00065223384,0.00011513493,0.00022074969,0.00000797337],"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.00011269192,0.00070988,0.024062911,0.0003084917,0.000043159333,0.00023150125,0.015162302,0.001926483,0.17896394,0.12828133,0.0005418993,0.6496554],"study_design_scores_gemma":[0.00041154455,0.0003387113,0.020212814,0.00021034165,0.0000035365986,0.00007370724,0.00016289281,0.86932933,0.09789221,0.010835844,0.000066115186,0.00046294197],"about_ca_topic_score_codex":0.0002357962,"about_ca_topic_score_gemma":0.0002926865,"teacher_disagreement_score":0.86740285,"about_ca_system_score_codex":0.00010882994,"about_ca_system_score_gemma":0.00001726439,"threshold_uncertainty_score":0.62065035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14783373,0.000035659523,0.8504465,0.0001838563,0.00019775692,0.00025084877,0.0000033431782,0.000725739,0.00032251317],"genre_scores_gemma":[0.6774367,0.000008464859,0.3224274,0.000031641506,0.000013077396,0.000036345595,2.2531304e-7,0.000017981094,0.000028163746],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985384,0.000055847577,0.00038631223,0.00047017937,0.00026344947,0.00028586108],"domain_scores_gemma":[0.9989257,0.000089978916,0.00022267959,0.00042631468,0.00024347044,0.000091891954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041578486,0.00020465844,0.0002514093,0.00033499426,0.0003838278,0.00028979336,0.00039921104,0.00012742137,0.0000080636655],"category_scores_gemma":[0.00004546477,0.00020707068,0.000064707936,0.0006055542,0.00020122869,0.0008601208,0.000008021301,0.0006245824,0.000003661403],"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.000010728731,0.000086295346,0.000017959017,0.00008926353,0.000006590197,0.0000047497397,0.001102577,0.000036355275,0.602977,0.000033729088,0.000003723815,0.39563105],"study_design_scores_gemma":[0.00021869906,0.00015590624,0.00013807064,0.00026877216,0.000016699454,0.00007774332,0.00006352283,0.07752635,0.92056817,0.00070709735,0.000013532859,0.0002454442],"about_ca_topic_score_codex":0.00013394337,"about_ca_topic_score_gemma":0.00019392786,"teacher_disagreement_score":0.529603,"about_ca_system_score_codex":0.000030183879,"about_ca_system_score_gemma":0.00016047392,"threshold_uncertainty_score":0.84440976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03018794,0.00002357022,0.81805605,0.00014733015,0.00014050343,0.00008093592,5.209679e-8,0.00039619443,0.15096745],"genre_scores_gemma":[0.7663308,0.0000017195974,0.23304558,0.00027749588,0.0000040379705,0.000007540022,7.146943e-8,0.0000028459003,0.00032990982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931324,0.000079336125,0.00012650993,0.0002230936,0.0000882952,0.00016955413],"domain_scores_gemma":[0.9995516,0.000093970724,0.000027618114,0.00026676702,0.000029851182,0.000030218585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033254013,0.00006955955,0.00008115841,0.00013521446,0.000035216883,0.00006999669,0.0003235074,0.000030214545,0.000027017984],"category_scores_gemma":[0.00014372438,0.000063145366,0.000021752187,0.0004668214,0.000009611837,0.00031870513,0.000044551096,0.00010228683,0.000025478019],"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.0000011449581,0.00006467779,0.046894874,0.000004677227,0.0000045898373,0.000055287503,0.0029089719,0.00004243092,0.002995424,0.9175378,0.001971296,0.027518814],"study_design_scores_gemma":[0.0009307452,0.00038278766,0.015877642,0.00018385393,0.0000045825122,0.00018756099,0.00047042008,0.18077295,0.5917175,0.19584167,0.012204753,0.001425539],"about_ca_topic_score_codex":0.00003824103,"about_ca_topic_score_gemma":0.00016764572,"teacher_disagreement_score":0.7361429,"about_ca_system_score_codex":0.000049849565,"about_ca_system_score_gemma":0.00002917333,"threshold_uncertainty_score":0.25749934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747423,0.00013677192,0.93019974,0.000075022755,0.0002751953,0.0011022349,0.00012886818,0.00026917658,0.00033874382],"genre_scores_gemma":[0.99739033,0.000025963014,0.000789942,0.000088603134,0.00014240418,0.0010622159,0.000031421274,0.00001376213,0.00045533106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985913,0.00015683119,0.00033599552,0.00052042404,0.00018783605,0.0002076147],"domain_scores_gemma":[0.99899745,0.00035071952,0.00014242526,0.00030348563,0.00012837083,0.00007755277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007407628,0.00018671584,0.00019294753,0.00013000824,0.00095256686,0.00027028457,0.00018942992,0.00011409687,0.0000028394772],"category_scores_gemma":[0.00000541665,0.00019442354,0.00005950218,0.00019311233,0.00014931451,0.0003869821,0.000004348017,0.00014076079,0.000005011164],"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.000007661293,0.00030186452,0.00011528649,0.00012779149,0.00003070382,0.0000010275694,0.00028413406,0.00064604945,0.14145945,0.790427,0.000105629406,0.06649336],"study_design_scores_gemma":[0.0033852996,0.0010240101,0.004796313,0.0006046297,0.00030178946,0.0010887958,0.00136533,0.42003402,0.30476087,0.25257462,0.0071503706,0.0029139288],"about_ca_topic_score_codex":0.00007570483,"about_ca_topic_score_gemma":0.00004339312,"teacher_disagreement_score":0.92991614,"about_ca_system_score_codex":0.00011433341,"about_ca_system_score_gemma":0.000045960252,"threshold_uncertainty_score":0.7928362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007783355,0.000029791345,0.9861052,0.00010716036,0.00042649842,0.0005086481,0.0000050920776,0.00097046565,0.004063757],"genre_scores_gemma":[0.6225533,3.4640632e-7,0.37640506,0.000031914977,0.000048521557,0.000072834846,0.00000802015,0.000007929126,0.000872063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899346,0.000050359078,0.00026328574,0.00032314248,0.00015492977,0.00021480575],"domain_scores_gemma":[0.99901253,0.00033895858,0.00011602546,0.00029703733,0.0002065914,0.00002883036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026969876,0.00012043828,0.00014277556,0.0001095576,0.00015062765,0.00027328552,0.00032171095,0.000048960745,0.0000035674614],"category_scores_gemma":[0.000089206034,0.00011220313,0.00003639086,0.00022470231,0.000013432899,0.0003922195,0.00006221049,0.00005441672,0.00000948932],"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.0000066015405,0.000047064852,0.0014990964,0.000054229586,0.000010465932,0.00000415604,0.00041442012,0.0038871309,0.004705267,0.9640957,0.011531655,0.013744192],"study_design_scores_gemma":[0.00015130854,0.00005731866,0.00058174285,0.000029600336,0.0000031049522,0.000009117409,0.00001843762,0.9754363,0.003228336,0.019929674,0.00040113897,0.00015396206],"about_ca_topic_score_codex":0.00039582615,"about_ca_topic_score_gemma":0.0001443971,"teacher_disagreement_score":0.97154915,"about_ca_system_score_codex":0.00008628825,"about_ca_system_score_gemma":0.000030118385,"threshold_uncertainty_score":0.4575511},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39553994,0.0003429895,0.58035123,0.0189899,0.00033600195,0.00026993087,0.0000037156628,0.0010154007,0.0031509148],"genre_scores_gemma":[0.82335925,0.00012876539,0.175296,0.0011481838,0.0000147040955,0.00001777293,0.0000014814599,0.000010058656,0.00002376743],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987495,0.00021731756,0.00035053582,0.0002465644,0.00020687889,0.00022921902],"domain_scores_gemma":[0.99566525,0.00041622034,0.00020973518,0.0035419972,0.00010805768,0.000058731952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039771615,0.00013667348,0.00020188655,0.000168047,0.00026523857,0.00007398415,0.0034693712,0.000061692284,0.000008728342],"category_scores_gemma":[0.00009561645,0.00015469281,0.00009931814,0.0004593736,0.00022835261,0.00036447635,0.0005272459,0.0003408035,0.000039862032],"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.000008526131,0.0012757311,0.034765065,0.00017909768,0.00018929626,0.000024439565,0.011993897,0.0003669134,0.72575986,0.060909793,0.091957636,0.07256976],"study_design_scores_gemma":[0.0009709441,0.00017851288,0.016760036,0.00075325987,0.00008038493,0.00016241962,0.0002416469,0.42906925,0.53380257,0.0047642062,0.011387258,0.001829515],"about_ca_topic_score_codex":0.00014774443,"about_ca_topic_score_gemma":0.00009692862,"teacher_disagreement_score":0.42870232,"about_ca_system_score_codex":0.00009375437,"about_ca_system_score_gemma":0.000013041077,"threshold_uncertainty_score":0.6447013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004024508,0.00005108292,0.9906693,0.00030199796,0.00064397545,0.0003736648,0.000003407444,0.0010581545,0.0028738966],"genre_scores_gemma":[0.30508062,0.0000015774222,0.6936701,0.00040810806,0.00012312179,0.000031754855,0.0000032986725,0.0000101673495,0.0006712739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.000024312461,0.0003077784,0.00043668924,0.00017912145,0.0004353846],"domain_scores_gemma":[0.99854994,0.00065934134,0.00011238128,0.00030218574,0.00028639456,0.00008974262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011295733,0.00015982825,0.00016803159,0.00018479385,0.0002568998,0.00015982935,0.00057716697,0.00008069698,0.000012316521],"category_scores_gemma":[0.00020725418,0.00015000706,0.00009232427,0.00030813288,0.000043983233,0.0005234387,0.000197473,0.00013225203,0.0000069222306],"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.00005983051,0.00019778992,0.0022951106,0.000069351656,0.00011725496,0.000021388942,0.004380403,0.000045262037,0.17897336,0.44579625,0.0068481485,0.36119586],"study_design_scores_gemma":[0.00038007685,0.0001906633,0.00046493122,0.000046292273,0.0000055385262,0.00003440089,0.00012538006,0.7887765,0.19938754,0.007591369,0.0026327914,0.00036450897],"about_ca_topic_score_codex":0.000054032593,"about_ca_topic_score_gemma":0.000097046555,"teacher_disagreement_score":0.7887313,"about_ca_system_score_codex":0.00014006942,"about_ca_system_score_gemma":0.00007296177,"threshold_uncertainty_score":0.611711},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031362288,0.000046906014,0.8845869,0.005077482,0.00042884162,0.0002504199,0.00002957311,0.0007074504,0.07751016],"genre_scores_gemma":[0.82325184,0.00007023041,0.17577806,0.000189476,0.000054467866,0.000038273254,0.00004593452,0.00001710664,0.0005546333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828416,0.0002528086,0.00044793583,0.00038153733,0.0003809971,0.0002525871],"domain_scores_gemma":[0.9971993,0.00027175297,0.0002388052,0.0016494258,0.00057383307,0.00006688475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404083,0.0002191935,0.00019870802,0.00029556986,0.00046289695,0.0005211023,0.0039799134,0.00009053173,0.00007477969],"category_scores_gemma":[0.000026263102,0.00022685561,0.0000966636,0.00036055312,0.00020220739,0.0006546905,0.0002846141,0.00038390217,0.00008429794],"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.00001958018,0.00065852515,0.00072325906,0.000010902269,0.000033970944,0.000007732626,0.00041965683,0.00062131457,0.26351583,0.713498,0.0047925743,0.01569868],"study_design_scores_gemma":[0.00028289427,0.000053080257,0.0008527892,0.00020261217,0.000009599623,0.000019515786,0.0000393616,0.913731,0.051537707,0.027522577,0.0053828154,0.00036609062],"about_ca_topic_score_codex":0.001475935,"about_ca_topic_score_gemma":0.0003347791,"teacher_disagreement_score":0.91310966,"about_ca_system_score_codex":0.00017977126,"about_ca_system_score_gemma":0.00020993265,"threshold_uncertainty_score":0.9250904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004599509,0.000016822869,0.9897672,0.00087535335,0.0005684687,0.00031464855,0.0000016556477,0.0005093469,0.0033469747],"genre_scores_gemma":[0.98419005,0.000020546515,0.014820702,0.00077829283,0.00003095351,0.000053021944,0.0000010696917,0.000008331889,0.00009700626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988126,0.00022574364,0.000356972,0.00012808327,0.00025871306,0.00021785151],"domain_scores_gemma":[0.9986337,0.00031212912,0.00019768738,0.0007087658,0.00010965442,0.000038086768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012475916,0.0001467038,0.00009248326,0.00023602968,0.00088398973,0.00034112547,0.0007729814,0.000069384754,0.00003944604],"category_scores_gemma":[0.000021790147,0.000089478366,0.000104128296,0.00078104594,0.00007682105,0.0023712004,0.0000053849894,0.00034639423,0.00007068262],"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.00006275622,0.00007673321,0.000027885028,0.000021453145,0.000075648255,0.000001269273,0.01748629,0.10651365,0.0004062268,0.066273406,0.000300634,0.808754],"study_design_scores_gemma":[0.00025702675,0.000059599763,0.00012142331,0.000059685914,0.00004333854,0.00015622817,0.0014539531,0.9439251,0.024595715,0.026896562,0.0021093285,0.0003220306],"about_ca_topic_score_codex":0.000025678173,"about_ca_topic_score_gemma":0.000010824375,"teacher_disagreement_score":0.9795906,"about_ca_system_score_codex":0.00011016569,"about_ca_system_score_gemma":0.000052749965,"threshold_uncertainty_score":0.6799024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003704808,0.00009264143,0.9938947,0.0038171345,0.00012008713,0.00075469504,0.000011653611,0.0005972012,0.00034142545],"genre_scores_gemma":[0.57474184,0.000071540126,0.42475805,0.00012180298,0.000005094169,0.00015434854,0.0000017094329,0.00001118729,0.0001344119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988094,0.00017382774,0.00031216358,0.00027536045,0.00019993419,0.00022931425],"domain_scores_gemma":[0.9960601,0.0006914561,0.00015677263,0.0027416507,0.00028309773,0.000066966946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040564698,0.00017537423,0.00023381754,0.000252549,0.00043399533,0.00006461795,0.0021789486,0.000085413776,0.00000395879],"category_scores_gemma":[0.000010487776,0.00016759946,0.00009748931,0.0006511039,0.0001237728,0.00031146043,0.0000062641625,0.00023891716,0.0000058731166],"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.0005059212,0.00812295,0.00002016145,0.00016099689,0.00056432834,0.0000057872126,0.01847379,0.26725814,0.13344105,0.07121073,0.005308722,0.49492744],"study_design_scores_gemma":[0.00094664324,0.0022556249,0.00005627626,0.00032963086,0.00010738594,0.000051599727,0.00017464539,0.5178551,0.45785892,0.01795031,0.0017762876,0.00063758565],"about_ca_topic_score_codex":0.00003456062,"about_ca_topic_score_gemma":0.00003460379,"teacher_disagreement_score":0.5743714,"about_ca_system_score_codex":0.00005648737,"about_ca_system_score_gemma":0.00010361719,"threshold_uncertainty_score":0.68345076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077698135,0.00016494961,0.9673826,0.02091493,0.00026415888,0.0003326759,0.000027630858,0.00189739,0.00823868],"genre_scores_gemma":[0.7775262,0.00011772029,0.22065891,0.0008117729,0.000027824464,0.0001919277,0.0000011653324,0.000021017475,0.00064344675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998399,0.0002522493,0.00038514513,0.00035836082,0.00028497123,0.0003202703],"domain_scores_gemma":[0.9924985,0.00063000317,0.000120117606,0.006456493,0.00017234468,0.00012251458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038155165,0.0002164319,0.00021155439,0.00029141075,0.0007996344,0.0001345899,0.005378246,0.00011615394,0.000028292434],"category_scores_gemma":[0.000028241162,0.00023301803,0.00017171424,0.00063283,0.00015126402,0.00057597674,0.000031142587,0.00065436796,0.0002518862],"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.00010476007,0.007917778,0.00021570026,0.000053886655,0.0006865435,0.000011618763,0.01057372,0.06798111,0.028870512,0.11433032,0.036802385,0.7324517],"study_design_scores_gemma":[0.0026930838,0.0005044458,0.0005117861,0.00019812965,0.00017950649,0.00019909965,0.00016452036,0.7785058,0.09108648,0.012725015,0.11164588,0.0015862542],"about_ca_topic_score_codex":0.00010766592,"about_ca_topic_score_gemma":0.0013507386,"teacher_disagreement_score":0.77674925,"about_ca_system_score_codex":0.00016197994,"about_ca_system_score_gemma":0.00009611729,"threshold_uncertainty_score":0.9994208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34808245,0.00007606234,0.64433116,0.0014847395,0.00024342033,0.0009836355,0.0000011176206,0.0011395843,0.0036578125],"genre_scores_gemma":[0.80702114,0.000005214209,0.1919205,0.00039053222,0.000035496392,0.000029277104,0.0000020550704,0.00001102768,0.00058472285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820006,0.00013621621,0.000424156,0.00056699954,0.00027395642,0.0003985967],"domain_scores_gemma":[0.9988391,0.00031333126,0.00008714274,0.0005422808,0.00011339804,0.00010476085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009813634,0.00021736846,0.0003282012,0.00015913861,0.00016912956,0.00023011967,0.0006671286,0.00013384208,0.000006241308],"category_scores_gemma":[0.00016037276,0.00018957886,0.000085556756,0.00031590622,0.0000168597,0.00034208279,0.000059310692,0.00024847675,0.000023158469],"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.00028351357,0.0032897634,0.004470729,0.0010123617,0.00008468071,0.00037118388,0.01329704,0.017411659,0.08542918,0.17416304,0.019716509,0.68047035],"study_design_scores_gemma":[0.00067464396,0.0006816053,0.0024570834,0.000695452,0.0000057449674,0.000034595054,0.00006983371,0.9376435,0.054274477,0.002507773,0.00047966896,0.00047558243],"about_ca_topic_score_codex":0.00015852098,"about_ca_topic_score_gemma":0.000028115564,"teacher_disagreement_score":0.9202319,"about_ca_system_score_codex":0.00011928538,"about_ca_system_score_gemma":0.00006200293,"threshold_uncertainty_score":0.77308017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04762605,0.0001341459,0.94672525,0.000033694138,0.00018741912,0.00032332662,7.0128436e-7,0.0004475919,0.0045218263],"genre_scores_gemma":[0.54981196,0.00000747403,0.45008597,0.0000144495725,0.000006174907,0.000023597788,5.472186e-7,0.000005780965,0.00004401444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.000042847318,0.0003568676,0.00023118866,0.00018111328,0.00017790783],"domain_scores_gemma":[0.99780315,0.0008252984,0.00014511166,0.00094565336,0.00022712181,0.000053644264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082166254,0.00009979409,0.00018979526,0.00011179309,0.00009416396,0.000055034423,0.0012511815,0.00008088342,0.0000035645915],"category_scores_gemma":[0.00029904212,0.00008742318,0.00006612971,0.00018476367,0.00004537799,0.0002947375,0.0003674046,0.00008341268,0.000007075456],"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.000090897935,0.00044079573,0.018416496,0.00016436548,0.00005529494,0.0000051224138,0.0029017283,0.00021395231,0.0037618275,0.80933785,0.0037168034,0.16089486],"study_design_scores_gemma":[0.0005543131,0.0005942553,0.005561869,0.0006263453,0.000030334395,0.0000963376,0.00025692536,0.8152697,0.15463078,0.021517195,0.00033277244,0.0005291957],"about_ca_topic_score_codex":0.00012926114,"about_ca_topic_score_gemma":0.0000752836,"teacher_disagreement_score":0.8150557,"about_ca_system_score_codex":0.000036909587,"about_ca_system_score_gemma":0.000027625707,"threshold_uncertainty_score":0.35650137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076228124,0.00004325026,0.98922145,0.0011206246,0.00033791034,0.00072419207,0.000100475816,0.0005860791,0.00024318002],"genre_scores_gemma":[0.8084375,0.00006141105,0.19104746,0.00006517928,0.000025958549,0.00024622216,0.000016241838,0.000020572383,0.000079396625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857545,0.00017057337,0.00045942212,0.0003325969,0.00022897271,0.00023301097],"domain_scores_gemma":[0.99602246,0.0015887603,0.00026840332,0.0017504303,0.00030457543,0.0000653921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114456,0.00018310705,0.00022309227,0.00045357432,0.00066500594,0.00006391694,0.0010128953,0.00010883132,0.000022484195],"category_scores_gemma":[0.00007282836,0.00020296121,0.00019011447,0.00076860184,0.00010461353,0.0004169729,0.000019145033,0.00028269368,0.000008841953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001005821,0.0012258239,0.000022083326,0.0000341822,0.00007879637,1.6097387e-7,0.003996895,0.9276173,0.015038564,0.00783106,0.00023182823,0.043822683],"study_design_scores_gemma":[0.00043218484,0.00016601961,0.00011806747,0.00011286023,0.00003064967,0.0000018186441,0.00009287204,0.95582443,0.040716957,0.0002290753,0.0020786533,0.00019639451],"about_ca_topic_score_codex":0.000060938193,"about_ca_topic_score_gemma":0.000091563685,"teacher_disagreement_score":0.80081475,"about_ca_system_score_codex":0.00018289105,"about_ca_system_score_gemma":0.000074989206,"threshold_uncertainty_score":0.82765174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23807116,0.000059862406,0.7581692,0.00005587907,0.00032209564,0.0000988907,3.5322597e-7,0.00056963763,0.002652971],"genre_scores_gemma":[0.7948983,0.0000017345031,0.20491377,0.00008108894,0.00004634745,0.00000505109,3.5881465e-7,0.0000076665865,0.000045736662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988512,0.00006129782,0.00024548112,0.0002290792,0.00023530841,0.00037768067],"domain_scores_gemma":[0.9988259,0.00023839706,0.00012564781,0.0005887783,0.00010518926,0.00011610124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606704,0.00013417247,0.00021869999,0.000102545295,0.00008569161,0.000038375907,0.00063994067,0.00007311919,0.000021980328],"category_scores_gemma":[0.00021357891,0.00012572153,0.00006769397,0.00025299418,0.0000531997,0.00050654216,0.00040706486,0.00015458465,0.000044716682],"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.00003915024,0.0016341887,0.17899658,0.00039844014,0.00015281573,0.00001960955,0.011529965,0.00046964755,0.06684344,0.5773293,0.0060033156,0.15658356],"study_design_scores_gemma":[0.0006327978,0.0004076556,0.056819227,0.00036674744,0.000051821055,0.00023697541,0.00036422076,0.19897765,0.72505635,0.015500914,0.00012391731,0.001461724],"about_ca_topic_score_codex":0.00018116628,"about_ca_topic_score_gemma":0.00006242192,"teacher_disagreement_score":0.6582129,"about_ca_system_score_codex":0.00006788183,"about_ca_system_score_gemma":0.00004581169,"threshold_uncertainty_score":0.51267755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07422297,0.000003820029,0.92498744,0.00006654725,0.00014000856,0.00019040791,0.0001290902,0.000082196384,0.00017750135],"genre_scores_gemma":[0.95634663,0.0000014413758,0.043432858,0.00016412248,0.0000072157604,0.000028227394,0.0000060462194,0.0000023442853,0.000011104983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990489,0.00013253739,0.00041218862,0.000093968265,0.00022012464,0.00009232026],"domain_scores_gemma":[0.99859273,0.00038628565,0.00030540556,0.00037988136,0.0003104102,0.000025277026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006538678,0.00008681226,0.00015896016,0.00033748712,0.00017412916,0.000031626245,0.00044052282,0.00005189223,0.000028383927],"category_scores_gemma":[0.000025651601,0.00006666837,0.00019523925,0.00058843597,0.0000912165,0.0012835097,0.0000024016863,0.000095441996,7.3406153e-7],"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.0001092851,0.000104369254,0.00025937488,0.000035509212,0.00036552822,1.462145e-8,0.009273735,0.3910588,0.0017859536,0.5132757,0.000025964795,0.08370579],"study_design_scores_gemma":[0.0002361394,0.00010647287,0.0051410105,0.000021772603,0.00018056289,0.0000020291075,0.00035907383,0.7036272,0.2732056,0.01688474,0.000097596465,0.00013773511],"about_ca_topic_score_codex":0.000011579482,"about_ca_topic_score_gemma":0.000052893203,"teacher_disagreement_score":0.88212365,"about_ca_system_score_codex":0.000058559715,"about_ca_system_score_gemma":0.00006627352,"threshold_uncertainty_score":0.27186573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010297352,0.000023734852,0.9738406,0.0039830618,0.0004488627,0.00029073592,5.898237e-7,0.0015007053,0.018881978],"genre_scores_gemma":[0.76322466,0.0000034633383,0.23459315,0.0009557597,0.000100669626,0.00001932732,8.333702e-7,0.000006917767,0.001095201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894714,0.00001909424,0.00018715019,0.00036408572,0.00014718882,0.00033534033],"domain_scores_gemma":[0.99923325,0.00007336751,0.0000638344,0.00048427243,0.000059790218,0.00008548834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003006875,0.00013211524,0.0001452921,0.00010759585,0.00013408734,0.00018065964,0.0007018475,0.000052398143,0.000010228106],"category_scores_gemma":[0.0000718831,0.00011519677,0.00008555341,0.00023463595,0.000013445669,0.0003608909,0.00010250033,0.000090384405,0.000020399952],"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.000008737163,0.00010767969,0.00007913662,0.000016055461,0.000007979491,0.000010899584,0.0013802242,0.000037926693,0.009313558,0.55707765,0.019441852,0.41251832],"study_design_scores_gemma":[0.0009102022,0.001788828,0.0016701026,0.00023694598,0.000015711965,0.00015455986,0.00017222358,0.44433656,0.33915615,0.1643773,0.04575508,0.0014263281],"about_ca_topic_score_codex":0.000015884027,"about_ca_topic_score_gemma":0.0000050589692,"teacher_disagreement_score":0.76219493,"about_ca_system_score_codex":0.000046891077,"about_ca_system_score_gemma":0.000024331837,"threshold_uncertainty_score":0.4697588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21266785,0.000007087247,0.7821281,0.00024678287,0.000061180195,0.00027257772,5.6025937e-7,0.00068809814,0.003927742],"genre_scores_gemma":[0.7066492,0.000004814009,0.2926232,0.00007524262,0.000015926104,0.000055044467,7.979424e-7,0.00000831512,0.0005674907],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922556,0.000017087059,0.00013781666,0.00025702105,0.00015450818,0.00020800855],"domain_scores_gemma":[0.9994324,0.00011555757,0.00004802091,0.00023867968,0.0001225864,0.000042778724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018801959,0.000106327,0.00011969226,0.000099058496,0.00019483446,0.00006516196,0.00041990855,0.000043250206,0.000002695711],"category_scores_gemma":[0.000017091748,0.00008381806,0.000038068658,0.00022098514,0.00003303554,0.00061548955,0.000024725221,0.00006518884,0.000003915677],"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.00015667544,0.00033920634,0.023667699,0.00015463153,0.00006916788,0.000120869474,0.019812439,0.00010173342,0.023912432,0.12433758,0.0054168464,0.8019107],"study_design_scores_gemma":[0.0011641983,0.0012338049,0.010049701,0.00010741529,0.000014077759,0.0003939695,0.00011250038,0.13022941,0.84724057,0.0062083746,0.0024601384,0.0007858609],"about_ca_topic_score_codex":0.000051048075,"about_ca_topic_score_gemma":0.00009456594,"teacher_disagreement_score":0.82332814,"about_ca_system_score_codex":0.000035358506,"about_ca_system_score_gemma":0.000049317863,"threshold_uncertainty_score":0.34180012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972629,0.00003876833,0.016782174,0.0003695158,0.000036779093,0.00027888775,2.389413e-7,0.000058994403,0.009805641],"genre_scores_gemma":[0.96108437,0.000009352456,0.038787484,0.000050219904,0.000008398607,0.000026325233,2.0648116e-7,0.0000018521248,0.000031793494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988904,0.00016108711,0.0002187415,0.00012861005,0.0005053853,0.00009575429],"domain_scores_gemma":[0.9990323,0.0001998684,0.00011076872,0.00042990947,0.0002180392,0.000009116759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023832594,0.000051961768,0.00008925182,0.00007946807,0.000019907504,0.0000105267845,0.00083072414,0.000026506686,0.0000101914975],"category_scores_gemma":[0.00019765909,0.00003592627,0.000020566482,0.00038664596,0.000045026653,0.00031897353,0.000092262904,0.00006498619,0.0000026064595],"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.000049265735,0.0007030655,0.12853922,0.000097556134,0.000016631122,9.465878e-7,0.030007089,0.025464974,0.0630751,0.025363153,0.0033251871,0.7233578],"study_design_scores_gemma":[0.000121010315,0.00008085797,0.053203173,0.000031279553,0.0000035257988,0.0000022168274,0.000074098316,0.82201713,0.12406567,0.00031348492,0.000043057313,0.000044520908],"about_ca_topic_score_codex":0.000089607835,"about_ca_topic_score_gemma":0.00020511904,"teacher_disagreement_score":0.7965521,"about_ca_system_score_codex":0.000029501718,"about_ca_system_score_gemma":0.00007135299,"threshold_uncertainty_score":0.15437059},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013518333,0.000027313345,0.965297,0.00024881866,0.005933701,0.001038144,0.000048344413,0.0017212455,0.012167121],"genre_scores_gemma":[0.9920813,0.000003756587,0.0044971528,0.00048726675,0.00020335725,0.0005681057,0.000002742397,0.000079307436,0.0020770538],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587286,0.00046367088,0.00074791844,0.0012310506,0.00090538466,0.0007791194],"domain_scores_gemma":[0.996256,0.00088224927,0.00032904715,0.0019300112,0.000317694,0.00028500266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009014175,0.00056623155,0.0005743071,0.000617409,0.0011265896,0.00043923414,0.0015709196,0.00039183866,0.00006385288],"category_scores_gemma":[0.00005286968,0.00056765246,0.0002696167,0.000738937,0.000108105196,0.00091978407,0.000013789019,0.0014948597,0.0000837382],"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.00014970571,0.0039432445,0.0003477664,0.0007468913,0.00045023317,0.0004920024,0.04002794,0.06543839,0.74543893,0.014633687,0.01136947,0.11696174],"study_design_scores_gemma":[0.0029452331,0.0017084578,0.00022083064,0.0025537708,0.00012896967,0.0002610166,0.00045684323,0.43719208,0.51558757,0.00045168432,0.03534,0.003153525],"about_ca_topic_score_codex":0.0003088924,"about_ca_topic_score_gemma":0.00015247132,"teacher_disagreement_score":0.97856295,"about_ca_system_score_codex":0.00020354487,"about_ca_system_score_gemma":0.0002458531,"threshold_uncertainty_score":0.9996775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056741633,0.000026362339,0.9412149,0.000022179287,0.00025926364,0.0003414421,0.0000029615223,0.00041517479,0.0009760908],"genre_scores_gemma":[0.48711085,8.8981506e-7,0.512798,0.000021744201,0.00000956046,0.000021932992,6.9982923e-7,0.00000775734,0.00002856605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876463,0.00004916945,0.00029354214,0.00039238503,0.00019385105,0.0003064447],"domain_scores_gemma":[0.99893105,0.00010962092,0.00014547749,0.0006094885,0.00012922863,0.000075114986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078732026,0.00014292305,0.00022053633,0.00017984935,0.000109041845,0.00003479979,0.0008996783,0.000067539906,0.000009732865],"category_scores_gemma":[0.000033066874,0.00012509347,0.00009556445,0.00025726334,0.000048349153,0.00020650553,0.00012298593,0.00007112046,0.0000022045585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001959241,0.0006639549,0.00043537046,0.00008934883,0.00004755882,0.000016842461,0.015985025,0.00015876471,0.06029792,0.041584175,0.0005528393,0.8801486],"study_design_scores_gemma":[0.00015078436,0.00024017428,0.00040895987,0.000045328157,0.000006240927,0.000011926621,0.00013762292,0.58069843,0.4166652,0.0014310271,0.00005277387,0.00015155294],"about_ca_topic_score_codex":0.000092637565,"about_ca_topic_score_gemma":0.000011725143,"teacher_disagreement_score":0.8799971,"about_ca_system_score_codex":0.00003303506,"about_ca_system_score_gemma":0.000042617095,"threshold_uncertainty_score":0.5101164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026401307,0.000016657345,0.9952764,0.0005911115,0.00012249342,0.0005564853,0.0000031719908,0.00030544813,0.00048810852],"genre_scores_gemma":[0.41455245,0.0000010020376,0.58508706,0.00010158169,0.000048001355,0.00006373431,0.000002144567,0.000003799607,0.00014020612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921125,0.000060795883,0.00021577187,0.00021716185,0.00015223285,0.00014278846],"domain_scores_gemma":[0.99916834,0.00024773247,0.00011006736,0.0001790057,0.00026584312,0.000029002847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040480672,0.00008658606,0.0001157626,0.00007900856,0.000073671436,0.000039639213,0.00031374404,0.000046547695,0.000011849469],"category_scores_gemma":[0.00012681894,0.0000781158,0.00004188817,0.00013620054,0.00004141876,0.00045764487,0.000055968074,0.00004299042,0.000004644039],"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.000299285,0.000491614,0.000456568,0.00007305326,0.00008190711,0.0000012241402,0.007047355,0.019155249,0.17397128,0.6792714,0.02383658,0.09531452],"study_design_scores_gemma":[0.00034043286,0.00030122307,0.00010457169,0.000020396003,0.000004181076,0.000004859649,0.000021248565,0.7324976,0.25849485,0.0076012937,0.00048265874,0.0001266906],"about_ca_topic_score_codex":0.000012495053,"about_ca_topic_score_gemma":0.000029220702,"teacher_disagreement_score":0.7133423,"about_ca_system_score_codex":0.00006180233,"about_ca_system_score_gemma":0.00012513349,"threshold_uncertainty_score":0.318547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27392754,0.000012906963,0.72345257,0.000018074468,0.00023370591,0.00019952824,0.0000031034076,0.00030714067,0.0018454718],"genre_scores_gemma":[0.55581194,0.0000028288166,0.44392496,0.000012648514,0.000017365724,0.000033634806,0.0000012100597,0.0000063561106,0.00018906938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884075,0.000016710957,0.00032733212,0.0003764004,0.0001960689,0.00024272731],"domain_scores_gemma":[0.9987616,0.00006841611,0.00019943505,0.00064094854,0.00027256724,0.000057049834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579941,0.000140222,0.00028141434,0.0005215834,0.00008469093,0.000027361613,0.0006978648,0.00006476331,0.000030385212],"category_scores_gemma":[0.00003746721,0.00012788601,0.0001714305,0.0014999472,0.00004051469,0.0004676964,0.000116747324,0.00007938859,0.000007662996],"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.00024618083,0.0039597857,0.08332927,0.00059436687,0.0035662851,0.00000382369,0.030477697,0.0021797603,0.23403588,0.029729003,0.0012298872,0.61064804],"study_design_scores_gemma":[0.00014971642,0.00033339948,0.0066815764,0.000017457278,0.00019048367,0.0000048857532,0.000051862928,0.7569811,0.23522522,0.00011668848,0.00007309784,0.00017454615],"about_ca_topic_score_codex":0.0006921096,"about_ca_topic_score_gemma":0.000100299076,"teacher_disagreement_score":0.75480133,"about_ca_system_score_codex":0.000042400647,"about_ca_system_score_gemma":0.000041725816,"threshold_uncertainty_score":0.52150404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08115432,0.00002682874,0.915587,0.0016918815,0.00006549951,0.00025123646,3.2789535e-7,0.0005550678,0.00066783774],"genre_scores_gemma":[0.66589254,5.866586e-7,0.3332007,0.00084058725,0.000014072902,0.0000066785333,0.0000010660831,0.0000026498133,0.000041138675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936956,0.00001729459,0.0001372033,0.00023797201,0.00009375671,0.00014418692],"domain_scores_gemma":[0.9994331,0.00017816409,0.00005967213,0.00020211567,0.00008841364,0.000038519192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002512423,0.00007931337,0.000094537965,0.00008880392,0.0000973069,0.0001262831,0.00021254647,0.000034691086,0.0000017460646],"category_scores_gemma":[0.000091228416,0.00007444169,0.000027899938,0.00010604031,0.000012160363,0.00026686888,0.000029451856,0.000048038066,0.0000011929835],"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.00004705106,0.000106486936,0.0030299285,0.000032219807,0.000010214604,0.0000040682216,0.00066592766,0.000067545996,0.09323486,0.13858083,0.0007469768,0.76347387],"study_design_scores_gemma":[0.0011875621,0.00048280833,0.008783397,0.000095262134,0.0000072983667,0.000008630897,0.000087422035,0.8436305,0.13787466,0.007220054,0.0003319694,0.0002904628],"about_ca_topic_score_codex":0.000028677638,"about_ca_topic_score_gemma":0.000025091867,"teacher_disagreement_score":0.8435629,"about_ca_system_score_codex":0.00002499589,"about_ca_system_score_gemma":0.00002085951,"threshold_uncertainty_score":0.30356443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006784258,0.000048652637,0.9853622,0.0076014847,0.00033038866,0.0006738572,0.0000025277757,0.0015604964,0.0037419724],"genre_scores_gemma":[0.86734504,0.000037832408,0.1308237,0.00024556753,0.000010935783,0.00075896917,0.000002924766,0.000020458654,0.00075457647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986574,0.00019246653,0.0003376943,0.00031832766,0.0002459383,0.00024817185],"domain_scores_gemma":[0.9956638,0.0004257461,0.00012151525,0.0034261518,0.00026053388,0.00010222893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022228133,0.00017418963,0.00014444666,0.00026951206,0.0007160941,0.0001811446,0.0023434774,0.0000999482,0.00005424935],"category_scores_gemma":[0.000026866639,0.00018057444,0.000099701814,0.0007260161,0.00012304093,0.00081476994,0.000015242078,0.000539982,0.0008009557],"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.000016423079,0.0033688797,0.00002659132,0.000046153087,0.00017204724,0.0000026071157,0.007022297,0.017136922,0.046938226,0.09257768,0.00750503,0.82518715],"study_design_scores_gemma":[0.0006853818,0.0005039716,0.0006370166,0.00027477468,0.00006610601,0.00008891283,0.00020337092,0.9170378,0.050203096,0.02679921,0.0024463453,0.0010540212],"about_ca_topic_score_codex":0.00032743145,"about_ca_topic_score_gemma":0.00017132064,"teacher_disagreement_score":0.89990085,"about_ca_system_score_codex":0.00013002282,"about_ca_system_score_gemma":0.000075763324,"threshold_uncertainty_score":0.99997705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015249847,0.0001296343,0.98820084,0.0017662725,0.0005270007,0.00027247745,0.0000037660789,0.0011810028,0.006394035],"genre_scores_gemma":[0.8245517,0.000099850906,0.17469446,0.00016274367,0.000023677278,0.0001786117,0.0000018424201,0.000015956448,0.00027118388],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888563,0.00019970801,0.00025113902,0.00018524968,0.00019515648,0.00028308955],"domain_scores_gemma":[0.9968136,0.00033149784,0.00010125533,0.0025470608,0.00010011527,0.00010649151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004270321,0.0001370644,0.00011308042,0.000206022,0.00068769563,0.00008435046,0.0017174416,0.000075312346,0.00002104732],"category_scores_gemma":[0.00001666995,0.00014295761,0.00008553928,0.0005822998,0.000070067275,0.0009013778,0.00001674219,0.0003809895,0.00017837953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017016106,0.0033064676,0.0006077296,0.000033320877,0.00013414874,0.0000010067143,0.011367103,0.0011344453,0.024193691,0.090393946,0.0020942409,0.86671686],"study_design_scores_gemma":[0.0012703612,0.00057560025,0.0034368339,0.00042568057,0.000168218,0.00020263653,0.00064199435,0.41586486,0.5215877,0.009702984,0.04384776,0.0022753682],"about_ca_topic_score_codex":0.00004780008,"about_ca_topic_score_gemma":0.00007804343,"teacher_disagreement_score":0.8644415,"about_ca_system_score_codex":0.0001337533,"about_ca_system_score_gemma":0.000044495144,"threshold_uncertainty_score":0.58296424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057470746,0.000089586945,0.9395711,0.000175486,0.0010958759,0.0004719792,0.0000036740976,0.0009071935,0.00021436828],"genre_scores_gemma":[0.97137517,0.000030290046,0.028163873,0.000106416184,0.00009753852,0.00011150252,4.6050258e-7,0.000028713865,0.00008606695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985489,0.00015413,0.0003191953,0.00045334807,0.00016067762,0.00036372544],"domain_scores_gemma":[0.9976877,0.001497382,0.00013491961,0.0004979932,0.0000947514,0.0000872488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688552,0.00026824238,0.00025670242,0.00012911482,0.0012046227,0.00020104287,0.0005622933,0.000080453334,0.0000016877075],"category_scores_gemma":[0.000012246663,0.00017931317,0.00011184644,0.00027756544,0.000061797786,0.00033276406,0.0000061717183,0.00032560894,0.0000035875178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000660151,0.000049750186,0.000038472244,0.00035761937,0.000043794218,6.711345e-7,0.0028914548,0.036566924,0.016192814,0.00036554915,0.00007283803,0.94335407],"study_design_scores_gemma":[0.00031163494,0.00019154573,0.00008022926,0.0003768642,0.000018425115,0.00004372507,0.00017099355,0.8509503,0.14588661,0.000044906334,0.0017159663,0.00020878532],"about_ca_topic_score_codex":0.000045781726,"about_ca_topic_score_gemma":0.000012891689,"teacher_disagreement_score":0.94314533,"about_ca_system_score_codex":0.00006651078,"about_ca_system_score_gemma":0.000029872284,"threshold_uncertainty_score":0.9265105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045485995,0.000011692365,0.9890733,0.00035880925,0.00049179775,0.00031488226,0.000008014248,0.0004174457,0.004775455],"genre_scores_gemma":[0.97784257,0.000023925846,0.021266637,0.0005372977,0.000013802785,0.00004685807,0.0000013576076,0.000006804654,0.0002607442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987332,0.00012691668,0.0003999224,0.00013424778,0.00037372156,0.00023199391],"domain_scores_gemma":[0.99852234,0.0003653415,0.0002445264,0.0006324877,0.00017898729,0.00005634429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089025096,0.00016699842,0.00014947746,0.00020215924,0.00034297173,0.00013712028,0.0006385472,0.00007370765,0.000026974776],"category_scores_gemma":[0.000015743777,0.0001148538,0.00006833137,0.00047890557,0.00008378364,0.0016255605,0.0000030694837,0.00024459106,0.00002460023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008761162,0.000356166,0.0000057774437,0.000063974476,0.00013841644,0.0000015984331,0.011232436,0.03721831,0.0011630509,0.29710826,0.0014531733,0.65038276],"study_design_scores_gemma":[0.0041250666,0.004959656,0.0013210219,0.0009749247,0.00016836787,0.00020430895,0.0038545956,0.30543375,0.5356664,0.12964103,0.011515927,0.0021349643],"about_ca_topic_score_codex":0.000014723763,"about_ca_topic_score_gemma":0.0000038373223,"teacher_disagreement_score":0.97329396,"about_ca_system_score_codex":0.00007047626,"about_ca_system_score_gemma":0.000075767675,"threshold_uncertainty_score":0.46836022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017157575,0.000028634655,0.9664162,0.00025340953,0.0003310094,0.0002588156,4.585976e-7,0.0014043659,0.014149555],"genre_scores_gemma":[0.5703746,0.0000011125712,0.4283567,0.0009226349,0.000015125945,0.000012462289,4.3254286e-7,0.000020738207,0.00029617714],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978007,0.00047890312,0.00029064287,0.0006115557,0.00035062296,0.0004675876],"domain_scores_gemma":[0.9984098,0.00032512902,0.0001411274,0.00090738747,0.00009846721,0.0001180576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016524717,0.00026007358,0.00025081667,0.0003882634,0.00026013903,0.00020388472,0.0006860592,0.0000951275,0.00007015889],"category_scores_gemma":[0.0002900842,0.00024196258,0.00009208558,0.0008085216,0.000048027214,0.00041093858,0.00009231432,0.0002040783,0.000036668363],"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.000078239456,0.00093528075,0.0064756926,0.00019109562,0.00010368963,0.00074154965,0.0028138035,0.037286516,0.71117955,0.2081737,0.017661098,0.01435975],"study_design_scores_gemma":[0.00020994575,0.00010577794,0.00010633059,0.000116216346,0.0000075837515,0.000017607395,0.000038072205,0.45773542,0.53848606,0.0022270093,0.00059292204,0.0003570185],"about_ca_topic_score_codex":0.000039015787,"about_ca_topic_score_gemma":0.000008683886,"teacher_disagreement_score":0.553217,"about_ca_system_score_codex":0.00008942077,"about_ca_system_score_gemma":0.000112255555,"threshold_uncertainty_score":0.98669475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4837476,0.000052646843,0.5138625,0.00005202137,0.00009338254,0.00015496778,0.0000016970862,0.00022887504,0.0018063171],"genre_scores_gemma":[0.6615314,0.0000035265673,0.33832213,0.00006573517,0.000023443878,0.000008764228,0.0000017856488,0.000004398641,0.000038821836],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989116,0.000013170935,0.00033522488,0.00028101436,0.00021261362,0.00024633665],"domain_scores_gemma":[0.99900377,0.0003771905,0.0001445863,0.0001914958,0.00022208426,0.0000608698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076230767,0.00012459207,0.00020759695,0.00012699311,0.0001579621,0.000046423364,0.00032335075,0.000058399834,0.0000047619924],"category_scores_gemma":[0.000028764644,0.00011406352,0.00004458783,0.00017968791,0.00006695908,0.00040694125,0.00015518501,0.000108707325,0.0000011601828],"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.000083024584,0.00019923049,0.66313106,0.00011735925,0.00004865596,0.0000014681856,0.003967146,0.00008983819,0.0056026396,0.3004841,0.0016869904,0.024588468],"study_design_scores_gemma":[0.00038356264,0.00032769583,0.02301519,0.00005541782,0.000008207164,0.00002088933,0.0000814372,0.88146454,0.092308685,0.0017202833,0.00039914166,0.00021494456],"about_ca_topic_score_codex":0.000006955676,"about_ca_topic_score_gemma":0.00004990935,"teacher_disagreement_score":0.8813747,"about_ca_system_score_codex":0.00004231719,"about_ca_system_score_gemma":0.00005104477,"threshold_uncertainty_score":0.46513754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061056416,0.0014852007,0.9359404,0.00007401077,0.000111801295,0.00028629374,0.000013820166,0.00030168548,0.0007304072],"genre_scores_gemma":[0.99802864,0.000016322807,0.0014604056,0.000039460312,0.00006354135,0.000044725857,0.0000025391791,0.000022654613,0.000321696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.000027436929,0.00037691576,0.00057176856,0.00022451131,0.00033337963],"domain_scores_gemma":[0.999299,0.00012920944,0.00014394206,0.00017529617,0.00012471393,0.00012784901],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032223167,0.00025426032,0.00033550034,0.00019241165,0.0008653695,0.0011436259,0.0001720413,0.00013351961,4.192949e-7],"category_scores_gemma":[0.0000063557327,0.00023398915,0.00006498193,0.00024887145,0.00010010858,0.0010717243,0.000007684728,0.00014902971,3.7971702e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015189988,0.00014264091,0.00037309836,0.00060600997,0.00003952123,0.000014214116,0.00078241975,0.0009836336,0.008295604,0.0018960498,0.0000711984,0.9867804],"study_design_scores_gemma":[0.0016008056,0.00080739375,0.0005216048,0.0016060126,0.00012277799,0.00089853007,0.00071758364,0.96558315,0.013906746,0.011760296,0.0010394966,0.0014355894],"about_ca_topic_score_codex":0.00007030835,"about_ca_topic_score_gemma":0.00001992986,"teacher_disagreement_score":0.9853448,"about_ca_system_score_codex":0.00003828794,"about_ca_system_score_gemma":0.00005240337,"threshold_uncertainty_score":0.9998933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003573268,0.00007000455,0.9923399,0.0011117213,0.00071634335,0.0014062963,0.00002521487,0.00065580726,0.00010144219],"genre_scores_gemma":[0.73804253,0.00006016885,0.2611682,0.00005990848,0.000009979944,0.0005257881,0.0000021344295,0.000019812776,0.00011147372],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982767,0.0003850745,0.0005493159,0.00031248096,0.00023534978,0.00024103886],"domain_scores_gemma":[0.9931817,0.0021671539,0.00027560216,0.0038434824,0.00044609234,0.000085969696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275456,0.0002032328,0.0003812741,0.00027088073,0.00063347985,0.00008024223,0.0026175838,0.00017509617,0.000004277165],"category_scores_gemma":[0.00010543129,0.00020692428,0.00019129773,0.000510557,0.00016196027,0.00031541195,0.000022972816,0.0006043259,0.000015349273],"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.0001882771,0.007752281,0.000060851908,0.011533913,0.0008832367,0.0000069254406,0.015722327,0.033575483,0.8632299,0.053949542,0.0032364698,0.009860806],"study_design_scores_gemma":[0.00049680885,0.00041295498,0.000050226416,0.0020040506,0.00015229992,0.00005689874,0.00018044566,0.60731626,0.3814562,0.007226636,0.00009962171,0.00054759753],"about_ca_topic_score_codex":0.00006246008,"about_ca_topic_score_gemma":0.00031815915,"teacher_disagreement_score":0.73446923,"about_ca_system_score_codex":0.00004734863,"about_ca_system_score_gemma":0.00013073572,"threshold_uncertainty_score":0.8438127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22556041,0.0004548269,0.73367333,0.036832456,0.00044356813,0.0004706686,0.000013264014,0.00090253074,0.0016489337],"genre_scores_gemma":[0.5911902,0.000053023017,0.40767136,0.0009790383,0.000044469478,0.000038616432,0.000008357509,0.000007680294,0.000007245671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846625,0.0002797762,0.00042226797,0.00030497863,0.00028800886,0.00023871908],"domain_scores_gemma":[0.99664897,0.00034209646,0.0003687709,0.002188897,0.0004014964,0.000049792896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034065198,0.00016690705,0.00022967017,0.00012272177,0.00034588503,0.000064732,0.002339112,0.0000888683,0.0000059650506],"category_scores_gemma":[0.00011939359,0.0001836773,0.00010327735,0.0004617116,0.00082068704,0.0007490857,0.00051074027,0.00038785778,0.000028537195],"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.000049561277,0.0015586728,0.038353615,0.00019742425,0.0003335058,0.000011294733,0.009836971,0.0003781761,0.20741932,0.6533933,0.056572076,0.03189609],"study_design_scores_gemma":[0.0017724244,0.00023104649,0.022476302,0.0008450244,0.00012648279,0.0005996934,0.00045604337,0.06755404,0.8576879,0.034041807,0.01230601,0.0019032152],"about_ca_topic_score_codex":0.00011577746,"about_ca_topic_score_gemma":0.000057892394,"teacher_disagreement_score":0.6502686,"about_ca_system_score_codex":0.00016090545,"about_ca_system_score_gemma":0.00010239395,"threshold_uncertainty_score":0.7490143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030381497,0.000011196883,0.9645002,0.0034890117,0.000098480305,0.0004167893,0.00001586604,0.0004279403,0.0006590528],"genre_scores_gemma":[0.5276159,2.8579674e-7,0.47157338,0.00066389877,0.000026530384,0.00003828016,0.0000082260885,0.000005360577,0.00006813855],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988672,0.000046709905,0.00029068894,0.0003102948,0.00023282722,0.00025228746],"domain_scores_gemma":[0.9988398,0.00033009375,0.00012811206,0.00041530526,0.00021839821,0.000068308254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037593587,0.00012552291,0.00016049671,0.00014056354,0.00013479449,0.000032219858,0.0005151897,0.000056115154,0.000046939662],"category_scores_gemma":[0.00010934713,0.00012221852,0.00012867808,0.00022082684,0.00006441087,0.00015803316,0.00010397378,0.000112072295,0.0000059295908],"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.00033982508,0.002486731,0.019466458,0.00075600576,0.0003778592,0.000010734813,0.010971255,0.036756117,0.05555514,0.27870256,0.1711249,0.4234524],"study_design_scores_gemma":[0.0016693271,0.00028947386,0.005902564,0.000054164266,0.000028876371,0.000019449604,0.00017936408,0.28467774,0.6809171,0.022473343,0.0032563114,0.0005323125],"about_ca_topic_score_codex":0.00013036748,"about_ca_topic_score_gemma":0.0016044342,"teacher_disagreement_score":0.6253619,"about_ca_system_score_codex":0.00007764745,"about_ca_system_score_gemma":0.00021041802,"threshold_uncertainty_score":0.49839264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5431235,0.000026644371,0.45603716,0.000056572473,0.00017191342,0.00032193662,0.000008291242,0.00009485518,0.00015911597],"genre_scores_gemma":[0.9990255,0.000021012638,0.0007544573,0.00002722486,0.000010426723,0.000052152518,0.0000017899878,0.000011738535,0.0000956597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840504,0.00014654963,0.00036920156,0.00040642577,0.0004514731,0.00022131],"domain_scores_gemma":[0.99917674,0.00009167478,0.00016944908,0.00034283142,0.00013232492,0.00008699386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041184828,0.00016613895,0.00024889733,0.00026127626,0.00022205232,0.000030787323,0.0002031927,0.00008840084,0.0000036412416],"category_scores_gemma":[0.0000056696413,0.00015596875,0.00005654211,0.00035704134,0.00013025837,0.0001305721,0.0000026821497,0.0001588219,0.0000013711569],"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.00019141276,0.0025197582,0.03549819,0.0016640152,0.00052430993,0.00039764555,0.04016956,0.32578173,0.4396274,0.017474165,0.0004065979,0.13574518],"study_design_scores_gemma":[0.006735274,0.0018332865,0.16851635,0.0016619,0.00012665088,0.0023333342,0.0066632885,0.54891384,0.26063246,0.00017819085,0.00034624993,0.0020591945],"about_ca_topic_score_codex":0.00057632284,"about_ca_topic_score_gemma":0.00047451936,"teacher_disagreement_score":0.45590204,"about_ca_system_score_codex":0.00015206554,"about_ca_system_score_gemma":0.00016163403,"threshold_uncertainty_score":0.6360221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2272339,8.21231e-7,0.7691649,0.0006707147,0.0010000803,0.00039385076,0.000017057768,0.00016689338,0.001351757],"genre_scores_gemma":[0.99686,0.0000015029848,0.0023846002,0.00046821116,0.0000058831765,0.00013775469,0.0000010294411,0.0000069800644,0.00013403724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989201,0.00015113564,0.00036036744,0.000108139495,0.00030403305,0.00015624193],"domain_scores_gemma":[0.9984573,0.00038022918,0.00018197551,0.00085423235,0.00009921892,0.00002704052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635881,0.00012915727,0.0001083787,0.00023262204,0.00021453148,0.00006153127,0.0010212474,0.00010797278,0.00005308783],"category_scores_gemma":[0.00005756085,0.00008180035,0.00011016388,0.00049859716,0.00013981242,0.0007170724,0.000007101924,0.0006512855,0.000043163243],"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.000075669086,0.00029499482,0.00006655923,0.000026972524,0.000017607144,6.308376e-7,0.0058852616,0.006147987,0.0019579441,0.8271689,0.00015538307,0.1582021],"study_design_scores_gemma":[0.0009990849,0.0004657567,0.00811864,0.00024682487,0.00006241548,0.00006975751,0.002130081,0.43246558,0.45189258,0.102432035,0.00035398622,0.00076324225],"about_ca_topic_score_codex":0.000037546844,"about_ca_topic_score_gemma":0.00032550923,"teacher_disagreement_score":0.7696261,"about_ca_system_score_codex":0.00006869868,"about_ca_system_score_gemma":0.00006921556,"threshold_uncertainty_score":0.33357212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018887233,0.00005149419,0.9902512,0.0015453702,0.0010807953,0.000216638,4.285801e-7,0.0008673884,0.0040979814],"genre_scores_gemma":[0.16693859,0.00000924611,0.83041245,0.0017860667,0.00013561039,0.000012448203,0.0000013275495,0.0000138638125,0.00069039327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984776,0.0001458168,0.00026054212,0.00038012594,0.000434007,0.0003019474],"domain_scores_gemma":[0.9986917,0.00012201013,0.00015834348,0.00082050957,0.0001395548,0.000067877525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008557657,0.00016053887,0.00013790997,0.000052146566,0.00024961686,0.0001863992,0.0011757078,0.00008674256,0.000049519796],"category_scores_gemma":[0.00007361349,0.0001130912,0.00008255222,0.00025098477,0.000051942156,0.00037224506,0.00038648388,0.00017367158,0.000107514024],"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.000018395336,0.000265193,0.006028456,0.000048255162,0.00012305751,0.000019595804,0.0034753021,0.0033037653,0.0044405283,0.38293663,0.115434326,0.4839065],"study_design_scores_gemma":[0.0001560025,0.00006159459,0.00081413134,0.000020451564,0.000008310393,0.000018108878,0.000029525494,0.9680365,0.0020122759,0.010281076,0.018343577,0.00021846149],"about_ca_topic_score_codex":0.00041681947,"about_ca_topic_score_gemma":0.000040073755,"teacher_disagreement_score":0.9647327,"about_ca_system_score_codex":0.00009300855,"about_ca_system_score_gemma":0.00005547403,"threshold_uncertainty_score":0.46117252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033506084,0.00004065512,0.9608934,0.00027450203,0.0011419168,0.00064129883,0.0000057657307,0.0014871269,0.0020092507],"genre_scores_gemma":[0.84197426,0.0000029826913,0.1568428,0.00039431432,0.000067150024,0.000080831254,0.0000034765737,0.000022305816,0.0006118888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821544,0.000100145284,0.00028966175,0.0006510445,0.0002542923,0.00048944866],"domain_scores_gemma":[0.9987362,0.00012373705,0.00012470537,0.00073503586,0.00016177891,0.000118541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034748527,0.0002611156,0.00024878414,0.000121537654,0.00031415277,0.00019166754,0.00079285516,0.00017167622,0.000052220843],"category_scores_gemma":[0.0001820376,0.0002405198,0.00012435597,0.00040019606,0.000050705083,0.00045574017,0.00010472761,0.00021816745,0.000018510074],"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.00012500011,0.00072025595,0.001273941,0.00046649572,0.00016416772,0.00002106215,0.004885663,0.00066572183,0.32223198,0.41459244,0.07305589,0.18179736],"study_design_scores_gemma":[0.00045513475,0.00027314932,0.00013452664,0.000024489333,0.000009580575,0.000065334345,0.00007154144,0.025439667,0.8672298,0.09842618,0.0072910083,0.00057955104],"about_ca_topic_score_codex":0.000053949756,"about_ca_topic_score_gemma":0.00012295393,"teacher_disagreement_score":0.80846816,"about_ca_system_score_codex":0.00009489364,"about_ca_system_score_gemma":0.00003603688,"threshold_uncertainty_score":0.9808113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40634662,0.0003286961,0.5925712,0.000120207296,0.00036545005,0.00014627841,0.000007039322,0.000056429515,0.000058082056],"genre_scores_gemma":[0.96447957,0.00026087303,0.034843687,0.00022952323,0.00009267748,0.0000017421239,4.4238666e-7,0.0000235735,0.00006794092],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973808,0.00021285206,0.0009851905,0.0003804873,0.0005468556,0.0004938424],"domain_scores_gemma":[0.9954108,0.0020809069,0.0008999201,0.0003377706,0.00094445585,0.0003261267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039944677,0.00027960003,0.00056781113,0.00036333824,0.00016728223,0.00009998133,0.00059522287,0.00015350527,0.000004144672],"category_scores_gemma":[0.00072316435,0.0002671374,0.000093564166,0.00036545587,0.00027415247,0.00077357923,0.000134572,0.0005514991,0.000003164515],"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.00022076927,0.0010445118,0.07330013,0.0003918408,0.00037930754,0.0013904152,0.00976579,0.0020206948,0.86524314,0.0014288906,0.0055298605,0.039284624],"study_design_scores_gemma":[0.0025445323,0.0012452936,0.13519588,0.0007816471,0.00011234728,0.004012105,0.00016213077,0.029776257,0.80004287,0.02492838,0.00024696434,0.0009515777],"about_ca_topic_score_codex":0.000023031791,"about_ca_topic_score_gemma":0.000048811715,"teacher_disagreement_score":0.5581329,"about_ca_system_score_codex":0.00012544384,"about_ca_system_score_gemma":0.0003492569,"threshold_uncertainty_score":0.99997807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45679703,0.000013407471,0.5421791,0.00010660096,0.000025927835,0.000038223294,2.1927079e-7,0.00012784635,0.0007116095],"genre_scores_gemma":[0.8899948,0.000001763889,0.10988184,0.000100784164,0.0000020263383,0.000002207259,0.0000013502296,0.0000025572995,0.000012699894],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99908024,0.000058430647,0.00024776012,0.00027162762,0.00018164217,0.0001602723],"domain_scores_gemma":[0.9991932,0.00008734406,0.0000931035,0.00046759067,0.00012302044,0.000035748097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050465745,0.00007986364,0.00021451229,0.0006144327,0.000026232405,0.000017815451,0.00049875723,0.000055324665,0.00000528504],"category_scores_gemma":[0.0001112989,0.000078842706,0.00008209477,0.0033224178,0.000025713456,0.00021974515,0.00009513211,0.000084889485,0.0000061111746],"study_design_candidate":"observational","study_design_consensus":"observational","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.000007763332,0.0001567592,0.9519532,0.0000111713425,0.0001402844,0.000010675587,0.0011607895,0.016761526,0.0026122653,0.024563074,0.00010255203,0.0025199582],"study_design_scores_gemma":[0.00013476347,0.000033863158,0.87806064,0.000015420976,0.000052399155,0.0000026529347,0.00004184203,0.09873374,0.015596371,0.0071862647,0.0000036101067,0.00013846447],"about_ca_topic_score_codex":0.017664822,"about_ca_topic_score_gemma":0.07675274,"teacher_disagreement_score":0.43319774,"about_ca_system_score_codex":0.00021453224,"about_ca_system_score_gemma":0.00009957174,"threshold_uncertainty_score":0.98887664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053394545,0.00000853928,0.9425578,0.00014757662,0.0000820005,0.000082925,2.986408e-7,0.00033556132,0.0033907308],"genre_scores_gemma":[0.85062826,1.6635124e-7,0.14922161,0.000041488373,0.000010256895,0.000005629509,7.400248e-7,0.0000029763885,0.00008886208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999469,0.000014468321,0.00015415129,0.0001305134,0.0001251898,0.000106682885],"domain_scores_gemma":[0.99960864,0.000043974516,0.000066689165,0.00021822886,0.000049150494,0.000013320464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012363396,0.00004949307,0.000060288916,0.00007684353,0.000024110586,0.000018829702,0.00028341645,0.000016217866,0.000027660646],"category_scores_gemma":[0.000006828681,0.000047009762,0.000025553578,0.00017713317,0.000012290524,0.00017105514,0.00007074944,0.00002847602,0.000007294034],"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.0000048658453,0.00015187741,0.01655948,0.000033064265,0.000020422793,0.00000516278,0.0013412139,0.0018908129,0.037461888,0.6964691,0.02649392,0.21956818],"study_design_scores_gemma":[0.0009227371,0.000466298,0.059523858,0.00004133375,0.000019885507,0.000036628648,0.0006897407,0.1412685,0.653066,0.14275417,0.0005049132,0.0007059231],"about_ca_topic_score_codex":0.0012554167,"about_ca_topic_score_gemma":0.00058200146,"teacher_disagreement_score":0.7972337,"about_ca_system_score_codex":0.000021355661,"about_ca_system_score_gemma":0.000027351189,"threshold_uncertainty_score":0.19170024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002263201,0.00007699466,0.9934618,0.0008538307,0.00036600415,0.00042365023,0.000002807088,0.001385841,0.001165877],"genre_scores_gemma":[0.2812858,0.000017209633,0.71660155,0.00063629466,0.00006116156,0.000108061744,0.000003459406,0.000011262123,0.001275186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.000064053034,0.00024235863,0.00044403778,0.0002465092,0.00034973738],"domain_scores_gemma":[0.99861836,0.0005384531,0.00008048322,0.00048013937,0.00020941111,0.00007315528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035075494,0.0001655877,0.00019516768,0.00007513535,0.00030186772,0.00004783128,0.00080520957,0.00008862917,0.000038765633],"category_scores_gemma":[0.00010739626,0.00014806219,0.000080706326,0.00018248141,0.000093044626,0.0004295807,0.00016195496,0.00009919243,0.00006452588],"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.00004469723,0.0001899983,0.0012432983,0.000015013549,0.000050311286,0.000023102059,0.00068616605,0.003161172,0.0011118836,0.698555,0.2917587,0.0031606918],"study_design_scores_gemma":[0.0018423016,0.0008522778,0.0052013155,0.000041621643,0.000021029837,0.000564385,0.000038590697,0.6452967,0.049878653,0.27556723,0.01936831,0.0013275938],"about_ca_topic_score_codex":0.00011984045,"about_ca_topic_score_gemma":0.000023513841,"teacher_disagreement_score":0.6421355,"about_ca_system_score_codex":0.00006904591,"about_ca_system_score_gemma":0.00016833258,"threshold_uncertainty_score":0.60378003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030515853,0.000015038546,0.9636561,0.0020717357,0.00012933639,0.00043758214,0.000015203702,0.0016548889,0.001504214],"genre_scores_gemma":[0.7184799,0.000009751968,0.2810584,0.00014831004,0.000008912284,0.00013126925,0.000013040936,0.000018311379,0.00013212697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820477,0.0003449411,0.00038152185,0.0004522379,0.00034980537,0.00026670445],"domain_scores_gemma":[0.9946494,0.0005801601,0.00016254399,0.0041553937,0.00037781044,0.000074689044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044250593,0.00022880337,0.00022479813,0.0002394325,0.0008772049,0.0001467404,0.0016712327,0.0001275394,0.000008095647],"category_scores_gemma":[0.00001204202,0.00022603312,0.00011471264,0.0008741592,0.0002467258,0.00047130833,0.000013830894,0.00057696336,0.000038297872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004003439,0.0143047925,0.004424402,0.00024275195,0.00021327844,0.000019426807,0.002385735,0.7657372,0.062953494,0.081489764,0.0032254201,0.06460345],"study_design_scores_gemma":[0.0006421843,0.00022432768,0.005485226,0.00013123063,0.000045625493,0.000015613876,0.000026707075,0.88047475,0.10328096,0.008507891,0.0006346363,0.00053087884],"about_ca_topic_score_codex":0.0011207412,"about_ca_topic_score_gemma":0.0032367609,"teacher_disagreement_score":0.687964,"about_ca_system_score_codex":0.00021040061,"about_ca_system_score_gemma":0.00015871809,"threshold_uncertainty_score":0.92173636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019149525,0.000004861615,0.9691015,0.00010070029,0.00094607903,0.00040549476,0.0000014986216,0.0009885936,0.009301777],"genre_scores_gemma":[0.72811836,0.0000015371432,0.2710492,0.00026382733,0.000073293,0.00010681155,9.0607796e-7,0.000011366279,0.00037467014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894845,0.000017608387,0.0001889546,0.00038802097,0.0001411418,0.0003157955],"domain_scores_gemma":[0.99907583,0.0001783342,0.00008388686,0.0004535555,0.0001264806,0.00008193556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036206804,0.00013329934,0.00014251853,0.0001239101,0.00012980317,0.00013724025,0.0014751449,0.00006223376,0.00003664628],"category_scores_gemma":[0.000113515525,0.00012025512,0.000089458794,0.00018541541,0.000022256268,0.0007974627,0.0004520706,0.000086460495,0.000018707338],"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.00026297366,0.0012221383,0.09989218,0.00037222749,0.00022167455,0.00006675073,0.022938812,0.000051138653,0.0538444,0.49923778,0.08104886,0.24084108],"study_design_scores_gemma":[0.00071962405,0.00032303596,0.0059064454,0.00006905254,0.000009104366,0.000023109476,0.000047134527,0.3571189,0.61551327,0.017087054,0.0024976989,0.0006855709],"about_ca_topic_score_codex":0.00008451374,"about_ca_topic_score_gemma":0.00003351938,"teacher_disagreement_score":0.7089689,"about_ca_system_score_codex":0.000024101777,"about_ca_system_score_gemma":0.00004009248,"threshold_uncertainty_score":0.49038616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027349126,0.000032581378,0.95376295,0.00083468633,0.00008889104,0.0000927953,2.5203838e-7,0.0020417045,0.040411215],"genre_scores_gemma":[0.63097936,0.0000014800046,0.36707836,0.0002985435,0.000039466307,0.000005484456,2.2018048e-7,0.000005086334,0.0015920115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992365,0.000023414002,0.00012493286,0.00024856784,0.0001622296,0.00020430487],"domain_scores_gemma":[0.9993082,0.00012844274,0.000032983233,0.0004327594,0.00004062582,0.0000569873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017974329,0.00009614299,0.00008537671,0.00006832743,0.000054729124,0.00028197374,0.000759563,0.000037979455,0.000030073774],"category_scores_gemma":[0.00006200533,0.00008195881,0.00003776124,0.00019856103,0.000021938911,0.000926012,0.00019120566,0.00008571305,0.00029889843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004571094,0.00012521303,0.0008075788,0.000004453192,0.0000128730835,0.000015583078,0.0007582038,0.0004451213,0.0019039668,0.020115102,0.06518338,0.91062397],"study_design_scores_gemma":[0.0002737418,0.00037668168,0.00071166805,0.000043795957,0.000006195466,0.00017653279,0.000042560383,0.47456506,0.45144007,0.01757414,0.0538278,0.00096173125],"about_ca_topic_score_codex":0.0000072849402,"about_ca_topic_score_gemma":0.000006121955,"teacher_disagreement_score":0.90966225,"about_ca_system_score_codex":0.00004100118,"about_ca_system_score_gemma":0.00003245934,"threshold_uncertainty_score":0.38418344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19044194,0.000101810605,0.8062464,0.00015570674,0.0009087711,0.00063102064,0.000003235957,0.0010632058,0.00044788895],"genre_scores_gemma":[0.5933721,0.000075656346,0.40593734,0.00023613242,0.000109119625,0.000013119332,0.0000044838894,0.00002434572,0.00022769034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757856,0.000081830185,0.0005396096,0.0007680455,0.00030788698,0.0007240429],"domain_scores_gemma":[0.9978613,0.00079441944,0.00024358284,0.00062323397,0.0003067695,0.00017069386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001631474,0.00035130425,0.00039940493,0.00023181994,0.00033791116,0.0002570458,0.0007003938,0.00024009467,0.000013363003],"category_scores_gemma":[0.000059348513,0.00032742787,0.00005040066,0.00044674808,0.00021297307,0.0008748034,0.00020774313,0.00025691037,0.000008058832],"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.0008962034,0.00035723584,0.019231174,0.00024414074,0.00022536707,0.00004359235,0.0018041692,0.016880866,0.021584468,0.14679454,0.015107453,0.7768308],"study_design_scores_gemma":[0.001237448,0.0006457144,0.0036033373,0.00010844625,0.000031038606,0.00019960973,0.000092957525,0.8137658,0.17391898,0.0047371425,0.00084733556,0.00081213604],"about_ca_topic_score_codex":0.0001262107,"about_ca_topic_score_gemma":0.00012022302,"teacher_disagreement_score":0.796885,"about_ca_system_score_codex":0.0001064839,"about_ca_system_score_gemma":0.00007528966,"threshold_uncertainty_score":0.9999178},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09511425,0.000034342986,0.9012311,0.0018904969,0.00024358377,0.00073121564,0.000012081565,0.00054813275,0.00019478891],"genre_scores_gemma":[0.94203687,0.000027760148,0.05685234,0.0006465689,0.00017026473,0.00014898463,0.000010909424,0.000026822103,0.000079506564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771404,0.000010159728,0.000350922,0.0008001199,0.0002801923,0.00084453623],"domain_scores_gemma":[0.99821234,0.0000748874,0.000080464524,0.00020916873,0.00041682794,0.0010062915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001108552,0.0004142388,0.00042743701,0.0005899281,0.00029393358,0.00051567284,0.00081170327,0.000085859276,0.000018781655],"category_scores_gemma":[0.00004461979,0.00041893602,0.00007384213,0.00049786334,0.000020965326,0.00038631426,0.00013989356,0.00030139697,0.00000764619],"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.000066960114,0.0000881729,0.011987227,0.00020487071,0.00009766327,0.000045915363,0.008344033,0.00013518272,0.007989858,0.48932737,0.027430302,0.45428246],"study_design_scores_gemma":[0.0006620565,0.001172043,0.02296935,0.00027265312,0.000016790327,0.00013664755,0.000054551107,0.9602249,0.006403997,0.002074488,0.00495485,0.001057628],"about_ca_topic_score_codex":0.0035574867,"about_ca_topic_score_gemma":0.0028451893,"teacher_disagreement_score":0.96008974,"about_ca_system_score_codex":0.00027238773,"about_ca_system_score_gemma":0.00047167228,"threshold_uncertainty_score":0.99982625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008765734,0.00007625126,0.9761686,0.005275742,0.000117567266,0.00056280027,5.9520613e-7,0.0012499198,0.0077828425],"genre_scores_gemma":[0.4956846,0.0000023477173,0.503075,0.0005927333,0.000010065959,0.000088538276,4.0038174e-7,0.0000067574974,0.00053957175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909407,0.000038133436,0.0001983343,0.00028899498,0.00015353432,0.00022693456],"domain_scores_gemma":[0.9983983,0.00022153057,0.000059743288,0.0011035778,0.00013977663,0.00007705611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000388154,0.0001053746,0.00010897135,0.00011898535,0.00014514825,0.00009655944,0.0011082313,0.00004132192,0.000030741754],"category_scores_gemma":[0.00022922627,0.00009661624,0.00006346611,0.0002867657,0.000019505327,0.000094228846,0.00038684963,0.00008796741,0.00014507711],"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.000016496302,0.00081683556,0.0005325068,0.000054966647,0.000033887904,0.0000026608004,0.008332424,0.0015614874,0.0141442865,0.3828163,0.12183364,0.4698545],"study_design_scores_gemma":[0.00018301667,0.00010924619,0.00010005229,0.000033445547,0.0000023267264,0.0000068126897,0.00003879621,0.9416374,0.03502111,0.001545776,0.021123491,0.00019855062],"about_ca_topic_score_codex":0.000027014754,"about_ca_topic_score_gemma":0.000016691416,"teacher_disagreement_score":0.9400759,"about_ca_system_score_codex":0.000061822524,"about_ca_system_score_gemma":0.000007258795,"threshold_uncertainty_score":0.3939896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030266492,0.00026640756,0.9678978,0.000067208995,0.00009023069,0.0010863668,0.00003638015,0.00014406281,0.00014506893],"genre_scores_gemma":[0.9946948,0.00003096804,0.0044095507,0.00012486278,0.000018458471,0.000657897,0.0000013186649,0.000014213304,0.000047908077],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987299,0.00022501497,0.00032958057,0.00039258282,0.0001500296,0.00017293442],"domain_scores_gemma":[0.99901634,0.00038028334,0.00015122257,0.00029464488,0.000056489065,0.00010103311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060729915,0.00017471595,0.00020684468,0.00017287415,0.00034433138,0.00011352961,0.00015690169,0.00006784455,0.000009322927],"category_scores_gemma":[0.0000012571629,0.00016848618,0.0000415256,0.00020708058,0.00012075829,0.00028441954,0.000003427985,0.00011958533,0.0000033315075],"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.00012577407,0.0009610986,0.0001651468,0.00048772967,0.00026566477,0.0000025308839,0.010461487,0.0057898927,0.119160295,0.23292865,0.000082486586,0.62956923],"study_design_scores_gemma":[0.0064265337,0.003633242,0.001844597,0.0014965174,0.00043137965,0.00072062865,0.01767041,0.111347616,0.8240735,0.025386298,0.0039701834,0.0029991118],"about_ca_topic_score_codex":0.000032413056,"about_ca_topic_score_gemma":0.000014369275,"teacher_disagreement_score":0.9644283,"about_ca_system_score_codex":0.000057096688,"about_ca_system_score_gemma":0.000040803116,"threshold_uncertainty_score":0.68706673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062708408,0.000016647233,0.9918447,0.00003346125,0.0003048973,0.0004848713,7.5976124e-7,0.00064878433,0.000395026],"genre_scores_gemma":[0.47973332,0.0000018256177,0.5199684,0.000035296922,0.0000069983917,0.000017636601,9.917809e-7,0.0000075152657,0.00022804171],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910206,0.00006214722,0.00024219755,0.00028475226,0.00012666809,0.00018216616],"domain_scores_gemma":[0.9987261,0.00016748603,0.0001318273,0.00048008657,0.00045795485,0.00003651871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164358,0.00011636663,0.00016665686,0.00010809834,0.000056863013,0.000019723651,0.00056350883,0.00007855106,0.000018696082],"category_scores_gemma":[0.00015773342,0.000104319355,0.00003139122,0.00031210078,0.000033356217,0.00029356583,0.00010779016,0.000054763237,0.000009010304],"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.00030019734,0.0015080984,0.0049248086,0.00020602305,0.00016857166,0.0000066557595,0.01377445,0.0061977957,0.47308412,0.35546982,0.0077017318,0.13665771],"study_design_scores_gemma":[0.0002613471,0.0002758223,0.0016610575,0.000014053807,0.0000060730176,0.0000016330168,0.000014007139,0.6377084,0.3488621,0.011025313,0.00002292191,0.00014721733],"about_ca_topic_score_codex":0.00021411754,"about_ca_topic_score_gemma":0.00002992301,"teacher_disagreement_score":0.6315107,"about_ca_system_score_codex":0.000023095103,"about_ca_system_score_gemma":0.000052412426,"threshold_uncertainty_score":0.425402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013724349,0.0000086384,0.9828479,0.00026569943,0.0005528981,0.00028089847,0.000028476992,0.00059507263,0.00169602],"genre_scores_gemma":[0.927257,0.0000038463763,0.071927354,0.0004627207,0.000029537232,0.00012500472,0.0000055055452,0.000008450349,0.00018058054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990192,0.000045976703,0.00033133605,0.00017022177,0.00021476983,0.00021849907],"domain_scores_gemma":[0.99887484,0.00042999827,0.00014607247,0.0002870469,0.0001818303,0.00008021151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260721,0.00014305563,0.0001282187,0.00018794557,0.0006881603,0.00032105396,0.0003287994,0.00010469008,0.000036596917],"category_scores_gemma":[0.000070212576,0.000145843,0.00007109044,0.00017690018,0.00016160586,0.002000271,0.000004697532,0.0003366178,0.000040984436],"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.00026493412,0.00015344139,0.00004438061,0.00019936208,0.000075241005,0.0000011370514,0.009091695,0.0014324754,0.029642288,0.58225876,0.00066756667,0.37616873],"study_design_scores_gemma":[0.0017504786,0.00040364015,0.0002510921,0.00024545137,0.000049204056,0.00020536876,0.0004302931,0.7593385,0.14499515,0.07299992,0.018176014,0.0011549197],"about_ca_topic_score_codex":0.0000057467823,"about_ca_topic_score_gemma":0.000008503689,"teacher_disagreement_score":0.9135327,"about_ca_system_score_codex":0.000046214176,"about_ca_system_score_gemma":0.00009847003,"threshold_uncertainty_score":0.5947305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38280585,0.000030523293,0.6003738,0.00010887308,0.0014098291,0.00018001725,4.949613e-7,0.0019255789,0.01316504],"genre_scores_gemma":[0.9587723,0.000017895005,0.03659337,0.0006538289,0.00010683642,0.000009326257,0.0000017136002,0.000024331925,0.0038203842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981044,0.000050304654,0.0003810613,0.0005310516,0.00030015275,0.0006330563],"domain_scores_gemma":[0.9986184,0.00024928374,0.00015140102,0.0007062896,0.00012791532,0.00014670225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502993,0.00023972696,0.00021675862,0.0002622989,0.00021887032,0.00014761453,0.0010681191,0.00015009115,0.000091624155],"category_scores_gemma":[0.00008560317,0.00021890555,0.00007928384,0.0007932638,0.00004501799,0.0008288926,0.00034279618,0.00034520568,0.00018685023],"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.00040119808,0.0009612748,0.14649361,0.00031514102,0.0003481537,0.0006425787,0.022214191,0.005267918,0.22927411,0.11436216,0.10976538,0.3699543],"study_design_scores_gemma":[0.00069004716,0.00034733446,0.018322418,0.00016705689,0.0000118173075,0.00009181518,0.000050993014,0.54839873,0.41900316,0.00083535246,0.011125171,0.00095612137],"about_ca_topic_score_codex":0.00005742678,"about_ca_topic_score_gemma":0.000027281698,"teacher_disagreement_score":0.5759665,"about_ca_system_score_codex":0.00011998211,"about_ca_system_score_gemma":0.00004508383,"threshold_uncertainty_score":0.8926709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041495933,0.00006107312,0.9558159,0.0017702776,0.00018681925,0.0001636929,1.4400808e-7,0.0027396048,0.038847547],"genre_scores_gemma":[0.45060638,0.000004263912,0.5475471,0.00128985,0.000029123748,0.000004448874,1.6520826e-7,0.000004850027,0.0005138112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988867,0.00007307248,0.00017339009,0.0003598778,0.00020188143,0.00030508937],"domain_scores_gemma":[0.9989823,0.00010796967,0.00005396984,0.0007109437,0.000060378563,0.00008444425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038681176,0.00013353037,0.00013072099,0.00009775775,0.0000930237,0.00012599595,0.0010747297,0.00006355218,0.00003231241],"category_scores_gemma":[0.00007003777,0.00012070505,0.000049963553,0.00032224288,0.000017471053,0.00036444736,0.00009648103,0.00013521004,0.00018555447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006713634,0.0001527065,0.00018018985,0.000003483147,0.000008521912,0.00006965388,0.0006543098,0.0002298701,0.0072969687,0.1921712,0.043099068,0.7561273],"study_design_scores_gemma":[0.00056811655,0.0019492417,0.0047065583,0.00007110674,0.000012940133,0.00029819115,0.000026416425,0.35884124,0.34627163,0.2729596,0.01298046,0.0013144985],"about_ca_topic_score_codex":0.000015003188,"about_ca_topic_score_gemma":0.000008439796,"teacher_disagreement_score":0.75481284,"about_ca_system_score_codex":0.000065545035,"about_ca_system_score_gemma":0.000062384795,"threshold_uncertainty_score":0.4922209},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067705865,0.000021650836,0.9967925,0.00018041694,0.00038517444,0.00022832633,0.000005063681,0.0007816451,0.00092816056],"genre_scores_gemma":[0.036127627,2.7069342e-7,0.9606123,0.00012425584,0.00012091683,0.0000058536566,0.0000033421763,0.000013689573,0.0029917257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893683,0.00006605143,0.00020538844,0.0003410009,0.00018605648,0.00026467541],"domain_scores_gemma":[0.9989643,0.00024161926,0.00009876924,0.00035520378,0.00028850613,0.000051604387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033883945,0.00013292387,0.00015765373,0.000089278685,0.0001407232,0.00011513974,0.00034418382,0.00007208711,0.000017112787],"category_scores_gemma":[0.000066717614,0.00012683631,0.000038651782,0.00034452774,0.00001630756,0.00024560365,0.00014384667,0.000081637765,0.000006181473],"study_design_candidate":"theoretical_or_conceptual","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.000011869983,0.00005955987,0.0022418734,0.000026772033,0.000015664338,0.0000051425523,0.00011491545,0.0010950712,0.017938491,0.87743247,0.06157632,0.03948187],"study_design_scores_gemma":[0.00022837952,0.00006921062,0.0032189912,0.000017799299,0.000020898344,0.000021096334,0.000008329602,0.7969233,0.016010882,0.18116163,0.0020343983,0.00028509233],"about_ca_topic_score_codex":0.006774826,"about_ca_topic_score_gemma":0.0011469586,"teacher_disagreement_score":0.7958282,"about_ca_system_score_codex":0.00016013996,"about_ca_system_score_gemma":0.00015083274,"threshold_uncertainty_score":0.9998391},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27081767,0.000010741236,0.72312236,0.0000282316,0.00008454887,0.000049369148,8.58597e-7,0.0004952414,0.0053909705],"genre_scores_gemma":[0.8034339,0.0000012172771,0.19638787,0.000100222154,0.000009715967,0.0000013319922,0.0000015800344,0.000004149823,0.000060011833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881524,0.000045951667,0.00029104063,0.0003170965,0.00029787913,0.00023277875],"domain_scores_gemma":[0.9983968,0.00039826508,0.00011297771,0.0008617125,0.00014701355,0.00008319282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162398,0.00009985028,0.00021952651,0.00064838876,0.000049872084,0.000038995,0.00088959024,0.000052056806,0.000030359382],"category_scores_gemma":[0.000101380174,0.000086694985,0.00011975611,0.0022365768,0.000031020674,0.00011983271,0.00012880805,0.000083465384,0.000006509634],"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.000058005502,0.0024682716,0.13378128,0.000050881623,0.0012648846,0.00008493485,0.013185693,0.13658117,0.04287851,0.42952946,0.00090940786,0.2392075],"study_design_scores_gemma":[0.00005465888,0.00013752477,0.019346956,0.000006010675,0.00007577481,9.143116e-7,0.000097255775,0.9049756,0.07477395,0.00024830748,0.00012774003,0.00015533327],"about_ca_topic_score_codex":0.00020626815,"about_ca_topic_score_gemma":0.00034474718,"teacher_disagreement_score":0.7683944,"about_ca_system_score_codex":0.000031695778,"about_ca_system_score_gemma":0.000023151832,"threshold_uncertainty_score":0.3535319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018917436,0.0000027404662,0.97239166,0.0004424506,0.00029588767,0.0010468012,0.0000058171627,0.00048067377,0.0064165127],"genre_scores_gemma":[0.9941199,0.0000075146963,0.004273445,0.00084061344,0.0000063113325,0.00063856173,7.7790395e-7,0.000006996162,0.000105899046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881095,0.00018786624,0.00038895378,0.00011756599,0.0003180985,0.00017656303],"domain_scores_gemma":[0.9982134,0.00066774565,0.0002160152,0.00068889937,0.00016897057,0.000044960707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909975,0.00014466181,0.00012935986,0.00035557768,0.00023123808,0.00011978608,0.0007056858,0.00007272594,0.00014737797],"category_scores_gemma":[0.000036014975,0.00010098146,0.000120249555,0.0005295725,0.000105179264,0.0015159682,0.000003494702,0.0002823229,0.0003316481],"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.00007167336,0.00037239876,0.000016721473,0.00007860008,0.00007375521,2.476553e-7,0.009581912,0.0029752252,0.0011159417,0.6077703,0.0021050167,0.3758382],"study_design_scores_gemma":[0.00079447526,0.0017104773,0.0006921522,0.00036882953,0.000031702373,0.000028901915,0.0019019751,0.06820802,0.5706623,0.35317257,0.0016390004,0.000789565],"about_ca_topic_score_codex":0.000053386557,"about_ca_topic_score_gemma":0.0000053139565,"teacher_disagreement_score":0.97520244,"about_ca_system_score_codex":0.000033544024,"about_ca_system_score_gemma":0.00003810453,"threshold_uncertainty_score":0.4262776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04320557,0.000026288513,0.9547025,0.000095865806,0.00040943484,0.00048660315,0.0000013141627,0.00064144266,0.0004309574],"genre_scores_gemma":[0.6466064,0.0000021222145,0.353038,0.00012206201,0.00003487422,0.00001273075,6.713912e-7,0.000009660643,0.00017347514],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985947,0.00006588493,0.00034904736,0.00038702777,0.00023304758,0.00037031402],"domain_scores_gemma":[0.99802417,0.0008786835,0.00015496451,0.00059095054,0.00026265086,0.00008857074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018325375,0.00016720411,0.00027146068,0.00015511534,0.000112894224,0.00004842116,0.00079085457,0.000121908386,0.000004309125],"category_scores_gemma":[0.0003304366,0.00015646905,0.00009085085,0.0003020229,0.00006634521,0.00020565116,0.00021127323,0.00012361036,0.0000063215753],"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.0010606643,0.0027948332,0.019103922,0.0019401077,0.0002911857,0.00054238585,0.010580954,0.0024188098,0.60599303,0.12915327,0.035591792,0.19052906],"study_design_scores_gemma":[0.00039593203,0.0010504916,0.0032906674,0.0001413264,0.000019639529,0.00006009346,0.00006696945,0.2234984,0.75110084,0.019722458,0.00015244857,0.0005007513],"about_ca_topic_score_codex":0.000041227653,"about_ca_topic_score_gemma":0.000027302025,"teacher_disagreement_score":0.6034008,"about_ca_system_score_codex":0.000042119416,"about_ca_system_score_gemma":0.00007440319,"threshold_uncertainty_score":0.63806224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08867457,0.000034751472,0.909761,0.0003063507,0.00006169252,0.00017490996,5.59642e-7,0.00021391871,0.00077222864],"genre_scores_gemma":[0.88285506,8.0934893e-7,0.11699629,0.00010581051,0.00001751584,0.0000038472044,0.000010856279,0.0000038052337,0.0000060088328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990137,0.0000791516,0.0003000532,0.0002000209,0.00019556512,0.00021150621],"domain_scores_gemma":[0.9992208,0.00014013931,0.00014084559,0.00036350178,0.0001086871,0.000026053533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017758717,0.00008272795,0.00010514771,0.000078163575,0.00006857643,0.00005147108,0.0006347344,0.0000480899,0.000003222089],"category_scores_gemma":[0.000073121875,0.000061437684,0.00002740254,0.0008132252,0.0000507151,0.00021320747,0.00008857847,0.0001772658,6.8786983e-7],"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.00012982619,0.0012790286,0.022079071,0.00023216785,0.000016612756,0.00015143394,0.017456643,0.0065911254,0.10671279,0.18443362,0.0040932903,0.6568244],"study_design_scores_gemma":[0.00015396855,0.000060958937,0.017708048,0.000050618353,0.0000030430756,0.0000060076704,0.00024925233,0.9194879,0.05547835,0.006623205,0.0000393432,0.00013933072],"about_ca_topic_score_codex":0.00020086585,"about_ca_topic_score_gemma":0.00015222652,"teacher_disagreement_score":0.91289675,"about_ca_system_score_codex":0.000041769392,"about_ca_system_score_gemma":0.000035140583,"threshold_uncertainty_score":0.2505356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010938214,0.0000058031774,0.9762988,0.0035097043,0.00018269602,0.00027875134,0.000025146806,0.0002912255,0.008469645],"genre_scores_gemma":[0.8496398,0.000014251333,0.14987789,0.00021443334,0.0000066888542,0.00009258765,0.000007301859,0.000013332646,0.00013375291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862397,0.00032909052,0.00031497097,0.00029879276,0.0002438992,0.00018926969],"domain_scores_gemma":[0.9941718,0.0010587657,0.00012581197,0.004355088,0.0002051401,0.000083390536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189949,0.00016523714,0.00017427024,0.00024464144,0.0005633581,0.00010580171,0.0032756533,0.00011512627,0.000020957565],"category_scores_gemma":[0.00004149827,0.00013246103,0.00013081286,0.000751295,0.00036396223,0.00032516196,0.00002047931,0.0010625807,0.0000135638975],"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.000016144902,0.0020783856,0.000039916922,0.000007210463,0.00008273806,5.8942857e-7,0.0031845989,0.0022288063,0.0010813777,0.9678733,0.00030148824,0.023105456],"study_design_scores_gemma":[0.00009365519,0.00018497517,0.00011252094,0.000017791303,0.000024758116,0.000011380908,0.00023835043,0.9886659,0.0037201233,0.0066679716,0.00010403607,0.00015855808],"about_ca_topic_score_codex":0.000100635945,"about_ca_topic_score_gemma":0.0018736077,"teacher_disagreement_score":0.9864371,"about_ca_system_score_codex":0.0000624318,"about_ca_system_score_gemma":0.000085338084,"threshold_uncertainty_score":0.6087034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041279037,0.00005930995,0.95344555,0.0010946214,0.00010853728,0.0004011187,0.000009037439,0.0014963606,0.0021064356],"genre_scores_gemma":[0.8603329,0.00037659652,0.13867375,0.00010369246,0.000010372141,0.00017481667,0.00000212227,0.000027432565,0.0002983167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984581,0.0002897332,0.0003127111,0.0004126621,0.0002586073,0.00026820644],"domain_scores_gemma":[0.9966276,0.0006087845,0.000116753894,0.0023275644,0.00017284101,0.00014645231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020490412,0.00022123769,0.00025165456,0.0002764918,0.001185467,0.000067979454,0.0014748056,0.000117376156,0.0000029566168],"category_scores_gemma":[0.0000061500755,0.00020809067,0.000068907946,0.0006221165,0.00036187214,0.00039632467,0.000028032682,0.0007166354,0.00002634355],"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.0010132749,0.007406986,0.0036633692,0.0008773937,0.001593248,0.00028331592,0.079734236,0.021915851,0.027637035,0.14426333,0.002344514,0.70926744],"study_design_scores_gemma":[0.0011688619,0.00060076715,0.0010259962,0.0008408238,0.00006546762,0.0012649486,0.00032806254,0.97205603,0.020143492,0.00011310337,0.0015069438,0.0008854982],"about_ca_topic_score_codex":0.00011926927,"about_ca_topic_score_gemma":0.00022318005,"teacher_disagreement_score":0.9501402,"about_ca_system_score_codex":0.00013690437,"about_ca_system_score_gemma":0.00011509221,"threshold_uncertainty_score":0.9117774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031117344,0.0000018030765,0.9629135,0.002601834,0.00063621876,0.00088176434,0.000007726181,0.0009940688,0.0008457538],"genre_scores_gemma":[0.38007188,2.6620393e-7,0.617068,0.00245704,0.00007600612,0.00022428008,0.0000029249197,0.000010904727,0.00008866449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983301,0.00010650096,0.00026703015,0.00065300235,0.00027949287,0.00036384174],"domain_scores_gemma":[0.99709624,0.0011825387,0.000119533994,0.0012380406,0.0002718613,0.0000917574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017918971,0.00021664146,0.00017538673,0.000092422495,0.0004396307,0.00036514344,0.0013667629,0.00010090611,0.000028692059],"category_scores_gemma":[0.00028856882,0.00013835405,0.000103839266,0.00023271688,0.000086559594,0.00034785332,0.00013812489,0.0004007211,0.000010349939],"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.000020190615,0.000553051,0.0004643012,0.000023040986,0.000016411044,0.0000040183113,0.0010145267,0.00007878904,0.08731896,0.2157653,0.0021018274,0.6926396],"study_design_scores_gemma":[0.00016890647,0.0008433702,0.000060298986,0.000012226476,0.0000040235614,0.0000015542249,0.00004982242,0.70941806,0.25353897,0.0349868,0.000708598,0.0002073759],"about_ca_topic_score_codex":0.000077522025,"about_ca_topic_score_gemma":0.00014602885,"teacher_disagreement_score":0.70933926,"about_ca_system_score_codex":0.000067351975,"about_ca_system_score_gemma":0.000091995724,"threshold_uncertainty_score":0.5641914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07740181,0.00031879908,0.9187765,0.0004227499,0.00021469762,0.0018567772,0.0000025710451,0.00020991813,0.00079617684],"genre_scores_gemma":[0.930106,0.0000037252755,0.06876431,0.00008745908,0.0000510653,0.0007703444,0.000011768848,0.00000744998,0.00019786788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990069,0.00005972356,0.00026721635,0.00016226833,0.00034626652,0.00015758621],"domain_scores_gemma":[0.9975434,0.0007347646,0.00018465477,0.00065253745,0.00086753303,0.000017113027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037334238,0.000078489116,0.000101498445,0.00006134048,0.00028099635,0.00005192981,0.0005303949,0.000039513372,0.0000052553983],"category_scores_gemma":[0.00014602681,0.00005622283,0.000055989483,0.00016632612,0.000019784946,0.00060119556,0.00010047683,0.000056142897,0.0000024632861],"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.000115899704,0.00018101269,0.00083888526,0.0000828269,0.00007298772,6.5822796e-9,0.0010417375,0.34229824,0.0041842833,0.16267323,0.01965834,0.46885252],"study_design_scores_gemma":[0.00044725192,0.0001459849,0.0005008619,0.000021863558,0.00003156979,0.000002140904,0.00004149122,0.9859699,0.0072215204,0.002651376,0.002894372,0.00007167472],"about_ca_topic_score_codex":0.0001259464,"about_ca_topic_score_gemma":0.00015289028,"teacher_disagreement_score":0.8527042,"about_ca_system_score_codex":0.00012042149,"about_ca_system_score_gemma":0.000091800925,"threshold_uncertainty_score":0.22927004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022041168,0.00003639931,0.8527587,0.0005131102,0.00020900379,0.000076864075,2.035545e-7,0.002340897,0.122023635],"genre_scores_gemma":[0.817473,6.178526e-7,0.17918795,0.00023251503,0.00004554605,0.000005820151,4.917675e-7,0.000004881469,0.0030491543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999316,0.000026122501,0.00011410124,0.00021607129,0.00015816976,0.00016955979],"domain_scores_gemma":[0.9994324,0.000052590596,0.000032113436,0.00041332186,0.000045391604,0.000024202522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016815405,0.000078110745,0.00008018911,0.000059161994,0.00006038484,0.000092737886,0.0005720171,0.000039212075,0.000020517871],"category_scores_gemma":[0.000017782795,0.00006733015,0.00003565946,0.00023818172,0.000016585876,0.00022699372,0.00011906635,0.00007712507,0.000071801616],"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.0000035847215,0.00015842993,0.04077859,0.000011344543,0.000010262342,0.000045287128,0.00023600727,0.00009703975,0.031108087,0.7615623,0.11794562,0.048043463],"study_design_scores_gemma":[0.00060256856,0.00020322393,0.09113726,0.000053853804,0.00000955828,0.0001490602,0.000030521947,0.058162965,0.60455424,0.18159874,0.06234285,0.0011551948],"about_ca_topic_score_codex":0.0002599462,"about_ca_topic_score_gemma":0.00013164296,"teacher_disagreement_score":0.79543185,"about_ca_system_score_codex":0.000021634283,"about_ca_system_score_gemma":0.000021963133,"threshold_uncertainty_score":0.2745644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3699966,0.000013466527,0.62374073,0.0014009181,0.00014270781,0.00023834189,7.020586e-7,0.0017501041,0.0027163876],"genre_scores_gemma":[0.55918306,0.0000038793573,0.4399059,0.0006941841,0.000032590127,0.000010014244,0.0000013271301,0.000011894098,0.00015717305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979915,0.00013170586,0.00031483284,0.000753592,0.00031690157,0.0004914456],"domain_scores_gemma":[0.99820256,0.000115771116,0.00014063546,0.0011096054,0.00024716102,0.00018428682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005502298,0.00028751767,0.00031669537,0.00012562292,0.00020662064,0.00017881871,0.0012880618,0.00011025195,0.000069136215],"category_scores_gemma":[0.00015309424,0.00024165213,0.00008602277,0.00043656141,0.0001628433,0.00072530925,0.0005162834,0.00039580622,0.00010520981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003956188,0.0040297695,0.06480462,0.00021100846,0.00041598204,0.00025057656,0.017512435,0.00062870386,0.07343319,0.056482628,0.020812511,0.7610229],"study_design_scores_gemma":[0.0014134308,0.00042449296,0.035475366,0.00013881689,0.000023317434,0.00028048252,0.00023128196,0.5274176,0.42878556,0.0025384063,0.0019367755,0.0013344819],"about_ca_topic_score_codex":0.0008319009,"about_ca_topic_score_gemma":0.010770028,"teacher_disagreement_score":0.7596885,"about_ca_system_score_codex":0.00021608995,"about_ca_system_score_gemma":0.00012441562,"threshold_uncertainty_score":0.9854288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020965587,0.000069460424,0.9551035,0.0006984607,0.00042612042,0.00070720474,0.000029566616,0.0020305181,0.019969577],"genre_scores_gemma":[0.4276748,0.0000019300694,0.5613118,0.00083463313,0.00023365968,0.00017950745,0.000036341567,0.000040982493,0.009686364],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717945,0.000145914,0.0005392447,0.0010338259,0.00039106514,0.0007104854],"domain_scores_gemma":[0.99753124,0.00039930613,0.00021069453,0.0013446987,0.00034409974,0.00016997865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059724227,0.0003974917,0.0003893908,0.00028745187,0.0003133061,0.00048628612,0.0015792656,0.00019195976,0.0002167095],"category_scores_gemma":[0.000115814735,0.00036227657,0.00019088315,0.0005949618,0.00008658442,0.0010557378,0.0002344622,0.00022065942,0.00011978303],"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.00018499757,0.0017468464,0.006312595,0.00011381592,0.00015047158,0.00006788168,0.0054334924,0.0009365482,0.06017542,0.09809024,0.76313496,0.063652724],"study_design_scores_gemma":[0.0021064908,0.001830428,0.0029322642,0.00015990017,0.00007850762,0.00018264902,0.00012062443,0.482926,0.16328721,0.11070005,0.23283826,0.0028376228],"about_ca_topic_score_codex":0.00040150844,"about_ca_topic_score_gemma":0.0032471505,"teacher_disagreement_score":0.53029674,"about_ca_system_score_codex":0.00013931954,"about_ca_system_score_gemma":0.00013004486,"threshold_uncertainty_score":0.99988294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160232,0.000038277118,0.81159854,0.025464483,0.00012706057,0.0003553176,9.515745e-7,0.0012185867,0.0009648085],"genre_scores_gemma":[0.7353005,0.000011645447,0.26237637,0.0021920505,0.000011789121,0.00008505536,0.0000030507654,0.000013585079,0.000005964112],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990095,0.00009321491,0.00018707415,0.0002803099,0.00022528095,0.0002046075],"domain_scores_gemma":[0.99673057,0.000116842144,0.00015178573,0.0028771397,0.00007675595,0.000046937443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023292119,0.00014124598,0.000102779384,0.00021702626,0.00038798255,0.00013755799,0.0023572824,0.00003863142,4.397702e-7],"category_scores_gemma":[0.00003220309,0.0001275122,0.00004275636,0.00053407054,0.00014203203,0.0004536303,0.00021220386,0.00030913393,0.000027720416],"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.000034201024,0.00095929776,0.0023733163,0.000058894224,0.00009281364,0.000028126668,0.007159437,0.008296469,0.49424893,0.32157636,0.0022656554,0.1629065],"study_design_scores_gemma":[0.004450567,0.0023889747,0.020561028,0.0019288522,0.00012531348,0.00039843528,0.00041925185,0.05459465,0.86375386,0.042323913,0.0050040814,0.0040510464],"about_ca_topic_score_codex":0.00023691815,"about_ca_topic_score_gemma":0.0001495569,"teacher_disagreement_score":0.5750685,"about_ca_system_score_codex":0.0001447033,"about_ca_system_score_gemma":0.000056701097,"threshold_uncertainty_score":0.5199797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09230734,0.00003175026,0.90506387,0.00022537546,0.00031281702,0.0005573143,0.000012109285,0.0010834088,0.00040602952],"genre_scores_gemma":[0.8097668,0.0000095401165,0.18968308,0.00011518104,0.000029802759,0.00010954731,0.000002381401,0.000035004752,0.00024865824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981649,0.0000655106,0.00035439033,0.0005888483,0.0004020959,0.00042424115],"domain_scores_gemma":[0.9985324,0.00047321798,0.00012504203,0.0005265997,0.00016701393,0.00017573273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002438442,0.0002807897,0.0002666873,0.00029788626,0.0010439546,0.00006674165,0.0004369838,0.000101087455,0.000021809916],"category_scores_gemma":[0.000015773343,0.00025134467,0.00015182875,0.0006731307,0.00008766365,0.00030420424,0.0000034282434,0.00032791344,0.0000065042755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002565876,0.00119281,0.00018518705,0.00010995743,0.000093731825,0.000046678768,0.004229061,0.7706528,0.026672233,0.0005342807,0.0005310935,0.19549564],"study_design_scores_gemma":[0.0010824226,0.00056796556,0.0005096289,0.00024125993,0.000032249092,0.00020131102,0.00002582684,0.9200283,0.07633178,0.00015126928,0.00041279782,0.00041512857],"about_ca_topic_score_codex":0.00006382959,"about_ca_topic_score_gemma":0.0000179862,"teacher_disagreement_score":0.71745944,"about_ca_system_score_codex":0.00010679276,"about_ca_system_score_gemma":0.00012986662,"threshold_uncertainty_score":0.99999386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78563243,0.00007883663,0.21163999,0.00018785901,0.00019379253,0.00010609584,0.0000037939656,0.00024180599,0.0019153879],"genre_scores_gemma":[0.9697585,0.0000029300024,0.030102488,0.00003701068,0.000033864162,0.0000041645444,0.0000034633306,0.0000039664815,0.00005362717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99904937,0.00005395859,0.00022561867,0.00026926232,0.00023250461,0.00016928205],"domain_scores_gemma":[0.99933296,0.00011513614,0.00013578932,0.00025341247,0.00012913642,0.00003356875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038898023,0.0001006261,0.00014872481,0.0000912717,0.000108434804,0.000049197926,0.000276197,0.00006049601,0.0000035606472],"category_scores_gemma":[0.00006550657,0.00010472936,0.00003878451,0.00018979597,0.00008355064,0.0001318576,0.00022386537,0.00009406996,0.0000048756137],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037903133,0.0010150608,0.34242114,0.00036673897,0.00003832494,0.00005954363,0.0017772361,0.0015152796,0.1301071,0.47664824,0.007657379,0.038356055],"study_design_scores_gemma":[0.00044687014,0.00010264619,0.5902965,0.00016544978,0.000013079107,0.00009204391,0.000042043313,0.2566004,0.13359565,0.017876016,0.00037379836,0.00039550668],"about_ca_topic_score_codex":0.0004303041,"about_ca_topic_score_gemma":0.00010336064,"teacher_disagreement_score":0.4587722,"about_ca_system_score_codex":0.00007112699,"about_ca_system_score_gemma":0.000041118852,"threshold_uncertainty_score":0.42707396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028009124,0.000039855586,0.97037464,0.000010652739,0.00016280192,0.0001496436,0.0000035477,0.0006072139,0.00064254674],"genre_scores_gemma":[0.8971644,0.0000019097188,0.10271267,0.00003314594,0.00001220735,0.000023258712,2.1816203e-7,0.000018786019,0.000033425316],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986907,0.000047457885,0.00033873308,0.0003756798,0.00028085656,0.00026653416],"domain_scores_gemma":[0.9990728,0.00018348313,0.00019122964,0.00029986605,0.00017031722,0.00008231707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023147081,0.00018341148,0.00021892309,0.00026720483,0.00024159154,0.000054197502,0.0005651588,0.00008070233,0.000032997883],"category_scores_gemma":[0.000009743182,0.00018299876,0.00009232592,0.0004814685,0.00008471276,0.0005712132,0.000004362488,0.0002667286,0.0000097551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097519885,0.0007017454,0.00016989214,0.00014024807,0.000047714344,0.000014942315,0.0069146333,0.007170413,0.06840327,0.0002085464,0.000020119036,0.91611093],"study_design_scores_gemma":[0.00027767612,0.00030434324,0.00019715299,0.00035239087,0.000030914052,0.00003402118,0.00018169047,0.4812294,0.51592386,0.0011703253,0.0000031968593,0.00029502425],"about_ca_topic_score_codex":0.00007797513,"about_ca_topic_score_gemma":0.000048522117,"teacher_disagreement_score":0.91581595,"about_ca_system_score_codex":0.000051946325,"about_ca_system_score_gemma":0.00011126082,"threshold_uncertainty_score":0.7462473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029571649,0.00006054392,0.94879395,0.00092169474,0.00015118357,0.000503781,0.0000045277425,0.0017089953,0.0182837],"genre_scores_gemma":[0.53391296,0.0000012318513,0.45919546,0.00058298995,0.00014620827,0.00009522122,0.0000056937683,0.00003126215,0.006028956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981337,0.000053216343,0.00027119592,0.0006759933,0.00036147173,0.0005044094],"domain_scores_gemma":[0.9984871,0.00031975305,0.00012800441,0.0008743765,0.00012295044,0.000067773886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025671598,0.00029095905,0.0002765518,0.00013858285,0.0001812689,0.00019738218,0.0009748335,0.000121017794,0.00006135502],"category_scores_gemma":[0.000042069067,0.00021288679,0.00011335953,0.00039712744,0.00008528545,0.0003519501,0.0001953184,0.00020412727,0.000024635297],"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.00037010314,0.0018703645,0.036955897,0.0003088692,0.00022128038,0.00010446521,0.0049432702,0.003778863,0.021499453,0.4546088,0.34586385,0.12947479],"study_design_scores_gemma":[0.004041685,0.0050285845,0.021186696,0.0005190041,0.0001092704,0.0005046803,0.00019366317,0.15006766,0.22600952,0.3321541,0.25596923,0.004215941],"about_ca_topic_score_codex":0.0007313977,"about_ca_topic_score_gemma":0.0020576224,"teacher_disagreement_score":0.50434136,"about_ca_system_score_codex":0.00006641221,"about_ca_system_score_gemma":0.0000874926,"threshold_uncertainty_score":0.8681271},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00994383,0.000066621535,0.9366862,0.00092089846,0.00038064117,0.00026332441,0.0000017223243,0.0021850443,0.04955171],"genre_scores_gemma":[0.6849271,0.0000017296453,0.31315294,0.00077282166,0.00001600458,0.000023520273,1.5726333e-7,0.000010932937,0.0010947656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854016,0.00013942027,0.00023556146,0.00043822196,0.00027218318,0.0003744304],"domain_scores_gemma":[0.9981232,0.0002279051,0.00007790079,0.0013425451,0.00011933989,0.00010905761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049744226,0.00017953158,0.00020739708,0.00010447459,0.00011822358,0.000110340545,0.0014291619,0.00008375075,0.00003913964],"category_scores_gemma":[0.000522512,0.00015750126,0.00008494319,0.00027930154,0.000041317187,0.00029789796,0.00016446455,0.00017635612,0.00009467983],"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.000026472566,0.0006380369,0.016058384,0.000041720625,0.00011817884,0.000110185494,0.0019840146,0.0010020687,0.032391977,0.84063107,0.09092211,0.016075784],"study_design_scores_gemma":[0.004481875,0.00058908685,0.0029914223,0.0000884574,0.000043742013,0.00034648596,0.00017899086,0.58151823,0.28994823,0.07540109,0.04247696,0.0019354193],"about_ca_topic_score_codex":0.00014982322,"about_ca_topic_score_gemma":0.0001740652,"teacher_disagreement_score":0.76523,"about_ca_system_score_codex":0.000048192815,"about_ca_system_score_gemma":0.000066885514,"threshold_uncertainty_score":0.64227146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031007691,0.0000535052,0.99452966,0.00083611405,0.00010952919,0.0006624606,0.000009303238,0.00045571686,0.00024291457],"genre_scores_gemma":[0.6784688,0.00014601767,0.32073203,0.00005414297,0.0000066340313,0.00038907904,0.0000028519205,0.000012374381,0.00018805415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889004,0.00013182202,0.00026125502,0.00033580384,0.00017422924,0.00020686319],"domain_scores_gemma":[0.9968766,0.0009690995,0.00012836324,0.0017304578,0.0002080197,0.00008744443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027423442,0.00017743981,0.00024273442,0.0004575017,0.0012576347,0.00008390358,0.0010073158,0.0000767759,0.000003768572],"category_scores_gemma":[0.000009038781,0.00017134204,0.00011304583,0.0012974412,0.00016048536,0.0003367704,0.000011893666,0.00026769194,0.0000054108455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023622718,0.0026215105,0.0027082239,0.00007798583,0.0032487256,0.000012724055,0.032261454,0.886992,0.004584058,0.0046059606,0.0016500029,0.061001178],"study_design_scores_gemma":[0.0004006654,0.00035211537,0.0006498108,0.000053139316,0.00029615537,0.00006802721,0.000076250086,0.9828738,0.014251917,0.00038831477,0.0002694706,0.00032036105],"about_ca_topic_score_codex":0.00010563345,"about_ca_topic_score_gemma":0.0003115257,"teacher_disagreement_score":0.6753681,"about_ca_system_score_codex":0.0000734896,"about_ca_system_score_gemma":0.00007734315,"threshold_uncertainty_score":0.96728367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102851175,0.000010355781,0.88753086,0.0038454179,0.000021080312,0.00013087413,2.5216153e-7,0.00015691495,0.0054530757],"genre_scores_gemma":[0.91963106,0.0000010551285,0.07879103,0.0015197224,0.000007675145,0.000006842579,1.4503313e-7,0.0000011399322,0.000041326362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959934,0.000017048778,0.00007984853,0.00013266703,0.000104561535,0.00006653719],"domain_scores_gemma":[0.9994961,0.00018806761,0.00003122966,0.00022096797,0.00004192967,0.000021677231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002246411,0.00004168452,0.000048637423,0.000040184827,0.000050199335,0.000021297305,0.00026756173,0.000016424236,0.0000029582316],"category_scores_gemma":[0.000059068545,0.000028386066,0.000011670842,0.0001401259,0.000014405481,0.000057475227,0.000049758884,0.000040475228,0.000005480048],"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.0000020384941,0.000013331533,0.00026568506,8.9687205e-7,0.0000010458134,8.272853e-8,0.00015566355,0.000018946628,0.009573686,0.9387933,0.0016429687,0.049532346],"study_design_scores_gemma":[0.00013045313,0.0005395523,0.03501566,0.000060548773,0.0000045313373,0.000018646866,0.000058508584,0.27828497,0.3264009,0.35758948,0.0016042123,0.00029252082],"about_ca_topic_score_codex":0.000020353618,"about_ca_topic_score_gemma":0.000009315595,"teacher_disagreement_score":0.8167799,"about_ca_system_score_codex":0.000014647575,"about_ca_system_score_gemma":0.000009789532,"threshold_uncertainty_score":0.11575502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070914164,0.0024736724,0.87883335,0.0017510434,0.000162176,0.00028514373,0.0000066887005,0.0007549604,0.044818785],"genre_scores_gemma":[0.76271725,0.0001796935,0.23697753,0.00007985393,0.0000052245096,0.00002946473,0.0000015941473,0.0000048385054,0.0000045668057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00014456995,0.00019875405,0.00017270897,0.00014728689,0.00012957878],"domain_scores_gemma":[0.99745715,0.00041158058,0.0001184059,0.0017743773,0.00015122652,0.00008728868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038891294,0.00010179565,0.00014584733,0.00024116486,0.00019598285,0.000059914375,0.0016155558,0.000049851977,0.0000011533882],"category_scores_gemma":[0.000108783825,0.00009663594,0.00006607723,0.00058757875,0.00022483351,0.0002045629,0.0003368938,0.00017691423,0.000002764156],"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.0000063921825,0.00016974418,0.009110737,0.000012772289,0.000030844534,4.1462962e-7,0.0046970877,0.000020680865,0.0028393806,0.96656084,0.0010841871,0.015466889],"study_design_scores_gemma":[0.0018080043,0.0020939705,0.034759905,0.0012652252,0.00013398277,0.00007998694,0.0058956207,0.02609644,0.074840344,0.83271337,0.018391708,0.0019214177],"about_ca_topic_score_codex":0.000062774976,"about_ca_topic_score_gemma":0.000042072814,"teacher_disagreement_score":0.6918031,"about_ca_system_score_codex":0.000010267374,"about_ca_system_score_gemma":0.00003674586,"threshold_uncertainty_score":0.3940699},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013508407,0.00012306891,0.9896041,0.0060535064,0.00030135314,0.00045178775,0.000020404137,0.0014574154,0.0006375367],"genre_scores_gemma":[0.5249537,0.000043440174,0.47447753,0.00020882796,0.0000065029694,0.0002715039,0.000003034533,0.000016822543,0.000018654597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866813,0.0001257644,0.00034222688,0.00035721867,0.00020088753,0.00030577267],"domain_scores_gemma":[0.9960435,0.0008301006,0.00013439976,0.0026968,0.00020021269,0.00009500106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043273458,0.00020350462,0.00019692197,0.00040611415,0.0014191316,0.00021541842,0.0023416902,0.00010756883,0.0000045210236],"category_scores_gemma":[0.000032625547,0.00022468664,0.00021864647,0.0007450791,0.00017929728,0.0004748477,0.000012985831,0.00044844742,0.000016124692],"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.000072405644,0.003599188,0.00009902444,0.00014691372,0.0002824084,0.0000048571615,0.0029070657,0.14057454,0.033638645,0.5557764,0.00035024714,0.26254827],"study_design_scores_gemma":[0.0021297494,0.0004695801,0.00013681676,0.00071191223,0.00013851849,0.000026504367,0.00023121567,0.3101338,0.54630214,0.13526931,0.0032933322,0.0011571135],"about_ca_topic_score_codex":0.00010756109,"about_ca_topic_score_gemma":0.0006270816,"teacher_disagreement_score":0.52360284,"about_ca_system_score_codex":0.00020130852,"about_ca_system_score_gemma":0.00023550849,"threshold_uncertainty_score":0.9998809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35617745,0.00007336159,0.63763523,0.0002420568,0.0007180468,0.00029686512,0.0000010861962,0.0013635466,0.0034923633],"genre_scores_gemma":[0.6247239,0.000016857957,0.37451553,0.00039490432,0.00015588636,0.000010309695,0.000002159521,0.00003559733,0.00014485882],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967774,0.000023587201,0.0005870808,0.0010635348,0.0004985358,0.0010498251],"domain_scores_gemma":[0.99756634,0.00009210022,0.00033604237,0.0004799956,0.0012003107,0.00032520306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019595057,0.00046815845,0.00043174182,0.00043028436,0.00037185077,0.00075720827,0.0019112256,0.00027996357,0.00006577966],"category_scores_gemma":[0.00043002766,0.0004771341,0.00010919025,0.0014365371,0.00013494748,0.0015652125,0.00076286466,0.0006291494,0.00012897645],"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.00013794257,0.0006251519,0.02603152,0.00034349563,0.00019784484,0.00016392322,0.012765561,0.00002382521,0.42998663,0.15444706,0.004734023,0.370543],"study_design_scores_gemma":[0.0008381306,0.00046023965,0.004030522,0.00050249195,0.00006669545,0.00038604566,0.00062464457,0.47448668,0.48571882,0.024086291,0.006835658,0.0019637852],"about_ca_topic_score_codex":0.0000524614,"about_ca_topic_score_gemma":0.000011432134,"teacher_disagreement_score":0.47446284,"about_ca_system_score_codex":0.0001941953,"about_ca_system_score_gemma":0.00030872613,"threshold_uncertainty_score":0.999768},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048024174,0.0002591985,0.94855714,0.0019050759,0.00019467188,0.0005326007,0.000018466424,0.0004507992,0.000057856912],"genre_scores_gemma":[0.69325054,0.0001735772,0.30630326,0.00008922748,0.0000055346,0.00013852108,0.0000016674002,0.000012336973,0.000025318506],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987625,0.00010370822,0.00036859667,0.00033658434,0.00021061965,0.00021797302],"domain_scores_gemma":[0.997194,0.00026902944,0.0001476497,0.0019904906,0.0003217243,0.00007713141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052528555,0.00018069409,0.00025406823,0.00018778596,0.0007370564,0.00007707158,0.001360386,0.00010542247,0.0000013577899],"category_scores_gemma":[0.000032042513,0.00018573315,0.00012172596,0.0003723243,0.00037462366,0.0003625256,0.000025677295,0.00030951868,0.0000024570472],"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.0005208919,0.011204428,0.0019543443,0.0024715692,0.00096903514,0.000011732307,0.029531281,0.05677732,0.5990742,0.1825206,0.0006024263,0.11436221],"study_design_scores_gemma":[0.0005323627,0.00018369067,0.000115269235,0.0003682415,0.000048491496,0.0000102386475,0.00012871386,0.16306229,0.81710225,0.018121457,0.00004729871,0.0002797019],"about_ca_topic_score_codex":0.00025555407,"about_ca_topic_score_gemma":0.00031276973,"teacher_disagreement_score":0.64522636,"about_ca_system_score_codex":0.000097503114,"about_ca_system_score_gemma":0.00016338799,"threshold_uncertainty_score":0.75739783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014110927,0.00008734424,0.9809914,0.0033015863,0.00012290505,0.0006898488,0.00010239636,0.00034088676,0.00025267288],"genre_scores_gemma":[0.6871147,0.00021311779,0.3122021,0.00011620538,0.000010014833,0.00025761925,0.000008887519,0.000013162498,0.00006417926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.00014382975,0.00044250392,0.000335751,0.00019179237,0.00021816451],"domain_scores_gemma":[0.9968697,0.00095956214,0.00020548208,0.0015798179,0.00030287745,0.00008255979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294792,0.00017222337,0.00020394436,0.00028711642,0.0007605004,0.00007183242,0.0010585029,0.000087974826,0.000009110287],"category_scores_gemma":[0.000023274873,0.00019787559,0.000107655615,0.0003879084,0.00008604135,0.00043447287,0.000020072861,0.00027941228,0.000010940862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002604076,0.001631306,0.00003759397,0.000073118594,0.00015043606,3.1496515e-7,0.004983448,0.002422611,0.017736131,0.096735284,0.0009097271,0.87529397],"study_design_scores_gemma":[0.00072996813,0.00027722924,0.00053254183,0.00011225982,0.00008149875,0.000012535718,0.0003631552,0.5989918,0.39221647,0.0053673955,0.00091581343,0.00039933086],"about_ca_topic_score_codex":0.00011562179,"about_ca_topic_score_gemma":0.0009891078,"teacher_disagreement_score":0.8748947,"about_ca_system_score_codex":0.00012677038,"about_ca_system_score_gemma":0.000084466854,"threshold_uncertainty_score":0.80691326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04261899,0.000031734508,0.94787616,0.0005327366,0.00011132915,0.000121470104,0.0000011921684,0.0004658828,0.00824052],"genre_scores_gemma":[0.7555516,0.0000013103859,0.24409658,0.0002722194,0.000010687196,0.0000065234863,2.396236e-7,0.0000038845906,0.000056962574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920607,0.000038603415,0.00020920938,0.0002244704,0.00015347061,0.00016819747],"domain_scores_gemma":[0.99926955,0.00012413281,0.000099395664,0.00033945014,0.00012434169,0.00004310825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025613856,0.0000960848,0.00017605737,0.000116434996,0.00005425853,0.00004377193,0.0005399147,0.000039394254,0.000011032738],"category_scores_gemma":[0.00009646864,0.00008151194,0.00005896288,0.00028011177,0.000041115778,0.00032322545,0.00009114615,0.000086072854,0.0000103552575],"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.000021190188,0.00021790761,0.010315656,0.000031376698,0.00007557462,0.000041097057,0.0056746895,0.0017202921,0.05721784,0.9027842,0.0007698273,0.021130292],"study_design_scores_gemma":[0.002082947,0.00081957795,0.0062227882,0.00023392422,0.00002319622,0.000076685035,0.00024651596,0.09606798,0.7852883,0.10795196,0.0002966475,0.00068950455],"about_ca_topic_score_codex":0.00012936995,"about_ca_topic_score_gemma":0.00011773345,"teacher_disagreement_score":0.7948323,"about_ca_system_score_codex":0.000049373848,"about_ca_system_score_gemma":0.000057064663,"threshold_uncertainty_score":0.33239606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06895181,0.0003031512,0.9289109,0.000084287785,0.0002578114,0.00031482955,0.0000059901963,0.00075377256,0.00041745906],"genre_scores_gemma":[0.75006086,0.0000056878657,0.24972774,0.000024861849,0.000038463026,0.000028524024,8.78583e-7,0.000034389483,0.00007861845],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979072,0.00012794722,0.00052903476,0.0005898864,0.00039664053,0.00044929038],"domain_scores_gemma":[0.99875045,0.00012921276,0.00034813827,0.00038843934,0.00030470232,0.00007904195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003969775,0.0003222203,0.00036927348,0.00048377266,0.0005111907,0.00034181718,0.0005818044,0.000116078845,0.000022986125],"category_scores_gemma":[0.000007940143,0.00031262144,0.00015386129,0.0009954588,0.00015627094,0.0017599777,0.0000060661446,0.0003560001,0.0000035066948],"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.000041465857,0.0004010118,0.0000369749,0.00033287145,0.000018202798,0.000038103834,0.0012583117,0.024266977,0.8752075,0.00003483428,0.00006482604,0.098298915],"study_design_scores_gemma":[0.00025936813,0.000075797274,0.000050903214,0.0006319132,0.000026784619,0.000040589315,0.000036710968,0.2737281,0.7239993,0.000870572,0.000015120808,0.00026478487],"about_ca_topic_score_codex":0.00019360932,"about_ca_topic_score_gemma":0.0000050711774,"teacher_disagreement_score":0.681109,"about_ca_system_score_codex":0.000115425595,"about_ca_system_score_gemma":0.00016067093,"threshold_uncertainty_score":0.9999326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023591217,0.000058800983,0.87285614,0.0009559832,0.000370852,0.00013186753,4.246935e-7,0.0017782988,0.100256436],"genre_scores_gemma":[0.8058706,0.0000017769364,0.18040831,0.0009797118,0.000087925524,0.000018239,5.3173846e-7,0.000013521238,0.012619383],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988381,0.000026760976,0.00018090205,0.0003881208,0.00023375211,0.00033235832],"domain_scores_gemma":[0.9992058,0.00006465171,0.0000633092,0.0005712484,0.00004840039,0.00004653577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026254976,0.00013556132,0.0001325637,0.00012897511,0.00010962916,0.00023554653,0.00079886155,0.000065324726,0.00022806306],"category_scores_gemma":[0.00001742237,0.00012406302,0.00006539461,0.00027738966,0.000016185923,0.00062528683,0.00032348745,0.00011153983,0.00010811325],"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.00000438192,0.00017084742,0.008160815,0.000032283522,0.00002360838,0.000068649686,0.0037396958,0.00010594073,0.008420191,0.16703567,0.7843926,0.027845314],"study_design_scores_gemma":[0.00042285633,0.000119221855,0.0015575261,0.00008256547,0.000010034561,0.00006247532,0.00003679229,0.25021896,0.25505486,0.41730574,0.0742316,0.00089739246],"about_ca_topic_score_codex":0.0012566332,"about_ca_topic_score_gemma":0.00010158713,"teacher_disagreement_score":0.7822794,"about_ca_system_score_codex":0.000059684553,"about_ca_system_score_gemma":0.000025114694,"threshold_uncertainty_score":0.50591433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753023,0.000018141805,0.9060451,0.0014204743,0.00007849983,0.00046309005,0.000012859252,0.0016895714,0.012742061],"genre_scores_gemma":[0.58667904,5.5900455e-7,0.4126872,0.00008008387,0.000024343339,0.00003849116,0.000016985206,0.000014539363,0.00045874645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878204,0.00004467018,0.00025587832,0.00038019428,0.00021687741,0.00032035314],"domain_scores_gemma":[0.99785805,0.00031020519,0.00012359423,0.0014944607,0.00015699725,0.00005668008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002836125,0.0001894427,0.0001998833,0.00012690462,0.00034836234,0.00044258343,0.0017983215,0.00006545813,0.0000020584348],"category_scores_gemma":[0.000058543414,0.000155166,0.00006271523,0.0003510233,0.00013877545,0.00093574426,0.0003689567,0.0001965285,0.000010267528],"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.00002846307,0.00076038163,0.007368238,0.000065010325,0.00006265058,0.000004403994,0.0014075389,0.00091045455,0.0030354403,0.95545644,0.0063418285,0.02455914],"study_design_scores_gemma":[0.0018840561,0.0008932458,0.006078719,0.0002695536,0.000054525448,0.00015636155,0.0004267644,0.82137173,0.05914081,0.10073727,0.0069595105,0.0020274343],"about_ca_topic_score_codex":0.0007925193,"about_ca_topic_score_gemma":0.00074811024,"teacher_disagreement_score":0.85471916,"about_ca_system_score_codex":0.00007103782,"about_ca_system_score_gemma":0.000051707466,"threshold_uncertainty_score":0.63274854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01411406,0.0066722506,0.9733777,0.00082554814,0.00032786795,0.00032583816,9.4946176e-7,0.00007723991,0.0042785252],"genre_scores_gemma":[0.5571477,0.0012402353,0.4414877,0.00003765243,0.000052372096,0.000017216746,0.0000010757501,0.000010477367,0.000005575941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979263,0.00023964858,0.0010079296,0.0002092981,0.00028634552,0.00033049335],"domain_scores_gemma":[0.99472266,0.0029206565,0.00039340762,0.0014547397,0.0003312797,0.00017724265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030568936,0.00017312702,0.00043932092,0.00024499808,0.00029712706,0.000237542,0.0024101753,0.00016937728,0.000002259586],"category_scores_gemma":[0.0002999162,0.00015303784,0.00011792926,0.0002941654,0.00025551868,0.00057368627,0.00100436,0.0007414951,0.0000018261259],"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.00023299617,0.000815067,0.005909854,0.000042554973,0.00008709214,0.000018295003,0.002332431,0.00021504067,0.00035399877,0.48019308,0.0005389261,0.50926065],"study_design_scores_gemma":[0.0015695747,0.0012512128,0.0086687,0.0019593895,0.00010895802,0.0006779011,0.0006894889,0.92226416,0.00028678635,0.051823046,0.010069036,0.000631774],"about_ca_topic_score_codex":0.000025795482,"about_ca_topic_score_gemma":0.00005702639,"teacher_disagreement_score":0.9220491,"about_ca_system_score_codex":0.0001107386,"about_ca_system_score_gemma":0.000071148854,"threshold_uncertainty_score":0.62407017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015611836,0.000017020575,0.96019787,0.023981063,0.000075176526,0.0003278199,0.0000012371114,0.0011534265,0.012685225],"genre_scores_gemma":[0.51318353,0.0000025832799,0.48626944,0.0003477894,0.000014305526,0.000020358333,0.0000064449046,0.0000031384893,0.0001523753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928045,0.000038661827,0.00016248235,0.00021751487,0.0001371641,0.00016371097],"domain_scores_gemma":[0.99802697,0.00017954089,0.000054246655,0.0015386324,0.0001515622,0.00004904552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002698831,0.00008470802,0.00009140538,0.000078616125,0.00017575102,0.00011084179,0.00129045,0.00006596923,0.000003037311],"category_scores_gemma":[0.0001409811,0.00008469196,0.00005205846,0.00022358354,0.000025437645,0.00042231765,0.00017372328,0.00009575522,0.000008818292],"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.0000046977357,0.000092311755,0.000029905466,0.0000023765865,0.0000030683505,2.878086e-7,0.00017696814,0.00007822425,0.014668185,0.927763,0.004427599,0.052753404],"study_design_scores_gemma":[0.0002120018,0.00021246367,0.0025646887,0.00001586706,0.000005330456,0.000009792894,0.000009677849,0.8222125,0.025985407,0.14789154,0.00072412577,0.00015656691],"about_ca_topic_score_codex":0.000018916844,"about_ca_topic_score_gemma":0.00003359857,"teacher_disagreement_score":0.8221343,"about_ca_system_score_codex":0.00006574254,"about_ca_system_score_gemma":0.000023836872,"threshold_uncertainty_score":0.3453638},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057704403,0.000026937176,0.9956201,0.0021988389,0.00014955443,0.0005005309,0.000020050778,0.0004937594,0.0004132314],"genre_scores_gemma":[0.61534244,0.00006365977,0.38441488,0.0000909062,0.0000045099514,0.000045854587,0.0000020156072,0.0000060407024,0.000029686236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989133,0.00020498224,0.00031753792,0.00022349875,0.00015742419,0.000183254],"domain_scores_gemma":[0.99711543,0.0007435194,0.00013702255,0.0016960013,0.00024444706,0.000063583226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039986437,0.00013229574,0.00017867972,0.0002503925,0.00044067268,0.00004924133,0.0016227901,0.00008635843,0.000003213646],"category_scores_gemma":[0.00001815505,0.00015036136,0.00013271673,0.0004518507,0.00011600837,0.0004130793,0.0000072328107,0.00023312581,0.0000068972117],"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.0003869137,0.009805002,0.000013590228,0.0001146118,0.00041769518,0.0000033272604,0.011070419,0.08548989,0.27758712,0.40244594,0.0031399645,0.20952553],"study_design_scores_gemma":[0.0005716709,0.00093388266,0.00014670865,0.00013856935,0.00007993504,0.000020248857,0.00007622254,0.7090339,0.22603092,0.062390573,0.0002170271,0.0003603283],"about_ca_topic_score_codex":0.000034194614,"about_ca_topic_score_gemma":0.000034746936,"teacher_disagreement_score":0.62354404,"about_ca_system_score_codex":0.00010378733,"about_ca_system_score_gemma":0.000057343223,"threshold_uncertainty_score":0.61315584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013386309,0.000009817552,0.9635992,0.00020782053,0.0004368872,0.000112121794,7.0498237e-7,0.0013322366,0.020914886],"genre_scores_gemma":[0.85257673,0.0000055258524,0.14539056,0.00087518693,0.000026201093,0.0000065764525,0.0000042412576,0.000006629266,0.0011083299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.000014577991,0.00025256525,0.00014650381,0.00021403427,0.00029785043],"domain_scores_gemma":[0.99929935,0.00015867518,0.00008212147,0.00031020067,0.00008198443,0.00006764609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069195917,0.000104845414,0.000081586964,0.00016204527,0.0000787127,0.00016596311,0.00053282775,0.000045587367,0.000017696213],"category_scores_gemma":[0.00012862547,0.00010057548,0.000028045928,0.0003892743,0.000014544469,0.0015118091,0.00023079166,0.000123507,0.00012425381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016887976,0.00004677642,0.0005493594,0.000028329898,0.000012291734,0.000020086747,0.0062431395,0.0002761273,0.0016997306,0.0053846724,0.043382023,0.94234055],"study_design_scores_gemma":[0.0006136075,0.0003843555,0.00058407546,0.000070487826,0.0000043848563,0.00008303836,0.00032315069,0.5355878,0.2814052,0.004966953,0.17485012,0.001126848],"about_ca_topic_score_codex":0.00009139408,"about_ca_topic_score_gemma":0.000024847635,"teacher_disagreement_score":0.9412137,"about_ca_system_score_codex":0.000044644963,"about_ca_system_score_gemma":0.000019289177,"threshold_uncertainty_score":0.4101349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061376292,0.00014209641,0.93120754,0.0050906832,0.00014863769,0.00012473675,0.0000019161675,0.0004608367,0.0014472557],"genre_scores_gemma":[0.7457871,0.000005877932,0.25378335,0.00035513157,0.000016297232,0.000023576604,0.0000025528245,0.000007828023,0.000018303333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990972,0.00011776501,0.00029064016,0.00017098352,0.00015400017,0.00016940084],"domain_scores_gemma":[0.99675566,0.000450228,0.00017277164,0.0025157838,0.00008115445,0.000024410616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029016743,0.000099207755,0.00013869566,0.00017851844,0.00017055687,0.00005089707,0.0028820545,0.000033711927,0.0000016815845],"category_scores_gemma":[0.000047277877,0.00010905904,0.00006216306,0.00041198215,0.0001546331,0.00024119377,0.00036658917,0.00017090482,0.000013446566],"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.000006079799,0.0004375806,0.004067803,0.000044372988,0.000054486078,0.0000049971286,0.0018674906,0.008934187,0.7647808,0.15685554,0.038984057,0.023962611],"study_design_scores_gemma":[0.0012032256,0.0002007886,0.013679189,0.0007383364,0.00010362489,0.00015144222,0.0001787322,0.6786799,0.26295868,0.032672,0.0073963804,0.0020377396],"about_ca_topic_score_codex":0.00032415075,"about_ca_topic_score_gemma":0.00012826583,"teacher_disagreement_score":0.6844108,"about_ca_system_score_codex":0.000057826317,"about_ca_system_score_gemma":0.000025894344,"threshold_uncertainty_score":0.5355622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007109835,0.00002554203,0.9788129,0.0006667577,0.00046969642,0.0004524454,9.981064e-7,0.0012484955,0.011213379],"genre_scores_gemma":[0.25177762,8.4950483e-7,0.7455921,0.0007520047,0.000081475504,0.00015100115,7.576102e-7,0.00001642866,0.001627761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989499,0.0000413144,0.00016295689,0.0003911765,0.00014982662,0.00030485337],"domain_scores_gemma":[0.9992054,0.000116460535,0.00006031581,0.00045425905,0.00009675119,0.00006683017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030756573,0.0001398764,0.00013629932,0.000101704674,0.000098335586,0.00013592544,0.00066693296,0.00007179986,0.000014904457],"category_scores_gemma":[0.00027768654,0.00011474789,0.000074482195,0.00031870144,0.000020044905,0.00019712855,0.000080614045,0.000109857756,0.000012543639],"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.000098522585,0.000457445,0.0007992341,0.00032006978,0.00006372298,0.000022187047,0.006203514,0.0002777939,0.08419303,0.6080958,0.03673834,0.2627303],"study_design_scores_gemma":[0.0010202058,0.0007305372,0.00007678095,0.00006449833,0.000012358183,0.00011536138,0.00004575827,0.0125191035,0.6227468,0.14566037,0.21617828,0.0008299128],"about_ca_topic_score_codex":0.000010868976,"about_ca_topic_score_gemma":0.00004883654,"teacher_disagreement_score":0.5385538,"about_ca_system_score_codex":0.000023627626,"about_ca_system_score_gemma":0.000080800404,"threshold_uncertainty_score":0.46792832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038646914,0.000019490353,0.95572144,0.00046166932,0.00033351962,0.00011451656,1.2644078e-7,0.0009563015,0.0037459955],"genre_scores_gemma":[0.83264935,0.000004675956,0.16680595,0.00033306814,0.00005117591,0.000011888088,4.412273e-7,0.000009307865,0.00013413998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990643,0.000042819003,0.00017232898,0.0003382289,0.00015654537,0.00022576845],"domain_scores_gemma":[0.9993713,0.0001042124,0.00008249657,0.00032459476,0.00004183026,0.000075575066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005968329,0.0001244401,0.00013740272,0.00016338758,0.00014229209,0.00016540165,0.00027247315,0.000055751596,0.000006290165],"category_scores_gemma":[0.00018659748,0.00011494025,0.00003235847,0.00017688269,0.000019118428,0.000558447,0.0002611982,0.00009984272,0.000014935141],"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.000012151955,0.00013477358,0.0012379132,0.00019998955,0.00004941917,0.000011458943,0.012265982,0.0021054114,0.028535275,0.31925747,0.010593314,0.6255968],"study_design_scores_gemma":[0.00010550402,0.00005270467,0.000755574,0.00004652553,0.0000023294667,0.000015923497,0.00001553852,0.96612775,0.0181823,0.014440911,0.00009504444,0.00015986574],"about_ca_topic_score_codex":0.000050461178,"about_ca_topic_score_gemma":0.000011643361,"teacher_disagreement_score":0.96402234,"about_ca_system_score_codex":0.000037135393,"about_ca_system_score_gemma":0.000009983559,"threshold_uncertainty_score":0.46871275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053884955,0.0000084646845,0.96229535,0.00083535694,0.0006369111,0.0003123667,0.0000011767619,0.0012305577,0.02929134],"genre_scores_gemma":[0.66742295,9.507004e-7,0.32947832,0.00026200374,0.000105983876,0.00003545579,0.00000193625,0.000011132887,0.0026812737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896264,0.000008521609,0.00021769051,0.00032184442,0.00015691885,0.00033240338],"domain_scores_gemma":[0.99918675,0.00012546018,0.00007651942,0.00044982778,0.00011709538,0.000044340293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036165473,0.00013347737,0.00014414042,0.00012330835,0.00012834818,0.00013480999,0.00072745717,0.00006395427,0.000013313267],"category_scores_gemma":[0.000039176193,0.00012011582,0.000080551305,0.00027013142,0.000017193255,0.00035688252,0.00019217457,0.00008367202,0.000026614991],"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.000021929494,0.00031374942,0.0006502935,0.00008090867,0.00002443372,0.00002444725,0.0009896122,0.00068670564,0.038046442,0.81160474,0.11348207,0.03407466],"study_design_scores_gemma":[0.00048569133,0.0005529503,0.00018756118,0.000061374856,0.000005653726,0.000035261022,0.000039123683,0.6205869,0.31358218,0.051227365,0.012687731,0.0005482558],"about_ca_topic_score_codex":0.0001389336,"about_ca_topic_score_gemma":0.00005188721,"teacher_disagreement_score":0.7603774,"about_ca_system_score_codex":0.00005032069,"about_ca_system_score_gemma":0.00003047898,"threshold_uncertainty_score":0.48981813},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049447,0.000077739525,0.92363805,0.0023018203,0.001105868,0.0012181586,0.00006857244,0.00084387435,0.00025146586],"genre_scores_gemma":[0.7505931,0.000058139172,0.2420516,0.0008634456,0.00013300126,0.00023903031,0.000013298272,0.00008026089,0.005968102],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99696875,0.00017611384,0.0006128787,0.0010435337,0.0004959476,0.0007027943],"domain_scores_gemma":[0.9976346,0.0006454981,0.00016631735,0.001012424,0.000271238,0.0002699277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051116175,0.0005136496,0.00047090618,0.0003890004,0.00057982455,0.00040319652,0.0006785868,0.00029094267,0.00004238866],"category_scores_gemma":[0.000044098862,0.0005786607,0.00018307974,0.000694963,0.00010880107,0.0002439219,0.000016051721,0.0005704775,0.00007636996],"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.0008516869,0.0029218371,0.00013735805,0.0005023224,0.00007665738,0.000029472909,0.0044836616,0.024621053,0.5988376,0.0013006569,0.10235161,0.26388603],"study_design_scores_gemma":[0.0037678375,0.0062839,0.00041265503,0.0007094754,0.00031471057,0.00016190496,0.00008550299,0.17932774,0.7390792,0.012216805,0.054105137,0.0035351291],"about_ca_topic_score_codex":0.00054798974,"about_ca_topic_score_gemma":0.0012427748,"teacher_disagreement_score":0.68158644,"about_ca_system_score_codex":0.00017567277,"about_ca_system_score_gemma":0.00008034091,"threshold_uncertainty_score":0.9996665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29705372,0.00006395651,0.63874894,0.0013559903,0.00033205244,0.0010627076,7.029042e-7,0.0011741275,0.060207788],"genre_scores_gemma":[0.96830547,0.0000028059644,0.030946856,0.0004101777,0.000023776724,0.000093460054,1.2120437e-7,0.000006413612,0.00021094894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913883,0.00009933049,0.000151986,0.00014751982,0.00023027378,0.0002320828],"domain_scores_gemma":[0.9987693,0.00034634557,0.00008744242,0.0007046877,0.00004663684,0.000045590587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006598846,0.00009403144,0.000106794265,0.00008714168,0.00006785624,0.00002998198,0.00084963726,0.000036735823,0.000027968636],"category_scores_gemma":[0.00011972324,0.000054717002,0.000066716886,0.000385824,0.000055531633,0.00020667618,0.00016260346,0.00012227643,0.00003078998],"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.0000043958726,0.00025855177,0.020437365,0.00001249539,0.000012200427,3.859841e-7,0.0013447611,0.000001354781,0.0034730257,0.95539975,0.0047968677,0.014258828],"study_design_scores_gemma":[0.00029047436,0.0011476415,0.03494276,0.00018539577,0.000014628468,0.00003295707,0.00030608373,0.007549802,0.8683991,0.07867698,0.0077403723,0.00071383856],"about_ca_topic_score_codex":0.000091745685,"about_ca_topic_score_gemma":0.000018519144,"teacher_disagreement_score":0.87672275,"about_ca_system_score_codex":0.000010616319,"about_ca_system_score_gemma":0.000014294492,"threshold_uncertainty_score":0.22312945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109646715,0.00011905649,0.87300265,0.011422907,0.00064182264,0.00019958113,0.0000013517258,0.0012982726,0.003667626],"genre_scores_gemma":[0.90904206,0.000022123986,0.088997535,0.001692136,0.00008059919,0.000055493183,0.000004871734,0.000016819946,0.00008833203],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00016348327,0.00026799852,0.00026632095,0.00017956622,0.0002842438],"domain_scores_gemma":[0.99677515,0.0002884808,0.00013912942,0.0026990685,0.000060304796,0.000037850496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036324575,0.0001434963,0.00014208005,0.0002076546,0.0004104698,0.00024088836,0.0033533939,0.00004975351,0.0000034997963],"category_scores_gemma":[0.000022953422,0.00016041665,0.00007107216,0.00055017177,0.00010256963,0.0005222591,0.00051689806,0.00028320725,0.000041177285],"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.000004256498,0.00027534502,0.005099367,0.000033493456,0.00004728134,0.000026451708,0.0027823213,0.003824314,0.70972335,0.1447831,0.11597817,0.01742257],"study_design_scores_gemma":[0.0012866848,0.00009613397,0.009716863,0.00057068805,0.000052694675,0.00018365285,0.00012770793,0.5323104,0.34606332,0.014828357,0.092048414,0.0027150735],"about_ca_topic_score_codex":0.00032881033,"about_ca_topic_score_gemma":0.00005906543,"teacher_disagreement_score":0.7993954,"about_ca_system_score_codex":0.00012360764,"about_ca_system_score_gemma":0.000021182785,"threshold_uncertainty_score":0.6541601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087032,0.000026114285,0.5883548,0.000021502421,0.0008536822,0.0004283282,0.000005095954,0.00048615804,0.0011210588],"genre_scores_gemma":[0.97713375,0.000006471024,0.022571882,0.000029055245,0.000055222758,0.00010905841,4.255005e-7,0.0000334213,0.000060725495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99742746,0.00023990696,0.0007691556,0.00060980447,0.00039532653,0.00055836793],"domain_scores_gemma":[0.99825865,0.00049212965,0.00044587525,0.0006339271,0.00009503441,0.00007438103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000998053,0.00031417765,0.0003681789,0.00038306022,0.00040343145,0.00007226756,0.0010224942,0.00014594608,0.0000034650375],"category_scores_gemma":[0.00005213136,0.00027441428,0.00013526577,0.0013233835,0.00009686659,0.0005808371,0.000017248305,0.00080016005,0.000009511833],"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.00038656246,0.00090428215,0.0038920238,0.0005296913,0.00021902326,0.000048562742,0.041345965,0.009544589,0.37998974,0.00021475223,0.00023101989,0.5626938],"study_design_scores_gemma":[0.00061917905,0.00039373958,0.00038153856,0.00072361244,0.000019718806,0.00007798056,0.0007333922,0.47917706,0.51747894,0.000014892363,0.000026855529,0.0003531091],"about_ca_topic_score_codex":0.0010144111,"about_ca_topic_score_gemma":0.000058247075,"teacher_disagreement_score":0.56843054,"about_ca_system_score_codex":0.00026838385,"about_ca_system_score_gemma":0.0001177867,"threshold_uncertainty_score":0.9999708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27743712,0.00013048509,0.7187631,0.00016595621,0.00012171516,0.00018957353,0.0000064726705,0.00067770155,0.0025078324],"genre_scores_gemma":[0.60759944,0.0000047553326,0.3922352,0.00005144999,0.000019692896,0.000013668574,0.0000025835132,0.0000045357115,0.00006867109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00003116227,0.00031397128,0.00026401255,0.00021867495,0.00020616132],"domain_scores_gemma":[0.9989402,0.0004650955,0.00013471686,0.00020909171,0.00019414899,0.00005674481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024698043,0.0001212581,0.0002700689,0.00011088016,0.00023488243,0.000028259563,0.00036726933,0.000048739737,0.000009755881],"category_scores_gemma":[0.000049433092,0.00011754755,0.000060467006,0.00012830112,0.00015571035,0.00025043698,0.00018855864,0.00008073757,0.0000015667661],"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.000018755401,0.00015075147,0.1583183,0.00006761095,0.00003585847,0.0000017171545,0.0021653515,0.00003441022,0.0015431406,0.8289597,0.00738242,0.0013220044],"study_design_scores_gemma":[0.001015993,0.000608958,0.073469065,0.00007779835,0.000020830192,0.00026746822,0.00025490287,0.82427293,0.056206457,0.038895946,0.0042970176,0.0006126409],"about_ca_topic_score_codex":0.000049239963,"about_ca_topic_score_gemma":0.000045281653,"teacher_disagreement_score":0.82423854,"about_ca_system_score_codex":0.000030500049,"about_ca_system_score_gemma":0.0001054193,"threshold_uncertainty_score":0.479345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036945336,0.00011461603,0.947013,0.0006844632,0.0021410715,0.0004555461,0.0000010149549,0.0016950949,0.0109498575],"genre_scores_gemma":[0.8334258,0.0000075602993,0.16485347,0.0005354151,0.00028847405,0.0000889064,0.0000014250699,0.00002376455,0.0007751575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984441,0.00006521151,0.00025409317,0.00037159928,0.00021539764,0.0006496248],"domain_scores_gemma":[0.9985566,0.00040335284,0.00011413413,0.00065677904,0.0001056318,0.00016349225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237651,0.00020210665,0.00021702195,0.0001922333,0.00023138757,0.00014643525,0.0011306244,0.00010229546,0.000022966928],"category_scores_gemma":[0.00017048651,0.00017796789,0.000113186565,0.00034051342,0.00004132771,0.00095834583,0.0004690029,0.00014459023,0.000043201548],"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.000019054498,0.00025099312,0.0031228715,0.00007992166,0.000037183396,0.000005604766,0.005710941,0.0000331702,0.020857278,0.89364684,0.020085447,0.056150686],"study_design_scores_gemma":[0.00085140497,0.0005241218,0.00067000627,0.00019621904,0.000032899596,0.00014380405,0.0005717148,0.25504437,0.67238563,0.049771156,0.018258655,0.0015500315],"about_ca_topic_score_codex":0.000021099202,"about_ca_topic_score_gemma":0.0000036585827,"teacher_disagreement_score":0.8438757,"about_ca_system_score_codex":0.00007611583,"about_ca_system_score_gemma":0.000033326967,"threshold_uncertainty_score":0.72573197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38347483,0.0000507723,0.5910037,0.021208491,0.00049663655,0.00021679724,0.000003051107,0.0007221236,0.0028235707],"genre_scores_gemma":[0.710949,0.000011868828,0.28813797,0.00084957405,0.00001066387,0.000024443598,0.0000017347228,0.000007138052,0.0000075735884],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991529,0.000120112294,0.00024975956,0.0001710584,0.00014569677,0.00016046151],"domain_scores_gemma":[0.99596775,0.0003824019,0.00015125175,0.0033758148,0.00008414265,0.000038644062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047704365,0.00009574972,0.00012994208,0.00016237547,0.00017030934,0.00005153404,0.0037461866,0.000050477956,0.0000033410483],"category_scores_gemma":[0.000077246055,0.00010373517,0.000064153945,0.00038096233,0.00020542032,0.0002841704,0.000354705,0.0004072091,0.000011653781],"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.0000010389672,0.00007220047,0.0016417141,0.000010026862,0.000016191241,0.0000010446055,0.0015479287,0.000019554755,0.95481825,0.017700996,0.004669917,0.019501165],"study_design_scores_gemma":[0.0008904586,0.00016237726,0.018750584,0.00032109406,0.00005688897,0.00018420153,0.00029332042,0.14716193,0.7643055,0.013578849,0.052679602,0.0016152052],"about_ca_topic_score_codex":0.00011685467,"about_ca_topic_score_gemma":0.0002026675,"teacher_disagreement_score":0.32747418,"about_ca_system_score_codex":0.000021231685,"about_ca_system_score_gemma":0.000034526787,"threshold_uncertainty_score":0.6961409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18596059,0.000027594444,0.81224126,0.00018121117,0.00021907885,0.00025664258,0.0000096201275,0.0007110313,0.00039297994],"genre_scores_gemma":[0.60547525,0.000020436444,0.393981,0.00016991071,0.000012969628,0.000012876575,0.000013043365,0.000012242358,0.00030226875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977605,0.00023028757,0.0005861911,0.00061714876,0.0004720316,0.00033386977],"domain_scores_gemma":[0.9971452,0.0012552794,0.00031555843,0.0007875143,0.0003763879,0.00012009504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008422704,0.0002781855,0.0004170911,0.00018644784,0.00027218327,0.00008549832,0.0008291367,0.00017341379,0.00002653095],"category_scores_gemma":[0.0009285829,0.00022626687,0.0001038068,0.00056846504,0.00013459992,0.0008909297,0.0003582072,0.00030147115,0.000049204817],"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.00045912332,0.0032086377,0.012062018,0.00026795932,0.00028188038,0.00031687078,0.030790174,0.017158486,0.049479,0.010946959,0.12851205,0.7465168],"study_design_scores_gemma":[0.00032007284,0.00019526578,0.001419161,0.00006791475,0.0000066816524,0.000029920262,0.000031834115,0.8006494,0.19246766,0.0044334773,0.00009099844,0.00028759183],"about_ca_topic_score_codex":0.0002180902,"about_ca_topic_score_gemma":0.000055686676,"teacher_disagreement_score":0.78349096,"about_ca_system_score_codex":0.000085511536,"about_ca_system_score_gemma":0.0001102361,"threshold_uncertainty_score":0.92268956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47749907,0.000105325984,0.50902414,0.0011355549,0.00026029022,0.00019251839,0.0000023730333,0.0014608533,0.01031985],"genre_scores_gemma":[0.9206292,0.00006951409,0.077754304,0.0012744092,0.000025154117,0.00001035156,8.9905285e-7,0.000011212978,0.00022494543],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886334,0.00007539228,0.0001663528,0.00041911585,0.0002451353,0.00023064994],"domain_scores_gemma":[0.99904287,0.00027895937,0.000054549935,0.0004928764,0.000039897168,0.000090842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025355662,0.00016139032,0.00016412992,0.00017260906,0.00019391673,0.0001184719,0.00048633674,0.0000729955,0.000021047263],"category_scores_gemma":[0.00006355041,0.00013352111,0.000043315296,0.00032309868,0.00006243826,0.00040495727,0.00014162957,0.00013837425,0.0000247831],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033403133,0.0015394423,0.6006051,0.00029015084,0.00014361028,0.00221839,0.007213039,0.0017510658,0.003387389,0.07169717,0.19138582,0.11943485],"study_design_scores_gemma":[0.0033252079,0.0045939055,0.18386069,0.00053700944,0.00004722331,0.00083401176,0.0002070989,0.507233,0.25523666,0.027956558,0.011775432,0.004393214],"about_ca_topic_score_codex":0.00009478175,"about_ca_topic_score_gemma":0.000041561427,"teacher_disagreement_score":0.50548196,"about_ca_system_score_codex":0.00003571005,"about_ca_system_score_gemma":0.000070152375,"threshold_uncertainty_score":0.5444833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59277105,0.000020292058,0.40580207,0.00010839951,0.0000425919,0.00015053347,4.650134e-7,0.00012229395,0.0009823273],"genre_scores_gemma":[0.5718096,0.0000025216627,0.4280978,0.00004404396,0.000016568889,0.000013154028,0.0000011754669,0.000002195467,0.000012912239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991764,0.000074594,0.00017266408,0.00019470342,0.00027750194,0.00010417292],"domain_scores_gemma":[0.9994374,0.000034975896,0.00008161638,0.00019646875,0.0002172557,0.00003228662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656668,0.00006714139,0.00006922243,0.000092122405,0.00007680413,0.00005343525,0.0001922868,0.00001950952,0.000041990606],"category_scores_gemma":[0.000014194796,0.00006230819,0.000011509645,0.000148607,0.0000152345865,0.0012715751,0.00007432162,0.000043536853,0.000002535219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.366805e-7,0.00001126088,0.0011482824,0.0000015603608,0.0000025546292,6.559663e-8,0.001898833,0.000048512153,0.0005097016,0.0008220498,0.000032512075,0.9955242],"study_design_scores_gemma":[0.00017726154,0.00010192447,0.0060155494,0.00000778439,0.000005400524,0.000007267247,0.00025192602,0.90501857,0.08796565,0.000324027,0.000047838283,0.00007677683],"about_ca_topic_score_codex":0.00003532178,"about_ca_topic_score_gemma":0.00013259708,"teacher_disagreement_score":0.99544746,"about_ca_system_score_codex":0.00005155885,"about_ca_system_score_gemma":0.000047742178,"threshold_uncertainty_score":0.25408542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018561172,0.00000865869,0.98769695,0.006977652,0.0012184399,0.0010623616,0.00004187274,0.0010680369,0.0017404348],"genre_scores_gemma":[0.51520634,0.000026833304,0.4833778,0.0002995985,0.000020349695,0.00076311466,0.000002333434,0.000019125271,0.00028448296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863595,0.000113928596,0.00038511495,0.00036651484,0.0001806697,0.00031784098],"domain_scores_gemma":[0.99323446,0.0024554527,0.00013191199,0.0036843237,0.00036400507,0.0001298663],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006085113,0.00021276818,0.00019860518,0.0003097701,0.00152465,0.00025366843,0.0020414754,0.00016130318,0.000033470886],"category_scores_gemma":[0.000086887456,0.00023179728,0.00015967162,0.00045228298,0.0001741801,0.00055553135,0.000018327555,0.0007598866,0.00006821662],"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.00010334157,0.006298183,0.000020915582,0.00010605527,0.0005514275,0.000009175016,0.020603966,0.056909278,0.25988066,0.44486508,0.05012837,0.16052356],"study_design_scores_gemma":[0.0005165163,0.00027423105,0.00001292247,0.00004046611,0.00004511276,0.00006924789,0.000070667455,0.76174456,0.18030787,0.04891075,0.007516304,0.0004913527],"about_ca_topic_score_codex":0.00004977944,"about_ca_topic_score_gemma":0.0009460939,"teacher_disagreement_score":0.7048353,"about_ca_system_score_codex":0.00006049877,"about_ca_system_score_gemma":0.0002340056,"threshold_uncertainty_score":0.99977523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025397437,0.000052984098,0.9697104,0.00021209422,0.0004487433,0.00009890104,9.063445e-7,0.00061913737,0.0034593635],"genre_scores_gemma":[0.42044893,7.34256e-7,0.57923704,0.0001456976,0.00003421159,0.000009946735,0.0000012575713,0.000004553043,0.00011758994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988107,0.00005107321,0.000249072,0.00035099234,0.0002902588,0.00024790477],"domain_scores_gemma":[0.9991078,0.00039510016,0.00005766205,0.00032663465,0.00007663054,0.000036217447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561857,0.00010841483,0.00012125037,0.00023433928,0.00006738271,0.00007411566,0.00055881764,0.000059878403,0.00002723692],"category_scores_gemma":[0.00006830249,0.00010405571,0.000043008815,0.00054574566,0.000024320761,0.0003506591,0.00011316001,0.00011461276,0.00003291218],"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.000013966905,0.00049107533,0.15291874,0.000016177093,0.0000042657293,0.00011267224,0.00009283514,0.002491531,0.002818888,0.12093632,0.019219575,0.7008839],"study_design_scores_gemma":[0.0003177046,0.00004016588,0.051590193,0.00004579904,5.7910097e-7,0.000009728473,0.00000386172,0.92453307,0.006386163,0.014486374,0.002368903,0.00021744518],"about_ca_topic_score_codex":0.001125638,"about_ca_topic_score_gemma":0.0014400331,"teacher_disagreement_score":0.92204154,"about_ca_system_score_codex":0.00015409774,"about_ca_system_score_gemma":0.00009021648,"threshold_uncertainty_score":0.42432687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035990616,0.000030480027,0.99169314,0.0006205517,0.00067853404,0.0002816712,0.0000062058803,0.00074919284,0.0023411673],"genre_scores_gemma":[0.9816319,0.00015891252,0.016850503,0.00096656766,0.000014945249,0.00007415002,9.652571e-7,0.0000071021827,0.00029500574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907154,0.00014158132,0.00025975375,0.00013686658,0.00022192979,0.00016833827],"domain_scores_gemma":[0.99895483,0.0002982474,0.000101780206,0.0005044638,0.00009242124,0.000048231846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867711,0.00013096006,0.00011226278,0.00023784515,0.00035133027,0.00018436537,0.0004298205,0.000046439087,0.000032033036],"category_scores_gemma":[0.000019014298,0.00009261659,0.00007466841,0.0004193758,0.00014018004,0.0018381051,0.000004024537,0.00025412784,0.000074900876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041748142,0.000020472087,0.000003886127,0.0000056437957,0.000018746494,6.7878955e-7,0.004323466,0.00017559648,0.000018686162,0.054490346,0.00013409968,0.94076663],"study_design_scores_gemma":[0.0069744578,0.0006659149,0.0014068414,0.00019016696,0.00012140467,0.0013138168,0.003139769,0.3171036,0.10772813,0.5269408,0.032288622,0.0021264185],"about_ca_topic_score_codex":0.000026025808,"about_ca_topic_score_gemma":0.000005167108,"teacher_disagreement_score":0.97803277,"about_ca_system_score_codex":0.00003089788,"about_ca_system_score_gemma":0.000025915939,"threshold_uncertainty_score":0.3776795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66638833,0.000011218636,0.32890302,0.0003365948,0.00047403085,0.00009912,2.2465672e-7,0.00048976584,0.0032976894],"genre_scores_gemma":[0.79180664,7.89395e-7,0.20785183,0.0001632547,0.000047432764,0.0000036986362,8.062693e-8,0.000009899249,0.00011639128],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902594,0.000027475086,0.00023923353,0.00025437388,0.0002185698,0.00023443444],"domain_scores_gemma":[0.99878716,0.00014460314,0.00013857102,0.00078545697,0.000100329424,0.000043874457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046465,0.000117801006,0.00014428062,0.000080754304,0.00014070369,0.00008442324,0.0012793193,0.000064073894,0.000025340727],"category_scores_gemma":[0.00022849985,0.000081069404,0.000069629685,0.00035892718,0.000090580856,0.00028131108,0.00046498264,0.00030057164,0.000012020119],"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.0000029769972,0.000049419872,0.003713652,0.000021018128,0.0000132486875,0.000004590076,0.0018924903,0.000057362035,0.9593114,0.013306795,0.00027405444,0.02135298],"study_design_scores_gemma":[0.00010209469,0.0000534409,0.0023304329,0.000052736184,0.000009587523,0.00007191737,0.00010011413,0.14786728,0.8451073,0.0033153263,0.0007324868,0.00025727198],"about_ca_topic_score_codex":0.0005161956,"about_ca_topic_score_gemma":0.00021609002,"teacher_disagreement_score":0.14780991,"about_ca_system_score_codex":0.000013107447,"about_ca_system_score_gemma":0.000048272752,"threshold_uncertainty_score":0.33059144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2530355,0.000026700802,0.74467564,0.001238119,0.00005215361,0.00023317354,0.000005929367,0.00019557035,0.00053722976],"genre_scores_gemma":[0.6284161,0.0000018631428,0.371212,0.00028561987,0.000017242073,0.000018251778,0.000002029157,0.0000036506922,0.000043222106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991534,0.000031008378,0.00021680008,0.0002574064,0.0001496466,0.00019178112],"domain_scores_gemma":[0.9992321,0.00028797315,0.000085863394,0.00023050666,0.000107297165,0.000056262234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002759133,0.00009665348,0.00012481693,0.00010636921,0.00012380858,0.000030287403,0.00027981677,0.000037717353,0.000014060894],"category_scores_gemma":[0.000087525696,0.00009358423,0.000056770023,0.00011719675,0.0000851016,0.00009678978,0.00012923552,0.00007476805,0.0000014715752],"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.000108437336,0.00064235704,0.1222043,0.0003410515,0.00026089192,0.00000329505,0.012726209,0.0030110953,0.02639951,0.51914275,0.03639063,0.2787695],"study_design_scores_gemma":[0.0020515022,0.0005276734,0.10094206,0.000077482146,0.00005121774,0.000091669004,0.0007042412,0.4564549,0.2935721,0.1422808,0.0023197578,0.0009265762],"about_ca_topic_score_codex":0.00012942207,"about_ca_topic_score_gemma":0.0012645466,"teacher_disagreement_score":0.45344383,"about_ca_system_score_codex":0.000035380133,"about_ca_system_score_gemma":0.00007291914,"threshold_uncertainty_score":0.38162544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08174883,0.0010090398,0.8961863,0.0037806847,0.0008796681,0.0006177519,0.0000032659464,0.0015716699,0.014202781],"genre_scores_gemma":[0.54600406,0.000082196304,0.43460876,0.0006443089,0.00030774542,0.000028162442,0.0000021321541,0.0000397844,0.018282868],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99635875,0.00047531526,0.0005710349,0.0008767592,0.0005020393,0.0012160756],"domain_scores_gemma":[0.9973009,0.00078648824,0.0002716245,0.00087973126,0.00047174853,0.00028949886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005660701,0.00039019604,0.00032111644,0.00017710852,0.00027576202,0.0004159636,0.0011316006,0.00035880264,0.00007161459],"category_scores_gemma":[0.0009970185,0.0004095201,0.00011903742,0.0009028745,0.00025130366,0.0010028869,0.00036082623,0.00064371346,0.00010201322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029792885,0.00053607376,0.0201036,0.00024605636,0.000041808384,0.00044386665,0.0050961087,0.00015385612,0.017526869,0.02328809,0.009027335,0.92350656],"study_design_scores_gemma":[0.0003427689,0.00028017024,0.051494855,0.00046019943,0.000033491593,0.0006460477,0.000049718656,0.15150538,0.7671181,0.008046718,0.019260067,0.0007625011],"about_ca_topic_score_codex":0.0016558853,"about_ca_topic_score_gemma":0.0006388966,"teacher_disagreement_score":0.92274404,"about_ca_system_score_codex":0.00046217223,"about_ca_system_score_gemma":0.00064308645,"threshold_uncertainty_score":0.99983567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1381144,0.0001574653,0.8576684,0.0004226388,0.0022439354,0.00030440703,0.0000048573716,0.00040953816,0.0006743705],"genre_scores_gemma":[0.9482428,0.00023498833,0.050753243,0.00019806264,0.00025893922,0.000016350503,3.6827765e-7,0.000036414523,0.00025882685],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979542,0.00008479332,0.0007652354,0.00030092977,0.00047097198,0.000423884],"domain_scores_gemma":[0.9975374,0.00016909071,0.00078270485,0.0004355956,0.0008984569,0.00017676761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767604,0.0002237913,0.00038445945,0.00047631442,0.0002308372,0.000067251756,0.0010511471,0.000115556584,0.000004757098],"category_scores_gemma":[0.00021459583,0.00021412832,0.00026596576,0.0003932835,0.0000997321,0.0011850869,0.000049187867,0.00038268813,0.0000067619662],"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.000114574854,0.0007452376,0.00079678313,0.00013662546,0.0003320986,0.00079185853,0.020432204,0.0010388122,0.58329946,0.0012213236,0.16383617,0.22725484],"study_design_scores_gemma":[0.0006543364,0.001316869,0.00042277513,0.00026074005,0.000024794648,0.007898369,0.00011779561,0.0013304095,0.96026754,0.016655162,0.0104690995,0.00058209396],"about_ca_topic_score_codex":0.0000056292665,"about_ca_topic_score_gemma":0.000001717348,"teacher_disagreement_score":0.8101284,"about_ca_system_score_codex":0.00021989683,"about_ca_system_score_gemma":0.00030046454,"threshold_uncertainty_score":0.87319},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021886041,0.000010089155,0.9668022,0.00006170631,0.0004404437,0.00024623267,0.000019735227,0.0011495181,0.00938407],"genre_scores_gemma":[0.98223275,0.00005698648,0.01715821,0.0004251259,0.0000025826955,0.0000742346,0.0000017619215,0.0000070228634,0.000041331874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989904,0.00009597103,0.00036186774,0.0001368624,0.00019289443,0.00022201239],"domain_scores_gemma":[0.9992072,0.00010358198,0.000109114946,0.00038807146,0.000095639894,0.00009636522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003794803,0.000167428,0.00011993349,0.00071857276,0.00033485767,0.000095683594,0.00040587323,0.00010877962,0.000087346685],"category_scores_gemma":[0.000006345567,0.00015953161,0.00009983248,0.0005381223,0.00010272691,0.0041826125,0.0000026638058,0.0002876268,0.00008289341],"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.00008386833,0.00016036132,0.0001225003,0.00005373108,0.00006838529,0.0000017080309,0.042200793,0.000104024315,0.00020052317,0.2783658,0.00008857024,0.67854977],"study_design_scores_gemma":[0.004568354,0.0033446725,0.02926871,0.00033509952,0.0002174085,0.00083820237,0.0049080616,0.039903257,0.385271,0.5218233,0.005502725,0.004019222],"about_ca_topic_score_codex":0.000020932606,"about_ca_topic_score_gemma":0.000010795652,"teacher_disagreement_score":0.9603467,"about_ca_system_score_codex":0.000021686928,"about_ca_system_score_gemma":0.00003006855,"threshold_uncertainty_score":0.6505511},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020804495,0.00012758395,0.9933781,0.0038545313,0.00039952138,0.0007023953,0.000005358061,0.00070814596,0.0006162952],"genre_scores_gemma":[0.49468887,0.00007804065,0.5047624,0.00028214356,0.0000148983,0.00011721001,0.0000022736756,0.000010560463,0.000043621792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985557,0.00015285531,0.0004115966,0.00038622264,0.0002078331,0.0002857726],"domain_scores_gemma":[0.9960425,0.001477803,0.00013093048,0.0021014793,0.0001512392,0.000096058815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036938995,0.0001868546,0.00019912144,0.0004857402,0.00044039203,0.00012659059,0.001979196,0.00018592126,0.0000065178106],"category_scores_gemma":[0.00012683948,0.00021147508,0.00012103728,0.0015331554,0.00003053458,0.00055560557,0.000008317677,0.00051193667,0.000018700059],"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.000043172495,0.00084941695,0.000020724412,0.0000066426164,0.000024590376,9.640643e-7,0.0058239074,0.005254232,0.0016809311,0.23944388,0.00086520694,0.74598634],"study_design_scores_gemma":[0.00045158254,0.00050932827,0.00017108802,0.00029860024,0.000018050374,0.000009625897,0.00005950216,0.09451864,0.012720537,0.8901674,0.0006869759,0.0003886424],"about_ca_topic_score_codex":0.00014781584,"about_ca_topic_score_gemma":0.00050582935,"teacher_disagreement_score":0.74559766,"about_ca_system_score_codex":0.00023050913,"about_ca_system_score_gemma":0.00018629317,"threshold_uncertainty_score":0.8623703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013631358,0.00002065554,0.981716,0.0060290736,0.00012640486,0.00024903275,8.693651e-7,0.0011525498,0.009342279],"genre_scores_gemma":[0.5799153,5.1357824e-7,0.4171427,0.002436941,0.000022562455,0.0000283008,0.0000013916942,0.000003267389,0.0004490734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991918,0.000018172794,0.00015060233,0.0002799539,0.00014852005,0.00021095316],"domain_scores_gemma":[0.9991704,0.00016334599,0.00006492087,0.00044155604,0.0001130889,0.000046638226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023275006,0.00009886311,0.00010780362,0.000080392405,0.00008707685,0.000087583154,0.0006635696,0.000036925077,0.0000125287515],"category_scores_gemma":[0.000095395866,0.000083694664,0.00005849043,0.00018098764,0.000011295517,0.00015376852,0.000042740263,0.000053900752,0.0000083509],"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.00003381445,0.0003401149,0.00053362246,0.000029120514,0.000013501881,0.000013102043,0.00034575272,0.00025715498,0.013268989,0.57574767,0.06892168,0.3404955],"study_design_scores_gemma":[0.00087868667,0.001563437,0.0014259611,0.00007897673,0.000011369426,0.0000045153674,0.00002566188,0.39460152,0.5324406,0.04540351,0.022940665,0.00062504807],"about_ca_topic_score_codex":0.00002754615,"about_ca_topic_score_gemma":0.000032201,"teacher_disagreement_score":0.5785521,"about_ca_system_score_codex":0.000042267737,"about_ca_system_score_gemma":0.000050555303,"threshold_uncertainty_score":0.3412969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048037,0.00013075172,0.39274365,0.00009221817,0.00031669057,0.000120708515,5.8902816e-7,0.00095067814,0.00084102957],"genre_scores_gemma":[0.82098883,0.000022901808,0.17861955,0.00019620982,0.000036583162,0.000005339069,6.334922e-7,0.000016155058,0.00011381402],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998455,0.00009532805,0.000283989,0.0005274084,0.00027203342,0.00036625602],"domain_scores_gemma":[0.9990283,0.00019577904,0.00012071029,0.0004300426,0.00009797253,0.00012714977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034076744,0.00021647719,0.00024038633,0.00020930359,0.00050869,0.00013343502,0.00047155013,0.00008740119,0.000013630182],"category_scores_gemma":[0.00013792004,0.00019189391,0.00004645593,0.0006799545,0.00008802102,0.0007437473,0.00041167924,0.00020447007,0.000007407676],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065770204,0.0004830548,0.85676366,0.00017004185,0.00016576338,0.0008087623,0.042092793,0.0004170981,0.020101747,0.023092618,0.00840451,0.04743418],"study_design_scores_gemma":[0.0014934847,0.0006382421,0.0337543,0.00035939156,0.00006395912,0.004813934,0.002453128,0.75937736,0.18930057,0.0031740922,0.0018618965,0.0027096465],"about_ca_topic_score_codex":0.0004785021,"about_ca_topic_score_gemma":0.000099734316,"teacher_disagreement_score":0.8230094,"about_ca_system_score_codex":0.000062052386,"about_ca_system_score_gemma":0.0000883785,"threshold_uncertainty_score":0.78252065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034890372,0.00129894,0.7470907,0.0016001075,0.00041196332,0.00038635943,0.00000873449,0.0012052323,0.2131076],"genre_scores_gemma":[0.7569424,0.00047794456,0.24232224,0.000060277656,0.000006355011,0.000017868659,0.000001207838,0.0000064222636,0.00016532277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930984,0.00011886033,0.00023078427,0.00014036021,0.00008525773,0.000114887065],"domain_scores_gemma":[0.9973678,0.00018214362,0.00013425293,0.002127869,0.00015147866,0.00003648073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034796202,0.00008214581,0.00013722532,0.00012249548,0.000111950554,0.000026084608,0.0017066651,0.000036459372,0.0000046201685],"category_scores_gemma":[0.000058708323,0.00008401434,0.000025109379,0.00027534278,0.00019505966,0.00027076073,0.00060333346,0.0001288633,0.000010165675],"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.000012790305,0.0003259567,0.0038906531,0.00009639854,0.000046333615,0.0000044170783,0.020714976,0.0000019482927,0.029036423,0.8803352,0.0073239175,0.05821097],"study_design_scores_gemma":[0.002059654,0.0012284447,0.067749105,0.0013218558,0.00014616495,0.00047663806,0.0028818257,0.104409054,0.53893924,0.22143617,0.05668247,0.002669362],"about_ca_topic_score_codex":0.00009550632,"about_ca_topic_score_gemma":0.00009127825,"teacher_disagreement_score":0.722052,"about_ca_system_score_codex":0.000015960855,"about_ca_system_score_gemma":0.000028987197,"threshold_uncertainty_score":0.34260052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012065219,0.00020619035,0.9844131,0.0001494774,0.00042803693,0.0019840335,0.0000060666366,0.00070406473,0.000043843236],"genre_scores_gemma":[0.8476843,8.817501e-7,0.15148862,0.00031542985,0.00017006784,0.0002542839,0.00001734816,0.000044502995,0.000024559864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673665,0.00024426938,0.0007753773,0.0008874427,0.0006154686,0.00074078224],"domain_scores_gemma":[0.99747324,0.0010586061,0.0005178869,0.00039911998,0.0002910105,0.00026014386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028833477,0.00041345364,0.00036949167,0.00054324407,0.0007445746,0.0008335815,0.0006180556,0.00014582169,0.0000067576084],"category_scores_gemma":[0.000047917,0.00038583443,0.000085430634,0.0006176416,0.00006360564,0.00036993998,0.000032948632,0.00028322762,0.0000027492677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033914932,0.00018515199,0.000034175,0.00023901569,0.000027422075,0.000010838722,0.0036731968,0.58300805,0.014340631,0.000778903,0.0007478842,0.39661556],"study_design_scores_gemma":[0.001160268,0.00074319687,0.00004319187,0.00058186246,0.000031834905,0.00003887223,0.0017293093,0.98233247,0.012128868,0.00052689324,0.00010824681,0.000575003],"about_ca_topic_score_codex":0.00002337895,"about_ca_topic_score_gemma":0.000028308945,"teacher_disagreement_score":0.8356191,"about_ca_system_score_codex":0.00020260182,"about_ca_system_score_gemma":0.00023553226,"threshold_uncertainty_score":0.99985933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018110152,0.00005051716,0.9737637,0.003236764,0.00011292997,0.00036175523,8.6875343e-7,0.0018508346,0.0025125004],"genre_scores_gemma":[0.41126192,0.0000069978664,0.58715004,0.00019898552,0.000033886066,0.00003635615,0.000001612837,0.00001711294,0.0012931016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988592,0.00002737104,0.00018495104,0.00040767353,0.00021536183,0.0003054282],"domain_scores_gemma":[0.99915147,0.000096323056,0.00005573295,0.0005068807,0.000088633926,0.00010095131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003274561,0.00015820522,0.0001891104,0.000097114615,0.00014483507,0.000097954355,0.00077424455,0.000092294285,0.000013593986],"category_scores_gemma":[0.000022295839,0.00013620818,0.00011203843,0.0002579844,0.000034761328,0.000337218,0.0000764718,0.00008744395,0.000038327467],"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.000034298107,0.00031611184,0.00007444556,0.00008888796,0.000029925537,0.000019055613,0.0022681651,0.000330345,0.23596063,0.4750521,0.005201362,0.2806247],"study_design_scores_gemma":[0.00070433406,0.00037974791,0.00008823163,0.00013272231,0.0000098707515,0.000034035325,0.000026554777,0.07210845,0.84037346,0.0755141,0.010177993,0.00045049968],"about_ca_topic_score_codex":0.000078919766,"about_ca_topic_score_gemma":0.0000127775775,"teacher_disagreement_score":0.60441285,"about_ca_system_score_codex":0.00007376749,"about_ca_system_score_gemma":0.00008917223,"threshold_uncertainty_score":0.55544084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012630402,0.000060588907,0.9890289,0.00042650892,0.00018848488,0.00023575507,0.0000013817762,0.0002587801,0.008536595],"genre_scores_gemma":[0.23966807,0.000007928759,0.7591691,0.000074145726,0.00003715922,0.000010400997,0.0000010425151,0.0000033527645,0.0010287755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935853,0.000021384001,0.00015243096,0.00018545952,0.00016419396,0.0001180178],"domain_scores_gemma":[0.9991814,0.00025882263,0.000081484606,0.00032303797,0.00012532037,0.000029934155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021373776,0.00006836582,0.00009793565,0.00004722397,0.00011333693,0.000014287209,0.00050553423,0.000039133658,0.000020266418],"category_scores_gemma":[0.00007281315,0.000047536112,0.000065213426,0.00019077309,0.000118666605,0.00014558302,0.00008577791,0.00006308766,0.000003912363],"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.00002501363,0.00006589223,0.0039939163,0.000018150915,0.000043243952,6.562579e-7,0.00096167857,0.00018464892,0.0018335414,0.8957354,0.07373351,0.023404347],"study_design_scores_gemma":[0.0012079334,0.0003933485,0.0073529277,0.000029509118,0.000033839413,0.0013230973,0.00045811222,0.82792485,0.09606521,0.048110012,0.016514821,0.00058635796],"about_ca_topic_score_codex":0.00014167647,"about_ca_topic_score_gemma":0.0000055259297,"teacher_disagreement_score":0.8476254,"about_ca_system_score_codex":0.000021480468,"about_ca_system_score_gemma":0.00015646183,"threshold_uncertainty_score":0.19384664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019191783,0.000042640142,0.98817354,0.0024065014,0.0001939856,0.00042625878,0.0000010678806,0.0013979666,0.0054388684],"genre_scores_gemma":[0.5797026,6.3964836e-7,0.41814825,0.0010325423,0.000033031716,0.000041948657,0.0000012126957,0.0000065592653,0.0010332271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988623,0.000036109475,0.00021617864,0.00041957415,0.00016027456,0.00030555046],"domain_scores_gemma":[0.99887174,0.000318711,0.000075990836,0.0004915077,0.00016666416,0.00007538499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027993077,0.00016060726,0.00018190744,0.00011738721,0.00014299511,0.00016480453,0.0006673559,0.000070437956,0.000010624103],"category_scores_gemma":[0.00023895968,0.0001388653,0.00008562967,0.0002606028,0.000023146185,0.00042094398,0.00007856546,0.00011392407,0.000024685081],"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.000056274184,0.00029375622,0.00008628498,0.00001752223,0.000038803908,0.000016422044,0.0054682707,0.0004896837,0.009632107,0.81784594,0.036855884,0.12919904],"study_design_scores_gemma":[0.0007997475,0.0014038241,0.00070867664,0.00011176041,0.000018817509,0.00008194297,0.000077011384,0.7092764,0.038415898,0.24565679,0.0026444348,0.00080473954],"about_ca_topic_score_codex":0.00001630934,"about_ca_topic_score_gemma":0.00004456331,"teacher_disagreement_score":0.70878667,"about_ca_system_score_codex":0.000054557255,"about_ca_system_score_gemma":0.00005026478,"threshold_uncertainty_score":0.56627625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010022112,0.000053251697,0.87387204,0.00032749583,0.00032554258,0.00012714429,3.3970153e-7,0.0008321582,0.11443989],"genre_scores_gemma":[0.56864744,0.0000029006019,0.42743176,0.00089954614,0.000017785855,0.000017340482,4.649313e-7,0.000008873259,0.0029738897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988171,0.00011630574,0.0001872545,0.00040270275,0.0001889636,0.00028766072],"domain_scores_gemma":[0.99901086,0.00012473352,0.000059485625,0.000606758,0.00011568977,0.00008244852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031678806,0.00014648073,0.00013785655,0.00011266618,0.000099405435,0.00014706033,0.0006037315,0.000062879204,0.00012713285],"category_scores_gemma":[0.00013041966,0.00012618641,0.00006181849,0.00041702596,0.000028437858,0.00041196996,0.00011860596,0.00014209881,0.00015873734],"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.000012557797,0.0002684184,0.00658563,0.000018637513,0.000057601606,0.00010943325,0.004927071,0.000046973397,0.011065733,0.86014706,0.07982055,0.036940347],"study_design_scores_gemma":[0.0010747298,0.0015249039,0.002493311,0.000116232026,0.000028442591,0.0006032046,0.000404711,0.096994504,0.61126095,0.12760974,0.15547308,0.0024162068],"about_ca_topic_score_codex":0.000026035574,"about_ca_topic_score_gemma":0.00012114966,"teacher_disagreement_score":0.7325373,"about_ca_system_score_codex":0.000047623922,"about_ca_system_score_gemma":0.00005891435,"threshold_uncertainty_score":0.5145732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020947304,0.00003596989,0.9731957,0.00080084364,0.00036332934,0.0005730443,0.0000022915892,0.0017007666,0.0023807753],"genre_scores_gemma":[0.53343904,0.0000014731586,0.46613818,0.00020666925,0.000038724902,0.00004465363,8.8106447e-7,0.000017982735,0.000112368485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998233,0.000090492846,0.00035485075,0.0006078947,0.00025858666,0.00045514767],"domain_scores_gemma":[0.9979461,0.00046284735,0.000083128594,0.0012521697,0.00013760164,0.0001181686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008390384,0.00023165664,0.00023072743,0.00013653813,0.00016708513,0.00022661107,0.0019147088,0.00008933321,0.0000043819027],"category_scores_gemma":[0.0005635619,0.00021974611,0.00012447799,0.0003334776,0.000056149293,0.00061587966,0.00042290852,0.00014670688,0.00001312338],"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.0006893282,0.0009834798,0.0037208314,0.00024038489,0.00016468698,0.00017510551,0.010734914,0.003705093,0.030380847,0.5189907,0.029428981,0.40078565],"study_design_scores_gemma":[0.002610946,0.0013221394,0.0025116645,0.00064424763,0.000045573826,0.0002272898,0.00034829188,0.14962032,0.21001808,0.62682647,0.003767103,0.0020579048],"about_ca_topic_score_codex":0.00013418718,"about_ca_topic_score_gemma":0.00014025085,"teacher_disagreement_score":0.51249176,"about_ca_system_score_codex":0.00021942271,"about_ca_system_score_gemma":0.00007922876,"threshold_uncertainty_score":0.8960987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064883335,0.000040363397,0.95596355,0.0002912142,0.00041276554,0.000098432436,7.1363786e-8,0.0018370514,0.034868218],"genre_scores_gemma":[0.7228023,0.000002484206,0.27433994,0.0007819564,0.000024261724,0.000011256708,1.314087e-7,0.0000128774545,0.0020248222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882054,0.00006923916,0.00020577287,0.00037571965,0.0001955881,0.00033314162],"domain_scores_gemma":[0.9990939,0.00007958465,0.00006665344,0.00060576986,0.00006121754,0.00009287815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237572,0.00013923775,0.00013901817,0.00013528464,0.00013015843,0.00015605753,0.0005571816,0.00006022072,0.00004503658],"category_scores_gemma":[0.00020589752,0.00012731893,0.000076991775,0.0003136204,0.000019138686,0.00033052982,0.00019720866,0.00015008183,0.00012939387],"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.0000071728105,0.00044578756,0.00520429,0.00009215462,0.00007617058,0.00012159448,0.011144268,0.0007744928,0.05030581,0.5765471,0.06140079,0.2938804],"study_design_scores_gemma":[0.00050718343,0.0002825467,0.00041123203,0.00012943301,0.000011566247,0.00045559654,0.0003162546,0.28394297,0.5891389,0.082133465,0.041313395,0.0013574585],"about_ca_topic_score_codex":0.000034298882,"about_ca_topic_score_gemma":0.000013855295,"teacher_disagreement_score":0.71631396,"about_ca_system_score_codex":0.000050190756,"about_ca_system_score_gemma":0.00003629587,"threshold_uncertainty_score":0.5191915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62563795,0.000039105664,0.37311515,0.00012795838,0.000113343325,0.00012575752,7.413325e-7,0.00018816609,0.0006518059],"genre_scores_gemma":[0.8913017,0.000009168541,0.108512856,0.00010091387,0.000010575635,0.0000020899477,0.0000010286896,0.000006535728,0.000055119363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998875,0.000049922215,0.0003273604,0.00028695285,0.00027117107,0.00018959153],"domain_scores_gemma":[0.9986602,0.00051890605,0.00021135608,0.0004004052,0.00015044815,0.000058703587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223481,0.00012918626,0.0002496439,0.0005067042,0.000052102965,0.000027010867,0.00033888765,0.00010431551,0.0000035433686],"category_scores_gemma":[0.00037775998,0.00011577107,0.000043257925,0.00094964233,0.00008171636,0.00024598325,0.0002055366,0.00014217186,0.0000040686955],"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.0004002535,0.0031138982,0.09838244,0.0018939772,0.0001906539,0.00010508489,0.008355347,0.00418935,0.14856826,0.35560974,0.00481347,0.37437752],"study_design_scores_gemma":[0.00014525476,0.00050985,0.03159914,0.00012556626,0.0000064980954,0.0000100571215,0.00004497552,0.22789651,0.73302317,0.006467391,0.0000077419745,0.00016385352],"about_ca_topic_score_codex":0.00025161833,"about_ca_topic_score_gemma":0.000022917757,"teacher_disagreement_score":0.5844549,"about_ca_system_score_codex":0.000027845092,"about_ca_system_score_gemma":0.000024947976,"threshold_uncertainty_score":0.47210073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022580128,0.00009054262,0.95305187,0.00016479676,0.00052364933,0.00051796966,2.3325546e-7,0.0028450433,0.020225748],"genre_scores_gemma":[0.84772354,0.000001995874,0.1501983,0.00044266746,0.000031807824,0.00001586369,8.973216e-7,0.000014668484,0.0015702734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998148,0.00014166987,0.00053094584,0.0004478711,0.00030511743,0.0004263789],"domain_scores_gemma":[0.9978522,0.0005186987,0.00019497392,0.001164821,0.0001531139,0.00011615744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025645543,0.00021620332,0.00038031486,0.00021417536,0.00013086558,0.00021004229,0.0011112924,0.00008831691,0.000021206506],"category_scores_gemma":[0.00031208832,0.00016058533,0.000097252756,0.0006105939,0.00002690735,0.00041057318,0.00024919058,0.00016444705,0.00013021419],"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.00016512434,0.0010904057,0.020329872,0.024678225,0.0006197873,0.0013679356,0.02099586,0.0013614844,0.17314495,0.6915619,0.044657182,0.020027265],"study_design_scores_gemma":[0.0010243494,0.00058579276,0.011015386,0.0045635747,0.00008858598,0.00043699017,0.00047588936,0.27996114,0.6638346,0.03467294,0.0010883482,0.0022524395],"about_ca_topic_score_codex":0.00012997416,"about_ca_topic_score_gemma":0.00014850091,"teacher_disagreement_score":0.8251434,"about_ca_system_score_codex":0.00008476694,"about_ca_system_score_gemma":0.000035777688,"threshold_uncertainty_score":0.654848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030625893,0.0005851629,0.89821064,0.01649925,0.00084615115,0.0023006075,0.00031104614,0.0034968148,0.047124404],"genre_scores_gemma":[0.76050425,0.00013855149,0.23678944,0.0016544865,0.000084102,0.0003873507,0.00019423799,0.00002666201,0.0002209031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949431,0.0008599815,0.0012477523,0.0010233038,0.00082667364,0.0010992306],"domain_scores_gemma":[0.991072,0.000535022,0.0006080636,0.0061752056,0.0010470527,0.00056262914],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016437095,0.0006571777,0.0007797992,0.00034142716,0.0012007963,0.00083542254,0.007176801,0.00041011773,0.00007608707],"category_scores_gemma":[0.00021645486,0.00075068075,0.00021816645,0.0015083372,0.00037184072,0.0007761139,0.0013586972,0.00085519894,0.00086549454],"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.0001009558,0.0022272582,0.0038058646,0.00008329588,0.00021272035,0.000006853755,0.0007009415,0.011543095,0.0019434823,0.68322855,0.25323045,0.042916503],"study_design_scores_gemma":[0.0029891965,0.00037422037,0.019739117,0.0007983257,0.00016896921,0.00027781536,0.0005605124,0.6808741,0.01012477,0.014034071,0.26617244,0.003886447],"about_ca_topic_score_codex":0.0012013195,"about_ca_topic_score_gemma":0.004952099,"teacher_disagreement_score":0.72987837,"about_ca_system_score_codex":0.0014146795,"about_ca_system_score_gemma":0.0010246082,"threshold_uncertainty_score":0.99991244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051192585,0.0000012222637,0.97536683,0.00044233358,0.001831006,0.00014815562,0.000006579126,0.0011162235,0.015968407],"genre_scores_gemma":[0.96479946,0.0000039487313,0.032167267,0.0025575594,0.000022413078,0.000043658838,8.452469e-7,0.000006879806,0.00039798662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991626,0.000040711973,0.00026220034,0.000124515,0.00023558189,0.00017435818],"domain_scores_gemma":[0.99893856,0.00013823804,0.00009896706,0.00064327446,0.0001124195,0.000068533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005208605,0.000121900186,0.00008546167,0.0003029731,0.00022497348,0.0001544285,0.00059538626,0.00010612863,0.00024247197],"category_scores_gemma":[0.000013347271,0.00011777521,0.00008671321,0.00033306977,0.000046410303,0.0024080114,0.0000028177867,0.00047267435,0.0009611557],"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.00003336553,0.0000976966,0.000009570705,0.00002393527,0.00002676879,0.0000010496536,0.009434475,0.0004607656,0.0028875,0.17525382,0.0036426943,0.80812836],"study_design_scores_gemma":[0.00059252896,0.0002347712,0.00019710444,0.000045131106,0.00002009114,0.00011248676,0.0003161806,0.052032787,0.81420505,0.08076317,0.0507745,0.0007062093],"about_ca_topic_score_codex":0.000010630263,"about_ca_topic_score_gemma":0.0000073490755,"teacher_disagreement_score":0.9596802,"about_ca_system_score_codex":0.000028650686,"about_ca_system_score_gemma":0.000051210613,"threshold_uncertainty_score":0.9998167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00509843,0.000010182872,0.98250085,0.0018796445,0.00033440057,0.00033781247,0.0000081649205,0.00061289326,0.009217634],"genre_scores_gemma":[0.9904821,0.000037040834,0.0068191364,0.0023353042,0.0000098759665,0.00007969561,5.430875e-7,0.0000065676677,0.00022972291],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990687,0.000099238976,0.00027563688,0.000117773,0.00027086397,0.00016783254],"domain_scores_gemma":[0.99888253,0.00049726566,0.000081828126,0.000429145,0.00005511341,0.000054096494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061346125,0.00014344571,0.00011252029,0.00025295635,0.00033995102,0.00015298407,0.00038630885,0.00007109646,0.000051091745],"category_scores_gemma":[0.0000145364065,0.000098062286,0.0000992157,0.00025062702,0.00011741549,0.0018127295,0.0000016328694,0.00030594625,0.00011754958],"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.00010662373,0.000024360495,2.6845862e-7,0.000005762143,0.000015028753,1.0648357e-7,0.0058991513,0.0009257835,0.000008305913,0.3185681,0.00015809834,0.6742884],"study_design_scores_gemma":[0.0056342296,0.00074944575,0.00014715991,0.00014931445,0.00006325293,0.00011284669,0.0008352993,0.23782548,0.10022142,0.6317969,0.021377536,0.0010871094],"about_ca_topic_score_codex":0.0000065467107,"about_ca_topic_score_gemma":0.000011317533,"teacher_disagreement_score":0.9853837,"about_ca_system_score_codex":0.000047497575,"about_ca_system_score_gemma":0.000025168778,"threshold_uncertainty_score":0.3998864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023536747,0.00003589862,0.8559429,0.00058814464,0.0002391376,0.00008053294,2.782522e-7,0.0021632432,0.117413096],"genre_scores_gemma":[0.80716234,0.0000017600994,0.18832915,0.00025370554,0.000056124936,0.000009159647,7.791574e-7,0.000007111986,0.004179871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991429,0.000037467093,0.0001541713,0.00027576915,0.0001644707,0.00022525473],"domain_scores_gemma":[0.9992906,0.0000734886,0.00004517994,0.0004937117,0.00006375197,0.00003330827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022000563,0.00010034893,0.000107520624,0.00007795611,0.0000762662,0.00013236364,0.0007576441,0.00004519704,0.000026712973],"category_scores_gemma":[0.00001750636,0.00008789979,0.000041290466,0.00030215824,0.000025312642,0.0002850912,0.00017910359,0.00008844298,0.00012371638],"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.0000026078806,0.00011457665,0.006617188,0.000011573794,0.0000064525225,0.00005074612,0.00016533905,0.00007336046,0.0116431415,0.85780823,0.069221966,0.054284837],"study_design_scores_gemma":[0.00042149975,0.00016714685,0.013398714,0.000048959435,0.000007118759,0.00012590516,0.00004746251,0.084590636,0.7170862,0.13079047,0.052305963,0.0010099455],"about_ca_topic_score_codex":0.0005606755,"about_ca_topic_score_gemma":0.00022006474,"teacher_disagreement_score":0.7836256,"about_ca_system_score_codex":0.000029916268,"about_ca_system_score_gemma":0.000026824566,"threshold_uncertainty_score":0.35844493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055663446,0.00008473365,0.9915931,0.000257051,0.00023944733,0.00017944995,0.0000011513421,0.0014447235,0.0006339467],"genre_scores_gemma":[0.8951853,0.000006113997,0.104103506,0.000321306,0.000035440684,0.00005179445,2.6797431e-7,0.000026505084,0.0002697525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998254,0.000059447626,0.00030515707,0.0005325058,0.00044089346,0.0004079884],"domain_scores_gemma":[0.9991075,0.00013267924,0.00011726653,0.0003617252,0.00014435763,0.00013648729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019601303,0.00024304776,0.00020844597,0.0002848908,0.0007823708,0.00012247646,0.00069600437,0.00010635923,0.000027568918],"category_scores_gemma":[0.0000057077373,0.0002466046,0.00011761674,0.0006466937,0.0001117839,0.0008145242,0.0000038219923,0.0004583736,0.00007324738],"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.00010889181,0.0005867411,0.000023209612,0.00008182434,0.000051559808,0.00014168318,0.005708339,0.2996517,0.007839043,0.00019486572,0.00063235726,0.68497974],"study_design_scores_gemma":[0.00068397395,0.00045370814,0.00007805769,0.00027622073,0.000033664262,0.0007318467,0.00012212913,0.9524975,0.04161448,0.002466085,0.00016581596,0.0008765592],"about_ca_topic_score_codex":0.000021570071,"about_ca_topic_score_gemma":0.000015505751,"teacher_disagreement_score":0.889619,"about_ca_system_score_codex":0.00010495097,"about_ca_system_score_gemma":0.00024944326,"threshold_uncertainty_score":0.9999986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2444462,0.000051227664,0.75466144,0.00005882178,0.00007515971,0.00012824671,0.0000021142432,0.0005229255,0.00005386747],"genre_scores_gemma":[0.85825795,0.000008775489,0.14158165,0.000046099187,0.00002864778,0.000014505657,2.8124342e-7,0.000021008054,0.000041050127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834555,0.000063837935,0.00034476805,0.00045822238,0.00048610315,0.00030153454],"domain_scores_gemma":[0.9988387,0.00021524711,0.00024205416,0.00031843668,0.00029088132,0.000094672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025380313,0.00023254428,0.00031723478,0.00029461877,0.0006551344,0.000062280415,0.0005095737,0.0000993922,0.0000061236788],"category_scores_gemma":[0.000007059643,0.00020956663,0.00007568312,0.000833389,0.0001498546,0.00060429616,0.0000057683983,0.00041937895,0.0000074186755],"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.00080796226,0.0024702903,0.00083397364,0.0010563651,0.00030611645,0.00033415665,0.014220663,0.53752404,0.094698615,0.0003712852,0.0001584736,0.34721807],"study_design_scores_gemma":[0.00054936233,0.00062865607,0.00030106455,0.000664965,0.00007789046,0.00050172955,0.000117497904,0.3359692,0.6601796,0.00044331857,0.000006430771,0.0005602524],"about_ca_topic_score_codex":0.00014199906,"about_ca_topic_score_gemma":0.00005870837,"teacher_disagreement_score":0.6138118,"about_ca_system_score_codex":0.00006749228,"about_ca_system_score_gemma":0.0002120991,"threshold_uncertainty_score":0.8545879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006192673,0.000020897416,0.9027643,0.00015545299,0.0003545096,0.00006008096,2.555902e-7,0.00066956965,0.095355675],"genre_scores_gemma":[0.5836388,0.0000012162407,0.41520643,0.00022302281,0.000011266003,0.000006032328,2.03496e-7,0.0000033207336,0.0009097235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928343,0.000061724655,0.00011784265,0.00022600821,0.00014289474,0.00016806816],"domain_scores_gemma":[0.99948066,0.00011676271,0.000039797695,0.00023989507,0.00007710841,0.00004577018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028026968,0.000078232944,0.000075618205,0.00007446042,0.00007775605,0.000056129586,0.00036223436,0.000032429485,0.0000659821],"category_scores_gemma":[0.00013147989,0.000071590155,0.00003634467,0.00022866654,0.000029886005,0.0003061859,0.0000967835,0.0001072359,0.00006747733],"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":[3.8348284e-7,0.000016220689,0.0008308785,0.0000011092674,0.000005191544,0.0000032901469,0.00031121835,0.0000017880918,0.0007258751,0.9922208,0.0019878834,0.0038953624],"study_design_scores_gemma":[0.00069184246,0.00035316334,0.0032579976,0.00010062791,0.000008689556,0.0003803224,0.00036655233,0.5100804,0.20006143,0.2412756,0.042271562,0.0011518103],"about_ca_topic_score_codex":0.000019637053,"about_ca_topic_score_gemma":0.0000052930977,"teacher_disagreement_score":0.7509452,"about_ca_system_score_codex":0.0000639926,"about_ca_system_score_gemma":0.000049836894,"threshold_uncertainty_score":0.29193616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005258532,0.000008255295,0.9902196,0.0002688193,0.00168011,0.00076935155,0.000016559574,0.0009481523,0.0008306113],"genre_scores_gemma":[0.95878434,0.0000035382961,0.04013373,0.00050190743,0.000020108017,0.0003369631,0.000006259134,0.000012818477,0.00020034604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843484,0.00014509584,0.000476165,0.00021247666,0.00044768065,0.0002837585],"domain_scores_gemma":[0.998543,0.00025465718,0.00020767814,0.00055009266,0.00028803825,0.00015650668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014411148,0.00019000599,0.00015673527,0.00046939624,0.0002593747,0.0001929568,0.00049938273,0.00013010782,0.000008793303],"category_scores_gemma":[0.00008894126,0.00018484057,0.00012682048,0.0003747359,0.00005350432,0.0027309393,0.000005178488,0.00021744514,0.00012662004],"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.0018383005,0.00090279576,0.00022435526,0.00020043482,0.00017720975,0.0000027511473,0.029649919,0.29855683,0.002999116,0.079044394,0.014359719,0.5720442],"study_design_scores_gemma":[0.002629822,0.0009621736,0.00019104072,0.00012639479,0.0000374405,0.000028091723,0.002614484,0.83183753,0.12409261,0.025762947,0.0110031925,0.0007142472],"about_ca_topic_score_codex":0.000028291013,"about_ca_topic_score_gemma":0.000016156297,"teacher_disagreement_score":0.9535258,"about_ca_system_score_codex":0.0003510374,"about_ca_system_score_gemma":0.000127114,"threshold_uncertainty_score":0.75375795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18080239,0.000017688004,0.80116886,0.00012973204,0.0002508845,0.00016255169,8.5872256e-7,0.0010861664,0.016380861],"genre_scores_gemma":[0.5383533,0.0000018591102,0.4613458,0.00021864535,0.000008701166,0.000004217049,4.489708e-7,0.0000064090714,0.000060611652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984492,0.00012323352,0.00033655833,0.0004623018,0.00028695655,0.0003417229],"domain_scores_gemma":[0.99840814,0.00017709668,0.00017002175,0.00092622585,0.00021230965,0.00010621906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008828425,0.00018459435,0.00029175504,0.00011877353,0.00015510507,0.00007724146,0.0012096418,0.00012182662,0.0000903008],"category_scores_gemma":[0.00019085334,0.00017009335,0.00011405085,0.00041824067,0.0001258899,0.0003632015,0.00044573634,0.00023018713,0.000039578666],"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.00019940855,0.0028422605,0.41270387,0.00071868993,0.00016566725,0.00035265594,0.011261335,0.00033103654,0.051553644,0.4673065,0.00980092,0.042764004],"study_design_scores_gemma":[0.0003746188,0.00034664193,0.016301047,0.000118915865,0.000017231954,0.000024322275,0.00006755325,0.34111553,0.6172401,0.023705782,0.000109585046,0.0005786679],"about_ca_topic_score_codex":0.00075184053,"about_ca_topic_score_gemma":0.00014352477,"teacher_disagreement_score":0.56568646,"about_ca_system_score_codex":0.000046850622,"about_ca_system_score_gemma":0.00010497299,"threshold_uncertainty_score":0.69362056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3512648,0.000522176,0.64295214,0.00057571114,0.0022759761,0.00077989494,0.00010852969,0.00037979288,0.0011409859],"genre_scores_gemma":[0.97289044,0.000108563596,0.023977669,0.00084713975,0.0007955912,0.00004853877,0.00001016426,0.00011263168,0.001209236],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99350005,0.0004728889,0.0021506995,0.0010709016,0.0013480517,0.0014574284],"domain_scores_gemma":[0.9928232,0.0010447201,0.0020852378,0.0011388478,0.0023645503,0.0005434384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026243778,0.00083311985,0.0014150471,0.0008367418,0.0005847445,0.0006284982,0.0023882769,0.00038422793,0.000028878481],"category_scores_gemma":[0.00052894093,0.00080721686,0.00078872225,0.001061537,0.00026167708,0.0018205165,0.00026034124,0.0011331136,0.000050165367],"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.0005851183,0.0038009894,0.011452329,0.00097285584,0.001451239,0.0046265526,0.01849492,0.009609936,0.5764128,0.0059737004,0.31157225,0.055047274],"study_design_scores_gemma":[0.009992373,0.0040196246,0.024232062,0.0032221994,0.00065801974,0.0057525546,0.0002712798,0.08618876,0.713957,0.11484307,0.031570632,0.0052924273],"about_ca_topic_score_codex":0.00006486969,"about_ca_topic_score_gemma":0.0009697825,"teacher_disagreement_score":0.62162566,"about_ca_system_score_codex":0.00066281407,"about_ca_system_score_gemma":0.0007317652,"threshold_uncertainty_score":0.99943787},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017681967,0.000025974387,0.9723201,0.001022848,0.001953103,0.0007368128,4.184201e-7,0.0016273985,0.0046314164],"genre_scores_gemma":[0.46270543,0.0000021140174,0.5350449,0.00041537994,0.00005467988,0.00021818417,0.0000010877538,0.000016949476,0.0015412418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983327,0.000036562335,0.00032991075,0.0005749343,0.00028918832,0.00043671957],"domain_scores_gemma":[0.9981206,0.0007018617,0.00008903547,0.0006817907,0.00025168047,0.00015505539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043529388,0.00019409161,0.00020814809,0.00017466872,0.00017549371,0.00028413278,0.0008200688,0.00016235375,0.00012612386],"category_scores_gemma":[0.0005770156,0.00016760791,0.00012790212,0.00020227174,0.000043896496,0.0008964906,0.00024514247,0.00020821887,0.00037246002],"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.000021912889,0.000104580366,0.0005686012,0.0000113905135,0.000015059158,0.0000017906294,0.0005788884,0.00010993468,0.0017854454,0.0063053686,0.11533694,0.8751601],"study_design_scores_gemma":[0.00031342916,0.00031922336,0.002021856,0.000040902105,0.000007748485,0.000040024108,0.00011484367,0.94617563,0.011968749,0.036545362,0.002119327,0.00033291426],"about_ca_topic_score_codex":0.00035269363,"about_ca_topic_score_gemma":0.00019567455,"teacher_disagreement_score":0.94606566,"about_ca_system_score_codex":0.00012637567,"about_ca_system_score_gemma":0.00007383017,"threshold_uncertainty_score":0.68348527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15708879,0.00038417114,0.81986594,0.020073479,0.0004515593,0.00052040466,0.0000058140795,0.0010123835,0.0005974773],"genre_scores_gemma":[0.58580726,0.00003567968,0.41362274,0.0004302443,0.000018372517,0.00006541564,0.0000044696917,0.000011598604,0.0000042527536],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866503,0.00016890922,0.00040584308,0.0003050109,0.0002094875,0.00024570548],"domain_scores_gemma":[0.9961009,0.00015284914,0.00036058412,0.0030514658,0.0002714916,0.00006273466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318635,0.00017422324,0.00022254532,0.00023243125,0.00026778408,0.00008264431,0.0031991645,0.00007967734,0.0000018019291],"category_scores_gemma":[0.00009380833,0.00018356513,0.00010469243,0.00064080296,0.00059769454,0.00049022195,0.00046403552,0.00030937244,0.0000086506625],"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.00001495824,0.00046938853,0.0020259407,0.00008577254,0.00012475347,0.0000084385865,0.0033942729,0.00017462562,0.83093816,0.13152117,0.0015121014,0.029730437],"study_design_scores_gemma":[0.0013099634,0.00025788235,0.0020856068,0.00046870112,0.00006673548,0.0002623136,0.0002200055,0.012625519,0.95795554,0.022441547,0.0013968204,0.0009093805],"about_ca_topic_score_codex":0.00017938613,"about_ca_topic_score_gemma":0.00003283288,"teacher_disagreement_score":0.42871845,"about_ca_system_score_codex":0.00014571889,"about_ca_system_score_gemma":0.00010397607,"threshold_uncertainty_score":0.7485569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058520595,0.00013715537,0.99094045,0.0023532396,0.000046563706,0.00023826551,0.000014920975,0.00033715207,0.00008022114],"genre_scores_gemma":[0.61666816,0.00011661867,0.38305694,0.000072960494,0.0000016305422,0.000051105886,0.00000194181,0.0000069500225,0.000023684897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881834,0.00019040277,0.00031927106,0.0002759822,0.00023787639,0.00015813265],"domain_scores_gemma":[0.9968283,0.00048488344,0.00014161614,0.0022799238,0.00019071737,0.00007455812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034502888,0.00014327161,0.0002480489,0.00051267724,0.00039348172,0.000052507025,0.0012944846,0.00007671348,0.0000066646394],"category_scores_gemma":[0.000014111057,0.00015263622,0.00012756046,0.0015121793,0.00024031731,0.00031588355,0.00002371923,0.00027781446,0.0000058037363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008214979,0.003810234,0.00017321641,0.00005314358,0.0024845272,0.000006668573,0.009080789,0.8250483,0.074794896,0.033279203,0.0001042844,0.051082555],"study_design_scores_gemma":[0.0011262508,0.0005118674,0.00326579,0.0002575704,0.0011508801,0.0000519063,0.00019660106,0.6472129,0.32119825,0.02407008,0.000116918374,0.0008409943],"about_ca_topic_score_codex":0.00031817897,"about_ca_topic_score_gemma":0.00028699334,"teacher_disagreement_score":0.6108161,"about_ca_system_score_codex":0.00006992793,"about_ca_system_score_gemma":0.000110314555,"threshold_uncertainty_score":0.6224324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023201423,0.0000023267094,0.969881,0.00026652895,0.00044055533,0.0004778746,9.3794074e-7,0.0017306944,0.003998665],"genre_scores_gemma":[0.61078876,1.8522586e-7,0.3886359,0.00038324343,0.000053744345,0.000018894581,0.0000029886764,0.000009722822,0.00010656123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.000113156384,0.00029121013,0.00051822845,0.00039174035,0.0003077488],"domain_scores_gemma":[0.9987847,0.00018710979,0.00013594022,0.00056367845,0.0002350307,0.0000935183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093127484,0.00019126122,0.00014317293,0.00028159053,0.00022804322,0.00012402411,0.00042409185,0.00009606693,0.000014377562],"category_scores_gemma":[0.000116520874,0.00017183577,0.00006564969,0.0006066201,0.000052277956,0.00047884998,0.00008863653,0.00025137796,0.0000409379],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005279564,0.00039726438,0.00016908985,0.000012732218,0.000009424224,0.000023290226,0.0012675349,0.000117932694,0.06561628,0.004990786,0.00024965234,0.9270932],"study_design_scores_gemma":[0.0002084904,0.00029817323,0.004493602,0.000021811415,0.0000019427027,0.0000059890317,0.000015961397,0.567751,0.42591625,0.0010133977,0.00010297948,0.00017043325],"about_ca_topic_score_codex":0.0001676998,"about_ca_topic_score_gemma":0.00023139073,"teacher_disagreement_score":0.9269228,"about_ca_system_score_codex":0.00022043855,"about_ca_system_score_gemma":0.000034516557,"threshold_uncertainty_score":0.7007259},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15957865,0.000027555201,0.8343097,0.00012734365,0.00022215163,0.00023528218,7.057769e-7,0.0007582159,0.0047403895],"genre_scores_gemma":[0.8942045,0.0000084504445,0.105334125,0.00015228061,0.000043722277,0.000011362642,0.0000014249399,0.000015450174,0.00022866098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986224,0.000033185854,0.0002770292,0.00036523666,0.00036027038,0.00034183328],"domain_scores_gemma":[0.99882126,0.00021180081,0.00017587349,0.00056210905,0.00014591146,0.00008304494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088663877,0.00017845855,0.00021929338,0.00043613077,0.0000747726,0.000060137056,0.0005417213,0.00007824939,0.000020975565],"category_scores_gemma":[0.00007753533,0.00014144884,0.000052089887,0.0008561787,0.00005758756,0.00054424774,0.00015511365,0.00011546808,0.0000140036955],"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.0006810567,0.0023738393,0.023318617,0.0012150807,0.00049866695,0.00041379474,0.038612936,0.01044923,0.20052072,0.31197837,0.036399998,0.3735377],"study_design_scores_gemma":[0.00039610665,0.00079422427,0.0046492824,0.00022161443,0.000011859383,0.00008335974,0.00006875528,0.2434012,0.7454154,0.004400198,0.00010765533,0.00045035084],"about_ca_topic_score_codex":0.0002371559,"about_ca_topic_score_gemma":0.0001121355,"teacher_disagreement_score":0.7346259,"about_ca_system_score_codex":0.000036383488,"about_ca_system_score_gemma":0.000041540035,"threshold_uncertainty_score":0.5768116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034250005,0.000019230716,0.9815837,0.0014969715,0.00010341472,0.0002771058,8.410882e-7,0.0015382707,0.011555456],"genre_scores_gemma":[0.37963602,7.759896e-7,0.6197095,0.00039335483,0.00007047238,0.000025891542,7.225226e-7,0.000009458562,0.0001538119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989041,0.00002242934,0.00016995489,0.000383021,0.00018654006,0.00033393814],"domain_scores_gemma":[0.9991505,0.00017089953,0.00006997784,0.00045672673,0.00007615539,0.00007573052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035667556,0.00013698955,0.00015320735,0.00008301367,0.00020472961,0.00015426919,0.000723133,0.00004193562,0.000017357914],"category_scores_gemma":[0.000031884374,0.0001124997,0.00005017978,0.0002262654,0.000038595004,0.0005617903,0.0001801651,0.00011413076,0.000019681916],"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.000027354947,0.00016385061,0.0020062502,0.00004094526,0.00004170177,0.0000099747895,0.0022982517,0.00034548438,0.0012843353,0.28426206,0.0041338094,0.705386],"study_design_scores_gemma":[0.00047069797,0.00023423975,0.00052291394,0.00004454194,0.0000075441853,0.00004940788,0.00001745165,0.9342432,0.044150952,0.0136943925,0.006142169,0.00042250962],"about_ca_topic_score_codex":0.00008385007,"about_ca_topic_score_gemma":0.00013628478,"teacher_disagreement_score":0.9338977,"about_ca_system_score_codex":0.00006861663,"about_ca_system_score_gemma":0.000042238946,"threshold_uncertainty_score":0.45876047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052382737,0.000008895658,0.9447109,0.0009168138,0.00017260075,0.0004177035,9.78373e-7,0.0009886337,0.0004007346],"genre_scores_gemma":[0.62928134,3.0722416e-7,0.37025312,0.0003714353,0.000025807289,0.000017555854,0.000007580001,0.0000042400884,0.00003859079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915856,0.00004293608,0.00017803036,0.0002884863,0.00015864799,0.00017331439],"domain_scores_gemma":[0.9994069,0.000087816705,0.00010575149,0.0001871136,0.00017516006,0.000037309972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002342732,0.0001022394,0.000099051766,0.000097420845,0.00014652166,0.000106628286,0.0002928073,0.00005029379,3.912184e-7],"category_scores_gemma":[0.000077389814,0.000103653656,0.00003986628,0.00030957072,0.000008013216,0.0006321223,0.00004208508,0.00009464673,0.0000031817974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040606876,0.00016679891,0.000055941666,0.000030907995,0.000004096897,0.0000025952609,0.0009329016,0.7337976,0.02544281,0.055448905,0.0028300253,0.18124683],"study_design_scores_gemma":[0.0001459072,0.00027847936,0.00055307586,0.00001006554,0.0000030159727,0.000006221815,0.000001932243,0.9193223,0.0019490658,0.07760718,0.000014615591,0.00010814299],"about_ca_topic_score_codex":0.0000046793302,"about_ca_topic_score_gemma":0.0000012214251,"teacher_disagreement_score":0.57689863,"about_ca_system_score_codex":0.000051776125,"about_ca_system_score_gemma":0.000051480452,"threshold_uncertainty_score":0.42268735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02846062,0.00003731092,0.864549,0.0003078403,0.00029658756,0.000068383146,4.844331e-7,0.0016959034,0.10458391],"genre_scores_gemma":[0.6530613,0.0000012378006,0.3458853,0.0003781211,0.00002511367,0.0000014762505,6.07297e-7,0.000005918527,0.0006409282],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989811,0.00002242746,0.00020140558,0.0002856929,0.0001968329,0.00031251292],"domain_scores_gemma":[0.99914896,0.00024132968,0.00007109193,0.00039285398,0.00006616528,0.00007962257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074008334,0.00010289721,0.000108270644,0.000081236154,0.00008951698,0.000094254276,0.0006613937,0.000057164976,0.000021891174],"category_scores_gemma":[0.00010680766,0.000095932184,0.000034807472,0.00030521298,0.000047929476,0.00028359168,0.00021338824,0.00013851681,0.000038971088],"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.0000041142566,0.000054983342,0.030926298,0.000011140536,0.00001501877,0.0000368073,0.0006414465,7.370432e-7,0.02255715,0.33969143,0.050086744,0.5559741],"study_design_scores_gemma":[0.0002523125,0.00011837326,0.0007200204,0.00004427811,0.0000044521375,0.00023357825,0.00056625635,0.008357099,0.9622051,0.0108792065,0.01601598,0.0006033063],"about_ca_topic_score_codex":0.000117596006,"about_ca_topic_score_gemma":0.00012106501,"teacher_disagreement_score":0.939648,"about_ca_system_score_codex":0.00005746008,"about_ca_system_score_gemma":0.000022765556,"threshold_uncertainty_score":0.3912001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21176428,0.000009686542,0.771641,0.00009402775,0.00044440333,0.00009810579,1.4444625e-7,0.000550473,0.015397896],"genre_scores_gemma":[0.91870975,0.0000020614552,0.08074627,0.00016055114,0.000011221098,0.0000056165813,2.2061012e-7,0.000010402958,0.00035388675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989817,0.00007083505,0.00021523758,0.00029404226,0.00019077095,0.000247391],"domain_scores_gemma":[0.9992264,0.00012897943,0.000076359385,0.0004504257,0.00006572252,0.00005210742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035178877,0.00011860547,0.00014470636,0.00012729484,0.00006227608,0.000044202716,0.00038982785,0.000059249563,0.00005507777],"category_scores_gemma":[0.00014279579,0.000110177476,0.000044013566,0.00042692883,0.000018108247,0.00018348098,0.00009965985,0.000107525295,0.000012911098],"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.000030207264,0.0003389271,0.0013663307,0.000060263166,0.000082623694,0.000032082087,0.0015569631,0.023014804,0.070546545,0.85645956,0.0037994976,0.04271221],"study_design_scores_gemma":[0.0002709042,0.000201017,0.00019618988,0.00008097534,0.0000045069514,0.000019832944,0.00003243401,0.31566933,0.65245974,0.030356193,0.000378954,0.0003299522],"about_ca_topic_score_codex":0.00003294686,"about_ca_topic_score_gemma":0.000010192949,"teacher_disagreement_score":0.8261033,"about_ca_system_score_codex":0.00003632361,"about_ca_system_score_gemma":0.00003651646,"threshold_uncertainty_score":0.4492907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05980503,0.00001753741,0.93557626,0.0007254155,0.00012704686,0.0004371312,0.0000014452995,0.00015298212,0.0031571565],"genre_scores_gemma":[0.98389477,0.0000026511977,0.015892128,0.00016101796,0.00000943876,0.000009390678,4.867505e-7,0.0000033438675,0.000026769027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991337,0.0000418398,0.00022843119,0.0002517445,0.00020877247,0.00013550946],"domain_scores_gemma":[0.99881506,0.00011954552,0.00016972587,0.00066077214,0.00019452629,0.00004039575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030106193,0.000087090615,0.00013456249,0.00009883728,0.000029833918,0.000011596269,0.0008451727,0.000030880718,0.0000025018373],"category_scores_gemma":[0.00009648504,0.00006192502,0.00005580462,0.00051849795,0.000023077742,0.00013078119,0.00010313367,0.00009197532,0.0000064163646],"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.000002629808,0.00007764186,0.00036658856,0.0000052151704,0.000004575683,9.290446e-8,0.00091405533,0.000013413059,0.08103388,0.017085364,0.00019517222,0.9003014],"study_design_scores_gemma":[0.0001283694,0.00032444156,0.044919502,0.000027242631,0.000010286323,0.0000023819227,0.00006321426,0.030156769,0.9043943,0.01927301,0.0005176734,0.00018279966],"about_ca_topic_score_codex":0.00010673054,"about_ca_topic_score_gemma":0.00002880041,"teacher_disagreement_score":0.9240897,"about_ca_system_score_codex":0.000036560345,"about_ca_system_score_gemma":0.00003745128,"threshold_uncertainty_score":0.25252292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010874565,0.000006938168,0.9850923,0.00035480593,0.0016947818,0.0005117401,0.000044292272,0.0003499415,0.0010706275],"genre_scores_gemma":[0.9745457,0.000010236936,0.024789596,0.00039220904,0.000018358103,0.00013470929,0.000004232092,0.000006653755,0.00009830023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990235,0.000056290675,0.0003717709,0.00012308247,0.00026018292,0.00016519913],"domain_scores_gemma":[0.997515,0.0010073103,0.00022280682,0.00086567877,0.00034145912,0.00004769262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010179653,0.00012249843,0.00011680429,0.00020829316,0.0003168291,0.00008158264,0.0009599032,0.00008916791,0.000046418525],"category_scores_gemma":[0.00014104634,0.0000950136,0.00010551247,0.00036669424,0.00015414268,0.0011316716,0.0000066956677,0.000293392,0.000027305721],"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.00034861383,0.00037020416,0.000008714789,0.00019576965,0.00010259726,5.941391e-7,0.01637016,0.015656807,0.013225853,0.754779,0.0034994292,0.19544226],"study_design_scores_gemma":[0.001180016,0.0009826492,0.00027511196,0.00012677458,0.000079281155,0.00007009819,0.0014513988,0.271079,0.6496122,0.06623662,0.008338404,0.0005684609],"about_ca_topic_score_codex":0.000015830678,"about_ca_topic_score_gemma":0.00002314243,"teacher_disagreement_score":0.96367115,"about_ca_system_score_codex":0.000029893521,"about_ca_system_score_gemma":0.0001020932,"threshold_uncertainty_score":0.3874542},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007731755,0.000039147497,0.9763808,0.0027918739,0.0012209832,0.0005804613,0.00006409749,0.0013799006,0.009810944],"genre_scores_gemma":[0.33794373,0.0000035184205,0.6568997,0.00081455614,0.00028859486,0.00016006526,0.000043453976,0.00002243102,0.0038239649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806774,0.000069382324,0.00035053742,0.00063227717,0.00039726475,0.00048281418],"domain_scores_gemma":[0.9974826,0.00094710686,0.00016645448,0.0006286463,0.000614644,0.00016056364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008649815,0.00024024052,0.00026995904,0.00015866231,0.00034001918,0.00014990581,0.0011623444,0.00019499415,0.00025555748],"category_scores_gemma":[0.0005863207,0.00022627019,0.00015260786,0.00026324176,0.00022898088,0.0004921999,0.0002855812,0.00035085026,0.00022079246],"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.000020456418,0.00009725072,0.0004961396,0.000009963899,0.00003177169,0.0000037035463,0.0001414122,0.000011056141,0.03362321,0.90913063,0.055317346,0.0011170345],"study_design_scores_gemma":[0.0016108318,0.0006692941,0.005496187,0.000090983136,0.00004934576,0.00043409536,0.000070436,0.4241849,0.109728776,0.38968268,0.06645916,0.001523324],"about_ca_topic_score_codex":0.00009473134,"about_ca_topic_score_gemma":0.0001584147,"teacher_disagreement_score":0.519448,"about_ca_system_score_codex":0.00008588966,"about_ca_system_score_gemma":0.00038356875,"threshold_uncertainty_score":0.9227031},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31030786,0.000009963679,0.6866237,0.00022412217,0.000019554987,0.00006905575,3.7389347e-7,0.0003626022,0.002382752],"genre_scores_gemma":[0.70954484,0.0000024813003,0.29017556,0.000071909126,0.0000069520047,0.000007779845,0.0000016045516,0.000004124222,0.00018474086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991121,0.000023397108,0.00020543595,0.00024139685,0.00025473203,0.00016290156],"domain_scores_gemma":[0.9991577,0.000059737504,0.00013432378,0.0004852313,0.00012454849,0.000038449984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002615938,0.0001055126,0.00020858555,0.00040065582,0.000055688884,0.00003443127,0.00048173222,0.000034691508,0.000017139397],"category_scores_gemma":[0.000022314372,0.0000817331,0.000053933345,0.0014485323,0.00003508593,0.0005616273,0.00008101325,0.00006778098,0.000011622715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003884003,0.00038990437,0.044676594,0.00009782105,0.00082083273,0.0000037933462,0.0054795784,0.719817,0.0015484674,0.015590741,0.00063264923,0.21090378],"study_design_scores_gemma":[0.00006361111,0.000122844,0.018075094,0.00002140381,0.00008526323,0.000004200393,0.000015299436,0.9614499,0.019980269,0.000053530493,0.000017009368,0.00011153158],"about_ca_topic_score_codex":0.000052104715,"about_ca_topic_score_gemma":0.00019798639,"teacher_disagreement_score":0.39923698,"about_ca_system_score_codex":0.000042381995,"about_ca_system_score_gemma":0.00003196072,"threshold_uncertainty_score":0.3332979},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11299732,0.0000050620074,0.8555231,0.001994252,0.00007997398,0.00012498157,8.700285e-7,0.00032583837,0.028948601],"genre_scores_gemma":[0.9292337,8.978003e-7,0.06985783,0.00044120985,0.0000070973,0.0000049492783,5.111432e-7,0.000004793396,0.00044905348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993473,0.000042606487,0.00014991408,0.00017896916,0.00014818097,0.00013299155],"domain_scores_gemma":[0.9990863,0.00031147702,0.00008610271,0.00041375472,0.000080581645,0.00002176577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028788936,0.00008457164,0.00011642629,0.00006873907,0.00007008957,0.000054331555,0.00066056516,0.000031793825,0.000018607305],"category_scores_gemma":[0.00014317624,0.000054374905,0.000048601232,0.00024737167,0.000040268667,0.00013178313,0.00013671844,0.000111093366,0.000028927625],"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.0000019451018,0.000030943378,0.00013308204,0.0000013913788,0.000007254287,0.0000041942917,0.00066563627,0.00014249851,0.0011731585,0.9928393,0.0002703073,0.004730312],"study_design_scores_gemma":[0.000374024,0.0007926335,0.00060734747,0.00019640135,0.000008666363,0.00003930789,0.00018438141,0.45154196,0.18352862,0.36227334,0.00004982778,0.00040350817],"about_ca_topic_score_codex":0.00006977308,"about_ca_topic_score_gemma":0.00007237251,"teacher_disagreement_score":0.8162363,"about_ca_system_score_codex":0.00008116597,"about_ca_system_score_gemma":0.000031912143,"threshold_uncertainty_score":0.22173442},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5683506,0.000021680578,0.4209811,0.008937588,0.00027355,0.00018065887,0.000002623963,0.0004627035,0.0007894853],"genre_scores_gemma":[0.77583396,0.000028261968,0.2228776,0.0012131535,0.000010516064,0.000019047295,0.000004410802,0.000008626393,0.0000044317762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879843,0.00024250979,0.00032879226,0.0002551288,0.00018948705,0.00018566851],"domain_scores_gemma":[0.99618524,0.0003777365,0.0002404628,0.003006325,0.00014027824,0.000049924616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044088942,0.00014217972,0.00020779425,0.0001987681,0.00026644193,0.000062060884,0.002173986,0.00006241162,0.0000021281746],"category_scores_gemma":[0.00010477413,0.00015509881,0.00008065102,0.0005067338,0.00033526646,0.000300455,0.0002913405,0.00035140768,0.00003511686],"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.000034527122,0.00092551636,0.0053524147,0.00008036241,0.00010095904,0.000008953057,0.0037353677,0.00534877,0.46221817,0.5069918,0.0060004448,0.009202725],"study_design_scores_gemma":[0.0010019315,0.00021710906,0.00917176,0.0004919808,0.00003198911,0.000062249834,0.00012342872,0.008992659,0.9170201,0.061647575,0.00053835387,0.0007008643],"about_ca_topic_score_codex":0.00041566778,"about_ca_topic_score_gemma":0.00014316311,"teacher_disagreement_score":0.45480192,"about_ca_system_score_codex":0.00014510081,"about_ca_system_score_gemma":0.00006843944,"threshold_uncertainty_score":0.6324746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112301536,0.000030005376,0.8648779,0.00012706328,0.00015355316,0.0001797559,1.6540268e-7,0.0016605671,0.020669501],"genre_scores_gemma":[0.82865435,0.000009459058,0.17039655,0.00017058525,0.000051941144,0.000013196375,3.699492e-7,0.00001322056,0.00069033273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985396,0.000053961227,0.00017517492,0.00048073323,0.0003150033,0.00043551985],"domain_scores_gemma":[0.99899775,0.0001003169,0.0000821389,0.00060979696,0.000107472006,0.000102555015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017084143,0.00018903865,0.00019207322,0.00009212247,0.00022241313,0.000050102506,0.0009425737,0.00006735219,0.000014428854],"category_scores_gemma":[0.000009923915,0.0001447356,0.000050833438,0.00068792637,0.00012778096,0.00032386393,0.0001788527,0.00025963128,0.00002448099],"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.00049630605,0.002215176,0.04023776,0.000038242535,0.000251871,0.0034205746,0.01906816,0.059501756,0.004652093,0.7544071,0.04551459,0.07019634],"study_design_scores_gemma":[0.00033043724,0.00076626986,0.0032399583,0.000036075122,0.0000049419477,0.00051368435,0.000051809093,0.9784527,0.015612844,0.00043929482,0.000087478234,0.00046452956],"about_ca_topic_score_codex":0.00014454857,"about_ca_topic_score_gemma":0.0000928697,"teacher_disagreement_score":0.9189509,"about_ca_system_score_codex":0.00006483701,"about_ca_system_score_gemma":0.000096766205,"threshold_uncertainty_score":0.5902146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40297386,0.000010660202,0.58692324,0.00023585875,0.00018616048,0.00020101879,0.000001026595,0.0007180283,0.0087501565],"genre_scores_gemma":[0.9124947,0.0000012990471,0.08693401,0.0001392053,0.000033400323,0.000015741629,0.0000016987384,0.000007720764,0.00037223616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897057,0.00005792937,0.00025741977,0.00024247583,0.0003106492,0.00016092809],"domain_scores_gemma":[0.99903935,0.00010774159,0.00013248989,0.0005728559,0.00010982153,0.000037733098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040668045,0.00010946149,0.00015220794,0.0001496184,0.000056383706,0.000039373517,0.0004928142,0.00006181124,0.000009540708],"category_scores_gemma":[0.00003231863,0.000095138086,0.000034462668,0.00025394536,0.00002184534,0.00032981427,0.00005155232,0.00009520051,0.000028314698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120717574,0.0007008609,0.039601207,0.0003519064,0.00003016906,0.0000039667098,0.0012872491,0.72592646,0.035577454,0.06967064,0.0066090743,0.120120294],"study_design_scores_gemma":[0.000121982775,0.00017373031,0.0033908735,0.00006445329,0.000001620213,0.0000022173974,0.0000066149105,0.9541169,0.041653413,0.000019421657,0.00034068103,0.00010809007],"about_ca_topic_score_codex":0.00006422154,"about_ca_topic_score_gemma":0.000017638495,"teacher_disagreement_score":0.5095208,"about_ca_system_score_codex":0.000066512825,"about_ca_system_score_gemma":0.000037905644,"threshold_uncertainty_score":0.38796186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40105665,0.00054675544,0.5527523,0.041363087,0.0005023573,0.000508108,0.000019412164,0.0016402547,0.0016110335],"genre_scores_gemma":[0.7211241,0.000035043115,0.2767624,0.001993081,0.000024052537,0.000024868794,0.000010310343,0.000007092162,0.000019020916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985052,0.00019193297,0.0004428489,0.00028292564,0.00030881504,0.0002683031],"domain_scores_gemma":[0.99680734,0.0002491817,0.00028524327,0.0024597284,0.00013224619,0.00006625027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004853419,0.00018013039,0.0002211973,0.00021641147,0.00030797417,0.00006805066,0.0034847788,0.000072824914,0.0000053133094],"category_scores_gemma":[0.00003115999,0.00018364283,0.00011080375,0.00041178972,0.00025463008,0.0006192715,0.00028330414,0.00036331243,0.000026008684],"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.00015790484,0.007336651,0.11352583,0.00030228324,0.00075280067,0.000037681628,0.045243982,0.004999702,0.27555192,0.3847228,0.093777224,0.07359123],"study_design_scores_gemma":[0.002559063,0.0006413463,0.28447482,0.0005016515,0.00012487816,0.00019566716,0.00016239785,0.6321929,0.030305952,0.0048365323,0.041765314,0.0022394797],"about_ca_topic_score_codex":0.000049084836,"about_ca_topic_score_gemma":0.000063764535,"teacher_disagreement_score":0.6271932,"about_ca_system_score_codex":0.000086578795,"about_ca_system_score_gemma":0.00008563466,"threshold_uncertainty_score":0.7488737},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017777299,0.00008928379,0.9942111,0.0019872172,0.00009279464,0.00054128794,0.0000045449824,0.0011227537,0.001773285],"genre_scores_gemma":[0.06387091,0.000022727385,0.9330341,0.00044480394,0.00013068617,0.0006543699,0.0000013652706,0.000010337856,0.0018306649],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923974,0.00001825078,0.00015011319,0.0002427293,0.00013110782,0.00021803072],"domain_scores_gemma":[0.99882996,0.0003543703,0.00005504703,0.00060494913,0.00010929071,0.000046391764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020835802,0.0000900365,0.00007340058,0.000046072204,0.00036595753,0.00019175124,0.0010565564,0.000037498387,0.000004486553],"category_scores_gemma":[0.00002602342,0.000060595146,0.0000710158,0.00023739734,0.000030325602,0.00020536447,0.00012285322,0.000075997516,0.000030193347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6392498e-7,0.000020778718,0.000031947184,0.0000015650978,0.000005722365,5.1736635e-8,0.00020151933,0.0000033301512,0.00020125882,0.06632556,0.0063950676,0.9268127],"study_design_scores_gemma":[0.00021073615,0.00011343682,0.0005355521,0.00000793212,0.000007648849,0.000013573965,0.00016253367,0.16638711,0.048693534,0.06554731,0.71791065,0.00040997716],"about_ca_topic_score_codex":0.0000119145,"about_ca_topic_score_gemma":0.0001623268,"teacher_disagreement_score":0.92640275,"about_ca_system_score_codex":0.000029700375,"about_ca_system_score_gemma":0.00002770026,"threshold_uncertainty_score":0.28146866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026985254,0.000024637462,0.96808285,0.000041513314,0.0000705766,0.0010269142,3.0462186e-7,0.001075793,0.0026921455],"genre_scores_gemma":[0.51903486,0.0000020769394,0.48067743,0.00004424338,0.0000049671853,0.00011815222,1.7845039e-7,0.000012319055,0.000105787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985369,0.00013649683,0.00027418052,0.00042697586,0.0003169193,0.00030855372],"domain_scores_gemma":[0.998576,0.000072587485,0.00017058637,0.00093783584,0.00015841724,0.00008459875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051139336,0.00019818782,0.0002522153,0.00024192558,0.000065356224,0.000031982985,0.00118129,0.000075805336,0.000033335888],"category_scores_gemma":[0.00003011128,0.00014693169,0.00006305732,0.0007074465,0.00014229781,0.00037660496,0.00015893842,0.00012846016,0.000013319178],"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.0014111835,0.010157994,0.16868024,0.0011941437,0.0010385826,0.0005222134,0.078456745,0.00076663477,0.19265687,0.26982048,0.009327701,0.26596722],"study_design_scores_gemma":[0.0005339981,0.0028456391,0.0049207984,0.00028267785,0.000027633721,0.000087237226,0.00025573102,0.04545354,0.9336872,0.011076369,0.000096089316,0.0007330809],"about_ca_topic_score_codex":0.0003229834,"about_ca_topic_score_gemma":0.000057357178,"teacher_disagreement_score":0.74103034,"about_ca_system_score_codex":0.000016313114,"about_ca_system_score_gemma":0.00007971862,"threshold_uncertainty_score":0.59917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001972184,0.000031177857,0.98991466,0.004892463,0.00019225256,0.0004494561,0.000021569102,0.0003951817,0.0021310644],"genre_scores_gemma":[0.8328992,0.00008593496,0.16639349,0.00040462991,0.0000061814453,0.00011108734,0.000005487536,0.0000089320265,0.000085044725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989532,0.00013468013,0.00034385922,0.00022449713,0.00017780464,0.00016593096],"domain_scores_gemma":[0.99632794,0.0012021685,0.0002402222,0.0019686657,0.00021208575,0.000048931943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068857,0.0001328234,0.0001708784,0.00027110387,0.0005272536,0.0000513356,0.0016879111,0.00007725822,0.0000035692483],"category_scores_gemma":[0.000048020327,0.00014196045,0.00011957229,0.0004411424,0.00006086197,0.00032800436,0.0000069273974,0.00026435245,0.000008130928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444878,0.0038463064,0.000080168,0.000045265988,0.00014125659,8.9750256e-7,0.005268328,0.00841552,0.022236396,0.22852644,0.0026761154,0.7286289],"study_design_scores_gemma":[0.001599663,0.0025165167,0.0010030757,0.0006794806,0.000108007895,0.000011478878,0.0002346501,0.43766904,0.5052355,0.046889074,0.0032350766,0.00081846386],"about_ca_topic_score_codex":0.00003593997,"about_ca_topic_score_gemma":0.00008690875,"teacher_disagreement_score":0.830927,"about_ca_system_score_codex":0.00011159062,"about_ca_system_score_gemma":0.000046512694,"threshold_uncertainty_score":0.5788979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20157336,0.000022456838,0.7884548,0.00006323361,0.0002569254,0.00008838631,1.2076566e-7,0.0016390239,0.007901709],"genre_scores_gemma":[0.6865858,0.0000017799215,0.3126165,0.00023842527,0.000050441693,8.00613e-7,2.2329442e-7,0.000012764016,0.0004932546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985368,0.000040698706,0.00029520362,0.000421209,0.00026748978,0.00043859228],"domain_scores_gemma":[0.9987965,0.00020445268,0.00011710538,0.0006825512,0.00010024972,0.00009912657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284019,0.00015504909,0.00016731648,0.00017835935,0.00020087618,0.0001783632,0.00081990607,0.00008002645,0.000012492785],"category_scores_gemma":[0.00009201314,0.00014873952,0.00006603677,0.00047858973,0.000041869353,0.00043054062,0.00041803336,0.00017443467,0.000020475885],"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.000057064182,0.00032818157,0.05571099,0.00011615513,0.000103721,0.0005275926,0.008301352,0.003429815,0.3463114,0.1658855,0.002435507,0.41679275],"study_design_scores_gemma":[0.0002503383,0.00008770374,0.0019534633,0.0001319211,0.0000115065595,0.00028459055,0.00020352728,0.5797339,0.41021836,0.0031213583,0.0032812727,0.0007220293],"about_ca_topic_score_codex":0.0002892119,"about_ca_topic_score_gemma":0.00006527906,"teacher_disagreement_score":0.5763041,"about_ca_system_score_codex":0.00010451321,"about_ca_system_score_gemma":0.000032413453,"threshold_uncertainty_score":0.60654217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50322413,0.000001578308,0.4917806,0.00010468892,0.0011149149,0.00011422643,1.12965914e-7,0.0007947607,0.0028649506],"genre_scores_gemma":[0.71319294,1.1358212e-7,0.28638676,0.000066268294,0.00004786999,0.000004030066,1.1803412e-7,0.000009637986,0.00029226326],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991286,0.000017388831,0.00015272149,0.00029871485,0.00020241237,0.00020018104],"domain_scores_gemma":[0.99917513,0.000015647762,0.000077526485,0.0006042229,0.00007347111,0.00005399993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019782438,0.00010529313,0.00008667646,0.00008358519,0.00011684356,0.000092470844,0.0006811743,0.00007660339,0.000027270444],"category_scores_gemma":[0.00009473726,0.00009568118,0.00004847265,0.00032778824,0.000023405855,0.0004860932,0.00032211372,0.00022873656,0.000019050094],"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.0000014440616,0.000055683737,0.006186581,0.00001123477,0.000004368043,0.0000044201524,0.00039744712,0.00007547552,0.95618063,0.0059248595,0.00016339029,0.03099448],"study_design_scores_gemma":[0.00010251506,0.000028848406,0.0042285747,0.00003885265,0.000002959636,0.00004190841,0.000008524899,0.24952744,0.7433979,0.0019190374,0.00044664627,0.00025679998],"about_ca_topic_score_codex":0.00012203138,"about_ca_topic_score_gemma":0.00019655032,"teacher_disagreement_score":0.24945197,"about_ca_system_score_codex":0.000038781232,"about_ca_system_score_gemma":0.0000615455,"threshold_uncertainty_score":0.39017653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002939391,0.00010149871,0.98845655,0.0021436003,0.00002832104,0.0002771868,5.7369164e-7,0.0011261071,0.00492677],"genre_scores_gemma":[0.41668046,0.0000073168712,0.58287704,0.00020270185,0.00001661683,0.00003326882,0.0000020771079,0.000006056802,0.00017447304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992473,0.000062936415,0.00015379502,0.0002492917,0.00012455265,0.00016208776],"domain_scores_gemma":[0.99883085,0.000118277785,0.000054491244,0.00081358384,0.000113008726,0.00006980231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040978653,0.00009367702,0.00009467509,0.0000711878,0.00015212783,0.00006830312,0.001100205,0.000058744095,0.000012891171],"category_scores_gemma":[0.000016934302,0.00008385532,0.000050722872,0.00016337654,0.000021730984,0.0008279693,0.000064956774,0.000097560165,0.00001066729],"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.000029628238,0.00017977573,0.000040894345,0.0000063150883,0.000009622024,2.4049453e-7,0.0014673918,0.00006493207,0.030636959,0.18270068,0.0033543175,0.7815093],"study_design_scores_gemma":[0.00023285739,0.00036330943,0.00009475791,0.000025842273,0.000004283093,0.0000043885093,0.000066980785,0.8188208,0.1447526,0.0076228334,0.02780647,0.0002048827],"about_ca_topic_score_codex":0.000035988563,"about_ca_topic_score_gemma":0.00004260189,"teacher_disagreement_score":0.81875587,"about_ca_system_score_codex":0.000051015704,"about_ca_system_score_gemma":0.000029995386,"threshold_uncertainty_score":0.3419521},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006589045,0.000065437416,0.9890699,0.0010209305,0.00021424108,0.00032036385,0.0000072790904,0.00056407746,0.0021487398],"genre_scores_gemma":[0.85935444,0.000053164502,0.14010677,0.000107120904,0.000005267148,0.00018307375,9.951578e-7,0.000013836629,0.00017534517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.00013660992,0.0003395954,0.00022021325,0.00020043297,0.00019662721],"domain_scores_gemma":[0.99605465,0.0007626451,0.00013760648,0.00277694,0.00019463767,0.000073524076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020053015,0.00013919976,0.00017665455,0.0002650963,0.0003551426,0.00007726688,0.0022267236,0.00007187964,0.00007533717],"category_scores_gemma":[0.000022067541,0.00014607643,0.0001109617,0.00056601915,0.00014344849,0.00051628274,0.000023858345,0.00035395878,0.00009732978],"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.000029232642,0.004633321,0.00027683767,0.00012974728,0.0004906065,0.0000022896274,0.013088788,0.03976977,0.13682128,0.10586325,0.007498127,0.6913968],"study_design_scores_gemma":[0.00054019986,0.00030199502,0.0011953964,0.00030831303,0.00006727457,0.000032621505,0.00025810028,0.8962834,0.08299957,0.016754813,0.00056168303,0.00069666735],"about_ca_topic_score_codex":0.00045918667,"about_ca_topic_score_gemma":0.0002398112,"teacher_disagreement_score":0.8565136,"about_ca_system_score_codex":0.00007315044,"about_ca_system_score_gemma":0.00006199305,"threshold_uncertainty_score":0.5956824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021886839,0.00008258759,0.9337396,0.0044899657,0.00047289216,0.000503932,0.00022922966,0.00028704782,0.038307924],"genre_scores_gemma":[0.8640222,0.000018493218,0.13517751,0.00011377684,0.000055366374,0.00019632597,0.000087493485,0.000008986241,0.00031987118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986224,0.00008330554,0.00045451225,0.0002937466,0.00036444754,0.0001815935],"domain_scores_gemma":[0.9970894,0.0005915834,0.0003227376,0.0008103917,0.0011499401,0.000035987487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033069146,0.00015566424,0.00017020143,0.00025241566,0.00028990305,0.00014621395,0.0023440418,0.00006419231,0.000023397532],"category_scores_gemma":[0.00018132896,0.00015887148,0.00010607523,0.00020898889,0.00024033031,0.00019010266,0.00023354434,0.00017437866,0.00001133496],"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.000015896128,0.0002735754,0.0008018076,0.000009735384,0.00002175758,2.6817187e-7,0.00017583763,0.0011458129,0.005259906,0.9894623,0.0019878729,0.00084521924],"study_design_scores_gemma":[0.0005098113,0.00015546766,0.0035109539,0.00033629025,0.0000117057,0.000016527925,0.00006504245,0.9009759,0.018259311,0.073706634,0.0021100051,0.00034238686],"about_ca_topic_score_codex":0.000092126385,"about_ca_topic_score_gemma":0.0003704456,"teacher_disagreement_score":0.9157557,"about_ca_system_score_codex":0.000117843265,"about_ca_system_score_gemma":0.00035467226,"threshold_uncertainty_score":0.6478591},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027282411,0.00006503452,0.9655929,0.0017643106,0.00024361537,0.00023596396,0.000021127244,0.0006333368,0.004161302],"genre_scores_gemma":[0.9685866,0.00061440316,0.030221151,0.00028160203,0.0000072168045,0.000051031864,0.0000070346946,0.000010570565,0.00022036041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984846,0.00019497347,0.0004352268,0.000324317,0.00031157082,0.0002493113],"domain_scores_gemma":[0.9951623,0.0008884748,0.00017853311,0.0034867171,0.00020712418,0.00007683035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040960338,0.00019536795,0.00033150983,0.0017862295,0.00043765048,0.00006929424,0.00262933,0.00009683436,0.000013384251],"category_scores_gemma":[0.000025133942,0.00019222319,0.00024345216,0.0045694932,0.00007417578,0.00033609677,0.000012908236,0.00045797258,0.0000349628],"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.00007540181,0.005159158,0.00026329223,0.000037693397,0.0012945156,0.0000025260929,0.0063018855,0.42306682,0.004020977,0.023736192,0.00033837341,0.5357031],"study_design_scores_gemma":[0.00020229327,0.00078909204,0.0018345753,0.00008554567,0.00031442803,0.0000022731947,0.00004079991,0.9254932,0.06971553,0.00063942035,0.0005478199,0.00033503148],"about_ca_topic_score_codex":0.00006989935,"about_ca_topic_score_gemma":0.00007275913,"teacher_disagreement_score":0.9413042,"about_ca_system_score_codex":0.00009682991,"about_ca_system_score_gemma":0.000043682114,"threshold_uncertainty_score":0.7838634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015003591,0.000004876368,0.9782148,0.00028175657,0.0002748295,0.00023913129,0.0000010583863,0.0005653511,0.0054146023],"genre_scores_gemma":[0.49477044,8.667851e-7,0.50472856,0.0004402419,0.000017181626,0.0000063089096,0.0000013957649,0.000008122857,0.00002685659],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984947,0.00003648571,0.00041803592,0.00034445332,0.00037968802,0.00032662635],"domain_scores_gemma":[0.9989261,0.00019686225,0.000187846,0.0004884058,0.0001218395,0.00007892374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012966666,0.00013555362,0.0001593932,0.0003226616,0.00008696073,0.000054127482,0.0004621671,0.00005598157,0.0000736126],"category_scores_gemma":[0.000048118105,0.00013668799,0.00008595717,0.00044582743,0.000022832206,0.00025980343,0.0001101999,0.000115928946,0.000011467579],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045549923,0.00006578247,0.0018866066,0.000011852907,0.0000080891605,0.000009804848,0.00044989213,0.000100338366,0.0035333328,0.0027005041,0.0016129495,0.9896163],"study_design_scores_gemma":[0.000379518,0.00030480354,0.007639726,0.000037582275,0.000005424747,0.000005319594,0.0003059045,0.22949676,0.76020104,0.0011858912,0.00020986453,0.00022816175],"about_ca_topic_score_codex":0.0005116013,"about_ca_topic_score_gemma":0.0005986173,"teacher_disagreement_score":0.9893881,"about_ca_system_score_codex":0.00014320957,"about_ca_system_score_gemma":0.00008006313,"threshold_uncertainty_score":0.5573974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010190843,0.000010616801,0.98219806,0.00031497196,0.00017182753,0.00022070095,4.272216e-7,0.001044114,0.0058484455],"genre_scores_gemma":[0.38876638,0.0000010077301,0.60986334,0.00023727011,0.000006597049,0.000043767894,1.5016263e-7,0.000005666864,0.0010758513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918777,0.00009929267,0.00013296546,0.00026394686,0.00010354543,0.00021250412],"domain_scores_gemma":[0.99875593,0.00053521484,0.000041912605,0.0005200502,0.00009833189,0.000048580165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963129,0.000087193555,0.00008914169,0.000075584736,0.00007522628,0.000058208643,0.0005104391,0.000044517612,0.000009961307],"category_scores_gemma":[0.0013077675,0.00007658358,0.00004214807,0.00022916213,0.000016919199,0.00021561678,0.000077233344,0.00006819277,0.000023388524],"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.000080869424,0.000093209805,0.0006302362,0.000023315108,0.000008357889,0.000005640296,0.00094954297,0.000041595697,0.013684098,0.961276,0.004265666,0.01894148],"study_design_scores_gemma":[0.00060990895,0.0005808059,0.0005004596,0.000040153547,0.0000056274507,0.000044447817,0.00006572387,0.26854125,0.53724533,0.113637656,0.07803752,0.0006911162],"about_ca_topic_score_codex":0.0000054991583,"about_ca_topic_score_gemma":0.0000027854342,"teacher_disagreement_score":0.8476383,"about_ca_system_score_codex":0.000023522283,"about_ca_system_score_gemma":0.00008075606,"threshold_uncertainty_score":0.31229877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.176082,0.00028002352,0.82213044,0.00038608385,0.00017477949,0.000684121,0.0000074412073,0.00012988599,0.00012521184],"genre_scores_gemma":[0.59744394,0.0000073062442,0.40230712,0.0001244701,0.000018707571,0.00003377611,0.0000026986602,0.000006520046,0.000055441906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835277,0.000091023125,0.00034743274,0.0004146217,0.00052867515,0.00026547187],"domain_scores_gemma":[0.9966004,0.0012382824,0.00021951307,0.00035039987,0.0015351569,0.00005623949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418109,0.00015417325,0.00019361268,0.00008519242,0.00022300247,0.000048668426,0.00044208244,0.00010107403,0.000007978182],"category_scores_gemma":[0.0007657251,0.0001143795,0.00006545455,0.00024408415,0.0001998933,0.00029295252,0.00015801676,0.00013702961,0.0000024707476],"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.0011245587,0.002373971,0.07326641,0.00079714204,0.00094070204,0.00001004917,0.032768626,0.001962607,0.24123207,0.2796693,0.008790846,0.3570637],"study_design_scores_gemma":[0.0006118984,0.000100092,0.029024864,0.00002820881,0.00003990453,0.00001402689,0.00026254618,0.7935109,0.16681728,0.009380975,0.000044512177,0.00016476017],"about_ca_topic_score_codex":0.00028371077,"about_ca_topic_score_gemma":0.0018659325,"teacher_disagreement_score":0.7915483,"about_ca_system_score_codex":0.00009287611,"about_ca_system_score_gemma":0.00018376562,"threshold_uncertainty_score":0.46642607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0157267,0.00045183065,0.9493926,0.032859296,0.00028364605,0.00084152794,0.0000082032975,0.00037676413,0.000059412574],"genre_scores_gemma":[0.8033619,0.00030413302,0.19171934,0.0037438062,0.00007507131,0.0007010426,0.0000049976707,0.000025586918,0.00006411074],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889046,0.000076828255,0.00028298923,0.00029909858,0.00012692956,0.00032367848],"domain_scores_gemma":[0.9958772,0.0015920338,0.00016867857,0.0021851046,0.000114071874,0.000062909596],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006201901,0.00017193989,0.00019273409,0.00015514634,0.0015775235,0.000112925416,0.0023392853,0.00005988157,3.179882e-7],"category_scores_gemma":[0.00015415646,0.00014882101,0.00012451538,0.0002347244,0.00029258462,0.00024996352,0.0004879739,0.00021512929,0.0000031099548],"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.0001234939,0.000879445,0.0017254015,0.00039733123,0.00072752766,0.000010648056,0.10778334,0.0068139154,0.22690591,0.017289601,0.49345255,0.14389083],"study_design_scores_gemma":[0.0005627463,0.000113620044,0.000632246,0.00010283181,0.000038484217,0.00011366604,0.00030389044,0.9718678,0.015249369,0.0017114485,0.008859506,0.00044441991],"about_ca_topic_score_codex":0.00012795028,"about_ca_topic_score_gemma":0.0000868649,"teacher_disagreement_score":0.96505386,"about_ca_system_score_codex":0.00006317076,"about_ca_system_score_gemma":0.000041655072,"threshold_uncertainty_score":0.9997223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001974742,0.0002003463,0.9933039,0.0013996114,0.00040074525,0.00041541507,0.0000094890465,0.0006569863,0.0016387574],"genre_scores_gemma":[0.6910633,0.0000705474,0.30829382,0.00009823385,0.000017997832,0.00038678615,0.0000020110394,0.000017127215,0.000050156308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871594,0.00014983906,0.00034005995,0.00023365513,0.00017467035,0.00038586435],"domain_scores_gemma":[0.9971169,0.0007577802,0.000071657785,0.0018745961,0.00009869385,0.00008036749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204199,0.00015821336,0.00017137248,0.00037384656,0.0006168523,0.00010883986,0.0016243301,0.000092993265,0.0000037728964],"category_scores_gemma":[0.00001984994,0.00017729923,0.0001248908,0.0006908819,0.00009140813,0.0006876707,0.000017329487,0.00041479897,0.000009045026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022162669,0.003172329,0.002242759,0.000069126545,0.00011783991,0.0000015478321,0.010628134,0.002778336,0.009620173,0.02374589,0.00093491987,0.9466668],"study_design_scores_gemma":[0.001367752,0.00032157332,0.005646778,0.00078285544,0.0001655895,0.00011731119,0.0014577825,0.83506256,0.11767261,0.0162916,0.01893053,0.0021830623],"about_ca_topic_score_codex":0.00013499912,"about_ca_topic_score_gemma":0.00030585795,"teacher_disagreement_score":0.9444837,"about_ca_system_score_codex":0.00013901711,"about_ca_system_score_gemma":0.00005082155,"threshold_uncertainty_score":0.72300524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06320893,0.000014136082,0.93314344,0.00039307796,0.0002302526,0.00022871821,1.4680839e-7,0.00056319503,0.0022181182],"genre_scores_gemma":[0.69635946,0.000001629864,0.3031483,0.00009809089,0.000046237194,0.000009165883,5.612653e-7,0.00000546586,0.00033106506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.000010328446,0.00014204015,0.00025457612,0.00009395527,0.00021765992],"domain_scores_gemma":[0.99950206,0.00011536988,0.00005182565,0.0002050296,0.00006911118,0.0000566223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000669942,0.0000829689,0.000089864916,0.00011003689,0.000106726846,0.000103160455,0.00021729515,0.0000515951,0.000001800981],"category_scores_gemma":[0.00005117985,0.00007628642,0.000022742941,0.00019671267,0.000015343594,0.00031923395,0.00009920313,0.000054813405,0.0000017429908],"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.000017575712,0.000042997253,0.0015913902,0.00005361985,0.000011646783,0.0000064931205,0.0014295226,0.000029743967,0.045216482,0.6960143,0.00083794293,0.2547483],"study_design_scores_gemma":[0.0003065463,0.000117364354,0.0021034286,0.000046713172,0.0000023551233,0.000023966917,0.00005401856,0.81426907,0.16609153,0.014647864,0.0020618222,0.00027533856],"about_ca_topic_score_codex":0.000018899587,"about_ca_topic_score_gemma":0.00003254609,"teacher_disagreement_score":0.8142393,"about_ca_system_score_codex":0.000028261169,"about_ca_system_score_gemma":0.000012781396,"threshold_uncertainty_score":0.31108698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19960201,0.0002209625,0.7804018,0.0010719011,0.00007817896,0.0003928869,0.0000042200027,0.0019805948,0.016247425],"genre_scores_gemma":[0.74424654,0.00000413215,0.25455,0.00016812581,0.00015602999,0.000014974837,0.000004894048,0.000021071948,0.00083422073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978458,0.00014544367,0.00049676787,0.00070404855,0.0002808758,0.0005270132],"domain_scores_gemma":[0.9984024,0.0004916654,0.00020115318,0.00061460386,0.00009757764,0.00019258003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050127436,0.00032516717,0.0005778266,0.00018066954,0.00027227573,0.00045181884,0.00084271835,0.0001299624,0.0001088291],"category_scores_gemma":[0.00008588017,0.00029999609,0.00008021327,0.00025345816,0.00010557531,0.0009969864,0.00057675544,0.00029246038,0.00045931988],"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.000019851583,0.00026483744,0.093165085,0.00004220094,0.00019888455,0.00003523749,0.0099175535,0.00016736895,0.015898047,0.006887291,0.012185205,0.86121845],"study_design_scores_gemma":[0.0010083541,0.0011615617,0.015038298,0.00023822131,0.00007460097,0.00013675008,0.00013147625,0.8699411,0.1021033,0.0015332302,0.006812956,0.0018201122],"about_ca_topic_score_codex":0.000055779703,"about_ca_topic_score_gemma":0.000023247554,"teacher_disagreement_score":0.86977375,"about_ca_system_score_codex":0.00018060418,"about_ca_system_score_gemma":0.000057270536,"threshold_uncertainty_score":0.9999452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01259061,0.00027551642,0.98322123,0.000044761593,0.00024144392,0.0014114567,0.00012604926,0.0003379965,0.0017509339],"genre_scores_gemma":[0.9969982,0.000026397463,0.00039533363,0.00013040417,0.00007609403,0.0015422144,0.000008325785,0.000020719232,0.00080230756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856246,0.000113445196,0.00034440088,0.00056532974,0.00014856571,0.00026581745],"domain_scores_gemma":[0.99875706,0.0005587524,0.00012658551,0.00038183565,0.00007270432,0.00010307551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052226783,0.00022415096,0.00023300188,0.0001725128,0.00082579395,0.0003239313,0.00026458697,0.00010088023,0.000004912481],"category_scores_gemma":[0.0000031422787,0.00021832276,0.00008277197,0.00027821137,0.00013008574,0.00032229463,0.0000043182126,0.00015877558,0.000006770677],"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.000014686113,0.00046617258,0.00009039456,0.0001835599,0.000085040185,0.0000023396876,0.0010385442,0.0007814162,0.026754638,0.7699563,0.00014625021,0.20048065],"study_design_scores_gemma":[0.00757629,0.0030719943,0.0023388346,0.0015666969,0.00061307463,0.0010818704,0.008561802,0.10596125,0.28061014,0.5431213,0.039641704,0.0058550243],"about_ca_topic_score_codex":0.00005402159,"about_ca_topic_score_gemma":0.00004161774,"teacher_disagreement_score":0.9844076,"about_ca_system_score_codex":0.00006890832,"about_ca_system_score_gemma":0.000029661689,"threshold_uncertainty_score":0.8902944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083708335,0.00002205722,0.9863877,0.0005086117,0.0006841766,0.00080708443,0.000019385445,0.0008211748,0.002378976],"genre_scores_gemma":[0.7980896,0.000014498684,0.20095336,0.00009196945,0.000016648322,0.00055382977,0.000005976255,0.000024837193,0.00024925443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986593,0.00010570235,0.00037328913,0.00037520632,0.00019740492,0.00028906166],"domain_scores_gemma":[0.99653226,0.00040618912,0.00014425571,0.0026056576,0.00021673816,0.00009492716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034564795,0.00019587217,0.00017125682,0.00040641398,0.0010506823,0.00007228511,0.0016291686,0.000117225834,0.000019074294],"category_scores_gemma":[0.000016144715,0.00021878295,0.00019070289,0.00070395885,0.0000919341,0.00028240087,0.000023316174,0.0003089951,0.000033703083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011204152,0.0061287843,0.00021450515,0.00010483068,0.00035359114,0.000004282152,0.04643753,0.74382675,0.02548994,0.07373657,0.0022326675,0.101358496],"study_design_scores_gemma":[0.000252721,0.00012593715,0.0007295003,0.000055769327,0.000029743054,0.0000057311972,0.00004161489,0.9864248,0.009814733,0.0019385427,0.0003293049,0.00025159534],"about_ca_topic_score_codex":0.00016636064,"about_ca_topic_score_gemma":0.00007882852,"teacher_disagreement_score":0.7897188,"about_ca_system_score_codex":0.00016243318,"about_ca_system_score_gemma":0.00006957578,"threshold_uncertainty_score":0.892171},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08098193,0.00009419789,0.91334146,0.00018630031,0.00091115315,0.00077307544,0.0000012633325,0.00093032245,0.0027802864],"genre_scores_gemma":[0.9632543,0.0000033533945,0.036023214,0.000080735044,0.000050165723,0.00006954636,0.000006230994,0.000018094277,0.00049440435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841386,0.00006014344,0.0003969789,0.00047444217,0.00019629621,0.00045827683],"domain_scores_gemma":[0.9983911,0.0009822939,0.00015727984,0.00029541485,0.00011339182,0.00006050204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020201602,0.00016577053,0.00021259098,0.0003504468,0.00010626317,0.000119837576,0.000490002,0.00010653775,0.0000022405923],"category_scores_gemma":[0.0003338418,0.00016809595,0.00005018841,0.0005648207,0.000026639224,0.0003984971,0.00009245719,0.00020020669,0.000009437544],"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.0005725591,0.0015350564,0.09449028,0.00084517326,0.0002701727,0.00026946203,0.03619788,0.004913679,0.024343433,0.21829997,0.003295568,0.61496675],"study_design_scores_gemma":[0.00063458295,0.00029513275,0.0073702466,0.00033715437,0.000011060206,0.00015404617,0.0025558192,0.95441705,0.030628767,0.002919711,0.00013164248,0.00054476917],"about_ca_topic_score_codex":0.0007180383,"about_ca_topic_score_gemma":0.0031729324,"teacher_disagreement_score":0.94950336,"about_ca_system_score_codex":0.00029006958,"about_ca_system_score_gemma":0.00006111458,"threshold_uncertainty_score":0.6854754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024811016,0.000012935729,0.968991,0.0020556333,0.00043747667,0.0003119813,0.0000058094647,0.0013174372,0.0020567393],"genre_scores_gemma":[0.6457333,0.000027736236,0.35388818,0.00010217175,0.0000085838,0.000092663126,0.0000025860043,0.000018818579,0.00012593385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998675,0.00013607217,0.0003187259,0.0003459564,0.00027940422,0.0002448461],"domain_scores_gemma":[0.995334,0.0006281605,0.00015619148,0.003505837,0.00026648506,0.0001093164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039060097,0.00019582805,0.00018050428,0.00052281166,0.00066560006,0.00018704217,0.0023286988,0.0001257964,0.000018323997],"category_scores_gemma":[0.000031092797,0.00018985497,0.00009359935,0.0014122173,0.00012336734,0.0005579007,0.000018438512,0.0009136955,0.000049483977],"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.00008946716,0.0026374902,0.00059338135,0.000049522867,0.00029238692,0.000008757124,0.008842843,0.009822384,0.24855934,0.036385268,0.00069707015,0.6920221],"study_design_scores_gemma":[0.0005090591,0.00019166325,0.0003524651,0.00007076813,0.000042568627,0.000062369865,0.0001175316,0.87748146,0.116305925,0.0031613754,0.0012308887,0.00047390012],"about_ca_topic_score_codex":0.00013637425,"about_ca_topic_score_gemma":0.0019927432,"teacher_disagreement_score":0.8676591,"about_ca_system_score_codex":0.000084040475,"about_ca_system_score_gemma":0.00008772202,"threshold_uncertainty_score":0.7742061},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11279989,0.0000917128,0.87894803,0.0002605017,0.0020229218,0.0008959169,0.000023212811,0.0025543713,0.0024034563],"genre_scores_gemma":[0.9937182,0.000035374906,0.004408356,0.00022766927,0.00009240985,0.00033918984,0.0000021408682,0.00008333876,0.0010933435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960778,0.00039574032,0.0007513733,0.0012306299,0.00078737334,0.0007571362],"domain_scores_gemma":[0.99681693,0.00030046052,0.00032590894,0.0018549784,0.0003935316,0.00030820863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041739992,0.0005760857,0.0007002893,0.0004819193,0.001098349,0.00021428116,0.0017289752,0.0002215766,0.000026410762],"category_scores_gemma":[0.000021278174,0.00055252627,0.00022428407,0.0008770454,0.00029902955,0.00088741403,0.00001860102,0.00074083824,0.00005677494],"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.000924533,0.0073135756,0.0003597996,0.0012555632,0.0027933011,0.0023141792,0.1372694,0.09455537,0.5220865,0.009488304,0.02523453,0.19640495],"study_design_scores_gemma":[0.0058254804,0.0049482384,0.00034531154,0.0034241648,0.00021433935,0.01333635,0.0018387393,0.08086784,0.8618486,0.0004032286,0.021904869,0.0050428635],"about_ca_topic_score_codex":0.0010124695,"about_ca_topic_score_gemma":0.00025620655,"teacher_disagreement_score":0.88091826,"about_ca_system_score_codex":0.0003358722,"about_ca_system_score_gemma":0.000278157,"threshold_uncertainty_score":0.9996926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17004544,0.000079876845,0.8263451,0.00065980747,0.0001892992,0.0002673885,0.0000031224233,0.0007440927,0.0016658643],"genre_scores_gemma":[0.665543,0.000020694393,0.33286348,0.00064605736,0.000042313026,0.000035086854,0.0000021952355,0.000008720721,0.00083840743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866956,0.000046527475,0.00022771512,0.0004981702,0.00023340505,0.00032460003],"domain_scores_gemma":[0.99883115,0.00033546035,0.000073465155,0.00041334864,0.00023179132,0.00011477786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037147567,0.00016892584,0.00021700478,0.000086932225,0.00034736883,0.000064461325,0.00043204645,0.00010814828,0.000015453177],"category_scores_gemma":[0.00017508413,0.00015787463,0.00007454439,0.00016055621,0.00015358516,0.0003822924,0.00028827175,0.0001438945,0.000016001011],"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.00015391306,0.0009652854,0.2544076,0.00024431795,0.00019527605,0.00013030104,0.0064502796,0.000092577095,0.015348702,0.50801677,0.19859022,0.015404771],"study_design_scores_gemma":[0.002275257,0.0005977253,0.1444669,0.000119993,0.00003915699,0.0016366258,0.00013333715,0.6147103,0.10832052,0.11425928,0.011547073,0.0018938754],"about_ca_topic_score_codex":0.0001440636,"about_ca_topic_score_gemma":0.00019529033,"teacher_disagreement_score":0.6146177,"about_ca_system_score_codex":0.000050867857,"about_ca_system_score_gemma":0.00012432256,"threshold_uncertainty_score":0.64379406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049601,0.000034220047,0.92579514,0.0019986487,0.0003116731,0.00038582084,0.0000137537,0.0005688838,0.0003958723],"genre_scores_gemma":[0.8996701,0.00008711626,0.099871956,0.00026209163,0.000010974121,0.0000303137,0.00000960694,0.0000138532605,0.000043980348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982446,0.00045381056,0.0004648244,0.00033727378,0.00027549866,0.00022402938],"domain_scores_gemma":[0.99656254,0.0005405115,0.00026748597,0.0023282857,0.00022439755,0.00007680517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062655646,0.00020810925,0.00025570535,0.0006627365,0.0007308673,0.000099869474,0.0012558994,0.00014128107,0.0000049555833],"category_scores_gemma":[0.000056065954,0.00021316789,0.0001200282,0.0014835511,0.0000950466,0.0006374101,0.000014210535,0.00052062544,0.00002487046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007511868,0.00349982,0.000017152588,0.000052717503,0.00007863287,0.0000037602042,0.0025950384,0.7858919,0.05016629,0.017318277,0.00021223351,0.14008906],"study_design_scores_gemma":[0.000188129,0.00030121632,0.00041641924,0.00012139031,0.000028648868,0.000009216076,0.000027336893,0.8795348,0.11557611,0.003556597,0.000028772958,0.00021140712],"about_ca_topic_score_codex":0.00017766483,"about_ca_topic_score_gemma":0.000051181483,"teacher_disagreement_score":0.8291741,"about_ca_system_score_codex":0.00018251622,"about_ca_system_score_gemma":0.0000930357,"threshold_uncertainty_score":0.8692734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009241638,0.000081633516,0.9621368,0.00023018105,0.00027551784,0.00035599072,9.1360397e-7,0.00089683925,0.026780488],"genre_scores_gemma":[0.6202823,0.000004195595,0.37809512,0.00026441735,0.000013805554,0.000034109893,6.2772676e-7,0.000011933858,0.0012935307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880874,0.000058578582,0.00019567352,0.00040290572,0.00022400168,0.00031009916],"domain_scores_gemma":[0.9991266,0.00020019095,0.00005074656,0.0004563466,0.0000712461,0.00009486841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156511,0.00014639557,0.0001507818,0.00008783369,0.00013933642,0.00008986082,0.00049658405,0.00007253807,0.00005567686],"category_scores_gemma":[0.00007005473,0.00011772864,0.00010439605,0.00026262004,0.000020199717,0.0001249066,0.000041786472,0.00009112306,0.000011538621],"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.00002827929,0.00057335355,0.0010719146,0.0000953429,0.00003088557,0.000009562078,0.0018934201,0.0007782668,0.035317495,0.8008881,0.020140281,0.13917308],"study_design_scores_gemma":[0.0009785505,0.00044812815,0.00057189655,0.000087094704,0.000015576674,0.000034030894,0.000036450037,0.2652915,0.5915553,0.015887419,0.12445932,0.0006346969],"about_ca_topic_score_codex":0.000017424676,"about_ca_topic_score_gemma":0.000007373541,"teacher_disagreement_score":0.7850007,"about_ca_system_score_codex":0.00004483965,"about_ca_system_score_gemma":0.00006043936,"threshold_uncertainty_score":0.48008347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21042669,0.0000075082858,0.78837186,0.0005332349,0.00021676318,0.000109414505,7.138439e-7,0.00010916796,0.00022467517],"genre_scores_gemma":[0.7577431,6.319228e-7,0.24178217,0.00037324466,0.00008776591,0.0000014252839,5.6409266e-7,0.00000820764,0.0000028440647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984067,0.00026127117,0.00043600483,0.00027560288,0.00035816387,0.00026225077],"domain_scores_gemma":[0.9981062,0.00019571504,0.00046018808,0.00089240575,0.00021370768,0.00013182971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828727,0.00015401538,0.00029049205,0.00032361178,0.0002091925,0.00020421938,0.0015649582,0.00004856079,0.000008265956],"category_scores_gemma":[0.00003440739,0.000117255746,0.00018364414,0.0012767267,0.000076632205,0.00021891581,0.0003703557,0.000251206,0.000005580663],"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.000117611795,0.00032564715,0.08336795,0.000042597407,0.0023932564,0.00002149834,0.018896362,0.21861409,0.013249833,0.048370894,0.009413416,0.6051868],"study_design_scores_gemma":[0.0002627639,0.00019994477,0.02244394,0.000031630545,0.00015454256,0.00016897943,0.00007272179,0.965384,0.0016939262,0.008589024,0.000718372,0.00028015728],"about_ca_topic_score_codex":0.00008088363,"about_ca_topic_score_gemma":0.000017747925,"teacher_disagreement_score":0.7467699,"about_ca_system_score_codex":0.0000809735,"about_ca_system_score_gemma":0.000047224923,"threshold_uncertainty_score":0.47815505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2210107,0.000020111367,0.766808,0.0002836715,0.00015734737,0.00016665457,0.0000012104381,0.002286489,0.009265859],"genre_scores_gemma":[0.900757,0.000005643064,0.09721522,0.0009626039,0.000050715636,0.000014108723,6.213633e-7,0.000015486043,0.0009786106],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874955,0.000047693084,0.00012831898,0.00040912002,0.00030627177,0.00035903827],"domain_scores_gemma":[0.9990159,0.00009410749,0.000058831687,0.00063672604,0.00008700726,0.00010740608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026460388,0.00015324893,0.0001528539,0.00006560721,0.00021619683,0.000064501,0.00068657263,0.000060233033,0.00004190769],"category_scores_gemma":[0.000046384415,0.0001199445,0.000034544704,0.00035968723,0.000029650999,0.0007507642,0.00017426416,0.00016492669,0.000016884507],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030334853,0.00458296,0.36012298,0.00022260044,0.00039980686,0.00392344,0.08484185,0.00033736922,0.044488728,0.30063957,0.17300919,0.027128186],"study_design_scores_gemma":[0.005448375,0.004744775,0.2388404,0.0004190088,0.00004514251,0.0032256697,0.0006187222,0.56901366,0.1442822,0.009078254,0.019683372,0.004600448],"about_ca_topic_score_codex":0.0000825691,"about_ca_topic_score_gemma":0.00015224259,"teacher_disagreement_score":0.67974627,"about_ca_system_score_codex":0.00003343459,"about_ca_system_score_gemma":0.00005882714,"threshold_uncertainty_score":0.48911947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018414659,0.000015880929,0.99312776,0.003769001,0.0009162599,0.00057839055,0.00000892308,0.0008517759,0.0005478773],"genre_scores_gemma":[0.589592,0.00002741143,0.40953213,0.0001502587,0.000019133817,0.0004176202,0.0000039551655,0.000020294186,0.00023723723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.00009120342,0.0003277007,0.00031878575,0.00019216974,0.0002450015],"domain_scores_gemma":[0.99660146,0.00037675133,0.00014232204,0.002592014,0.00018967272,0.000097765864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679026,0.00016817036,0.000144913,0.00028544187,0.000904776,0.00015858129,0.0016984653,0.00013126642,0.00002086377],"category_scores_gemma":[0.000029543942,0.00018784252,0.00013891178,0.0003247242,0.0000842217,0.00029367892,0.000024485353,0.000557505,0.000019202222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003024767,0.0016216353,0.000036329355,0.00004650021,0.00012774477,6.1337175e-7,0.0032729052,0.72520536,0.015587635,0.009669469,0.0027800675,0.2416215],"study_design_scores_gemma":[0.00022523383,0.0000859162,0.000011509639,0.000028313438,0.000013481251,0.0000087060625,0.000057996935,0.9787316,0.015915073,0.0015213408,0.0031845903,0.0002162673],"about_ca_topic_score_codex":0.000042043997,"about_ca_topic_score_gemma":0.00027464383,"teacher_disagreement_score":0.5894078,"about_ca_system_score_codex":0.000088640576,"about_ca_system_score_gemma":0.00008163796,"threshold_uncertainty_score":0.76599956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05388786,8.2020495e-7,0.94368225,0.000053736247,0.00036483444,0.00021957039,0.000025991467,0.00023180085,0.0015331248],"genre_scores_gemma":[0.9840318,0.0000056971,0.015514514,0.00036455414,0.0000070559936,0.000029249113,0.000015641928,0.0000070500487,0.000024451365],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875695,0.00017268497,0.00052702246,0.00011807172,0.00029111546,0.00013413587],"domain_scores_gemma":[0.99874413,0.00025990568,0.000359724,0.00044870772,0.00015212999,0.000035429603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009543938,0.00012875843,0.00017798849,0.0004239775,0.00010423687,0.000028299415,0.00037532588,0.000074585856,0.00004501166],"category_scores_gemma":[0.000020760675,0.00012960701,0.000071197486,0.00039355797,0.00004804303,0.0013193949,0.0000029119424,0.00014259212,0.00001382234],"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.00021768727,0.00033328548,0.000014290423,0.00031647072,0.00010796654,1.77807e-7,0.0069877324,0.019696485,0.10653479,0.4121604,0.000085721396,0.453545],"study_design_scores_gemma":[0.00045001457,0.00046280312,0.00023421005,0.0002498607,0.000022885582,0.000005125704,0.00011692753,0.09054017,0.8864021,0.021001639,0.00029587402,0.00021840517],"about_ca_topic_score_codex":0.000010673861,"about_ca_topic_score_gemma":8.7125414e-7,"teacher_disagreement_score":0.93014395,"about_ca_system_score_codex":0.000043459666,"about_ca_system_score_gemma":0.000037667785,"threshold_uncertainty_score":0.5285221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4637734,0.000008125169,0.5297967,0.00028196,0.00012843641,0.00010326796,0.0000027225606,0.00055778626,0.005347603],"genre_scores_gemma":[0.93228513,0.00000790492,0.06682053,0.00053314044,0.000014918533,0.000009324249,0.0000019095019,0.0000057509556,0.00032136377],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.00009477857,0.00024085585,0.00036661542,0.00045029016,0.00022076811],"domain_scores_gemma":[0.99860543,0.0003921068,0.00010598143,0.0006249268,0.0002058595,0.00006569786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022542656,0.00015272018,0.0002348285,0.000145287,0.00013817403,0.000018431454,0.0006890448,0.00008318047,0.000014171762],"category_scores_gemma":[0.0001763619,0.00013488022,0.000084776984,0.00031642066,0.00021625849,0.00011763487,0.00018231993,0.00019050816,0.000018697016],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000191578,0.002236173,0.56346154,0.00023627633,0.00006230249,0.0001342058,0.0023513124,0.00089341874,0.05303445,0.35200495,0.016291382,0.0091024],"study_design_scores_gemma":[0.00038368604,0.00033720504,0.37561348,0.000110375935,0.000004269295,0.00002986302,0.000030965635,0.46247345,0.15664257,0.0038994339,0.00011332183,0.00036137717],"about_ca_topic_score_codex":0.00027264332,"about_ca_topic_score_gemma":0.00010109672,"teacher_disagreement_score":0.46851176,"about_ca_system_score_codex":0.00005969032,"about_ca_system_score_gemma":0.00016766385,"threshold_uncertainty_score":0.5500256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955967,0.000043517884,0.4011667,0.002405965,0.00007351877,0.0001313158,0.000005207144,0.00033501344,0.00024205807],"genre_scores_gemma":[0.71833676,0.000020738658,0.28089815,0.0006858303,0.000005580674,0.000029803188,0.000009497488,0.0000069651946,0.00000669845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985575,0.00034533857,0.00039887804,0.0003150607,0.00018630669,0.00019691249],"domain_scores_gemma":[0.9928706,0.0003573322,0.00021861482,0.006306323,0.00017640546,0.000070710885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006686,0.00012714365,0.00026732677,0.0003561869,0.0002584748,0.00003070953,0.003935052,0.000052574374,0.0000069616453],"category_scores_gemma":[0.000075838696,0.00013574412,0.0001694809,0.0016421027,0.00029803466,0.00048165856,0.0004186657,0.00021944178,0.000004087366],"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.000021560681,0.0016541887,0.060958575,0.00003027167,0.001166907,0.00000947452,0.020093484,0.0009569499,0.8859948,0.0021130487,0.0036445996,0.023356147],"study_design_scores_gemma":[0.0002906874,0.0001157851,0.06847737,0.000016298192,0.00029963517,0.000020184636,0.00011515738,0.8170429,0.111636445,0.00027382257,0.0011215576,0.00059018965],"about_ca_topic_score_codex":0.00052945653,"about_ca_topic_score_gemma":0.000803315,"teacher_disagreement_score":0.81608593,"about_ca_system_score_codex":0.00008289111,"about_ca_system_score_gemma":0.00005585581,"threshold_uncertainty_score":0.7312372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33049512,0.0000073490028,0.6632728,0.00042147574,0.0001795161,0.00012559905,3.1349242e-7,0.0012653972,0.0042324397],"genre_scores_gemma":[0.74900913,0.000006064143,0.2503736,0.00035543655,0.000023534863,0.0000029547384,5.4375766e-7,0.000009824337,0.00021888566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853295,0.000036496152,0.0002067756,0.0005215285,0.0003315811,0.00037064016],"domain_scores_gemma":[0.99884766,0.00006913322,0.00009722161,0.00070028094,0.00015949487,0.00012618407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355545,0.00019454831,0.0002099809,0.00009001643,0.00018141679,0.00015978001,0.0009067443,0.000070573275,0.000022712227],"category_scores_gemma":[0.000063228406,0.00016252506,0.000050133272,0.0004667271,0.00008754733,0.00055051246,0.00032488705,0.00022553663,0.00010596799],"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.00014007828,0.0012182544,0.21198069,0.00025048654,0.00018882779,0.0010257709,0.010877132,0.0029805652,0.10800651,0.61661124,0.0041812332,0.042539243],"study_design_scores_gemma":[0.000616675,0.00031357625,0.010186704,0.00019886233,0.000012038178,0.0002366641,0.00018727795,0.018262716,0.9569315,0.012193776,0.00012998248,0.00073026377],"about_ca_topic_score_codex":0.0005762358,"about_ca_topic_score_gemma":0.000840998,"teacher_disagreement_score":0.84892493,"about_ca_system_score_codex":0.00011764115,"about_ca_system_score_gemma":0.00012608721,"threshold_uncertainty_score":0.66275793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16671775,0.000249788,0.7936111,0.00092590664,0.00051947596,0.00025065098,6.451832e-7,0.0013895654,0.036335092],"genre_scores_gemma":[0.68014413,0.000037542315,0.31952646,0.00005063551,0.000015713807,0.0000062117347,1.6817205e-7,0.0000039708984,0.00021514458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992181,0.00006942696,0.00018189724,0.00024210516,0.00015779973,0.0001306624],"domain_scores_gemma":[0.9992299,0.000042715834,0.00008902025,0.00051451003,0.00009623361,0.000027636155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002037193,0.000082755316,0.00012664816,0.000119254786,0.000042516738,0.000027581915,0.00043559782,0.000026626896,0.00010534157],"category_scores_gemma":[0.00006298413,0.00006868742,0.00005044398,0.00038754326,0.00012826936,0.0001771073,0.000084622705,0.000063596104,0.000011752278],"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.000002367639,0.000043596607,0.0013854154,0.000015337344,0.0000093707895,0.0000015543773,0.0004358892,0.0000066609064,0.009277103,0.9301457,0.0021589694,0.056518048],"study_design_scores_gemma":[0.00028114815,0.00020411554,0.00049673446,0.000036651505,0.000011681029,0.00014486478,0.00003884052,0.036157444,0.7331393,0.22862,0.00055430405,0.00031495676],"about_ca_topic_score_codex":0.00003382945,"about_ca_topic_score_gemma":0.000006048357,"teacher_disagreement_score":0.7238622,"about_ca_system_score_codex":0.000010913249,"about_ca_system_score_gemma":0.000007225343,"threshold_uncertainty_score":0.28009915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041868463,0.000011666622,0.9452755,0.00004850791,0.0005817456,0.000412118,0.000004239014,0.00059865986,0.011199094],"genre_scores_gemma":[0.78297585,0.0000016177663,0.21444476,0.00008484472,0.000015474801,0.000071390816,0.0000037542384,0.000014269817,0.0023880447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987448,0.00009834388,0.00029601756,0.000406538,0.00016721003,0.00028713117],"domain_scores_gemma":[0.99862343,0.0003286781,0.00016462912,0.0006155309,0.0002045375,0.00006319669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055044884,0.00014839892,0.00021589399,0.00012960733,0.00008569416,0.000049896233,0.00042714298,0.00008195346,0.000034348377],"category_scores_gemma":[0.00048166892,0.00013675487,0.000064200554,0.0003596275,0.000019604875,0.00024618662,0.00004906721,0.00007380914,0.000007558253],"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.000113303264,0.0010145117,0.00033636641,0.00012996458,0.00006475729,0.000004169694,0.0027090772,0.0025947362,0.11735203,0.83922476,0.03339325,0.0030630592],"study_design_scores_gemma":[0.0006051034,0.00068830285,0.000033634933,0.00007816026,0.000011167859,0.000004614058,0.00010994945,0.08493874,0.850395,0.06170963,0.0011048868,0.00032079098],"about_ca_topic_score_codex":0.000054039592,"about_ca_topic_score_gemma":0.000019667514,"teacher_disagreement_score":0.7775152,"about_ca_system_score_codex":0.00007103956,"about_ca_system_score_gemma":0.00007559785,"threshold_uncertainty_score":0.5576702},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023275899,0.000027725484,0.97224873,0.00010779823,0.00013603519,0.00017920962,0.0000011048757,0.00023592627,0.0037875415],"genre_scores_gemma":[0.4908873,0.0000023716268,0.50894696,0.00007048408,0.000004214381,0.000015023366,6.5965605e-7,0.0000037686896,0.000069215406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992691,0.000017723114,0.00022239053,0.00024392147,0.000101202306,0.00014566128],"domain_scores_gemma":[0.99911994,0.00013236633,0.00013140102,0.00045844977,0.00012816665,0.000029704168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042678096,0.000071647206,0.00010347906,0.000070444345,0.000046801644,0.000022093634,0.00038702769,0.00003379533,0.000006491538],"category_scores_gemma":[0.00028887665,0.00007022167,0.000049898183,0.00023728266,0.00001879208,0.00019649914,0.000023882765,0.000042715437,0.0000023962275],"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.00000908972,0.000109303386,0.025611285,0.00007184064,0.000024465531,7.30989e-7,0.0006866531,0.000213441,0.03567835,0.87849456,0.0028994523,0.056200847],"study_design_scores_gemma":[0.00066125963,0.0003683045,0.03536959,0.00007491617,0.000022116883,0.000024785959,0.00019708968,0.083047576,0.75589573,0.11186988,0.011685495,0.00078323454],"about_ca_topic_score_codex":0.000026944708,"about_ca_topic_score_gemma":0.00006571574,"teacher_disagreement_score":0.7666247,"about_ca_system_score_codex":0.00003155426,"about_ca_system_score_gemma":0.00007074076,"threshold_uncertainty_score":0.28635567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060605224,0.000013000097,0.9361713,0.000078646575,0.00013538469,0.00010151356,0.0000018466353,0.00016579873,0.0027272983],"genre_scores_gemma":[0.57370824,0.0000060975494,0.42612714,0.000029811281,0.00000747266,0.0000029686776,5.889142e-7,0.0000027945377,0.000114908216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992615,0.000029821074,0.00024642202,0.00015234183,0.00019822734,0.00011167064],"domain_scores_gemma":[0.9993506,0.000046386216,0.00013705726,0.00032735537,0.00011518387,0.000023423976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017917025,0.000060301987,0.0001158185,0.00009523313,0.000028575,0.0000045037746,0.00040569357,0.000025983443,0.0000443297],"category_scores_gemma":[0.000012017968,0.00005665458,0.00003796956,0.00026452364,0.000028335464,0.00021318751,0.00013010434,0.000037088976,0.0000041479498],"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.0000031035386,0.00018055494,0.012460826,0.000032528784,0.00003605376,0.00001871467,0.005070772,0.0000051890192,0.032168377,0.010948508,0.008816743,0.93025863],"study_design_scores_gemma":[0.0002452967,0.0002180192,0.05875695,0.000013803185,0.0000041747126,0.00004678218,0.00014428943,0.007476513,0.93106276,0.0017088036,0.00019622999,0.00012637007],"about_ca_topic_score_codex":0.0006995034,"about_ca_topic_score_gemma":0.000035890287,"teacher_disagreement_score":0.93013227,"about_ca_system_score_codex":0.000014967741,"about_ca_system_score_gemma":0.000060043916,"threshold_uncertainty_score":0.23103067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030505164,0.000029293838,0.959413,0.00094986503,0.00016908834,0.00011398722,7.265727e-8,0.00083883136,0.007980715],"genre_scores_gemma":[0.87692654,8.644768e-7,0.122511074,0.0004334957,0.00001786384,0.0000045015618,1.805322e-7,0.0000041834414,0.00010129113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912214,0.000023600118,0.00017501427,0.00026794017,0.00015272525,0.00025860692],"domain_scores_gemma":[0.99945754,0.000088621964,0.00003988082,0.00033455098,0.000037244867,0.00004217328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025903343,0.00010324136,0.000118072516,0.00017410415,0.00004867253,0.0001050728,0.00058620144,0.000042965115,0.0000073963547],"category_scores_gemma":[0.00011348874,0.000097145086,0.000033752694,0.00042548816,0.000016267299,0.00052115205,0.00006372205,0.00013346225,0.000011296231],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010612994,0.00014046686,0.0014707992,0.0000059957238,0.000004918766,0.000057694677,0.0056029954,0.00283056,0.0015394152,0.09516137,0.0015137162,0.89166147],"study_design_scores_gemma":[0.0006298681,0.00056515035,0.025292244,0.00017725828,0.00000575255,0.00015176903,0.00043499348,0.7254857,0.03278574,0.2132574,0.0002667747,0.0009473466],"about_ca_topic_score_codex":0.00003341095,"about_ca_topic_score_gemma":0.00027503382,"teacher_disagreement_score":0.8907141,"about_ca_system_score_codex":0.00005608972,"about_ca_system_score_gemma":0.000032199983,"threshold_uncertainty_score":0.39614618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012633389,0.00007216825,0.97540736,0.002288131,0.00042890944,0.00065549504,0.0000024203105,0.0020911295,0.006421021],"genre_scores_gemma":[0.60689557,0.0000068413933,0.39170092,0.0004002586,0.00010586013,0.00009554265,0.0000011743624,0.000009483755,0.0007843736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856186,0.000027620412,0.00021920142,0.0005080954,0.00024639638,0.00043681296],"domain_scores_gemma":[0.9984663,0.00025974348,0.000037600006,0.00096609973,0.00013368369,0.00013655194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042581893,0.00018856798,0.00022743283,0.000107581625,0.00011905315,0.00017234609,0.001427043,0.00010884083,0.000010993486],"category_scores_gemma":[0.00017311763,0.00016607383,0.00011799271,0.0002557929,0.000035526253,0.0003784975,0.00021248026,0.00014286222,0.000015105093],"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.00003556506,0.00044460787,0.00013594123,0.000024553854,0.000029662286,0.000017343546,0.0012370439,0.00022491251,0.015313195,0.57924247,0.090181045,0.31311366],"study_design_scores_gemma":[0.0007395572,0.0032221547,0.00056391535,0.000082976505,0.00002505632,0.000067845474,0.00017829858,0.27615905,0.6085177,0.08244687,0.026738105,0.001258474],"about_ca_topic_score_codex":0.000009102599,"about_ca_topic_score_gemma":0.0000090188405,"teacher_disagreement_score":0.5942621,"about_ca_system_score_codex":0.000050147377,"about_ca_system_score_gemma":0.000036535144,"threshold_uncertainty_score":0.67722946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17851357,0.000017799723,0.8136363,0.00028493608,0.00032711012,0.00036052748,6.607751e-7,0.0013830165,0.005476059],"genre_scores_gemma":[0.8515693,0.0000013097218,0.14573285,0.00082495355,0.00014756112,0.000029688725,7.0038635e-7,0.000016440024,0.0016771825],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985133,0.000023479846,0.0002285144,0.00052466703,0.00025919377,0.0004508634],"domain_scores_gemma":[0.9989048,0.0001907534,0.00012563173,0.00051582046,0.00017316375,0.000089833324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045568778,0.00020147115,0.00020849901,0.00012100748,0.00023814157,0.00036462658,0.0007563397,0.0000769641,0.00001763733],"category_scores_gemma":[0.00006344639,0.00016462702,0.000071746006,0.00032496647,0.000033838685,0.0007283163,0.00011298697,0.00014467567,0.0000062714184],"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.00028435202,0.00047972042,0.0077388347,0.00020582484,0.00010220948,0.000104356935,0.0074548824,0.0015030453,0.18686822,0.11749454,0.012972833,0.66479117],"study_design_scores_gemma":[0.0014801221,0.0011382172,0.003179133,0.00027882893,0.000014383809,0.00011340787,0.000083072475,0.44411615,0.54420763,0.0029361618,0.0013945313,0.0010583798],"about_ca_topic_score_codex":0.000035007437,"about_ca_topic_score_gemma":0.000008549794,"teacher_disagreement_score":0.67305577,"about_ca_system_score_codex":0.000060702612,"about_ca_system_score_gemma":0.000052563973,"threshold_uncertainty_score":0.6713295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21244231,0.00003430601,0.7787966,0.0073941606,0.00010092633,0.00031052137,0.0000020732975,0.00057392893,0.00034518485],"genre_scores_gemma":[0.5939554,0.000019632034,0.40508038,0.0007224537,0.000017012504,0.00015489059,0.0000033125382,0.0000103497905,0.000036573263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917305,0.000085543055,0.00018339185,0.00022232674,0.00014411587,0.00019159679],"domain_scores_gemma":[0.9972936,0.00044181917,0.00013012179,0.0019623793,0.0001307702,0.00004131792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023706039,0.000113873015,0.000118557386,0.00016682534,0.0005671311,0.00007644002,0.0021495451,0.000036346355,6.060091e-7],"category_scores_gemma":[0.000047786372,0.00011076085,0.000050190836,0.00031716283,0.00015599838,0.00052970357,0.00015463913,0.00014854957,0.00000840873],"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.0001085086,0.0009712548,0.06732933,0.00012778807,0.0003004216,0.00004654273,0.039979953,0.00061305915,0.5709124,0.05840243,0.101150125,0.16005819],"study_design_scores_gemma":[0.0050116326,0.0017324487,0.08788608,0.00092559546,0.00016641025,0.0011936459,0.00034624472,0.4012634,0.40851843,0.0044468115,0.08401027,0.00449905],"about_ca_topic_score_codex":0.0000536878,"about_ca_topic_score_gemma":0.000044821318,"teacher_disagreement_score":0.40065032,"about_ca_system_score_codex":0.00007864661,"about_ca_system_score_gemma":0.000044956807,"threshold_uncertainty_score":0.45166963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016843092,0.000032058208,0.971634,0.020674856,0.0006643293,0.0010633556,0.00007940639,0.0014715211,0.0026961905],"genre_scores_gemma":[0.5567712,0.00006430581,0.44207758,0.00015836617,0.000018996032,0.00068411976,0.000029401921,0.000026860533,0.00016915731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813795,0.0002234417,0.00051436684,0.00046907962,0.000296624,0.00035855288],"domain_scores_gemma":[0.98690116,0.0016803779,0.00019034668,0.01055153,0.0005086742,0.00016790906],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00063137134,0.00026916605,0.00024226148,0.00036490805,0.0016054453,0.00023781155,0.0061339424,0.0002581841,0.000015811442],"category_scores_gemma":[0.00013709835,0.0003074148,0.00022688511,0.0007193424,0.00035809062,0.0008040902,0.00008775155,0.001145914,0.000052238564],"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.00008480443,0.0039994707,0.00005179524,0.00004799836,0.00017369154,0.0000012320377,0.003060247,0.00412185,0.2849521,0.45856443,0.0025566008,0.24238577],"study_design_scores_gemma":[0.00084096135,0.00019726976,0.00034186488,0.00005561004,0.000064402724,0.000036370388,0.00006562392,0.9151059,0.060840003,0.016379438,0.0055692303,0.00050335756],"about_ca_topic_score_codex":0.00014672863,"about_ca_topic_score_gemma":0.0022650617,"teacher_disagreement_score":0.91098404,"about_ca_system_score_codex":0.00013845124,"about_ca_system_score_gemma":0.00012632959,"threshold_uncertainty_score":0.9999378},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020879861,0.00024370606,0.9721678,0.0001260872,0.0006914291,0.0006838276,0.000030453892,0.00068701437,0.0044898535],"genre_scores_gemma":[0.6296608,0.0000070690926,0.36999652,0.00004101283,0.000053922886,0.00006941034,0.000008019829,0.000015436823,0.00014783788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984792,0.000066524975,0.00038738185,0.00060741423,0.0002107235,0.00024879046],"domain_scores_gemma":[0.9978472,0.00034721018,0.00053213857,0.0008737449,0.00034567984,0.0000540175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635208,0.00025133733,0.0003886471,0.0002675646,0.000081993196,0.00007656052,0.0015670478,0.00022566131,0.0000135513865],"category_scores_gemma":[0.00024527678,0.00023206131,0.00019106301,0.000120039425,0.00004540807,0.000053373973,0.0011274458,0.00032409886,0.0000011682096],"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.0002805149,0.0004788243,0.048224635,0.0073897373,0.00087595795,0.000028028951,0.044005908,0.024691507,0.024004798,0.2956938,0.014125062,0.54020125],"study_design_scores_gemma":[0.00023940178,0.00020493612,0.0014136987,0.00084279844,0.000047937436,0.000008429204,0.00005819342,0.18300715,0.56195635,0.2509317,0.0003805628,0.00090883794],"about_ca_topic_score_codex":0.0017489324,"about_ca_topic_score_gemma":0.00089617714,"teacher_disagreement_score":0.6087809,"about_ca_system_score_codex":0.00007887063,"about_ca_system_score_gemma":0.00021341145,"threshold_uncertainty_score":0.94631857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6718076,0.000013707546,0.32218692,0.00018572761,0.000008405985,0.0004101095,2.9001313e-7,0.00004763786,0.0053396146],"genre_scores_gemma":[0.9546505,0.000001372234,0.045171347,0.000040175582,0.0000071248883,0.00009529544,7.8895334e-7,0.0000029817834,0.000030420435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989138,0.00011546168,0.00018411542,0.0001698551,0.00052777294,0.00008897399],"domain_scores_gemma":[0.9990025,0.0001286474,0.000110222645,0.0005042191,0.00024596334,0.00000842466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017482504,0.0000588216,0.00008114659,0.00008199754,0.000018110057,0.000012113148,0.0006294178,0.00002295229,0.0000028247314],"category_scores_gemma":[0.000039955456,0.000037876292,0.000011217776,0.0005790078,0.00002943805,0.00016773096,0.000052636176,0.000051794184,0.0000023603718],"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.00008218742,0.0006171137,0.2514209,0.00012163639,0.000011653938,6.98968e-7,0.009612416,0.11816415,0.073116384,0.058445636,0.0027074006,0.48569983],"study_design_scores_gemma":[0.00013883419,0.00025019943,0.09280195,0.00007041124,0.0000055859805,0.0000030090584,0.000081971106,0.75807065,0.14698145,0.0014437691,0.000066918576,0.00008527148],"about_ca_topic_score_codex":0.0011299796,"about_ca_topic_score_gemma":0.00094793504,"teacher_disagreement_score":0.63990647,"about_ca_system_score_codex":0.000026632762,"about_ca_system_score_gemma":0.000051932293,"threshold_uncertainty_score":0.17081986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003504484,0.000013757628,0.99421746,0.00053435017,0.00031033639,0.00034759066,0.000028978568,0.00031273853,0.00073033094],"genre_scores_gemma":[0.9881947,0.00003079333,0.010841108,0.0006390118,0.000018930694,0.000086147775,0.0000044055128,0.000005734818,0.00017914033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988759,0.00008998458,0.00045027657,0.00014005705,0.00025863235,0.00018514408],"domain_scores_gemma":[0.99781007,0.0009850021,0.00024629434,0.00065632263,0.00025821532,0.00004412905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176861,0.00013947947,0.00021911318,0.0005619123,0.00032145,0.00008446754,0.0006283661,0.00008953508,0.00002412165],"category_scores_gemma":[0.000037547296,0.000110483146,0.0002929816,0.0010401261,0.00007927337,0.0012732606,0.000004510103,0.00019104511,0.000027186661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025201446,0.00034300567,0.000023549912,0.00011084855,0.0013531856,2.1543613e-7,0.019514436,0.465844,0.0003929099,0.07259789,0.00078714505,0.4387808],"study_design_scores_gemma":[0.00025862118,0.00009429632,0.00026988782,0.000026490128,0.0003364337,0.000003480206,0.0003939269,0.87394667,0.11951161,0.0038037666,0.001138609,0.00021623229],"about_ca_topic_score_codex":0.000035089113,"about_ca_topic_score_gemma":0.00011092055,"teacher_disagreement_score":0.98469025,"about_ca_system_score_codex":0.00007021743,"about_ca_system_score_gemma":0.000042321193,"threshold_uncertainty_score":0.4505372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865702,0.000058960064,0.102731615,0.00009556046,0.00019396376,0.00029008376,0.0000016292174,0.00063429255,0.009423683],"genre_scores_gemma":[0.83052576,0.000008253399,0.16716473,0.00008553697,0.000032989807,0.000026139785,9.510307e-7,0.000014016974,0.0021416454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844015,0.00003782667,0.000313098,0.0004611456,0.0004381865,0.00030957029],"domain_scores_gemma":[0.9985054,0.00031923765,0.00015170695,0.00075449655,0.00022871469,0.000040422743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041938966,0.00020305949,0.00024709848,0.00040927634,0.00011377671,0.000114173046,0.00080704625,0.00007448517,0.000010480645],"category_scores_gemma":[0.00005987672,0.00014552528,0.000059592097,0.001044307,0.000106332256,0.00042081886,0.00022661862,0.00014909824,0.000019217214],"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.001868042,0.0038750698,0.16715606,0.0012044436,0.000112827576,0.00009387521,0.0030733105,0.040868122,0.014205361,0.5573178,0.03784975,0.17237532],"study_design_scores_gemma":[0.0020296746,0.011826491,0.14167126,0.0012599363,0.000027185735,0.00012917083,0.00009349022,0.22841743,0.5839626,0.025119716,0.0036901317,0.0017729199],"about_ca_topic_score_codex":0.00026360422,"about_ca_topic_score_gemma":0.000025698846,"teacher_disagreement_score":0.5697572,"about_ca_system_score_codex":0.00007435304,"about_ca_system_score_gemma":0.00006203275,"threshold_uncertainty_score":0.5934349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040383325,0.00005519934,0.98634744,0.00096698717,0.00021174295,0.0011392018,0.0000014370327,0.0027950653,0.0044445936],"genre_scores_gemma":[0.7069558,0.0000021196247,0.2897446,0.0011273711,0.000040684492,0.00008163365,0.0000015940946,0.000010054783,0.0020361831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983363,0.00008940471,0.0003818878,0.00049911794,0.0003018077,0.0003914635],"domain_scores_gemma":[0.9982487,0.0002717388,0.00014500278,0.0009717422,0.0002589121,0.000103890496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008073327,0.00021173751,0.0004234887,0.00012194407,0.00019319095,0.00024901886,0.0010426916,0.00010819082,0.0000070200604],"category_scores_gemma":[0.00035433905,0.0001771995,0.00015287966,0.00031834148,0.000022408798,0.00044674886,0.00014627863,0.00014308198,0.000049949667],"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.00008486484,0.0013424887,0.002117936,0.02338446,0.00018514892,0.00009114163,0.007580088,0.00020844917,0.02103811,0.81772393,0.11170896,0.014534394],"study_design_scores_gemma":[0.0010765227,0.0012075686,0.0021582944,0.008360168,0.000091997346,0.00023910395,0.00036320282,0.32452264,0.47356066,0.18593374,0.00059608294,0.0018900093],"about_ca_topic_score_codex":0.000044091023,"about_ca_topic_score_gemma":0.00004704848,"teacher_disagreement_score":0.70291746,"about_ca_system_score_codex":0.000084003026,"about_ca_system_score_gemma":0.00006962627,"threshold_uncertainty_score":0.7225986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23210983,0.000023911885,0.7640032,0.00003116404,0.0005870043,0.00014669453,6.0486366e-7,0.0006224877,0.0024750698],"genre_scores_gemma":[0.4648878,7.6472384e-7,0.5349188,0.000063442814,0.000029777124,0.0000014058845,7.987765e-8,0.000012201751,0.00008575798],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99819374,0.000025209665,0.0005086774,0.00043227768,0.00037576535,0.00046433904],"domain_scores_gemma":[0.9987683,0.00007110453,0.00022869834,0.00065881095,0.00016358487,0.000109449036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009969928,0.00018418391,0.00029139913,0.00027186115,0.0001275394,0.0000690829,0.000795711,0.00010228752,0.000021345386],"category_scores_gemma":[0.00017390288,0.00018959447,0.00014731372,0.00071374635,0.00004896834,0.0004417285,0.0006907005,0.0001886202,0.0000061626797],"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.00001082384,0.00026888444,0.007589127,0.00014361234,0.000054039276,0.00009505446,0.002149137,0.00043450063,0.59638005,0.0041254847,0.00030988,0.38843942],"study_design_scores_gemma":[0.00014042025,0.000047095462,0.001949022,0.00019512308,0.00000697317,0.00006601841,0.000062331645,0.29558828,0.7005677,0.0010830607,0.00003919818,0.00025475412],"about_ca_topic_score_codex":0.0005306414,"about_ca_topic_score_gemma":0.00021495704,"teacher_disagreement_score":0.38818467,"about_ca_system_score_codex":0.00018615709,"about_ca_system_score_gemma":0.00009291418,"threshold_uncertainty_score":0.7731438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07964761,0.00012024499,0.90432817,0.00011376862,0.000106871405,0.0002297214,2.0637236e-7,0.0016804283,0.013772986],"genre_scores_gemma":[0.6132255,0.000004928762,0.38650233,0.00010023331,0.000022629225,0.0000074606,3.4206246e-7,0.000024563567,0.00011197765],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805987,0.000057774945,0.00030732504,0.00066618924,0.0003707051,0.0005381264],"domain_scores_gemma":[0.9988099,0.00009733613,0.00016210505,0.00056370505,0.00017988011,0.0001870983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003659454,0.00029863243,0.00025112764,0.00023798061,0.0003407116,0.00019207047,0.00090327155,0.000107432556,0.00005225844],"category_scores_gemma":[0.000062230436,0.00022813703,0.000056367106,0.00087555754,0.000060992927,0.0013508843,0.00007141948,0.00025673385,0.000009572202],"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.0003154,0.0011687177,0.18877685,0.0024087713,0.00020250106,0.0012439773,0.11179405,0.0011360786,0.24572045,0.011128006,0.0008985118,0.43520668],"study_design_scores_gemma":[0.0003248159,0.00031918075,0.0012788856,0.00093783496,0.000032829354,0.00056759315,0.00036652846,0.050979752,0.94283825,0.0013950557,0.00011770766,0.0008415562],"about_ca_topic_score_codex":0.00047426746,"about_ca_topic_score_gemma":0.00024075127,"teacher_disagreement_score":0.6971178,"about_ca_system_score_codex":0.000077521385,"about_ca_system_score_gemma":0.0002336384,"threshold_uncertainty_score":0.93031573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033071578,0.000010607956,0.9618461,0.001628568,0.000041552114,0.00038312058,7.602404e-7,0.00044314124,0.0025745432],"genre_scores_gemma":[0.75527465,0.000004439868,0.24383543,0.00029654376,0.000040856285,0.00001226967,0.0000021242467,0.000007331796,0.0005263605],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909353,0.000019675137,0.00019400005,0.00028319535,0.00020234597,0.00020722894],"domain_scores_gemma":[0.9992344,0.000051511815,0.00010199263,0.00040865547,0.0001391229,0.00006435933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016058344,0.00012816576,0.00015452682,0.0001724744,0.000048278132,0.000040586394,0.0004591866,0.000064173146,0.0000060798156],"category_scores_gemma":[0.000018859031,0.00009683351,0.000055520355,0.0004722008,0.000018044862,0.0003291734,0.000021908681,0.000056720473,0.000001626824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009069697,0.00029567367,0.00009031587,0.000044588276,0.000017512823,0.0000013413744,0.0028109765,0.00053257024,0.07465248,0.06875703,0.0018781407,0.85082865],"study_design_scores_gemma":[0.0008266563,0.0017894205,0.0013256214,0.00016426541,0.000011246659,0.000012277621,0.00004851773,0.208058,0.76606745,0.020792518,0.0005643237,0.0003396985],"about_ca_topic_score_codex":0.00015477197,"about_ca_topic_score_gemma":0.00001493587,"teacher_disagreement_score":0.85048896,"about_ca_system_score_codex":0.00003545121,"about_ca_system_score_gemma":0.000097666605,"threshold_uncertainty_score":0.3948756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529476,0.0006519302,0.8451205,0.000047861267,0.000078283025,0.00012791665,0.00000771888,0.00023050721,0.0007877036],"genre_scores_gemma":[0.99915206,0.000024008514,0.000542123,0.00004223277,0.00004657631,0.000008830338,8.8361946e-7,0.000013870455,0.00016943752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984971,0.000042615626,0.00042838478,0.00046060802,0.0002995309,0.00027172326],"domain_scores_gemma":[0.9991899,0.00011795713,0.00018700016,0.00020315124,0.00016006385,0.00014192468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036691607,0.00021426717,0.00035938915,0.00019114726,0.0005803706,0.00054938765,0.00022167472,0.00012069131,0.0000012733958],"category_scores_gemma":[0.000009436546,0.00019914562,0.00007323585,0.0002958354,0.00011882586,0.0012555547,0.000009647308,0.00021821467,0.0000012279615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008708642,0.00016882466,0.00036937493,0.000327393,0.00003216363,0.00000849725,0.0011778015,0.0012239179,0.0056987787,0.0006507957,0.000022369468,0.9903114],"study_design_scores_gemma":[0.0010796837,0.0009298497,0.0006093488,0.0029735377,0.00011036582,0.0008243618,0.0009162373,0.91289407,0.07452788,0.0031646362,0.00055331556,0.0014166808],"about_ca_topic_score_codex":0.00005126653,"about_ca_topic_score_gemma":0.000027277143,"teacher_disagreement_score":0.9888947,"about_ca_system_score_codex":0.000042961343,"about_ca_system_score_gemma":0.000060708848,"threshold_uncertainty_score":0.81209224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14590223,0.00010576157,0.8520268,0.0007609919,0.0001860949,0.0002936753,0.000020677911,0.0002648734,0.00043890634],"genre_scores_gemma":[0.9053879,0.0002592672,0.09417791,0.00008501034,0.0000051545226,0.000027450886,0.000004697315,0.000014309906,0.000038348986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985354,0.00019986153,0.00051205343,0.00027874083,0.00027137826,0.00020256909],"domain_scores_gemma":[0.99480385,0.0026122972,0.00028751258,0.0019773,0.00023928567,0.00007978523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784763,0.00017973638,0.00028611268,0.00084019953,0.00034832023,0.000036595018,0.0011200858,0.00014507514,0.0000041408457],"category_scores_gemma":[0.00013103819,0.00019139743,0.00009791093,0.001489427,0.0002564748,0.00030936778,0.000030553678,0.00049639976,0.000008177143],"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.0005007821,0.015468157,0.0017290654,0.0009061836,0.00065733824,0.000014493638,0.020149425,0.16262907,0.048114378,0.10058801,0.0007443324,0.6484988],"study_design_scores_gemma":[0.0003848213,0.000719309,0.003396064,0.00033807938,0.000057241286,0.000011781117,0.00019229508,0.6049253,0.38544008,0.0041172025,0.00007912529,0.00033872967],"about_ca_topic_score_codex":0.0002641483,"about_ca_topic_score_gemma":0.00015796338,"teacher_disagreement_score":0.7594856,"about_ca_system_score_codex":0.00006508503,"about_ca_system_score_gemma":0.000058106256,"threshold_uncertainty_score":0.78049606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07722741,0.000020001647,0.91785806,0.0011883479,0.00052971585,0.0010596247,7.339166e-7,0.0011293528,0.0009867372],"genre_scores_gemma":[0.7381508,0.0000017815769,0.26020616,0.0003554417,0.000027082553,0.00033494513,0.0000015676727,0.0000135721475,0.0009086795],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984192,0.000062528794,0.0002994001,0.0005020892,0.00031857946,0.00039815507],"domain_scores_gemma":[0.9987502,0.00017481674,0.000110605324,0.0006676962,0.00017650281,0.00012019009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004309202,0.00017284925,0.00016348236,0.00016702848,0.00015237537,0.00023753605,0.00074619125,0.00009710028,0.00003671762],"category_scores_gemma":[0.00018923012,0.00014927836,0.000101298705,0.0002571755,0.00003472071,0.0007492794,0.00023166323,0.00011623939,0.00011962604],"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.00008161667,0.0010866908,0.12278252,0.00016665102,0.00010599227,0.00000931933,0.0030435899,0.0013964034,0.28482795,0.05973148,0.30779117,0.21897662],"study_design_scores_gemma":[0.0006099402,0.00035368593,0.019833641,0.000050387986,0.0000065980767,0.000008017894,0.00021145363,0.89066595,0.07490544,0.0083185155,0.0045870948,0.0004492987],"about_ca_topic_score_codex":0.00058280485,"about_ca_topic_score_gemma":0.00011227089,"teacher_disagreement_score":0.88926953,"about_ca_system_score_codex":0.00015424273,"about_ca_system_score_gemma":0.000041386775,"threshold_uncertainty_score":0.6087395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019319214,0.00023012403,0.97747177,0.00072497426,0.00018858581,0.0014013753,0.000011085177,0.00054523686,0.00010765946],"genre_scores_gemma":[0.82207435,0.00011988108,0.17709191,0.0001225477,0.00001560939,0.00050398003,0.0000016935777,0.00003667356,0.000033364027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978394,0.00061729545,0.000429639,0.00029992955,0.00037661052,0.00043713013],"domain_scores_gemma":[0.99469906,0.0011320845,0.00031630593,0.0035226268,0.00021621371,0.00011368549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096817,0.00028266743,0.0002715215,0.00041165884,0.0010329455,0.00008280699,0.0026855655,0.00012045583,0.000009053296],"category_scores_gemma":[0.000026613083,0.00022064286,0.00014478846,0.0015925635,0.00043223466,0.0007351404,0.000040617826,0.00062837073,0.0000093490635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048599215,0.015041312,0.0025139297,0.00042125236,0.0017000706,0.000009002936,0.08741617,0.7238988,0.095353775,0.009331106,0.00087657623,0.06295195],"study_design_scores_gemma":[0.0005705759,0.0005096197,0.0008010504,0.00054763025,0.00018104163,0.000058912105,0.0005692024,0.91471,0.08028527,0.00063676585,0.00044964728,0.0006803248],"about_ca_topic_score_codex":0.00028070377,"about_ca_topic_score_gemma":0.00007594322,"teacher_disagreement_score":0.8027551,"about_ca_system_score_codex":0.000081691636,"about_ca_system_score_gemma":0.00012457457,"threshold_uncertainty_score":0.8997555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049222517,0.00001494847,0.98954576,0.0013015108,0.0003073983,0.0005582711,6.421398e-7,0.00041793066,0.0029312677],"genre_scores_gemma":[0.75436187,0.0000018585622,0.24457377,0.00048414216,0.000035873458,0.000029186816,2.2492324e-7,0.0000090778,0.0005039687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904144,0.000059888553,0.00020525623,0.00024219502,0.00018942381,0.00026181],"domain_scores_gemma":[0.9976044,0.001598264,0.00010224692,0.0005628576,0.00008929536,0.000042885596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857365,0.00011401128,0.00013231106,0.00012287973,0.00010587399,0.000040229716,0.00093948113,0.000055309134,0.000013622385],"category_scores_gemma":[0.0002150176,0.0000706586,0.00006774275,0.00029058458,0.000046104138,0.00011211366,0.000102498,0.00008357731,0.000008565497],"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.00008932436,0.00017173841,0.00006133977,0.000023626562,0.000026097026,0.0000058526866,0.0015110058,0.000343934,0.031078853,0.91463506,0.032324504,0.019728675],"study_design_scores_gemma":[0.00020645582,0.0012199903,0.00013768076,0.00007062362,0.000005350701,0.000007394299,0.00009483439,0.107169904,0.8439431,0.045912735,0.0009998607,0.00023206907],"about_ca_topic_score_codex":0.000022429527,"about_ca_topic_score_gemma":0.0000057421494,"teacher_disagreement_score":0.8687223,"about_ca_system_score_codex":0.000027184034,"about_ca_system_score_gemma":0.000034031636,"threshold_uncertainty_score":0.2881374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011017506,0.000004678199,0.9655987,0.0011361112,0.00019249198,0.00011954306,2.66962e-7,0.0019781291,0.019952575],"genre_scores_gemma":[0.77055955,8.940898e-7,0.22721857,0.0019882533,0.000021488131,0.0000042620527,8.0334695e-7,0.0000038878197,0.00020230413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991211,0.000046843383,0.00013337124,0.00029020754,0.00020885897,0.00019959727],"domain_scores_gemma":[0.99924743,0.00013858796,0.00004683234,0.00046313624,0.000051927724,0.000052074603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897759,0.000107018874,0.00009704456,0.00013525829,0.00010439386,0.00013737258,0.00048396323,0.0000485974,0.000010817193],"category_scores_gemma":[0.00014125236,0.00009638494,0.00004617211,0.00025264747,0.00001097861,0.00030075878,0.000035099114,0.00011812152,0.000040222178],"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.00008239639,0.00090470293,0.0199888,0.000027144213,0.0000114584,0.000069005524,0.0012172167,0.00357591,0.19655566,0.26233882,0.039277673,0.4759512],"study_design_scores_gemma":[0.00017435913,0.0002748675,0.006199109,0.000043840308,0.000001446749,0.0000034841073,0.000008592566,0.90348333,0.08624497,0.0028253037,0.0005689887,0.00017171793],"about_ca_topic_score_codex":0.00003768777,"about_ca_topic_score_gemma":0.000025755618,"teacher_disagreement_score":0.8999074,"about_ca_system_score_codex":0.000068557965,"about_ca_system_score_gemma":0.000021670825,"threshold_uncertainty_score":0.39304638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4067875,0.00008421648,0.58721894,0.005095429,0.00017160182,0.00016571731,0.0000035125693,0.0003210427,0.00015201056],"genre_scores_gemma":[0.60182655,0.000053705397,0.3972572,0.0008092163,0.000013344528,0.000018351999,0.0000044322574,0.000010558296,0.000006602736],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833614,0.000241532,0.00047478586,0.00037302778,0.00032181144,0.00025272608],"domain_scores_gemma":[0.9948061,0.0005263067,0.0002912788,0.004062725,0.00024084799,0.00007273087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071509404,0.00018991291,0.00028662875,0.00023893415,0.0003978968,0.00013317964,0.0035131965,0.000057224555,0.0000019175216],"category_scores_gemma":[0.00021887905,0.00020426388,0.00013419459,0.00043457316,0.00027399443,0.0006119181,0.00081889523,0.0004028645,0.00002542471],"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.00004085869,0.00086778763,0.0042900043,0.000081747065,0.00015828546,0.000049576884,0.009489023,0.0032604213,0.8636025,0.059301138,0.014535531,0.04432309],"study_design_scores_gemma":[0.00078713393,0.000109067165,0.0058210935,0.00085371075,0.00003419043,0.000105555184,0.000085621345,0.017339602,0.9424487,0.030533968,0.0011855343,0.00069584354],"about_ca_topic_score_codex":0.00018015882,"about_ca_topic_score_gemma":0.00007730753,"teacher_disagreement_score":0.19503903,"about_ca_system_score_codex":0.0002087105,"about_ca_system_score_gemma":0.00006427933,"threshold_uncertainty_score":0.8329639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093518384,0.000020822043,0.8965354,0.0005485369,0.00014362343,0.00076814904,0.0000063623365,0.0019676094,0.0064911167],"genre_scores_gemma":[0.62771225,0.0000034299417,0.36988455,0.0014596621,0.00006729435,0.00015409663,0.000010410887,0.00005702495,0.0006512666],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970501,0.00021847471,0.000406594,0.0011283802,0.00043929362,0.00075713405],"domain_scores_gemma":[0.99657863,0.00095265807,0.0002667933,0.0015634515,0.0004207787,0.00021769114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010093388,0.00049661304,0.0005421703,0.00017743827,0.00036933305,0.0005477574,0.0015725305,0.00013490039,0.000040120565],"category_scores_gemma":[0.000109242545,0.00034380922,0.000079294514,0.00056053326,0.00017358974,0.0017309348,0.00015995748,0.00025596155,0.000021837237],"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.0015788996,0.0022538994,0.44141844,0.00065513805,0.0005938977,0.0000683021,0.011511768,0.022605289,0.030620707,0.3837122,0.084104314,0.020877134],"study_design_scores_gemma":[0.0020828517,0.0045781475,0.009883251,0.0002581737,0.00005253684,0.000063375446,0.00018096373,0.78790146,0.17029345,0.0145472735,0.008660076,0.0014984255],"about_ca_topic_score_codex":0.0004930025,"about_ca_topic_score_gemma":0.00478102,"teacher_disagreement_score":0.76529616,"about_ca_system_score_codex":0.00007856516,"about_ca_system_score_gemma":0.00019112798,"threshold_uncertainty_score":0.9999014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5832279,0.00032483536,0.39836252,0.00064584595,0.00023389202,0.0001907701,0.0000020791822,0.0012282679,0.015783913],"genre_scores_gemma":[0.7086363,0.00003575118,0.2906441,0.00012843493,0.0000096539015,0.0000034002385,1.0058493e-7,0.000006396775,0.00053588406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910265,0.00003474552,0.0002157217,0.0002835278,0.00016631625,0.00019702336],"domain_scores_gemma":[0.99921745,0.00015270255,0.000083665254,0.00041159248,0.00007171043,0.00006288051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022429584,0.00011526107,0.00016403077,0.0001514639,0.0000821343,0.000040666204,0.0004827974,0.000045062683,0.000022651317],"category_scores_gemma":[0.000081357495,0.00010059922,0.000045698507,0.0003480227,0.00005524586,0.00024463385,0.00025212514,0.00010717719,0.000010125902],"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.00001556564,0.0007109845,0.10492535,0.0001863289,0.0001633735,0.0000786152,0.011334406,0.00026098127,0.1415031,0.33234987,0.023156991,0.38531443],"study_design_scores_gemma":[0.0005935407,0.00024818402,0.0038050772,0.000120150646,0.000017675124,0.00015266969,0.00008567812,0.7520916,0.22520594,0.016292995,0.0007883065,0.00059818756],"about_ca_topic_score_codex":0.000101958474,"about_ca_topic_score_gemma":0.000055342058,"teacher_disagreement_score":0.75183064,"about_ca_system_score_codex":0.000010364846,"about_ca_system_score_gemma":0.000005907986,"threshold_uncertainty_score":0.4102317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1386772,0.0003443743,0.8568764,0.00036515578,0.00025011925,0.00040393477,0.000011822563,0.0008353484,0.002235683],"genre_scores_gemma":[0.51661456,0.00009840083,0.48300397,0.00015140774,0.000056302884,0.000022120726,0.0000039000515,0.000023683508,0.000025638226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99665904,0.00043582454,0.00075640145,0.0009692015,0.00052025187,0.0006592565],"domain_scores_gemma":[0.99690974,0.0014492194,0.00034069447,0.00083196594,0.00019308482,0.00027529136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001604879,0.000471539,0.00096498895,0.00089024345,0.00033710158,0.0001263126,0.00079798046,0.000237038,0.000017868852],"category_scores_gemma":[0.00023995311,0.00043405622,0.00012072259,0.001165295,0.000309276,0.0004541278,0.00039958808,0.00043423212,0.000004126699],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009736887,0.0006243992,0.4798553,0.0003310055,0.00018783656,0.000064012165,0.0078781415,0.00003824463,0.010362197,0.003627462,0.0053626304,0.4915714],"study_design_scores_gemma":[0.0023767857,0.0030057714,0.122474104,0.00053899863,0.00014562265,0.0001815474,0.000832218,0.31927267,0.53626233,0.011287555,0.0016615768,0.0019608017],"about_ca_topic_score_codex":0.00037744272,"about_ca_topic_score_gemma":0.00007977488,"teacher_disagreement_score":0.5259002,"about_ca_system_score_codex":0.0000522437,"about_ca_system_score_gemma":0.00010543822,"threshold_uncertainty_score":0.9998111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12659146,0.00009642477,0.5463587,0.043615606,0.0012253779,0.0028938989,0.0001305027,0.0013942925,0.27769372],"genre_scores_gemma":[0.98519754,0.00014335418,0.014243797,0.000120726974,0.000020902524,0.000047726844,0.000010617288,0.0000064887454,0.00020885808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988531,0.00002310402,0.00025293606,0.0002251553,0.00045636555,0.0001893724],"domain_scores_gemma":[0.99691826,0.00036379704,0.00038638583,0.00036552284,0.0019061951,0.000059826678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141284,0.00015664275,0.00012998361,0.00019050609,0.0009790434,0.00023764842,0.0025984508,0.00006384374,0.000017829014],"category_scores_gemma":[0.00030281988,0.00012352402,0.000084606785,0.00028157997,0.0003219039,0.0017056467,0.00081412826,0.00028402545,0.000007731111],"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.00012843094,0.00009605223,0.0009123394,0.000018240638,0.000045177665,7.2307536e-8,0.005927427,0.000021522143,0.00018114918,0.9860861,0.0005519416,0.006031601],"study_design_scores_gemma":[0.0008822776,0.00088677765,0.0011970039,0.00021069539,0.000044251847,0.0000101498745,0.0058144717,0.9565649,0.00084355526,0.027069014,0.0061177537,0.00035917625],"about_ca_topic_score_codex":0.000046543046,"about_ca_topic_score_gemma":0.000011045956,"teacher_disagreement_score":0.95901704,"about_ca_system_score_codex":0.00019774822,"about_ca_system_score_gemma":0.00003702334,"threshold_uncertainty_score":0.7530109},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25420693,0.000059356884,0.7446657,0.00017071534,0.000039882645,0.00015432574,0.0000012922776,0.0005734469,0.00012835916],"genre_scores_gemma":[0.98471236,0.000009317332,0.014935051,0.00015449419,0.000024328685,0.000020827885,7.446354e-7,0.000024542143,0.00011831467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985771,0.00008809585,0.00024133627,0.0005299167,0.00024312492,0.00032040055],"domain_scores_gemma":[0.99927336,0.00016517167,0.00012990322,0.00020576511,0.0001303617,0.000095424635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035696864,0.00025110965,0.00027320415,0.00019931461,0.0008941442,0.0005342469,0.00021976414,0.000091302994,0.0000028546422],"category_scores_gemma":[0.0000025527243,0.00023276803,0.000031593598,0.00044666664,0.00018802016,0.0006693414,0.000006736233,0.00036790088,0.000002325002],"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.0017570326,0.0033130147,0.007390935,0.0026109759,0.00026319548,0.00027399673,0.01964737,0.096047305,0.23089787,0.0018594521,0.00059773517,0.6353411],"study_design_scores_gemma":[0.000954479,0.00046021192,0.0013253787,0.00064115104,0.00004810072,0.00012368486,0.00017126581,0.5935544,0.39997327,0.0021044319,0.000027127122,0.0006165397],"about_ca_topic_score_codex":0.0002953589,"about_ca_topic_score_gemma":0.00016736778,"teacher_disagreement_score":0.73050547,"about_ca_system_score_codex":0.000048442824,"about_ca_system_score_gemma":0.0000863815,"threshold_uncertainty_score":0.94920045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39461148,0.00001564184,0.60236144,0.0011740911,0.00007177809,0.00048487177,0.0000013090404,0.00023041423,0.0010489756],"genre_scores_gemma":[0.91725916,0.0000028591678,0.08240637,0.00012945003,0.00002142645,0.000019444757,0.000003151715,0.0000061301057,0.00015199212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989952,0.00006178642,0.00026970578,0.0002901418,0.00021659344,0.00016656917],"domain_scores_gemma":[0.9985621,0.0007632131,0.00018334806,0.00034382616,0.000109704015,0.000037809536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345074,0.00012772363,0.00017422132,0.00013702952,0.00020919087,0.00006396998,0.00031779267,0.00007440948,0.000003408863],"category_scores_gemma":[0.00013511414,0.00008304543,0.000047859627,0.00022898849,0.000034569784,0.0003342586,0.000049574996,0.00010452145,0.0000032854914],"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.000013173036,0.00006466403,0.0031605347,0.000024503619,0.00001745447,0.0000018895696,0.00094350526,0.000021902508,0.0011413976,0.9610199,0.0006037949,0.03298732],"study_design_scores_gemma":[0.00044787454,0.0019719843,0.069808155,0.00034715433,0.000038829065,0.000050024944,0.000040766263,0.27880406,0.08239484,0.5654978,0.00016980765,0.0004286651],"about_ca_topic_score_codex":0.000013288957,"about_ca_topic_score_gemma":0.0000097879565,"teacher_disagreement_score":0.5226477,"about_ca_system_score_codex":0.000036137233,"about_ca_system_score_gemma":0.000024614896,"threshold_uncertainty_score":0.33864945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0385387,0.000002405231,0.9526218,0.001649784,0.0011754878,0.00085248624,0.0000010888323,0.0019537418,0.0032044759],"genre_scores_gemma":[0.6458296,3.221707e-7,0.3524228,0.00026489352,0.00010662407,0.0003051061,7.854382e-7,0.000014189349,0.001055663],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989046,0.000022662052,0.00019673738,0.00040937398,0.0001762412,0.00029041737],"domain_scores_gemma":[0.9988861,0.00008650166,0.00008828906,0.00069124793,0.00016968248,0.000078186626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054942945,0.00013622368,0.0001278878,0.00011653564,0.00014748235,0.00012781197,0.0007136738,0.00012509762,0.000025777797],"category_scores_gemma":[0.0002672537,0.00011769632,0.000098737335,0.00025170625,0.000027704387,0.0004915575,0.00015946156,0.00026711007,0.000052022966],"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.000058357247,0.0002823395,0.00063677767,0.00013673457,0.000038074304,0.000008988632,0.0014177271,0.000019129866,0.3549353,0.1516841,0.04710575,0.4436767],"study_design_scores_gemma":[0.0005620108,0.00060981815,0.0005428278,0.000041063122,0.000011118442,0.000108083645,0.000036519486,0.26579067,0.6100993,0.0639591,0.057554398,0.0006850538],"about_ca_topic_score_codex":0.00007576839,"about_ca_topic_score_gemma":0.0003449435,"teacher_disagreement_score":0.6072909,"about_ca_system_score_codex":0.000027594919,"about_ca_system_score_gemma":0.000053458243,"threshold_uncertainty_score":0.47995165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024555195,0.0000016716547,0.9708465,0.00026843528,0.0011176384,0.0011353157,5.584422e-7,0.0017974417,0.00027727222],"genre_scores_gemma":[0.49490327,1.203366e-7,0.50471276,0.000033494376,0.00007348053,0.00017414465,3.7280822e-7,0.000011507737,0.00009085552],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986902,0.000069176655,0.0002531557,0.00044419686,0.00018608347,0.0003572209],"domain_scores_gemma":[0.9985889,0.00055162644,0.00012411871,0.00042237737,0.00022583577,0.00008709431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508786,0.00015989969,0.00015280255,0.0001333398,0.00024582352,0.00016108846,0.00061952125,0.00012370537,0.000009121345],"category_scores_gemma":[0.0011715598,0.00014599909,0.000059922077,0.00026989877,0.000035673536,0.00044216512,0.00014693935,0.0003351692,0.000019492909],"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.00002733426,0.0000904228,0.00014263007,0.000040003346,0.0000110605815,0.000005648391,0.0013987139,0.0002886987,0.6795513,0.008363305,0.00034655005,0.3097343],"study_design_scores_gemma":[0.00019655688,0.00008978632,0.000061689796,0.000014585154,0.0000026647763,0.00001100094,0.000029956322,0.7225196,0.27612463,0.0006564423,0.00013403155,0.0001590839],"about_ca_topic_score_codex":0.00007388883,"about_ca_topic_score_gemma":0.00006743993,"teacher_disagreement_score":0.72223085,"about_ca_system_score_codex":0.000033080356,"about_ca_system_score_gemma":0.00006488154,"threshold_uncertainty_score":0.595367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002447069,0.000020888709,0.97177464,0.0006829791,0.0003302036,0.0003445335,0.0000013005655,0.00073498645,0.02366342],"genre_scores_gemma":[0.6834879,0.00010447988,0.31523177,0.00029031638,0.000023519644,0.000017272503,7.225554e-7,0.00001383727,0.00083020085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.0002448069,0.00019347703,0.00039726892,0.00031412675,0.00016064965],"domain_scores_gemma":[0.9973283,0.00094780483,0.00019644194,0.001374431,0.00012306226,0.00002998794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048104662,0.00018632205,0.00022017455,0.00012727722,0.00007176421,0.000042521042,0.002549576,0.00015382112,0.00001791934],"category_scores_gemma":[0.00014795338,0.00012424256,0.00010124248,0.00017173437,0.000095846364,0.000058283815,0.001477253,0.00049373216,0.000017926195],"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.000028692824,0.00019854144,0.00009409999,0.000054324817,0.000100271805,0.000059904425,0.0035445935,0.021881625,0.0011083522,0.8516723,0.11074748,0.010509818],"study_design_scores_gemma":[0.00018936109,0.00055130874,0.00023536224,0.0005656004,0.000024180868,0.0000478008,0.00011193399,0.61570895,0.14675654,0.23396584,0.00091977004,0.000923365],"about_ca_topic_score_codex":0.00021956245,"about_ca_topic_score_gemma":0.000006291516,"teacher_disagreement_score":0.6810408,"about_ca_system_score_codex":0.00007199998,"about_ca_system_score_gemma":0.0002151637,"threshold_uncertainty_score":0.5066465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6276616,0.00026370675,0.36654687,0.0017923091,0.00028488712,0.00015388943,0.0000014517491,0.0006592368,0.0026360904],"genre_scores_gemma":[0.92053485,0.000050026414,0.078412,0.000326869,0.000062276435,0.000005529319,2.5701792e-7,0.000009149417,0.00059903803],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986844,0.00014711835,0.00021902585,0.00032225682,0.00036958675,0.00025757824],"domain_scores_gemma":[0.9986984,0.0002995661,0.0001469479,0.00069694803,0.00008976962,0.00006835652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029464,0.00015970542,0.00019424854,0.000085882384,0.0002902828,0.000037985068,0.0012886563,0.0000756299,0.000021744954],"category_scores_gemma":[0.00010482421,0.00010565122,0.00009337662,0.00041878127,0.00011787959,0.00042362837,0.00031251126,0.0002659629,0.000009389252],"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.000053177107,0.00043540157,0.06402179,0.00020128193,0.00019352492,0.00022866127,0.05997601,0.0021800892,0.52431667,0.08315644,0.2200524,0.045184575],"study_design_scores_gemma":[0.0006706144,0.0009893773,0.12422454,0.00045595004,0.000039089096,0.0010796664,0.0006058962,0.062918305,0.7809451,0.020732813,0.0057840436,0.0015545882],"about_ca_topic_score_codex":0.0011271039,"about_ca_topic_score_gemma":0.0002100157,"teacher_disagreement_score":0.2928733,"about_ca_system_score_codex":0.000033631524,"about_ca_system_score_gemma":0.00013806218,"threshold_uncertainty_score":0.43083316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82862884,0.000024546094,0.14768603,0.0006893526,0.0021744743,0.0010980333,0.000044538247,0.0014687806,0.018185422],"genre_scores_gemma":[0.98192674,0.0000069707103,0.01713269,0.0005175476,0.00017299085,0.00005310397,0.000026740485,0.000065663626,0.00009755319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9948507,0.000022268963,0.0011714153,0.0013429249,0.0018431961,0.0007694959],"domain_scores_gemma":[0.99443436,0.001050249,0.0011416653,0.0002140856,0.002893908,0.00026571561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023068811,0.00064360345,0.0005792272,0.0010586714,0.0002572882,0.00036160238,0.0023062306,0.00031719691,0.000017941937],"category_scores_gemma":[0.003123745,0.00061633554,0.0002387754,0.0013503309,0.000165511,0.0009596786,0.0004311172,0.00071852596,0.000056601857],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023031686,0.0029539214,0.25913775,0.0003262857,0.0005327722,0.000022448552,0.006761599,0.0018885181,0.24258667,0.46142745,0.003651715,0.018407686],"study_design_scores_gemma":[0.00376082,0.004047873,0.4893568,0.00095132936,0.000055623936,0.000117412485,0.00044574318,0.34212723,0.140367,0.016241128,0.00016417836,0.0023648562],"about_ca_topic_score_codex":0.00021883308,"about_ca_topic_score_gemma":0.000023776376,"teacher_disagreement_score":0.44518635,"about_ca_system_score_codex":0.00049371785,"about_ca_system_score_gemma":0.000053849635,"threshold_uncertainty_score":0.9996288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02023402,0.000014483741,0.9761863,0.00064812065,0.0003223369,0.00035082194,0.0000020341133,0.00073336996,0.0015085349],"genre_scores_gemma":[0.47781226,0.0000010538865,0.5211176,0.00046801334,0.00007884766,0.00000932887,0.0000065259683,0.000005452892,0.00050085393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988285,0.000021679263,0.00025920995,0.0003294118,0.00024021613,0.00032101438],"domain_scores_gemma":[0.99908346,0.00024400416,0.00009022364,0.0002947115,0.00018216789,0.00010545403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089974666,0.000114019655,0.000120259625,0.00009391009,0.0001444558,0.00007869298,0.00041112368,0.000062814324,0.000054199212],"category_scores_gemma":[0.000061418075,0.000113264985,0.00007091011,0.00020084203,0.00002035465,0.00035819356,0.00014438962,0.0000876116,0.000019314952],"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.000048584905,0.00011515903,0.027978614,0.000036569974,0.00004315184,0.000007865852,0.0015424874,0.000011020394,0.018327057,0.67324644,0.12207357,0.15656948],"study_design_scores_gemma":[0.0018886051,0.00046326293,0.087710075,0.000044267785,0.000028611881,0.00008087152,0.00056048384,0.036325768,0.68443644,0.17370276,0.013779066,0.000979797],"about_ca_topic_score_codex":0.0007355261,"about_ca_topic_score_gemma":0.002216665,"teacher_disagreement_score":0.6661094,"about_ca_system_score_codex":0.000108300635,"about_ca_system_score_gemma":0.00016060534,"threshold_uncertainty_score":0.46188122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17226985,0.00019027587,0.81974334,0.005725012,0.0003240894,0.00016448738,8.003454e-7,0.0009131433,0.0006689869],"genre_scores_gemma":[0.49127927,0.00007164678,0.50691414,0.0016541616,0.000024847028,0.000018642182,0.0000018134181,0.000017167033,0.000018287596],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.0002321584,0.00033515444,0.00035407604,0.00024696306,0.00035416507],"domain_scores_gemma":[0.99532235,0.0002883221,0.00017279756,0.004028869,0.000097868826,0.00008982027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037243846,0.00018656645,0.00018479867,0.00028039297,0.0009505156,0.000101278376,0.0043187435,0.00006905651,0.000003963653],"category_scores_gemma":[0.00007298895,0.00021636793,0.000111772635,0.0006966193,0.00027200315,0.00069967675,0.0006822501,0.00036338443,0.000035884903],"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.000017727589,0.0008445613,0.04359532,0.00007563468,0.00032622312,0.00023435794,0.021107696,0.059359968,0.702398,0.019303393,0.107066244,0.045670863],"study_design_scores_gemma":[0.00042756944,0.00003756441,0.0020165297,0.00015995503,0.000026636417,0.0007879329,0.00010805696,0.9594716,0.027539153,0.0006894876,0.0077043795,0.0010311414],"about_ca_topic_score_codex":0.00016867276,"about_ca_topic_score_gemma":0.000051420426,"teacher_disagreement_score":0.9001116,"about_ca_system_score_codex":0.000213165,"about_ca_system_score_gemma":0.000078953635,"threshold_uncertainty_score":0.88232285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07869459,0.002274572,0.90338403,0.006108234,0.0026921465,0.002574288,0.0003177674,0.00091635715,0.0030379966],"genre_scores_gemma":[0.996294,0.000053800002,0.00038084565,0.001210912,0.00023763246,0.00016020627,0.00002103745,0.00006158587,0.0015799628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970311,0.00019753791,0.0006249887,0.00084974285,0.0005906767,0.0007059903],"domain_scores_gemma":[0.9975091,0.0006195855,0.0003183947,0.0009436459,0.0003130372,0.0002962303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008950531,0.0004896704,0.0004855082,0.00025482758,0.0008943583,0.00044664912,0.000744191,0.00026141934,0.0000063560074],"category_scores_gemma":[0.00017557609,0.00037964128,0.00013889912,0.00044938992,0.00028265498,0.0004778526,0.00008095633,0.00041307847,0.000021153588],"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.00046796774,0.0014513141,0.0025600698,0.0007126197,0.0005791293,0.00016586894,0.054067947,0.21804653,0.00017595227,0.5809033,0.10763513,0.033234194],"study_design_scores_gemma":[0.051244315,0.016900206,0.032543086,0.042985477,0.0013870155,0.008927217,0.08439589,0.24846298,0.0017284455,0.24613169,0.23814249,0.02715118],"about_ca_topic_score_codex":0.00028373455,"about_ca_topic_score_gemma":0.00033043613,"teacher_disagreement_score":0.91759944,"about_ca_system_score_codex":0.00019977536,"about_ca_system_score_gemma":0.00023070128,"threshold_uncertainty_score":0.99986553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39361155,0.000044941673,0.5795151,0.00064033346,0.0014211077,0.00041183011,8.716555e-7,0.001647811,0.022706429],"genre_scores_gemma":[0.72061884,0.0000046218192,0.27319357,0.00090625376,0.00018980529,0.00003054728,0.0000018932595,0.000036721493,0.005017741],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99691755,0.00011688439,0.00070570735,0.0008659698,0.00047419584,0.0009197192],"domain_scores_gemma":[0.9979077,0.0003471413,0.000163581,0.0012185783,0.00014990712,0.00021308064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016555676,0.00035648944,0.00037960205,0.00055793877,0.00010395723,0.00021326382,0.0017133816,0.00024098298,0.00011559022],"category_scores_gemma":[0.00027668383,0.0003401141,0.00014517266,0.0010974915,0.00006666089,0.0005233704,0.00067392574,0.000442513,0.00027299733],"study_design_candidate":"bench_or_experimental","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.0010146901,0.0031938576,0.09049976,0.00024780352,0.0002445266,0.0011017811,0.03185954,0.0004016405,0.31963792,0.051817816,0.14899446,0.3509862],"study_design_scores_gemma":[0.007498724,0.0017312184,0.0333452,0.00082648307,0.00006223886,0.0011273391,0.0010714836,0.056584824,0.66450197,0.019049875,0.20794584,0.006254788],"about_ca_topic_score_codex":0.0013759435,"about_ca_topic_score_gemma":0.020837782,"teacher_disagreement_score":0.34486407,"about_ca_system_score_codex":0.00022345754,"about_ca_system_score_gemma":0.00012289546,"threshold_uncertainty_score":0.9999051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18960229,0.000010759094,0.79890645,0.0001982497,0.0006353843,0.000112182504,4.3113457e-7,0.00080056104,0.009733711],"genre_scores_gemma":[0.7512942,7.2307074e-7,0.24822348,0.00008785414,0.000029100209,0.0000068309705,2.832882e-7,0.000009120816,0.00034839654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892545,0.000026998054,0.00025712536,0.00031309665,0.00024220531,0.00023514415],"domain_scores_gemma":[0.9986404,0.00030908428,0.00012592445,0.0007482338,0.000104643485,0.00007167988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310575,0.00012653922,0.00017916807,0.00014362927,0.00007041336,0.000057976125,0.0009256193,0.000093870614,0.00007850825],"category_scores_gemma":[0.0003548648,0.00011347056,0.000069979156,0.000307645,0.00006275099,0.0003257638,0.00032353995,0.00028762553,0.000026971164],"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.000010863582,0.00014576067,0.0047019357,0.000035282264,0.000027810584,0.000012995566,0.001328388,0.000075646436,0.43338442,0.5197241,0.005050235,0.035502598],"study_design_scores_gemma":[0.00065774116,0.00032273793,0.008614625,0.00015663574,0.000026041718,0.0001420119,0.0000666355,0.42198205,0.5162067,0.04950117,0.0013650218,0.00095861004],"about_ca_topic_score_codex":0.00022731927,"about_ca_topic_score_gemma":0.00040671046,"teacher_disagreement_score":0.56169194,"about_ca_system_score_codex":0.000018365346,"about_ca_system_score_gemma":0.00005236698,"threshold_uncertainty_score":0.46271953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013022044,0.000052902244,0.98503596,0.000018607534,0.00016230148,0.00012612222,0.0000021440574,0.00060724793,0.0009726515],"genre_scores_gemma":[0.8662999,0.0000018556659,0.13356361,0.000050281753,0.0000116773645,0.000020614774,1.2907165e-7,0.000017254732,0.00003466876],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872667,0.000052016665,0.0003349173,0.00034626387,0.0002795428,0.00026058432],"domain_scores_gemma":[0.99917215,0.00012039365,0.00017547629,0.0002839697,0.00017083122,0.000077150355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029302688,0.00017235249,0.00020447078,0.00028438153,0.0002394108,0.000054266144,0.0005941327,0.000081210455,0.00003372348],"category_scores_gemma":[0.0000057205634,0.00017153843,0.000090695576,0.0005444851,0.000076356606,0.0005894314,0.000003976596,0.00027168778,0.000011213061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013547385,0.00051784737,0.000024767613,0.0001243736,0.00006315096,0.000017062235,0.009331552,0.009982212,0.051452283,0.00063100475,0.000031388197,0.9276889],"study_design_scores_gemma":[0.00023205738,0.00038653272,0.00003146292,0.00032568432,0.00004013571,0.00005153542,0.00014628086,0.36466703,0.63062245,0.0031665158,0.0000042481934,0.00032604754],"about_ca_topic_score_codex":0.000056022312,"about_ca_topic_score_gemma":0.000023176259,"teacher_disagreement_score":0.92736286,"about_ca_system_score_codex":0.000051487983,"about_ca_system_score_gemma":0.00011499362,"threshold_uncertainty_score":0.69951344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008114271,0.00004085046,0.9899843,0.00008358306,0.00022726181,0.0004275451,9.907046e-7,0.000686706,0.00043450564],"genre_scores_gemma":[0.56030464,0.000012715688,0.4393426,0.000070205686,0.000028473109,0.000016887505,4.890603e-7,0.000008207264,0.00021581592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989488,0.00007319194,0.00024342322,0.00030814143,0.00017039965,0.00025605055],"domain_scores_gemma":[0.9985899,0.00055561116,0.00013597953,0.00044374538,0.00022351053,0.00005129742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035302818,0.00013478218,0.00024797165,0.00008269403,0.000109477565,0.000017141347,0.0007684127,0.00008351647,0.0000045822694],"category_scores_gemma":[0.000042545184,0.000119973745,0.000069294794,0.00029826554,0.000079899466,0.0002291234,0.00014417629,0.00009449317,0.000002666319],"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.00045610187,0.0006874657,0.002025843,0.00006163657,0.00022082965,0.00006640032,0.0047127297,0.10857441,0.02518801,0.6844079,0.08246269,0.091135986],"study_design_scores_gemma":[0.0002361794,0.00043161362,0.00026553625,0.000026505233,0.000005077988,0.0000201414,0.000020153082,0.9134943,0.08164412,0.0036267906,0.000041387513,0.00018823089],"about_ca_topic_score_codex":0.00015364759,"about_ca_topic_score_gemma":0.000014004049,"teacher_disagreement_score":0.80491984,"about_ca_system_score_codex":0.000034220833,"about_ca_system_score_gemma":0.0000663371,"threshold_uncertainty_score":0.48923874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009048758,0.00019372313,0.9752122,0.00037612446,0.00013216231,0.00020829702,0.0000014993486,0.0005764691,0.014250777],"genre_scores_gemma":[0.8633605,0.000018051272,0.13643645,0.00011516854,0.000007482478,0.000022535913,3.635199e-7,0.00000733392,0.0000320581],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991374,0.00005068509,0.00021794604,0.0002488821,0.00016704491,0.00017803929],"domain_scores_gemma":[0.9992468,0.000043199478,0.00011962861,0.0004343576,0.00011314067,0.000042893433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026017035,0.00009705489,0.0001374551,0.00009856557,0.00003366771,0.000011594075,0.00057614065,0.000039838706,0.000060949766],"category_scores_gemma":[0.000017202778,0.00008866372,0.000054974586,0.00008542938,0.000021742808,0.00034914166,0.00009602587,0.000056510413,0.00000919468],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002250017,0.0001537495,0.0064295297,0.0000522934,0.000069537724,0.0000076235915,0.022747187,0.000012773109,0.004067763,0.21553336,0.0011174667,0.7497862],"study_design_scores_gemma":[0.0030425703,0.0015547164,0.06333497,0.000108256194,0.00006738184,0.00004869999,0.0045860643,0.19612925,0.46557033,0.26366732,0.00060834415,0.0012820923],"about_ca_topic_score_codex":0.0001849728,"about_ca_topic_score_gemma":0.00047608043,"teacher_disagreement_score":0.8543118,"about_ca_system_score_codex":0.00002131043,"about_ca_system_score_gemma":0.000033269367,"threshold_uncertainty_score":0.36156017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053100626,0.000022736689,0.982385,0.00015249914,0.00012781144,0.00052609557,3.9079785e-7,0.0003098194,0.015944682],"genre_scores_gemma":[0.2102004,0.0000010372029,0.7890044,0.00030022764,0.000024322948,0.00008828785,2.8790762e-7,0.000008576734,0.00037246547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916685,0.000063393825,0.00014254477,0.0003147521,0.00011713913,0.00019534341],"domain_scores_gemma":[0.99918056,0.00026768108,0.00005139408,0.0004245006,0.000027362401,0.000048531074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081083144,0.00010378702,0.00011717581,0.000106237814,0.00007029972,0.000107985485,0.0005279085,0.000045670724,0.0000038620237],"category_scores_gemma":[0.00005717568,0.00006915483,0.000029509036,0.00021568421,0.000013919392,0.00014322487,0.00009871159,0.00010049847,0.0000026217124],"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.00004862374,0.00030552415,0.006296187,0.0001611593,0.000028887946,0.000016696069,0.0077995784,0.00020491311,0.0004516226,0.28514093,0.021660808,0.67788506],"study_design_scores_gemma":[0.00015545724,0.00008111067,0.00018524464,0.00003661733,0.0000019049487,0.0000064231026,0.0000684023,0.996615,0.0014553543,0.0011065606,0.00018210642,0.000105822815],"about_ca_topic_score_codex":0.000855201,"about_ca_topic_score_gemma":0.000025213049,"teacher_disagreement_score":0.9964101,"about_ca_system_score_codex":0.000035900688,"about_ca_system_score_gemma":0.000045714616,"threshold_uncertainty_score":0.2820052},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8099101,0.00008338928,0.17262359,0.00010758543,0.00015619198,0.00012797167,5.478183e-7,0.000826853,0.016163763],"genre_scores_gemma":[0.92690843,0.0000133614785,0.07213429,0.00005136468,0.000015421374,0.000007690191,5.73632e-7,0.000007792417,0.00086109096],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988723,0.0000504496,0.00030264974,0.0002881017,0.00027848047,0.00020805147],"domain_scores_gemma":[0.9990687,0.0001386049,0.000073401345,0.0005441811,0.00011718929,0.000057939873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017931,0.00012089966,0.00028132315,0.000090476955,0.000120217745,0.000014111336,0.00081166165,0.000061040075,0.000015018191],"category_scores_gemma":[0.000036476828,0.00010798585,0.00006445047,0.00030024155,0.000080413425,0.0001567819,0.00041790388,0.00011219658,0.000024780276],"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.00004153335,0.0009654625,0.7350739,0.00008234096,0.000077519435,0.00009801213,0.011648029,0.0004622017,0.11623972,0.023145745,0.079245485,0.032920014],"study_design_scores_gemma":[0.00009162253,0.00015583966,0.007266087,0.000021823585,0.0000038890867,0.000117545984,0.00005366835,0.051321726,0.9390341,0.00015414278,0.0015552649,0.00022425925],"about_ca_topic_score_codex":0.00008358303,"about_ca_topic_score_gemma":0.00012429272,"teacher_disagreement_score":0.8227944,"about_ca_system_score_codex":0.0000492943,"about_ca_system_score_gemma":0.000043487416,"threshold_uncertainty_score":0.4403535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034667,0.000042530286,0.97796917,0.000117563824,0.00008986458,0.00017127299,4.0908958e-8,0.00016524298,0.0010976198],"genre_scores_gemma":[0.71282727,1.6278616e-7,0.2871074,0.000026280737,0.000003669002,0.000007965773,8.232465e-8,0.0000017768907,0.000025420342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993255,0.00010732648,0.00008472126,0.00012482716,0.00029190132,0.00006570678],"domain_scores_gemma":[0.99939096,0.00010213282,0.000042247106,0.00020919833,0.00021595835,0.000039487208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677909,0.00004243557,0.00005681915,0.000055390366,0.000012595598,0.000018625888,0.00019393726,0.000019282354,0.000003311909],"category_scores_gemma":[0.0002151189,0.000037070033,0.0000075833136,0.00011555678,0.000017101078,0.00016822055,0.00008139382,0.000028268747,0.0000032596035],"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.00004314899,0.00018421284,0.00056691526,0.000033744327,0.000045954293,0.0000035746493,0.015221992,0.076147825,0.0158458,0.02820842,0.029044341,0.8346541],"study_design_scores_gemma":[0.0001438171,0.00011059222,0.00015450592,0.000009869795,0.0000058234305,0.0000059913805,0.000029154417,0.9784222,0.006947098,0.014115504,0.000004650862,0.000050781196],"about_ca_topic_score_codex":0.00003035228,"about_ca_topic_score_gemma":0.000002941963,"teacher_disagreement_score":0.90227437,"about_ca_system_score_codex":0.000028302999,"about_ca_system_score_gemma":0.00008192269,"threshold_uncertainty_score":0.1511672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056295075,0.0002390549,0.9414684,0.00046371113,0.00016222996,0.00018862511,0.000014021282,0.00047881115,0.0006900522],"genre_scores_gemma":[0.7380178,0.00008861963,0.26178026,0.000039249866,0.0000068690874,0.00003321008,0.0000031463107,0.000012751278,0.000018066412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988275,0.00020310789,0.00030450235,0.0002621219,0.00022451232,0.00017825075],"domain_scores_gemma":[0.9972454,0.00016491815,0.0001282746,0.002174996,0.00014347286,0.00014295834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090541,0.0001487532,0.00017442886,0.00025471018,0.00038451873,0.00008152509,0.0014949043,0.00004639185,0.000003748449],"category_scores_gemma":[0.000015179064,0.00015932991,0.000054379012,0.0003193282,0.00016882125,0.000737402,0.000032127704,0.00034191218,0.0000055275354],"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.00010537033,0.0041913544,0.0025927967,0.000122853,0.00033076477,0.000013028987,0.014778713,0.0018967728,0.5280102,0.027001435,0.00047619423,0.42048052],"study_design_scores_gemma":[0.00080048403,0.00072589936,0.00074371655,0.00023131941,0.00005516246,0.00023175144,0.00058417267,0.25984797,0.7248945,0.010206044,0.0009971189,0.00068184384],"about_ca_topic_score_codex":0.00042186162,"about_ca_topic_score_gemma":0.00022008592,"teacher_disagreement_score":0.68172276,"about_ca_system_score_codex":0.00010570482,"about_ca_system_score_gemma":0.00007186153,"threshold_uncertainty_score":0.6497285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25677732,0.0010524808,0.72619116,0.003920004,0.00028784023,0.00051529164,0.0000041309736,0.0011449353,0.010106853],"genre_scores_gemma":[0.85162175,0.00003491821,0.147744,0.00024118765,0.000013644977,0.000009758521,0.0000028125423,0.000009275669,0.00032264675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991759,0.00006311934,0.00016415569,0.00026730014,0.00016035096,0.00016916064],"domain_scores_gemma":[0.9988717,0.00006955652,0.00009495429,0.00070849806,0.00014058597,0.00011471046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106283,0.000119109274,0.0001414889,0.0001070308,0.0001910963,0.00018318527,0.00047247187,0.00007681771,0.0000021645965],"category_scores_gemma":[0.000067070454,0.00011119281,0.000015146932,0.0002195713,0.00010450574,0.0007144667,0.00059250096,0.00014129246,0.0000021262813],"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.00006750169,0.0007461324,0.111545295,0.00030541274,0.00018339271,0.00004559394,0.09868774,0.00023167257,0.016175222,0.687784,0.04172232,0.042505722],"study_design_scores_gemma":[0.00037115513,0.00011208522,0.005346659,0.00009299844,0.000015234597,0.000074806885,0.0006351952,0.97939277,0.002349869,0.009462538,0.0018655356,0.00028117248],"about_ca_topic_score_codex":0.0007406539,"about_ca_topic_score_gemma":0.0005206325,"teacher_disagreement_score":0.9791611,"about_ca_system_score_codex":0.00006188074,"about_ca_system_score_gemma":0.000054732292,"threshold_uncertainty_score":0.4534311},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09992921,0.000031081076,0.8203652,0.0026737747,0.0008263017,0.00025735513,0.000001581094,0.0031043307,0.072811164],"genre_scores_gemma":[0.8082559,0.0000015786868,0.18739672,0.002690323,0.00007723843,0.0000142783665,0.0000014026273,0.000018122944,0.0015443971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983858,0.0001665353,0.00022372356,0.00050233,0.00033675527,0.0003848402],"domain_scores_gemma":[0.998381,0.00012042908,0.00008170219,0.0010129509,0.00017392178,0.00022995335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009229756,0.00019376303,0.00018695867,0.00014460138,0.000095205265,0.00017701497,0.0012067375,0.00007882988,0.00003696808],"category_scores_gemma":[0.00026070312,0.00016602562,0.00006825477,0.00040321864,0.000055617904,0.00043428433,0.00040061167,0.000237019,0.000649497],"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.00010310988,0.0008870309,0.006734346,0.000049344322,0.000052797925,0.00021048411,0.0049121473,0.0003713193,0.004625946,0.65630263,0.272182,0.053568847],"study_design_scores_gemma":[0.0020518692,0.0017604487,0.012275774,0.00022091542,0.000021544733,0.00018239072,0.00023500988,0.28814125,0.22107315,0.42954308,0.042085845,0.0024087154],"about_ca_topic_score_codex":0.00041013872,"about_ca_topic_score_gemma":0.00021478097,"teacher_disagreement_score":0.7083267,"about_ca_system_score_codex":0.00012585866,"about_ca_system_score_gemma":0.00012748242,"threshold_uncertainty_score":0.8348186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67102194,0.00022806675,0.27121073,0.01570403,0.0047196858,0.001693232,0.0003301401,0.0008725976,0.034219608],"genre_scores_gemma":[0.9923979,0.00031471872,0.0029587587,0.00065796124,0.00037321297,0.000053386982,0.00014087243,0.00004153516,0.0030616312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624115,0.00013556145,0.0010140936,0.0012002197,0.0008648714,0.00054407574],"domain_scores_gemma":[0.99714184,0.00049047364,0.0007706181,0.0004604094,0.0009708435,0.00016583785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006767044,0.0006005409,0.00063127023,0.0004650398,0.0003452399,0.0004747628,0.001232201,0.0003621972,0.000056435532],"category_scores_gemma":[0.00021036176,0.0005957075,0.00021238915,0.00028081704,0.0002918116,0.0006605299,0.0003938243,0.0006149857,0.00001247385],"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.0009108337,0.0012105546,0.018974964,0.0002625774,0.000955147,0.000082861116,0.007225417,0.010019685,0.026422527,0.9210842,0.004404693,0.008446514],"study_design_scores_gemma":[0.003173369,0.0010793273,0.0051029744,0.0016134983,0.00010890519,0.00015151367,0.00042964143,0.76905656,0.15029922,0.06415744,0.0031488112,0.0016787372],"about_ca_topic_score_codex":0.0005124231,"about_ca_topic_score_gemma":0.00011170009,"teacher_disagreement_score":0.8569268,"about_ca_system_score_codex":0.0002688259,"about_ca_system_score_gemma":0.000083408806,"threshold_uncertainty_score":0.9996494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031914264,0.00013275212,0.9864825,0.00069827266,0.0006229231,0.00051024224,6.4740044e-7,0.00088662637,0.007474594],"genre_scores_gemma":[0.73102754,0.000020729427,0.26644975,0.00079190586,0.00005415748,0.00006758271,5.6225144e-7,0.000018816301,0.0015689611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984343,0.0001483363,0.00023821005,0.00047857533,0.0002463218,0.00045423288],"domain_scores_gemma":[0.9974675,0.0013426252,0.000104736704,0.0008463861,0.00015942412,0.000079323145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014614307,0.00020594303,0.00021068093,0.00007582287,0.00044783973,0.00022543065,0.0010094432,0.000106038395,0.000008024051],"category_scores_gemma":[0.00050808606,0.00015120023,0.0001325771,0.00037317377,0.00006008184,0.00033338976,0.00019127363,0.00022937336,0.000026095113],"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.000067089895,0.0006996516,0.0064328434,0.00022971212,0.00027142448,0.000044837274,0.006501134,0.0008894306,0.027776599,0.86513036,0.061793357,0.03016358],"study_design_scores_gemma":[0.00046949633,0.00026442506,0.0007872258,0.00009211997,0.000038162252,0.00008039491,0.00033104754,0.09866943,0.83922315,0.05104061,0.008258804,0.00074510695],"about_ca_topic_score_codex":0.00013282156,"about_ca_topic_score_gemma":0.00014970469,"teacher_disagreement_score":0.8140897,"about_ca_system_score_codex":0.000058550624,"about_ca_system_score_gemma":0.00008495123,"threshold_uncertainty_score":0.6165767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039059254,0.00029052806,0.99014336,0.0034819222,0.0001552184,0.0004326945,0.0000011555566,0.00053569494,0.0010535172],"genre_scores_gemma":[0.71031153,0.000014025876,0.28843948,0.00048234864,0.00005570483,0.000046440942,8.6684395e-7,0.000019376046,0.0006302516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00002378018,0.00011937169,0.00032805107,0.00019088529,0.00026402916],"domain_scores_gemma":[0.99898666,0.000099307355,0.0000741816,0.0005782787,0.00015688052,0.0001046825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004965295,0.0001405135,0.0001424627,0.000060576338,0.0002906131,0.00018789092,0.0005245194,0.00005639385,7.758525e-7],"category_scores_gemma":[0.000044555287,0.000083118415,0.00003093733,0.00028162764,0.00008875593,0.0003731102,0.00016628444,0.00011895607,0.0000012297953],"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.00021117834,0.00026637278,0.007134053,0.00021281917,0.0002004291,0.00007891911,0.03425971,0.003312812,0.001878361,0.807661,0.13783778,0.0069465586],"study_design_scores_gemma":[0.0005464491,0.00041149446,0.00016879775,0.00014020909,0.000046216162,0.00025301793,0.0008392432,0.93443847,0.006039483,0.04879414,0.007926006,0.00039647202],"about_ca_topic_score_codex":0.00047644242,"about_ca_topic_score_gemma":0.00030855084,"teacher_disagreement_score":0.93112564,"about_ca_system_score_codex":0.00003432095,"about_ca_system_score_gemma":0.00009046356,"threshold_uncertainty_score":0.33894706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027481163,0.00064787996,0.95240784,0.011314727,0.0008559645,0.0005606882,0.000019063773,0.00077265705,0.00594001],"genre_scores_gemma":[0.75315785,0.00014247547,0.24600087,0.00046202925,0.00006868357,0.00005272907,0.000007692927,0.000020614185,0.00008703273],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998278,0.0004131753,0.0004586779,0.0002163427,0.00029485795,0.0003389011],"domain_scores_gemma":[0.9960898,0.00086434954,0.00028084658,0.0016370292,0.0009171032,0.00021083596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011700415,0.00016702843,0.00022101121,0.000438979,0.00039845545,0.0002845904,0.0035427741,0.00009834051,0.000001851476],"category_scores_gemma":[0.0010799868,0.00016503352,0.00007962241,0.0011048912,0.00007812366,0.00047296306,0.00019820225,0.00082800275,0.000011714387],"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.0005686888,0.0070213554,0.07812066,0.000072559444,0.00055350235,0.00010041536,0.03567904,0.010034765,0.018124891,0.19688804,0.4237226,0.2291135],"study_design_scores_gemma":[0.006057782,0.0031730677,0.011315867,0.0014470752,0.000099697485,0.002388598,0.0015843797,0.6392524,0.025083562,0.14614667,0.16080314,0.0026477554],"about_ca_topic_score_codex":0.000112522226,"about_ca_topic_score_gemma":0.001227341,"teacher_disagreement_score":0.7256767,"about_ca_system_score_codex":0.00040511828,"about_ca_system_score_gemma":0.00047276745,"threshold_uncertainty_score":0.67298716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009255076,0.00006256521,0.9718948,0.0066890344,0.001658576,0.0010754834,0.00012111229,0.00059189193,0.008651485],"genre_scores_gemma":[0.9572184,0.00010866785,0.03667216,0.000579891,0.0004594752,0.00025664378,0.00022295171,0.000072523515,0.004409267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959937,0.00013660725,0.0010052174,0.0011379888,0.0011297476,0.00059675344],"domain_scores_gemma":[0.99694425,0.00046785385,0.00088938477,0.0005193528,0.0010266167,0.00015252487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076585915,0.00065438345,0.00058908865,0.00066982716,0.00033085028,0.00046643912,0.0015375114,0.00035810724,0.000043237556],"category_scores_gemma":[0.00011073626,0.00060381956,0.0001797663,0.00035852063,0.00018547279,0.0006996537,0.00024353873,0.00057020545,0.000017907892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017559429,0.0023682634,0.00093883096,0.0002823699,0.0013962545,0.00012118119,0.007016631,0.44521278,0.013779224,0.44376972,0.0074491412,0.07590965],"study_design_scores_gemma":[0.0015671725,0.0009182517,0.00016900478,0.0008092378,0.00005249617,0.00009105474,0.00010881508,0.94095707,0.035054386,0.01837558,0.0011685549,0.00072836387],"about_ca_topic_score_codex":0.0002636675,"about_ca_topic_score_gemma":0.000022531589,"teacher_disagreement_score":0.94796336,"about_ca_system_score_codex":0.00034834002,"about_ca_system_score_gemma":0.00011063576,"threshold_uncertainty_score":0.9996413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024738724,0.00006344995,0.98633564,0.00039127035,0.00033757745,0.00037845748,0.0000044064936,0.0017969105,0.00821845],"genre_scores_gemma":[0.24290748,0.0000025556126,0.7561527,0.00017582095,0.00017243113,0.000058909143,0.000002254643,0.00001797516,0.0005099131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851596,0.00003250637,0.00028148506,0.00049934693,0.00021954441,0.00045114267],"domain_scores_gemma":[0.9988771,0.00027214785,0.00010307436,0.00047770506,0.00020316432,0.000066778055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040389784,0.00019187962,0.00020187133,0.00013560685,0.00018051144,0.00011085307,0.0008045363,0.00009127661,0.000005939886],"category_scores_gemma":[0.000053159918,0.00017802049,0.00011624108,0.00031574463,0.000030307841,0.00032642344,0.00022535026,0.00012712332,0.000028421142],"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.00006273488,0.0007442101,0.002733161,0.00008319971,0.00011139827,0.000067034154,0.001157991,0.0008495438,0.011595233,0.25682798,0.071711436,0.6540561],"study_design_scores_gemma":[0.00039916756,0.0003431036,0.0002007989,0.000041197134,0.000012176894,0.000042551364,0.00005863812,0.7917759,0.09992685,0.10228574,0.004441599,0.00047226663],"about_ca_topic_score_codex":0.000345496,"about_ca_topic_score_gemma":0.00020162879,"teacher_disagreement_score":0.7909264,"about_ca_system_score_codex":0.00007361441,"about_ca_system_score_gemma":0.000060950242,"threshold_uncertainty_score":0.7259465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90651983,0.00004477831,0.08359208,0.0033579045,0.0014767661,0.00076018745,0.000090422865,0.00040343383,0.0037545834],"genre_scores_gemma":[0.9910135,0.00006732653,0.006834846,0.000626701,0.0003680358,0.000082402286,0.00006619293,0.000056406217,0.000884535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620265,0.0001122426,0.0010203252,0.0011112476,0.00095366186,0.00059989456],"domain_scores_gemma":[0.9974544,0.00032934832,0.0007380089,0.00044801974,0.00084588776,0.0001843523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008360885,0.000589159,0.0006039013,0.00074270286,0.00038914254,0.0005302182,0.0012314488,0.00031747844,0.000019047711],"category_scores_gemma":[0.00018170473,0.0005980468,0.0001812833,0.0003822836,0.00014012569,0.00057303015,0.0003713381,0.0005514036,0.0000060489274],"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.0038993927,0.0028389173,0.1084739,0.0011198492,0.0014933476,0.00012809911,0.014550603,0.16552763,0.34223416,0.30885965,0.0016103322,0.049264133],"study_design_scores_gemma":[0.0017218678,0.00090900663,0.0043659667,0.0020211753,0.000050435214,0.000042118518,0.000058538844,0.8731131,0.1137225,0.0022410532,0.00083897164,0.00091526064],"about_ca_topic_score_codex":0.00045949852,"about_ca_topic_score_gemma":0.00003337309,"teacher_disagreement_score":0.70758545,"about_ca_system_score_codex":0.0003547692,"about_ca_system_score_gemma":0.00010350363,"threshold_uncertainty_score":0.9996471},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034518216,0.00015613019,0.9387315,0.0065414477,0.00105561,0.0028209663,0.000011251757,0.0036712869,0.012493577],"genre_scores_gemma":[0.8117718,0.0000057317147,0.18672201,0.000582506,0.00011390536,0.00031929332,0.000009700183,0.00002031853,0.0004547452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758166,0.0003889853,0.00032344327,0.0009874102,0.00042521465,0.00029328247],"domain_scores_gemma":[0.9971063,0.00016944714,0.00021559767,0.0019867674,0.0004154906,0.00010635799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021415697,0.00030818055,0.00030029446,0.00008582959,0.0001851023,0.00049621955,0.0014758689,0.0002817824,0.0000098273595],"category_scores_gemma":[0.0004688669,0.00020771068,0.00009727937,0.00021993347,0.000107335116,0.00022633656,0.0027754493,0.0008313092,0.0000051509633],"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.00019505342,0.0014691474,0.09590599,0.0024875903,0.00023371226,0.000034195196,0.014181431,0.0012051429,0.00047251218,0.058337625,0.19233193,0.6331457],"study_design_scores_gemma":[0.00044796674,0.00038129455,0.021504104,0.00029593034,0.000060797527,0.000043636184,0.00012514986,0.6405937,0.006358343,0.30232522,0.026354304,0.0015095146],"about_ca_topic_score_codex":0.005474669,"about_ca_topic_score_gemma":0.0036998244,"teacher_disagreement_score":0.77725357,"about_ca_system_score_codex":0.00028953515,"about_ca_system_score_gemma":0.00068391394,"threshold_uncertainty_score":0.84701955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06393042,0.00010830166,0.8539995,0.00028097501,0.00025687244,0.0000677561,5.0847405e-7,0.00082227617,0.08053338],"genre_scores_gemma":[0.67632157,0.0000013859361,0.32311618,0.00008005608,0.000014574944,0.0000013250407,1.7901182e-7,0.0000038663047,0.00046088352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993414,0.00003386447,0.00014673694,0.00016446732,0.00018104157,0.0001324637],"domain_scores_gemma":[0.99926144,0.000060993898,0.00006519482,0.00041079527,0.00012839159,0.000073194446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037344478,0.00006776846,0.000110631496,0.000046391477,0.000024538575,0.000042860473,0.00066743494,0.0000355981,0.000016385851],"category_scores_gemma":[0.00015239451,0.00005978187,0.00003243479,0.00023357589,0.000024221927,0.00027002944,0.0002440053,0.00006670413,0.000018576116],"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.000017779417,0.00026449095,0.16168642,0.000074024996,0.000044642005,0.0000453604,0.006247431,0.00006069947,0.032983348,0.54495436,0.11305536,0.14056607],"study_design_scores_gemma":[0.00086240156,0.000835266,0.003468836,0.0002094014,0.000015902806,0.0001540121,0.0012050272,0.15330753,0.7299606,0.07971805,0.029129902,0.0011330177],"about_ca_topic_score_codex":0.0005154784,"about_ca_topic_score_gemma":0.00021924751,"teacher_disagreement_score":0.6969773,"about_ca_system_score_codex":0.00003189736,"about_ca_system_score_gemma":0.00006691976,"threshold_uncertainty_score":0.24378338},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654716,0.000014421153,0.9836265,0.0006876059,0.00056652457,0.00050074415,0.000005794471,0.0003270165,0.0006167094],"genre_scores_gemma":[0.8426792,0.000008277151,0.15688664,0.00011987942,0.00003949478,0.000027613041,6.868943e-7,0.000015201878,0.00022302028],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851596,0.0001426386,0.0003687321,0.00027589285,0.00049931783,0.00019743887],"domain_scores_gemma":[0.9987495,0.00007454048,0.00018475947,0.00067177636,0.00025773325,0.000061704115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040102095,0.00015922211,0.0001342525,0.00017655751,0.00017141696,0.00008051534,0.0005834741,0.00010679349,0.000010677398],"category_scores_gemma":[0.000025229,0.00013172407,0.000070038026,0.0005070992,0.0000766822,0.0002895425,0.000011648669,0.00024550964,0.0000040487594],"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.00019670062,0.0023930643,0.0005818169,0.00020666825,0.00010803305,0.000014770332,0.016267212,0.088383295,0.34536546,0.004307476,0.005318017,0.5368575],"study_design_scores_gemma":[0.00018257718,0.0005741057,0.000096485564,0.000074770294,0.000029134208,0.000008652739,0.00007432417,0.113380894,0.8841347,0.00090421503,0.00035908874,0.00018103392],"about_ca_topic_score_codex":0.00007375427,"about_ca_topic_score_gemma":0.000091773065,"teacher_disagreement_score":0.8290245,"about_ca_system_score_codex":0.00013118821,"about_ca_system_score_gemma":0.00019604573,"threshold_uncertainty_score":0.53715515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099976495,0.00008586836,0.8303607,0.06575547,0.0001525766,0.0002830342,0.000003291862,0.0012933803,0.002089149],"genre_scores_gemma":[0.72699547,0.00004243806,0.2694894,0.0030820444,0.000022283279,0.00011880524,0.0000016727543,0.00002501732,0.00022287977],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847573,0.00021640894,0.0003005152,0.0004036746,0.00024771361,0.00035596764],"domain_scores_gemma":[0.9937026,0.00067190186,0.00018586553,0.0052145333,0.0001324107,0.00009268635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036713385,0.00020843075,0.00019103769,0.00018222388,0.0003218636,0.00012216478,0.0043551936,0.00007162475,0.0000069564967],"category_scores_gemma":[0.00008784509,0.00014926244,0.00007350674,0.00048932346,0.00028559015,0.00058148813,0.00056705956,0.00024815885,0.0001285317],"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.000043618536,0.0004031841,0.01350392,0.000027822167,0.00017634407,0.000026207563,0.0030522635,0.000046577534,0.8028745,0.02041009,0.09095448,0.068480976],"study_design_scores_gemma":[0.0072167534,0.0008815364,0.05025136,0.0026490293,0.00026082684,0.00083553826,0.0004504597,0.027220324,0.6177677,0.013192911,0.27251258,0.0067609726],"about_ca_topic_score_codex":0.000076442026,"about_ca_topic_score_gemma":0.00015111301,"teacher_disagreement_score":0.627019,"about_ca_system_score_codex":0.00014081295,"about_ca_system_score_gemma":0.00006749959,"threshold_uncertainty_score":0.8093106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01392757,0.000030540417,0.9849178,0.000047416383,0.0002193561,0.0004228205,0.0000042656593,0.000067557536,0.00036266787],"genre_scores_gemma":[0.22525598,9.4476104e-7,0.77463365,0.000017429837,0.000030418121,0.000007645246,8.46983e-7,0.0000058938285,0.000047191825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987965,0.00011465015,0.00034037046,0.0001808288,0.00042209637,0.00014553888],"domain_scores_gemma":[0.9985194,0.0002662345,0.00029630106,0.00036687354,0.000533334,0.000017806546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855734,0.000085212116,0.00013996135,0.00008233744,0.00007679034,0.00002661576,0.0004529004,0.00004014212,0.000006207669],"category_scores_gemma":[0.00018219266,0.00006500846,0.000048550522,0.0003507346,0.00001584604,0.00020963111,0.00011670953,0.00005558484,2.7156423e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057321076,0.000049932867,0.00226782,0.000059966256,0.00001593953,7.98388e-8,0.00054972945,0.013040637,0.03969273,0.02711727,0.0014318319,0.9157683],"study_design_scores_gemma":[0.00016003598,0.00004669228,0.00085588056,0.000032209045,0.000025589436,0.0000027565743,0.000011193846,0.74988204,0.23639233,0.012521885,0.000011541925,0.000057829504],"about_ca_topic_score_codex":0.00062880217,"about_ca_topic_score_gemma":0.00013217803,"teacher_disagreement_score":0.9157105,"about_ca_system_score_codex":0.00007388094,"about_ca_system_score_gemma":0.0003492377,"threshold_uncertainty_score":0.2650968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03879605,0.0000040990794,0.95739764,0.00020022862,0.00040934386,0.00019839001,0.000021388292,0.00049402105,0.0024788196],"genre_scores_gemma":[0.9795384,0.00000802049,0.020103589,0.0001114723,0.000008510087,0.000031396376,4.870152e-7,0.0000065135932,0.00019162649],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987284,0.00013506932,0.00039498755,0.00013888233,0.00038415534,0.00021851732],"domain_scores_gemma":[0.9986053,0.00044037914,0.00013170383,0.0005366064,0.00022023082,0.00006578312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095184013,0.00012892544,0.00013733073,0.00042238485,0.00014455392,0.00004654984,0.0005553697,0.00007852252,0.0000818784],"category_scores_gemma":[0.000023090444,0.000095033705,0.00010191261,0.00037281675,0.00011327472,0.0007374388,0.000005904138,0.00015218764,0.00022944476],"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.00018922705,0.00023345489,0.000012093911,0.000071665505,0.000054611206,0.0000011510481,0.008250663,0.07547378,0.009380896,0.109568484,0.0002577252,0.7965062],"study_design_scores_gemma":[0.00064910844,0.00038623554,0.00013785508,0.00018399039,0.000012756222,0.000026616595,0.00034741563,0.08355824,0.9113414,0.002509744,0.0005264143,0.0003201884],"about_ca_topic_score_codex":0.000010811034,"about_ca_topic_score_gemma":0.000001739818,"teacher_disagreement_score":0.9407423,"about_ca_system_score_codex":0.000091405826,"about_ca_system_score_gemma":0.00008268187,"threshold_uncertainty_score":0.3875362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035700716,0.0006914681,0.96164966,0.00061353715,0.0007107496,0.00024049566,0.000006449383,0.00021065012,0.00017625015],"genre_scores_gemma":[0.95986915,0.000008527215,0.03932927,0.00009926696,0.0004506411,0.000011771483,2.7078985e-7,0.000029650104,0.00020143228],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975804,0.00019001811,0.0009481735,0.00032108065,0.0005198621,0.0004404606],"domain_scores_gemma":[0.996643,0.00040335237,0.0014114134,0.00027949875,0.0010777018,0.00018501143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025204197,0.000243988,0.0005079212,0.00029735136,0.00026843167,0.00048825558,0.0013109266,0.00011642033,0.0000033160288],"category_scores_gemma":[0.00020489958,0.00015928104,0.0001932323,0.00031356467,0.000116161085,0.0015415539,0.00009546791,0.00021949368,0.000007584842],"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.0005256108,0.00065194233,0.0053763185,0.003960048,0.00026733548,0.00022144441,0.0044861864,0.0012979206,0.62416786,0.009577238,0.0136727905,0.3357953],"study_design_scores_gemma":[0.00961177,0.005316854,0.0028805917,0.049912713,0.00030703502,0.00586514,0.0021959306,0.49273255,0.34051895,0.07657506,0.009602303,0.0044811117],"about_ca_topic_score_codex":0.000025359319,"about_ca_topic_score_gemma":0.000007027431,"teacher_disagreement_score":0.92416847,"about_ca_system_score_codex":0.00021946544,"about_ca_system_score_gemma":0.0004121004,"threshold_uncertainty_score":0.6495292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008155491,0.0000732052,0.9829958,0.00041302558,0.0014903169,0.00087590923,0.000005461648,0.0018429522,0.0041478435],"genre_scores_gemma":[0.115188204,0.000010454928,0.8838679,0.00016307713,0.00018396773,0.0003937729,0.0000075266894,0.000040862495,0.00014422339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973688,0.000065518616,0.00054793723,0.0011131694,0.00036407492,0.00054048805],"domain_scores_gemma":[0.9979846,0.0003222865,0.00019854229,0.0012181399,0.00020054088,0.000075886244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016014415,0.00038554508,0.0004890606,0.0005443315,0.0001336401,0.0006086885,0.0021545333,0.0005632004,0.0000054064144],"category_scores_gemma":[0.00015119424,0.00038978865,0.00023319843,0.0003150679,0.000059121245,0.0002499365,0.0021825898,0.0014194376,0.000002395748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002235966,0.00010274905,0.0014933893,0.00014101678,0.000026321874,0.000029592342,0.0008537584,0.00007112819,0.0014019969,0.0045215506,0.0013996736,0.98995656],"study_design_scores_gemma":[0.0001590502,0.00003717421,0.0009620483,0.0005498581,0.00001711443,0.000029248817,0.00005203806,0.89912635,0.013150679,0.083817214,0.0012159154,0.00088328845],"about_ca_topic_score_codex":0.00068469543,"about_ca_topic_score_gemma":0.00088796584,"teacher_disagreement_score":0.9890733,"about_ca_system_score_codex":0.000117133626,"about_ca_system_score_gemma":0.0002312064,"threshold_uncertainty_score":0.9998554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043263086,0.00023307065,0.978858,0.013760784,0.00024302653,0.00060015934,0.000035041678,0.0009086508,0.0010349634],"genre_scores_gemma":[0.8174502,0.0001154361,0.18137701,0.0003107275,0.00003356985,0.00038258045,0.000007948997,0.00001680511,0.00030569246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882984,0.00019133983,0.0002678803,0.00030682058,0.00013131935,0.00027279241],"domain_scores_gemma":[0.99459153,0.0019475843,0.00014632934,0.0028373948,0.00040366195,0.00007347612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049437885,0.00014924865,0.00017784606,0.000121594785,0.0005932019,0.00023119015,0.0049052704,0.00007036794,0.0000045230845],"category_scores_gemma":[0.00072995265,0.00011660357,0.00008074761,0.0003477795,0.000158729,0.0010006258,0.0014477015,0.00013480164,0.000025206888],"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.000051410385,0.0009371524,0.018326549,0.00007540073,0.00027520346,0.0000038166154,0.022774767,0.00010331829,0.09727761,0.43554392,0.03067177,0.39395908],"study_design_scores_gemma":[0.0037774465,0.0010440598,0.0067223166,0.0014702339,0.00009723945,0.00007308502,0.00071103347,0.3611882,0.3140726,0.0651823,0.24278504,0.0028764347],"about_ca_topic_score_codex":0.00015518592,"about_ca_topic_score_gemma":0.0004398311,"teacher_disagreement_score":0.81312394,"about_ca_system_score_codex":0.00008612661,"about_ca_system_score_gemma":0.00008645843,"threshold_uncertainty_score":0.9115295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10173594,0.00006909082,0.8946117,0.00006912075,0.0015338229,0.0016140883,0.000031029,0.00031784817,0.000017333607],"genre_scores_gemma":[0.99586195,0.000017467955,0.0031674518,0.000012313121,0.000044405486,0.0007440077,0.0000031991992,0.000025873356,0.00012331764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747604,0.00044728766,0.00056187465,0.0004872817,0.00076363893,0.00026387747],"domain_scores_gemma":[0.9977956,0.0004731078,0.00029256046,0.0004877838,0.0008742233,0.00007674309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018325392,0.00024807837,0.0003132711,0.00035466312,0.0002522005,0.000097079836,0.00031036115,0.00014938693,0.000007197031],"category_scores_gemma":[0.00008962504,0.00018107926,0.00010465497,0.00029400163,0.0000501897,0.0007215374,0.0000029452638,0.00012202404,0.000006406447],"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.0006353692,0.0011506313,0.00032771862,0.00048329047,0.00029240697,7.520247e-7,0.007761971,0.13959976,0.30968124,0.006143985,0.00052837253,0.5333945],"study_design_scores_gemma":[0.0007835745,0.0005322789,0.00044976646,0.0006190913,0.0000743046,0.0000108446575,0.00011601588,0.8610077,0.13596213,0.00020644278,0.000012483751,0.00022536782],"about_ca_topic_score_codex":0.00002508527,"about_ca_topic_score_gemma":0.00009520442,"teacher_disagreement_score":0.894126,"about_ca_system_score_codex":0.0003622736,"about_ca_system_score_gemma":0.00013995175,"threshold_uncertainty_score":0.7384198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032229647,0.0003793547,0.99160904,0.0033526681,0.00009681936,0.0002575917,0.000015054086,0.00028723496,0.0007792874],"genre_scores_gemma":[0.43481004,0.00004420536,0.5649425,0.000060759976,0.000015441045,0.00006251691,0.0000032770854,0.000008558654,0.00005274433],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886936,0.00023174562,0.00035846827,0.00022916989,0.00012557293,0.00018565486],"domain_scores_gemma":[0.9951919,0.002156515,0.0003157457,0.0019220109,0.00037035428,0.000043481392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088881096,0.00010646187,0.00017101964,0.00012546094,0.00034235156,0.00005698018,0.0019562293,0.000065236796,0.0000055058445],"category_scores_gemma":[0.0006587222,0.00008860581,0.00007921998,0.0002871955,0.00006696513,0.00046201888,0.00051739014,0.000088083994,0.0000034193974],"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.000005982588,0.000107255735,0.0042707897,0.00003207212,0.000047381167,1.5553047e-7,0.00133227,0.00021909506,0.4920025,0.2448029,0.00097305456,0.25620654],"study_design_scores_gemma":[0.00036123063,0.00007301303,0.00031993,0.00018995692,0.000018301966,0.000005517932,0.00006811362,0.7191133,0.2584113,0.016843643,0.0043174396,0.0002783064],"about_ca_topic_score_codex":0.00008261583,"about_ca_topic_score_gemma":0.00030801748,"teacher_disagreement_score":0.7188942,"about_ca_system_score_codex":0.00007223789,"about_ca_system_score_gemma":0.00009480144,"threshold_uncertainty_score":0.36351934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005170206,0.000028618673,0.9722074,0.00095408707,0.00059296103,0.00028803968,0.0000016447347,0.0016680784,0.019088933],"genre_scores_gemma":[0.70810264,0.0000020121963,0.27761927,0.0015060443,0.00011546269,0.00008700728,0.0000024174187,0.00002791703,0.012537241],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988227,0.000062473904,0.00020767823,0.00039332162,0.0001604075,0.00035342586],"domain_scores_gemma":[0.9986487,0.00028803368,0.000089457746,0.00048952946,0.00033887033,0.00014538845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300045,0.00015594625,0.00018331336,0.00011422001,0.000111493486,0.00018765812,0.00078662025,0.00007777771,0.000017617447],"category_scores_gemma":[0.00034556934,0.00014107795,0.000060767023,0.00028860744,0.000030593455,0.00041155214,0.0002942804,0.00011501256,0.000048650585],"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.00009248589,0.0002809534,0.00085755123,0.00017087381,0.00012289602,0.000024075618,0.015378221,0.0015407287,0.015552472,0.31661052,0.5996864,0.049682807],"study_design_scores_gemma":[0.00076617894,0.00033617302,0.000046762525,0.000040997675,0.000008832014,0.000036500966,0.00045494616,0.78629917,0.087981105,0.041227613,0.08220534,0.00059635664],"about_ca_topic_score_codex":0.000035180776,"about_ca_topic_score_gemma":0.00012648878,"teacher_disagreement_score":0.78475845,"about_ca_system_score_codex":0.00006583744,"about_ca_system_score_gemma":0.00010454931,"threshold_uncertainty_score":0.5752992},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06426827,0.00036110668,0.13390505,0.0002633931,0.001605582,0.0005195741,0.0000012110634,0.0018476504,0.79722816],"genre_scores_gemma":[0.76264656,0.000050796156,0.21480678,0.00032358512,0.0001241971,0.00007228599,0.00006863261,0.000031949367,0.021875238],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998679,0.000056606328,0.0003131093,0.00049635494,0.00021068017,0.00024424065],"domain_scores_gemma":[0.99919724,0.00010114934,0.00014590229,0.00042319944,0.00009229466,0.00004018413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025186353,0.00021678921,0.00024412465,0.0005144562,0.000050291754,0.0001629141,0.00088369433,0.0002068715,0.000046716254],"category_scores_gemma":[0.00007981163,0.00021446665,0.00006965464,0.0005279179,0.000005986985,0.00042752037,0.000049802184,0.00040333107,0.000047699377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026486203,0.00023251484,0.0049124444,0.0001420974,0.00004928907,0.00017317188,0.031094287,0.000077881254,0.0035368372,0.1645404,0.011020581,0.784194],"study_design_scores_gemma":[0.0019768444,0.0010018533,0.09710142,0.0055185226,0.000079995225,0.00013739671,0.0065639922,0.34233713,0.44845602,0.06871388,0.01917631,0.008936639],"about_ca_topic_score_codex":0.00012137014,"about_ca_topic_score_gemma":0.0103693325,"teacher_disagreement_score":0.7753529,"about_ca_system_score_codex":0.00015416341,"about_ca_system_score_gemma":0.00010169664,"threshold_uncertainty_score":0.8745696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99463516,0.000043837925,0.0012388985,0.00037903734,0.0001237567,0.00022910284,5.657553e-7,0.00025837152,0.0030912366],"genre_scores_gemma":[0.9955261,0.00004105264,0.0040246965,0.000053619005,0.000028145638,0.000050130388,6.4108804e-7,0.000014196646,0.0002614482],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829525,0.00010495505,0.00022377259,0.00039140217,0.00027666468,0.00070795027],"domain_scores_gemma":[0.9981404,0.00079900265,0.0000801867,0.0007854126,0.00014933273,0.000045688827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019872102,0.0001226055,0.00017036471,0.00033911527,0.000084445914,0.000035891906,0.0011552577,0.00007795071,0.000009089871],"category_scores_gemma":[0.0006142598,0.00011767398,0.000030890984,0.0010904938,0.0000947793,0.00026884,0.00017559445,0.0012780587,0.000036915917],"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.00006843229,0.00064074516,0.023538785,0.000073116615,0.000007220438,0.000015490985,0.0010760445,0.0002284301,0.80370915,0.0636581,0.00059199304,0.10639247],"study_design_scores_gemma":[0.0005049533,0.0021140722,0.028806016,0.00018361399,0.0000012324034,0.000017922563,0.000021383177,0.0544573,0.9042933,0.007702817,0.0015986478,0.00029874837],"about_ca_topic_score_codex":0.0000728717,"about_ca_topic_score_gemma":0.00070045533,"teacher_disagreement_score":0.10609373,"about_ca_system_score_codex":0.00014120742,"about_ca_system_score_gemma":0.000342168,"threshold_uncertainty_score":0.55526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06334124,0.00001640109,0.9033968,0.00008895556,0.00007764301,0.000037360845,3.9873495e-7,0.00048043803,0.03256078],"genre_scores_gemma":[0.8282479,0.0000014451107,0.17111486,0.0001389133,0.0000069654548,7.167613e-7,4.7236372e-7,0.0000027316028,0.00048596668],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918824,0.000017068996,0.00022085418,0.00020605673,0.00020389656,0.00016388854],"domain_scores_gemma":[0.99902767,0.00015096168,0.00008502354,0.00058766967,0.00010409945,0.000044589895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007820121,0.00006395894,0.00016433652,0.0004611035,0.000024380863,0.000019233536,0.0006744796,0.000038969727,0.00003796481],"category_scores_gemma":[0.000054237968,0.00005661993,0.0001069523,0.0020952618,0.000023475597,0.00013726515,0.00016191247,0.000061222396,0.000009056995],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017029457,0.0003605438,0.32192856,0.000024245472,0.0010463328,0.00005737444,0.003142281,0.00044939207,0.02615997,0.32047108,0.0053287386,0.32101446],"study_design_scores_gemma":[0.00022550962,0.00024334434,0.22118965,0.0000219509,0.000368781,0.000013060508,0.00016119854,0.29054818,0.47763228,0.0047946065,0.0041962494,0.0006051831],"about_ca_topic_score_codex":0.0001575408,"about_ca_topic_score_gemma":0.0005652748,"teacher_disagreement_score":0.7649067,"about_ca_system_score_codex":0.000022165346,"about_ca_system_score_gemma":0.000016514852,"threshold_uncertainty_score":0.23088938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4382913,0.00017489803,0.5592893,0.00034555548,0.0000041448625,0.00090010423,9.033566e-7,0.0003316026,0.0006622164],"genre_scores_gemma":[0.9767338,0.00006042685,0.022849161,0.0000364358,0.000008784902,0.0002863655,7.855967e-7,0.000008731249,0.000015491813],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985097,0.00009531933,0.00031460094,0.00043379265,0.00032677743,0.00031982272],"domain_scores_gemma":[0.998698,0.00017119134,0.00016042708,0.0006499049,0.00025428666,0.00006617538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013759453,0.00012402299,0.00023119083,0.0004756069,0.00008475064,0.00001929787,0.000636609,0.00009956528,3.7113722e-7],"category_scores_gemma":[0.000042832984,0.00012115286,0.000025146985,0.0010362015,0.00003735765,0.00014316375,0.00012144513,0.00026999833,0.0000018554259],"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.000023587558,0.00006628442,0.00025258097,0.00008887352,0.00000764756,2.931627e-7,0.00019126074,0.000045677203,0.6565967,0.3065755,0.000072464434,0.036079112],"study_design_scores_gemma":[0.000074866555,0.0011714615,0.0021058102,0.00011945297,0.0000043992236,0.000017618988,0.000018952516,0.01799191,0.9754098,0.0027494743,0.0002179906,0.00011825101],"about_ca_topic_score_codex":0.000046973702,"about_ca_topic_score_gemma":0.00001771903,"teacher_disagreement_score":0.5384425,"about_ca_system_score_codex":0.00014559754,"about_ca_system_score_gemma":0.000096731244,"threshold_uncertainty_score":0.49404702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008124483,0.0000050882118,0.9850282,0.00397335,0.00007540196,0.00021397977,0.0000028564352,0.00039033924,0.0021863088],"genre_scores_gemma":[0.57334584,2.368532e-7,0.4256075,0.0010035305,0.000008471259,0.0000019514925,7.9376423e-7,0.0000028287225,0.000028881432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990369,0.0001402853,0.00017505867,0.00023572081,0.00027227547,0.00013973341],"domain_scores_gemma":[0.99869514,0.00043133108,0.00012237935,0.0006261368,0.00009634235,0.000028683748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047347762,0.00011382657,0.00013431776,0.000114235685,0.000075798685,0.000054008677,0.00072475465,0.00006238081,0.00001827291],"category_scores_gemma":[0.00021867955,0.00007156902,0.00004842617,0.00039614024,0.000020084639,0.00013151983,0.00004355728,0.00014754062,0.0000025392796],"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.00013315007,0.0003849606,0.00012398152,0.00004872186,0.000032210286,0.000008902607,0.00405697,0.122145936,0.08797998,0.48904076,0.009880921,0.2861635],"study_design_scores_gemma":[0.00009230384,0.00015594884,0.00038589357,0.000023900222,0.000002964687,0.0000029475714,0.000009410784,0.7646844,0.20108132,0.033473182,0.000018499088,0.000069225265],"about_ca_topic_score_codex":0.000024903706,"about_ca_topic_score_gemma":0.000021787111,"teacher_disagreement_score":0.6425385,"about_ca_system_score_codex":0.000023217908,"about_ca_system_score_gemma":0.00004177137,"threshold_uncertainty_score":0.29185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8449961,0.00043308095,0.138603,0.00063854415,0.00546274,0.0008066991,0.000010136313,0.002835467,0.006214261],"genre_scores_gemma":[0.9547841,0.000011164591,0.044698477,0.00030160803,0.000012778926,0.000037304602,0.0000028752518,0.0000293973,0.00012229505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793285,0.00012788507,0.00030657958,0.00079784455,0.0003925813,0.00044225916],"domain_scores_gemma":[0.9979485,0.0003766429,0.00020195515,0.0011753736,0.00016313598,0.00013439466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074366713,0.0002899212,0.00031681327,0.00027982352,0.00024499977,0.00013572755,0.00096043193,0.00009373099,0.000012486534],"category_scores_gemma":[0.0004448207,0.00029579326,0.000057315116,0.000694546,0.00011683755,0.00039883383,0.0002727023,0.00035443276,0.000022664397],"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.000068977824,0.00046740088,0.017993327,0.00009163112,0.000030688963,0.00008894836,0.0013269207,0.00004681191,0.00073546596,0.9658489,0.0020754044,0.011225511],"study_design_scores_gemma":[0.0029056475,0.0030581176,0.038691226,0.0010128899,0.00006505438,0.000045405286,0.00015338733,0.084536776,0.188711,0.6743067,0.003830744,0.0026830616],"about_ca_topic_score_codex":0.00020624952,"about_ca_topic_score_gemma":0.000023882698,"teacher_disagreement_score":0.29154223,"about_ca_system_score_codex":0.0001391264,"about_ca_system_score_gemma":0.00008018681,"threshold_uncertainty_score":0.9999494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012101524,0.000062410254,0.9167703,0.00038961417,0.00049341266,0.00011961821,5.0428696e-7,0.0020035766,0.07895046],"genre_scores_gemma":[0.0937109,0.0000112768275,0.9019955,0.0010773281,0.000045507277,0.000015619507,2.2852663e-7,0.000011584289,0.0031320774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988783,0.000030424932,0.00015413838,0.0004715081,0.00019862979,0.00026700352],"domain_scores_gemma":[0.9987933,0.000017397246,0.000052288597,0.0009737394,0.00009005083,0.00007324029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024922707,0.0001282207,0.00011439097,0.00014536372,0.00006954993,0.00005084203,0.0010986602,0.00003932532,0.0001482693],"category_scores_gemma":[0.000021033286,0.00011174357,0.00006874575,0.00048637774,0.000032974003,0.00038761122,0.00032890146,0.00012366234,0.00020571456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021758099,0.00015116646,0.0019271328,0.0000087921435,0.000024009812,0.00006506913,0.0060549094,8.499224e-8,0.00077360944,0.031924035,0.08063307,0.87843597],"study_design_scores_gemma":[0.00031296778,0.00045356486,0.0064607635,0.000051798626,0.000016981156,0.00039288687,0.000106809224,0.021722058,0.7321815,0.20948796,0.027591845,0.0012208527],"about_ca_topic_score_codex":0.0004549338,"about_ca_topic_score_gemma":0.000016546835,"teacher_disagreement_score":0.8772151,"about_ca_system_score_codex":0.000016742457,"about_ca_system_score_gemma":0.000028959319,"threshold_uncertainty_score":0.45567703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.196394,0.0000022125075,0.802751,0.00015097675,0.00015087368,0.0001148822,0.0000056539247,0.00028031255,0.00015009439],"genre_scores_gemma":[0.90683836,2.0260002e-7,0.09306541,0.000030777006,0.000014420007,0.0000038127903,0.0000025759382,0.000006901833,0.00003753951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991729,0.000022807537,0.00023878361,0.0002172634,0.00019286528,0.000155325],"domain_scores_gemma":[0.9993773,0.00012568363,0.00013883285,0.00019596989,0.00012590534,0.00003628497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010876986,0.00009594768,0.000106928695,0.00012710875,0.000039742135,0.00007146218,0.00030739093,0.000026430665,0.000019721394],"category_scores_gemma":[0.000043589993,0.000068564084,0.000049668128,0.00019031185,0.00003172982,0.0009057282,0.00015426274,0.000036416848,0.000007745692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009487847,0.000047140005,0.0059404303,0.000020986201,0.00002735496,0.000003264619,0.0013819056,0.00046057376,0.029855948,0.0053068544,0.0010894485,0.9558566],"study_design_scores_gemma":[0.0027875935,0.0014826116,0.029862776,0.00089979876,0.000047782,0.00015819853,0.0025647567,0.6289206,0.29395217,0.03752053,0.00016836681,0.0016348375],"about_ca_topic_score_codex":0.000102315586,"about_ca_topic_score_gemma":0.000025792917,"teacher_disagreement_score":0.9542218,"about_ca_system_score_codex":0.000089100846,"about_ca_system_score_gemma":0.000051954532,"threshold_uncertainty_score":0.2795962},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002815345,0.00007366578,0.9872364,0.004312067,0.000311455,0.00036238128,0.000020570074,0.0005547055,0.004313426],"genre_scores_gemma":[0.8742169,0.00040658578,0.124644175,0.000077270124,0.000008698368,0.00008103721,0.000001987823,0.000019777191,0.0005435359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.00015400018,0.0004287868,0.00030300164,0.00027915137,0.00022494486],"domain_scores_gemma":[0.9927225,0.00034970097,0.0003657934,0.006204491,0.00025482153,0.00010271169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042438818,0.00018266383,0.0002801525,0.00019241593,0.001393652,0.00014826884,0.0052099526,0.00011907341,0.000021532187],"category_scores_gemma":[0.000031339725,0.00018974743,0.00017503763,0.00018651967,0.00030372854,0.00046315577,0.000029126448,0.00045060564,0.000020671261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010255855,0.0035028677,0.00027308578,0.00009382208,0.00025350356,0.000010032732,0.00774564,0.003992157,0.13140965,0.035459485,0.00055869546,0.8165985],"study_design_scores_gemma":[0.001164408,0.0005176227,0.0013107947,0.00040468216,0.000086016444,0.00003072804,0.00006687016,0.76576626,0.22019596,0.0028106915,0.0070023574,0.00064361864],"about_ca_topic_score_codex":0.00053330726,"about_ca_topic_score_gemma":0.0008535013,"teacher_disagreement_score":0.8714016,"about_ca_system_score_codex":0.000058726113,"about_ca_system_score_gemma":0.00013483503,"threshold_uncertainty_score":0.9999064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06682686,0.000036582016,0.92821497,0.0018056643,0.00020926534,0.00055224,0.000027377557,0.0022797491,0.000047277095],"genre_scores_gemma":[0.8780878,0.000036497644,0.12131202,0.00026368545,0.000007837302,0.00018131414,0.0000016549089,0.000046299,0.00006285498],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99752736,0.00026543968,0.0004547921,0.0007896291,0.00044857894,0.00051417935],"domain_scores_gemma":[0.99763685,0.00038313147,0.00016512428,0.0014232503,0.00030318086,0.00008848722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044679182,0.00041222814,0.00057426555,0.001104994,0.00019706973,0.000038807462,0.0011868384,0.00047839904,0.00001931701],"category_scores_gemma":[0.000027580267,0.0002864732,0.00013956812,0.0010784591,0.0004858346,0.00024143353,0.00000950979,0.0004338207,0.000024082743],"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.0007754535,0.0012477137,0.0010885388,0.00006087626,0.0004655215,0.00032596212,0.00017532722,0.04605605,0.88590115,0.0048039826,0.00026139664,0.058838014],"study_design_scores_gemma":[0.000954306,0.0015682838,0.00004079279,0.000259079,0.00005866333,0.00007781564,0.00001370467,0.06747583,0.9281288,0.0008302987,0.00018215428,0.00041029174],"about_ca_topic_score_codex":0.00005537756,"about_ca_topic_score_gemma":0.000047542642,"teacher_disagreement_score":0.811261,"about_ca_system_score_codex":0.00018574717,"about_ca_system_score_gemma":0.00015195407,"threshold_uncertainty_score":0.99995875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012601902,0.000008924611,0.9814496,0.003563097,0.00039317165,0.00043271988,0.00004199783,0.000375823,0.0011327569],"genre_scores_gemma":[0.800829,0.00004707494,0.19872111,0.00004580757,0.000005637997,0.00022347293,0.0000115918565,0.000013462674,0.0001028671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989901,0.000100133555,0.0003348422,0.00024962876,0.00016308343,0.00016217098],"domain_scores_gemma":[0.9956698,0.0009323625,0.00016897978,0.0029788928,0.00018962244,0.000060359132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023588435,0.00012951455,0.0001720566,0.00024728547,0.0003749332,0.00004807829,0.0018889093,0.00009506717,0.00001016231],"category_scores_gemma":[0.000033508597,0.00013314797,0.00016330511,0.00040843838,0.00016405083,0.00025573853,0.000015688822,0.00040470975,0.000003730198],"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.0000963062,0.0032406445,0.001099011,0.00010885432,0.00038099103,0.0000013431003,0.005498576,0.0038276478,0.13052908,0.5127871,0.0012440936,0.34118637],"study_design_scores_gemma":[0.00061267335,0.00023149907,0.00093166425,0.000047109923,0.00007708982,0.0000137287325,0.00020510823,0.8068099,0.15436848,0.035901725,0.0004365868,0.000364405],"about_ca_topic_score_codex":0.00013657247,"about_ca_topic_score_gemma":0.0072554233,"teacher_disagreement_score":0.8029823,"about_ca_system_score_codex":0.00006902052,"about_ca_system_score_gemma":0.00006159576,"threshold_uncertainty_score":0.54296166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572132,0.000033972272,0.9598586,0.026580313,0.0000753036,0.00018870318,0.0000010698113,0.00093019113,0.0007597448],"genre_scores_gemma":[0.6210299,0.000048938964,0.37811032,0.0007292117,0.000008257207,0.0000508538,0.0000024231617,0.000009164547,0.0000109419225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990647,0.00006719974,0.0002635045,0.00016387399,0.00022422873,0.00021648288],"domain_scores_gemma":[0.9973165,0.00023433854,0.0001713794,0.0021232893,0.00009613683,0.00005836405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038022135,0.00013249442,0.00011381672,0.00017962584,0.0003623587,0.0001734548,0.0020986316,0.00004437418,0.0000024854496],"category_scores_gemma":[0.000021107542,0.000090805435,0.00003876147,0.00036776214,0.00012593159,0.0020544347,0.00017744559,0.0001657513,0.000027025164],"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.000025280084,0.00011756316,0.001428057,0.00005648317,0.000052360137,0.000004225399,0.0047260737,0.0011658255,0.47479087,0.011816595,0.0050742556,0.50074244],"study_design_scores_gemma":[0.0020103436,0.00020441788,0.0020274613,0.0020776656,0.000058146332,0.00014949312,0.00017730222,0.65357184,0.2632161,0.0017472134,0.07310737,0.0016526402],"about_ca_topic_score_codex":0.000022262806,"about_ca_topic_score_gemma":0.000005294215,"teacher_disagreement_score":0.652406,"about_ca_system_score_codex":0.000104995124,"about_ca_system_score_gemma":0.000042379615,"threshold_uncertainty_score":0.38998148},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5932475e-8,0.00002955438,0.51566887,0.000021169039,0.0002834796,0.0005387604,0.000009129167,0.0006026118,0.48284635],"genre_scores_gemma":[0.0000068151335,0.000018708584,0.49207076,0.00005597699,0.0000463478,0.0000032384162,0.0000025931586,0.00003423964,0.5077613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803126,0.00021534516,0.00023789419,0.00090657535,0.00020319395,0.00040573836],"domain_scores_gemma":[0.9967987,0.0009455489,0.00038513684,0.0013043659,0.0003618416,0.00020439568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079835346,0.0004431537,0.00049059105,0.0002695329,0.00022719636,0.00009259934,0.0017259447,0.0005519853,0.0000020379423],"category_scores_gemma":[0.00012780695,0.00052697025,0.0003146579,0.000013807385,0.00016811896,0.0002883196,0.0010614758,0.0006265233,0.000010795455],"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.000054131368,0.00001034681,6.598439e-8,0.000036765603,0.000075241136,0.00008900253,0.00006804574,2.7971038e-7,0.00006732933,0.91557276,0.06392206,0.020103963],"study_design_scores_gemma":[0.00025700004,0.00022937528,5.216924e-7,0.00011001754,0.00016813375,0.00007188919,0.000003940894,0.0025055776,0.007931455,0.0013725258,0.9867073,0.00064222154],"about_ca_topic_score_codex":0.000052211326,"about_ca_topic_score_gemma":5.0417333e-7,"teacher_disagreement_score":0.9227853,"about_ca_system_score_codex":0.00022908175,"about_ca_system_score_gemma":0.00031204429,"threshold_uncertainty_score":0.9997182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028214931,0.000018485194,0.9699262,0.00021817676,0.00016042024,0.0005426602,0.000023795907,0.0005022204,0.0003931341],"genre_scores_gemma":[0.32932684,0.0000023016796,0.6704057,0.0000799092,0.000027049899,0.000044524306,0.0000027416759,0.000011940055,0.00009900117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.00008086703,0.00031266527,0.00051674526,0.00035647213,0.00041158719],"domain_scores_gemma":[0.99854046,0.0003006759,0.00009349582,0.0006670064,0.00029499846,0.000103382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011732533,0.0001619498,0.00022198482,0.00018461634,0.00011101153,0.000040218136,0.0009582075,0.00006576658,0.00003382213],"category_scores_gemma":[0.000026855561,0.00011615311,0.000069416375,0.0003339335,0.00007740625,0.00029541596,0.00020524715,0.0000694847,0.0000032014516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020782245,0.00039133502,0.0004863678,0.000052840947,0.00007321437,0.0000051783963,0.0012620909,0.00037392988,0.13711008,0.032492448,0.0012393967,0.8264923],"study_design_scores_gemma":[0.00048509476,0.0005663637,0.0002614943,0.00011899376,0.000010693739,0.0000090185795,0.0001929402,0.5260619,0.4692394,0.0026209564,0.00019611556,0.00023701256],"about_ca_topic_score_codex":0.00014756178,"about_ca_topic_score_gemma":0.0000071028503,"teacher_disagreement_score":0.8262553,"about_ca_system_score_codex":0.00009425759,"about_ca_system_score_gemma":0.00010696504,"threshold_uncertainty_score":0.47365862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044934843,0.00003502578,0.9895576,0.001486709,0.00024107561,0.00021748587,0.0000017590347,0.0010743361,0.0028924928],"genre_scores_gemma":[0.60461736,0.000003843645,0.39379188,0.00021430322,0.000054540513,0.000037619273,1.9939975e-7,0.000008311179,0.0012719682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991692,0.000023913015,0.0001503183,0.00028801314,0.0001313012,0.0002372715],"domain_scores_gemma":[0.99909705,0.00035082464,0.00005364829,0.0003448927,0.00009688784,0.000056694502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031729884,0.00009650586,0.000106551925,0.00006116454,0.00007383538,0.00006027039,0.000689747,0.000043410728,0.000023056104],"category_scores_gemma":[0.00008567819,0.000059817874,0.000068318,0.000100235215,0.000018190316,0.00027284684,0.00013628928,0.000036259346,0.000039595965],"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.000015284282,0.00010539932,0.0028344064,0.000029166935,0.000031064792,0.000005281162,0.00043480675,0.000005317652,0.3778962,0.20723522,0.02117558,0.39023226],"study_design_scores_gemma":[0.00047160644,0.00038458328,0.0002577374,0.00015095556,0.0000070678752,0.0000124497365,0.000019441015,0.014069201,0.90983945,0.044584427,0.029751454,0.00045162445],"about_ca_topic_score_codex":0.000039722523,"about_ca_topic_score_gemma":0.00004631972,"teacher_disagreement_score":0.6001239,"about_ca_system_score_codex":0.00004710185,"about_ca_system_score_gemma":0.0000357613,"threshold_uncertainty_score":0.24393022},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07759933,0.0000639644,0.9187832,0.0003905111,0.000199953,0.0001841889,0.0000025550469,0.00057228457,0.0022039977],"genre_scores_gemma":[0.6266552,0.000003354048,0.37277088,0.00002112609,0.000016922024,0.000009621545,1.0276584e-7,0.0000078072335,0.0005149891],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991015,0.00002229971,0.0002306788,0.00027045803,0.00014503076,0.00023003128],"domain_scores_gemma":[0.9989255,0.00035299658,0.00010802585,0.00045211066,0.00011740152,0.000043944252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042348015,0.00009929732,0.0001494868,0.00007093904,0.00007066756,0.000038559017,0.00064233044,0.000043730237,0.000021709888],"category_scores_gemma":[0.00022122244,0.00006832822,0.00007582987,0.0001764153,0.000030048446,0.00013725513,0.00023104457,0.000035811834,0.0000062750987],"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.000030508168,0.00014250376,0.009551307,0.00017426493,0.00003308705,0.000005098231,0.0008081927,0.00014439553,0.4567431,0.31981745,0.00406988,0.20848021],"study_design_scores_gemma":[0.00051112525,0.00025814073,0.00035861813,0.00033481218,0.000008012462,0.000020355985,0.00008072589,0.09163218,0.89521897,0.0062766867,0.0048923404,0.00040804743],"about_ca_topic_score_codex":0.0000789916,"about_ca_topic_score_gemma":0.00006648727,"teacher_disagreement_score":0.5490559,"about_ca_system_score_codex":0.00004947168,"about_ca_system_score_gemma":0.00003655377,"threshold_uncertainty_score":0.2786344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057569784,0.000018981913,0.9756784,0.000997028,0.000094492585,0.000020561292,0.0000013855922,0.0005539318,0.016878258],"genre_scores_gemma":[0.8294608,0.000004982405,0.16973428,0.00013634095,0.0000104579985,0.0000018337668,1.0450667e-7,0.0000031911634,0.0006480003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993934,0.000041374773,0.00013319771,0.00016862045,0.00013580316,0.00012759722],"domain_scores_gemma":[0.9992581,0.000102105,0.00005960819,0.0004704203,0.0000745196,0.00003525227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015415411,0.000061773244,0.00010404749,0.000060917337,0.000025692218,0.000011471864,0.0006658164,0.00002823906,0.00003835152],"category_scores_gemma":[0.00003415563,0.00003806803,0.000038154933,0.00014153968,0.00009663329,0.00019210894,0.00023301289,0.000021059917,0.00001019661],"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.000001287738,0.00002313976,0.0020613982,0.0000021945639,0.0000039426222,0.0000010681928,0.000042938947,5.7509375e-8,0.044591937,0.9009681,0.0021935473,0.05011044],"study_design_scores_gemma":[0.00013323638,0.00011585484,0.0027138584,0.000034851164,0.0000013714224,0.00001259737,0.0000056192375,0.0021954973,0.80995923,0.17862092,0.0060412413,0.00016573719],"about_ca_topic_score_codex":0.00047111887,"about_ca_topic_score_gemma":0.00015327737,"teacher_disagreement_score":0.8237038,"about_ca_system_score_codex":0.000018679277,"about_ca_system_score_gemma":0.000023357823,"threshold_uncertainty_score":0.15523691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00597339,0.00003902666,0.98088926,0.008852754,0.0002570513,0.0033931183,0.0000022862669,0.00048400016,0.00010911455],"genre_scores_gemma":[0.9272632,0.0000020888826,0.07051213,0.00019913899,0.00005806809,0.0017559223,4.426695e-7,0.000017549564,0.00019147611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846697,0.00014639866,0.00037046676,0.00045206695,0.00022528485,0.00033880334],"domain_scores_gemma":[0.9971319,0.0016616046,0.0001719082,0.0006643206,0.00033214895,0.000038149687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025833743,0.00017797071,0.00019140808,0.00008745834,0.00035929497,0.00016120196,0.0006856689,0.00010026495,0.0000024791411],"category_scores_gemma":[0.0014340918,0.000083949264,0.00014641644,0.00023541017,0.00007593542,0.00031572298,0.00009302475,0.00011997138,0.0000021110816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004391471,0.00034374528,0.00018733638,0.0002780427,0.00013744806,0.0000011188758,0.011061623,0.0031207479,0.24428056,0.032135375,0.0015788877,0.706436],"study_design_scores_gemma":[0.00076239335,0.0003244109,0.00038287978,0.0001340736,0.000025117632,0.0000153205,0.00056441047,0.64262855,0.29904974,0.055531025,0.00031663658,0.00026542816],"about_ca_topic_score_codex":0.00012308566,"about_ca_topic_score_gemma":0.0008719272,"teacher_disagreement_score":0.9212898,"about_ca_system_score_codex":0.00016029061,"about_ca_system_score_gemma":0.000080635924,"threshold_uncertainty_score":0.34233516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15454847,0.000009616083,0.844164,0.00027631552,0.00008470919,0.0006180381,0.00002860191,0.00019971102,0.00007049825],"genre_scores_gemma":[0.35533145,0.000005836853,0.6442999,0.00006356102,0.000025871926,0.00006850284,0.0000092719265,0.000011484121,0.00018407912],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875134,0.00004730012,0.0002759913,0.0004122388,0.00023581031,0.00027730185],"domain_scores_gemma":[0.99915695,0.00017435674,0.00010972809,0.0002702773,0.00023062417,0.000058066482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068306463,0.00013404146,0.00018492778,0.00015074223,0.0000890949,0.000041745407,0.00032938723,0.000055425342,0.000009917088],"category_scores_gemma":[0.00002963958,0.00009876564,0.000033936456,0.00023805515,0.00006760402,0.00027398148,0.00020076863,0.00004625252,8.202718e-7],"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.000017020147,0.00008917748,0.00048122116,0.000055809625,0.000028385724,0.000001228815,0.00061941094,0.0000043955256,0.4856202,0.0043258104,0.000078517165,0.5086788],"study_design_scores_gemma":[0.0006524114,0.0005192192,0.0030668373,0.0002018217,0.000014356397,0.000014183645,0.00010229071,0.3566853,0.6378293,0.00040887942,0.00026315896,0.00024222129],"about_ca_topic_score_codex":0.000031001047,"about_ca_topic_score_gemma":0.000001492479,"teacher_disagreement_score":0.5084366,"about_ca_system_score_codex":0.000050866856,"about_ca_system_score_gemma":0.00007449571,"threshold_uncertainty_score":0.4027546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055206604,0.000015631702,0.9405553,0.0010396423,0.00069061783,0.0006774474,0.000009190904,0.0012919287,0.00051367696],"genre_scores_gemma":[0.54128903,0.0000032386208,0.45745334,0.00013297872,0.00010343164,0.00028390213,0.000003644482,0.000016616406,0.00071383285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980663,0.000031682215,0.00045080498,0.00068080047,0.0002195964,0.00055081333],"domain_scores_gemma":[0.9969545,0.0016518896,0.00023456883,0.0007008053,0.00036138613,0.00009687066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010345354,0.00021932997,0.0003661056,0.00047516634,0.0003896665,0.00022756112,0.0008954044,0.000090231166,0.000028886861],"category_scores_gemma":[0.0006449075,0.00016174061,0.00043006815,0.0007786664,0.000031389794,0.0005306277,0.0001406961,0.00006221252,0.00001004967],"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.00015196059,0.0005039895,0.07854392,0.0001658728,0.001849838,0.000004287859,0.0015733409,0.0009495772,0.28985167,0.13895917,0.006555936,0.48089045],"study_design_scores_gemma":[0.00059536996,0.00013634103,0.002197612,0.00006400134,0.00025381902,0.000003805608,0.00004632882,0.9156813,0.07278527,0.0052628806,0.0024603338,0.0005129318],"about_ca_topic_score_codex":0.0003138968,"about_ca_topic_score_gemma":0.0011530279,"teacher_disagreement_score":0.91473174,"about_ca_system_score_codex":0.00017431873,"about_ca_system_score_gemma":0.00007220032,"threshold_uncertainty_score":0.6595591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054850034,0.00002526341,0.9333725,0.0006927061,0.00015921691,0.00007612124,0.0000013266714,0.00047394118,0.010348878],"genre_scores_gemma":[0.92746335,0.000008864048,0.07184834,0.00006931765,0.00002414389,0.0000034539921,2.5628273e-7,0.0000058799324,0.0005764146],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991993,0.000040704424,0.00020776776,0.00023027306,0.00016391078,0.0001580817],"domain_scores_gemma":[0.99893993,0.00034531765,0.00014512359,0.0004084768,0.00012129137,0.000039835963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025681747,0.00008285351,0.00012177164,0.000096624535,0.000054605345,0.00003529282,0.000569174,0.000043595937,0.000042385807],"category_scores_gemma":[0.00017348673,0.000056087167,0.000040162344,0.00021835424,0.00003650247,0.00041685486,0.0001588402,0.000038629634,0.000012368204],"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.000011377209,0.000046317793,0.057946086,0.000028338189,0.000016011914,0.0000039347497,0.0004875328,0.00000902015,0.49378958,0.2233274,0.0027539567,0.22158045],"study_design_scores_gemma":[0.00025070648,0.000097723314,0.0037717912,0.00012917383,0.0000039009274,0.000005866638,0.000020680438,0.013896156,0.9657813,0.014447904,0.0013352052,0.00025964438],"about_ca_topic_score_codex":0.00016906782,"about_ca_topic_score_gemma":0.00013196083,"teacher_disagreement_score":0.8726133,"about_ca_system_score_codex":0.000045271725,"about_ca_system_score_gemma":0.00003670789,"threshold_uncertainty_score":0.22871684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007767884,0.0000045806105,0.99079615,0.00015119731,0.00031210022,0.00056672277,0.000103416336,0.00022769351,0.00007025857],"genre_scores_gemma":[0.7268658,0.000028252329,0.27253586,0.00020386252,0.000025196347,0.00011517125,0.00001905962,0.000014818766,0.00019192426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989292,0.00007405873,0.00038621962,0.00017136129,0.00024206063,0.00019712627],"domain_scores_gemma":[0.99900115,0.00028723883,0.0001664583,0.00027239835,0.0002019451,0.00007083476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806437,0.00013930786,0.0001555362,0.00035014114,0.00017757347,0.0000567548,0.00026404197,0.000074892065,0.000024807368],"category_scores_gemma":[0.000008452703,0.00011556479,0.000052790747,0.00028830828,0.000055845176,0.0012252883,0.0000055627133,0.000089590416,0.0000054368884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048988422,0.00003507805,0.0000023425048,0.000043371387,0.000031563246,9.445194e-8,0.002332741,0.0008878891,0.012291745,0.009204837,0.000022773454,0.97509855],"study_design_scores_gemma":[0.0013785627,0.00041027064,0.00020910044,0.00036290108,0.00003793874,0.000017114355,0.00053356955,0.24666955,0.7459349,0.0036762562,0.00042927038,0.00034054666],"about_ca_topic_score_codex":0.000015799893,"about_ca_topic_score_gemma":7.9732825e-7,"teacher_disagreement_score":0.974758,"about_ca_system_score_codex":0.00008314549,"about_ca_system_score_gemma":0.000099202516,"threshold_uncertainty_score":0.47125953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014319827,0.000007413625,0.84814256,0.0055996613,0.0001580303,0.00012601839,0.0000014102666,0.0023454458,0.12929963],"genre_scores_gemma":[0.6813489,0.000011745542,0.22376937,0.00064819853,0.000045053835,0.0000106876205,5.2794735e-7,0.000018030078,0.0941475],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990342,0.00004541208,0.000116403826,0.00033277064,0.00022499387,0.00024619422],"domain_scores_gemma":[0.99904335,0.00009369739,0.00004683493,0.000664337,0.00006773559,0.00008405414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022318959,0.00010430686,0.00011939272,0.00009286646,0.00006947603,0.00003355982,0.00078968785,0.000053506643,0.00060913165],"category_scores_gemma":[0.00007407363,0.00007214237,0.000053309643,0.00024079687,0.00003977672,0.00033392422,0.0010353058,0.00004760713,0.0018170312],"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.000024406028,0.00017774255,0.0013428668,0.000013982162,0.000045675773,0.000088310655,0.0008693734,5.556863e-7,0.24433993,0.14376004,0.118833125,0.490504],"study_design_scores_gemma":[0.0018297038,0.0009774507,0.0052039404,0.00034438347,0.000029547455,0.00019258013,0.000023099108,0.015663896,0.6221749,0.03959284,0.31216002,0.0018076622],"about_ca_topic_score_codex":0.000090444504,"about_ca_topic_score_gemma":0.00003524795,"teacher_disagreement_score":0.6670291,"about_ca_system_score_codex":0.00019139593,"about_ca_system_score_gemma":0.00005979158,"threshold_uncertainty_score":0.9989602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010707617,0.0001625331,0.98600644,0.0011231632,0.00059026387,0.00060138054,0.000020384814,0.00056541094,0.0002228009],"genre_scores_gemma":[0.8619913,0.00006499941,0.1372871,0.000025220777,0.000016374692,0.00017699618,5.8908273e-7,0.000014765624,0.00042264033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878114,0.000053841763,0.00039421185,0.00041708615,0.000104386825,0.00024931203],"domain_scores_gemma":[0.9984859,0.00028187313,0.00018513658,0.00082961086,0.00017872381,0.000038760292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041728112,0.00015745881,0.00029083682,0.00062061264,0.00024479144,0.000050734587,0.00072643365,0.00026166916,0.000009245243],"category_scores_gemma":[0.000061552215,0.00012285194,0.000059931328,0.00046466303,0.00009534645,0.00043510267,0.000010385477,0.00013773546,0.0000041140083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014954758,0.000077791796,0.00008968523,0.000065487584,0.00006415371,0.0000023043833,0.00014128874,0.00015058913,0.07233055,0.01562255,0.00006428792,0.91137636],"study_design_scores_gemma":[0.0012527785,0.0010493274,0.000039844097,0.0008152965,0.000050866278,0.00039321787,0.00031508377,0.17267574,0.7884648,0.031355012,0.003016771,0.00057126785],"about_ca_topic_score_codex":0.0000733829,"about_ca_topic_score_gemma":0.000014620248,"teacher_disagreement_score":0.9108051,"about_ca_system_score_codex":0.000059343627,"about_ca_system_score_gemma":0.000054162487,"threshold_uncertainty_score":0.50097567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003599582,0.000081055754,0.9817548,0.013368264,0.0005845758,0.00053778366,0.000093190254,0.0014085292,0.0018118771],"genre_scores_gemma":[0.66162086,0.00023280608,0.33666304,0.00018411336,0.000020175688,0.00050300267,0.0000021852918,0.00002229985,0.00075152196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835104,0.00020964879,0.00042002922,0.0004382636,0.0002401136,0.00034092343],"domain_scores_gemma":[0.99347806,0.0021879505,0.00013929054,0.0037190337,0.0003349555,0.00014068502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039923235,0.00021123314,0.00023406679,0.0005000614,0.0009972344,0.000105969295,0.0025915457,0.0001448441,0.000020957872],"category_scores_gemma":[0.00009101991,0.0001777818,0.0002367293,0.001009423,0.00035424996,0.00049279514,0.000024475938,0.00029567452,0.00007501847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033360637,0.0010109514,0.00006426232,0.00002091994,0.00017914113,0.0000014081843,0.000508463,0.00012435725,0.018604795,0.34391618,0.006981559,0.62855464],"study_design_scores_gemma":[0.004432121,0.0017033285,0.000542729,0.0007973841,0.00036400097,0.0004869771,0.0003385189,0.07069015,0.4746953,0.18620218,0.25690752,0.0028397923],"about_ca_topic_score_codex":0.000041372885,"about_ca_topic_score_gemma":0.00016189287,"teacher_disagreement_score":0.6612609,"about_ca_system_score_codex":0.00019809433,"about_ca_system_score_gemma":0.00013754841,"threshold_uncertainty_score":0.7670021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037425585,0.00001608546,0.9948553,0.00067908695,0.00030852781,0.00031620223,3.2337763e-7,0.0009593413,0.0024909074],"genre_scores_gemma":[0.43987998,7.391717e-7,0.55855817,0.00016949352,0.00007478617,0.00005675125,0.0000024762755,0.000011640588,0.0012459882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990362,0.000022934655,0.00021662745,0.00031041968,0.0001766645,0.00023717707],"domain_scores_gemma":[0.9994145,0.000059086615,0.000094203366,0.0003161994,0.00007919633,0.00003678209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033803016,0.000112491645,0.00010402113,0.00012206764,0.00012790444,0.00013975981,0.0003430156,0.000059590897,0.000012575125],"category_scores_gemma":[0.00003338063,0.000107905755,0.000061247265,0.00013766493,0.000011100405,0.0001891387,0.00016928898,0.000057498877,0.0000066905513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099882745,0.00017715117,0.0012965689,0.00004520026,0.00001562559,0.000002842012,0.00037621838,0.87818146,0.0016779314,0.028231444,0.051625933,0.038359664],"study_design_scores_gemma":[0.00013744259,0.000058910115,0.0000683947,0.000015359348,0.0000018350675,0.0000040144278,0.00001770474,0.97967327,0.012995425,0.0058197533,0.0010562628,0.00015162221],"about_ca_topic_score_codex":0.00008640801,"about_ca_topic_score_gemma":0.000023773757,"teacher_disagreement_score":0.43950573,"about_ca_system_score_codex":0.00009451087,"about_ca_system_score_gemma":0.000025302177,"threshold_uncertainty_score":0.4400269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055529326,0.00009921544,0.98745775,0.000034442673,0.0014632007,0.000578177,0.0000113911055,0.0005609279,0.0042419345],"genre_scores_gemma":[0.45385897,0.0000051232737,0.5382277,0.000029953784,0.00011329282,0.00022889569,0.00003797297,0.000053154145,0.007444958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984805,0.00002463914,0.00040707094,0.0004976417,0.0003071749,0.0002829734],"domain_scores_gemma":[0.9980701,0.0005595225,0.00037896357,0.0005483273,0.0003884376,0.000054618573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040579677,0.0002374826,0.00036248195,0.00029268995,0.00009437663,0.000047174675,0.0010061958,0.00018985246,0.000011511893],"category_scores_gemma":[0.00027500754,0.00018699093,0.0001686626,0.0001906238,0.000019595771,0.00005603154,0.00007925803,0.00011076413,0.000008576208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012274095,0.00035343537,0.000029744966,0.0011662006,0.00019459822,0.0000057017546,0.0058347685,0.0010850568,0.038727872,0.13487528,0.0042483234,0.8133563],"study_design_scores_gemma":[0.0006135627,0.00051176234,0.00014114821,0.0019487031,0.00007725423,0.000011007238,0.00032468257,0.7369303,0.24405473,0.0141263055,0.00016510607,0.0010954295],"about_ca_topic_score_codex":0.00003476337,"about_ca_topic_score_gemma":0.000054923927,"teacher_disagreement_score":0.81226087,"about_ca_system_score_codex":0.000074178155,"about_ca_system_score_gemma":0.00014953119,"threshold_uncertainty_score":0.76252687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21408617,0.00046606088,0.7764747,0.001409485,0.0016933949,0.0010354967,0.00001956325,0.0008019587,0.004013154],"genre_scores_gemma":[0.99652386,0.00005270395,0.0024271624,0.00009924877,0.000087624794,0.00007682839,6.126917e-7,0.000032163778,0.0006998093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978521,0.00015221523,0.00031809302,0.0008886499,0.0003742731,0.00041468136],"domain_scores_gemma":[0.9978078,0.000067464214,0.00020812615,0.0015685359,0.00009077859,0.0002572782],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005512683,0.00032290095,0.0003880335,0.00017415635,0.0013229853,0.0007342535,0.00074584986,0.0001426939,0.0000069332496],"category_scores_gemma":[0.0000407869,0.00029029686,0.00010895494,0.00013301052,0.00030535148,0.00041597275,0.000014724684,0.00040292882,0.0000068222303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005662861,0.0006081636,0.001301291,0.0015424894,0.000447772,0.00015961195,0.00829279,0.0030198426,0.2198494,0.010503348,0.0006482765,0.7535704],"study_design_scores_gemma":[0.01433718,0.004030306,0.07205039,0.010409483,0.00083076186,0.012027856,0.0028437804,0.41821182,0.38334104,0.021129513,0.045750447,0.015037411],"about_ca_topic_score_codex":0.00031551757,"about_ca_topic_score_gemma":0.00030371101,"teacher_disagreement_score":0.7824377,"about_ca_system_score_codex":0.00006194304,"about_ca_system_score_gemma":0.00007446659,"threshold_uncertainty_score":0.9999772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070470414,0.00017220699,0.92923474,0.0020255975,0.0024800121,0.00043917637,0.0000068727254,0.004883252,0.060053453],"genre_scores_gemma":[0.60804564,0.000112350775,0.38772723,0.0007709357,0.00027272702,0.00015413838,0.000005842404,0.000063744024,0.002847379],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966796,0.0001753028,0.0005459141,0.001428949,0.00051009195,0.00066011405],"domain_scores_gemma":[0.9955188,0.0006938051,0.00035504598,0.0030225997,0.00021528854,0.00019443288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006883658,0.00054491893,0.0005231948,0.00036950616,0.00013469117,0.00035984785,0.004187427,0.0005380311,0.00013600398],"category_scores_gemma":[0.00038185006,0.00043926318,0.0002924383,0.00021562418,0.00008850617,0.00032163237,0.0048473175,0.000860535,0.00049004285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020702135,0.000600066,0.0021493537,0.00037682246,0.00026689828,0.00020234642,0.0033537534,0.00042650537,0.00033940992,0.1275751,0.08001427,0.78467476],"study_design_scores_gemma":[0.0009135496,0.00080179045,0.0006545313,0.0017880892,0.000078345074,0.00011890368,0.00010261172,0.37135798,0.023713123,0.5606997,0.034778204,0.0049931756],"about_ca_topic_score_codex":0.00022966466,"about_ca_topic_score_gemma":0.0001349659,"teacher_disagreement_score":0.7796816,"about_ca_system_score_codex":0.00032109534,"about_ca_system_score_gemma":0.00049237063,"threshold_uncertainty_score":0.9998059},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41955668,0.0000025177205,0.57968676,0.00008739904,0.0000972768,0.0003378686,0.0000024694234,0.00015010883,0.00007889409],"genre_scores_gemma":[0.68581796,0.0000032280004,0.31404993,0.00008571062,0.0000103854745,0.000012903029,0.0000022022496,0.000006937512,0.000010757687],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876523,0.000027141234,0.00035797452,0.00034804226,0.00025756375,0.00024407178],"domain_scores_gemma":[0.99865,0.00051413785,0.0002721223,0.00028482682,0.00022598919,0.000052932854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060102134,0.000137261,0.00020443082,0.00024597798,0.00012121486,0.000050192666,0.0004053877,0.00006274449,0.0000060396796],"category_scores_gemma":[0.00013509249,0.00009781472,0.000078329664,0.0003834161,0.000032716667,0.0006085207,0.00014191984,0.000047933365,0.000003677491],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001819454,0.000436123,0.12276232,0.0002209294,0.00012978596,0.0000043542504,0.0014931111,0.0023724807,0.039847918,0.18818754,0.00244438,0.64191914],"study_design_scores_gemma":[0.001767158,0.00069011253,0.04594449,0.00014761188,0.000023797536,0.000012035386,0.00024628156,0.40748125,0.48820645,0.0549829,0.000016791095,0.00048110465],"about_ca_topic_score_codex":0.00050811365,"about_ca_topic_score_gemma":0.00036241597,"teacher_disagreement_score":0.641438,"about_ca_system_score_codex":0.00016342898,"about_ca_system_score_gemma":0.00008502657,"threshold_uncertainty_score":0.39887688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08049097,0.000026193105,0.86678696,0.00022863662,0.00016575193,0.00009508135,1.6854459e-7,0.0013924257,0.05081379],"genre_scores_gemma":[0.6004515,0.0000022330096,0.3988693,0.00012200097,0.000041549632,0.000010208148,5.340836e-7,0.0000069139087,0.0004957351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990224,0.00004346338,0.00012925753,0.0002408676,0.00022736157,0.0003366514],"domain_scores_gemma":[0.999219,0.000065281005,0.00006665873,0.0004940018,0.000057646714,0.00009741619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047611297,0.000115085146,0.000100235186,0.00007994922,0.000103704304,0.00009766591,0.00042714208,0.00004717263,0.000053099266],"category_scores_gemma":[0.000038905502,0.00008961491,0.000031863518,0.00025614374,0.000021100532,0.0010609705,0.00017566497,0.00011916083,0.000054905093],"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.00007470065,0.0008400585,0.14936733,0.00011317406,0.00010924464,0.00012902678,0.011374095,0.00032940198,0.04253913,0.5880383,0.02867882,0.17840672],"study_design_scores_gemma":[0.00129992,0.001098824,0.044144332,0.0004163765,0.000056673776,0.0014292946,0.0007403301,0.11181907,0.80842113,0.0023987528,0.025395574,0.002779701],"about_ca_topic_score_codex":0.000029274548,"about_ca_topic_score_gemma":0.0000134063075,"teacher_disagreement_score":0.765882,"about_ca_system_score_codex":0.00005400644,"about_ca_system_score_gemma":0.000020190162,"threshold_uncertainty_score":0.36543897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66141146,0.0000070808865,0.33548206,0.00033469795,0.000068435904,0.00013186091,5.167701e-7,0.00040177067,0.0021621156],"genre_scores_gemma":[0.9688235,0.0000062063946,0.030702563,0.00040963944,0.000007771455,0.0000017594987,8.690101e-7,0.000005711211,0.0000419615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988673,0.00017284563,0.00014814695,0.00047268037,0.00014780865,0.00019127133],"domain_scores_gemma":[0.9988399,0.00062281557,0.0000990298,0.000313108,0.00004777497,0.000077354045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501854,0.000163818,0.00016939036,0.00022156212,0.0001645957,0.00015831467,0.00020013096,0.00007012775,0.000007720188],"category_scores_gemma":[0.00012566124,0.00015754692,0.000030419156,0.00026254522,0.000029906547,0.0010978186,0.00012929318,0.00018283095,0.0000017492322],"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.0010653364,0.0014827101,0.12560609,0.00022159994,0.00012953042,0.0014225105,0.011205761,0.0056548454,0.22535579,0.14363948,0.0019655335,0.4822508],"study_design_scores_gemma":[0.00033863552,0.0006393186,0.16871989,0.00014987403,0.000007106343,0.00003573084,0.00008159152,0.81957626,0.0077894214,0.0023524181,0.000031781216,0.0002779864],"about_ca_topic_score_codex":0.000111654714,"about_ca_topic_score_gemma":0.00002457738,"teacher_disagreement_score":0.8139214,"about_ca_system_score_codex":0.00013099113,"about_ca_system_score_gemma":0.00003186541,"threshold_uncertainty_score":0.64245766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30345705,0.00007483374,0.6938713,0.000104875115,0.00018702219,0.0007150677,0.0000021445562,0.00043520634,0.0011524521],"genre_scores_gemma":[0.91845363,0.000007249371,0.081244834,0.00009888019,0.000012863078,0.000011161192,7.871842e-7,0.000014275715,0.00015632433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672365,0.000999033,0.0006792853,0.00057378644,0.00064142724,0.00038282978],"domain_scores_gemma":[0.9965246,0.0014387801,0.00073233555,0.000941026,0.00026457317,0.00009872153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002595394,0.00032908045,0.0008356137,0.00095902977,0.00013906282,0.000088147644,0.0016018772,0.0001331763,0.0000044531985],"category_scores_gemma":[0.00042004552,0.00027494904,0.00014712577,0.0015680837,0.00008200195,0.0005929802,0.00014321382,0.00027793925,0.0000057365755],"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.00022370071,0.0024130836,0.000814193,0.013933312,0.00032963822,0.00012084505,0.020120732,0.22303623,0.27712312,0.4552364,0.002185233,0.004463526],"study_design_scores_gemma":[0.00041880782,0.0015667904,0.00052568276,0.0029286582,0.000049409722,0.000022257987,0.00032467293,0.5497425,0.43505332,0.00886977,7.935133e-7,0.00049730943],"about_ca_topic_score_codex":0.00027176717,"about_ca_topic_score_gemma":0.000015015982,"teacher_disagreement_score":0.61499655,"about_ca_system_score_codex":0.00014768941,"about_ca_system_score_gemma":0.00013081156,"threshold_uncertainty_score":0.99997026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009859732,0.000100397374,0.9839885,0.0008622976,0.00099273,0.00041864638,0.000043321692,0.0007329681,0.0030014047],"genre_scores_gemma":[0.99615914,0.000022150123,0.0020807465,0.00036824218,0.000061514846,0.00007233791,6.2642465e-7,0.00004568009,0.0011895591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768883,0.0002511147,0.00035732394,0.0007739226,0.0004783403,0.00045045238],"domain_scores_gemma":[0.9982071,0.00037814074,0.00013371036,0.00092821196,0.000077929166,0.00027493868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004510787,0.00034381365,0.00034133135,0.00026534873,0.00042990368,0.00023476164,0.00055245194,0.00019737799,0.000030257552],"category_scores_gemma":[0.000027556005,0.00024870297,0.00016958981,0.0003352621,0.0000945659,0.00020528868,0.0000037844518,0.00028805892,0.000019193854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045700566,0.00028116078,0.0003253353,0.00021359592,0.00014007211,0.00009502645,0.0011498582,0.014001724,0.15123266,0.002719614,0.00072270737,0.82907254],"study_design_scores_gemma":[0.012683908,0.006373975,0.002218737,0.017186282,0.00047095717,0.0027716747,0.0018208937,0.48240528,0.35207567,0.0018729125,0.11061681,0.009502911],"about_ca_topic_score_codex":0.00011883049,"about_ca_topic_score_gemma":0.00030078588,"teacher_disagreement_score":0.9862994,"about_ca_system_score_codex":0.00016413949,"about_ca_system_score_gemma":0.00010983438,"threshold_uncertainty_score":0.99999654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26132205,0.000008558582,0.73778766,0.0002201946,0.00009556558,0.00034449203,0.0000099163835,0.000108735505,0.00010283558],"genre_scores_gemma":[0.66706413,0.0000072846815,0.332745,0.00004104019,0.000019095432,0.000024827254,0.000009064336,0.000006681787,0.00008289902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991328,0.000022925697,0.00017652003,0.00029873953,0.00018076717,0.00018821325],"domain_scores_gemma":[0.9991432,0.000058840324,0.00014228963,0.000462294,0.00014891048,0.000044463064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050633383,0.00009794937,0.00014789488,0.00009363816,0.00028810202,0.00012970943,0.00053054537,0.000039374027,0.0000035981864],"category_scores_gemma":[0.000025676658,0.000092160764,0.000034607656,0.000058024623,0.00007657449,0.0002758166,0.000294549,0.00005715009,5.5238655e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007081139,0.00007347857,0.0014451649,0.000056409404,0.00002627402,0.0000023367365,0.0014102983,0.00001162965,0.11098922,0.0026749023,0.000062224535,0.883241],"study_design_scores_gemma":[0.00023914149,0.00013794022,0.018109467,0.00005998277,0.0000066904677,0.0000053462345,0.0000856724,0.62993103,0.35099173,0.00021296719,0.00009470724,0.00012532758],"about_ca_topic_score_codex":0.0000697226,"about_ca_topic_score_gemma":0.0000067611863,"teacher_disagreement_score":0.88311565,"about_ca_system_score_codex":0.000025141426,"about_ca_system_score_gemma":0.000029518833,"threshold_uncertainty_score":0.37582067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054340947,0.00032897695,0.9188394,0.0044211573,0.0025994712,0.00085934374,0.000013270519,0.0025419586,0.0160555],"genre_scores_gemma":[0.9646709,0.000071612536,0.033174857,0.00032814138,0.0002974922,0.00012572408,0.0000027985252,0.000031421954,0.0012970672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972314,0.00017296222,0.000462004,0.0013095682,0.00034499535,0.0004790578],"domain_scores_gemma":[0.99742955,0.00012871566,0.00024682714,0.0020134146,0.00010595704,0.00007554966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073866453,0.00036793,0.00041598588,0.00029696157,0.00004127955,0.00021502901,0.00280934,0.0002065325,0.000022733928],"category_scores_gemma":[0.00013771608,0.00029848132,0.000107101325,0.00017173914,0.000057194455,0.0002774493,0.0039121485,0.0007662246,0.00007206482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003994748,0.00041319247,0.05412734,0.0004883216,0.000065863525,0.00020347165,0.0035074083,0.000072945266,0.008233079,0.003314824,0.07977097,0.8497626],"study_design_scores_gemma":[0.0032605878,0.0010525567,0.14625774,0.010734258,0.000053287815,0.0002602868,0.000110820474,0.07057387,0.5450343,0.17063186,0.039502904,0.012527571],"about_ca_topic_score_codex":0.000995164,"about_ca_topic_score_gemma":0.001272046,"teacher_disagreement_score":0.91032994,"about_ca_system_score_codex":0.00025250737,"about_ca_system_score_gemma":0.00027688115,"threshold_uncertainty_score":0.9999467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055794384,0.000002541029,0.9366357,0.00024267993,0.0007766433,0.00024436787,0.0000044117846,0.00046095875,0.0058383206],"genre_scores_gemma":[0.99625415,0.000009303487,0.0031615251,0.00038687797,0.000009156405,0.000090902,0.0000017894804,0.000007681863,0.00007863428],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989277,0.0000930828,0.00033599776,0.00016941696,0.00027589872,0.0001978958],"domain_scores_gemma":[0.9986233,0.00011952506,0.00013750473,0.0009947517,0.00007086453,0.00005402701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076578325,0.00014495605,0.00012001959,0.0005375122,0.00055280974,0.00037745145,0.00070377294,0.00009642324,0.000022669901],"category_scores_gemma":[0.000037854967,0.00014564718,0.000080553036,0.00020417469,0.000061351326,0.003735803,0.0000044613043,0.0002714232,0.00018986413],"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.00011643537,0.00019754046,0.00008843003,0.000026176629,0.000024978359,0.0000040868945,0.004334872,0.030403048,0.00079990015,0.33789694,0.00023861094,0.625869],"study_design_scores_gemma":[0.001133371,0.00062978506,0.004338096,0.00033403674,0.00002202052,0.000031315652,0.00021302991,0.30012345,0.38253337,0.30828354,0.0013678148,0.0009901657],"about_ca_topic_score_codex":0.000034847504,"about_ca_topic_score_gemma":0.00004268042,"teacher_disagreement_score":0.9404597,"about_ca_system_score_codex":0.000086976186,"about_ca_system_score_gemma":0.000036572044,"threshold_uncertainty_score":0.593932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05820962,0.000018864976,0.93721783,0.0005425315,0.00050161796,0.0019128544,0.00008295129,0.00058416906,0.0009295508],"genre_scores_gemma":[0.99690783,0.000026717616,0.0017631919,0.0005689162,0.000028151955,0.00063864124,0.000015155161,0.000016821417,0.00003455364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736756,0.0006622732,0.00079117104,0.00029536372,0.0005403682,0.00034324196],"domain_scores_gemma":[0.9961262,0.002109676,0.00046271124,0.00084505853,0.0003544464,0.00010195919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024436763,0.00032728256,0.00038779186,0.00047736507,0.0007316532,0.00019385773,0.0006408879,0.00017216509,0.000045114393],"category_scores_gemma":[0.00017441576,0.00023889335,0.00028155037,0.0008768158,0.0005216557,0.0012023379,0.000007606259,0.00039160455,0.00004123993],"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.05289158,0.0031299607,0.00020726639,0.0008262964,0.0009872401,0.0000069461216,0.029643418,0.026678888,0.013068065,0.35341778,0.0075328224,0.51160973],"study_design_scores_gemma":[0.025532046,0.002164035,0.00025636368,0.0006684807,0.00018074579,0.000043425385,0.0007356708,0.14925437,0.7364474,0.08111392,0.0025497626,0.0010537687],"about_ca_topic_score_codex":0.000047729176,"about_ca_topic_score_gemma":0.000036266283,"teacher_disagreement_score":0.93869823,"about_ca_system_score_codex":0.000061732695,"about_ca_system_score_gemma":0.00009653202,"threshold_uncertainty_score":0.9741788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031030823,0.0000076271554,0.9950985,0.0008498727,0.000058262878,0.00016766241,9.0123297e-7,0.00023296622,0.00048114016],"genre_scores_gemma":[0.4083194,0.000014521049,0.59153825,0.000029423616,0.0000099475,0.000010119378,8.999651e-7,0.0000033843335,0.00007406217],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943864,0.00002824961,0.00015725117,0.0001681545,0.00012261597,0.00008509482],"domain_scores_gemma":[0.99959135,0.00003104459,0.000098077086,0.00017382103,0.00008137427,0.000024348135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001867639,0.000054795895,0.000059343496,0.00008357723,0.00003425216,0.000023686829,0.00013737733,0.000024412675,0.000024609268],"category_scores_gemma":[0.0000130833905,0.00003704745,0.000011513709,0.00014432777,0.000018529516,0.00050097995,0.000078140634,0.000016832833,0.0000016730459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.608419e-7,0.000011446928,0.00129358,0.0000057458383,0.0000031510751,3.102794e-7,0.00031198378,0.000011976975,0.0071374,0.012291884,0.00014979464,0.9787822],"study_design_scores_gemma":[0.0007216817,0.0004602314,0.011208479,0.000082646926,0.000009179228,0.00002257009,0.00015601687,0.23063771,0.7504473,0.0057713883,0.00018632911,0.0002964867],"about_ca_topic_score_codex":0.00007249877,"about_ca_topic_score_gemma":0.0000227237,"teacher_disagreement_score":0.9784857,"about_ca_system_score_codex":0.00002415536,"about_ca_system_score_gemma":0.000024493469,"threshold_uncertainty_score":0.15107512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014944891,0.0002504511,0.9050367,0.0027760635,0.00583717,0.00041019436,0.00000400067,0.0038206957,0.06691982],"genre_scores_gemma":[0.7410334,0.000020889036,0.25560507,0.00032802642,0.00014165146,0.000040408613,0.000005698336,0.000022911294,0.002801994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799407,0.00007385812,0.00030846184,0.00090514286,0.00033670285,0.00038179205],"domain_scores_gemma":[0.99617165,0.00011064504,0.00037616302,0.0031258648,0.00013306638,0.000082622275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052032014,0.00032097858,0.0003461477,0.00018852553,0.0002499592,0.00093107694,0.0050678137,0.00029566273,0.000022703229],"category_scores_gemma":[0.00021510429,0.0003043177,0.0001968517,0.00006101091,0.000049825154,0.00034334493,0.0070066014,0.00084288407,0.000077567485],"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.000007899437,0.00012241208,0.0059483787,0.0002634878,0.00008330449,0.00023931504,0.0016465273,0.00022055718,0.00085257745,0.034819,0.11337031,0.84242624],"study_design_scores_gemma":[0.0001827727,0.0000792661,0.0027257258,0.00045094095,0.00002596122,0.00011727307,0.000016502901,0.9056456,0.015206467,0.05895253,0.015101422,0.001495509],"about_ca_topic_score_codex":0.00037865405,"about_ca_topic_score_gemma":0.00010955768,"teacher_disagreement_score":0.9054251,"about_ca_system_score_codex":0.000093895076,"about_ca_system_score_gemma":0.00013856165,"threshold_uncertainty_score":0.9999409},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05471276,0.000016455526,0.9441751,0.00018753193,0.00013490237,0.00012915803,0.0000036823078,0.00024047396,0.000399938],"genre_scores_gemma":[0.9659776,0.0000057982834,0.03389108,0.00004629273,0.000019465013,0.00002334244,4.539319e-7,0.000010452732,0.000025522755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990638,0.000037035006,0.00023043493,0.00025486483,0.00025151286,0.0001623379],"domain_scores_gemma":[0.99915594,0.000037389,0.00022889423,0.00039309464,0.00014297423,0.00004168199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024423428,0.00011310363,0.00013125873,0.00014008147,0.00067322265,0.00024850777,0.00057259406,0.000050094633,0.000022564845],"category_scores_gemma":[0.000002076403,0.00011611988,0.00006351357,0.000110317145,0.00006891632,0.0012184496,0.000003704301,0.00014549533,0.000006401413],"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.000015740614,0.00009637292,0.00025612142,0.00005228055,0.000012884072,0.0000040393816,0.001095903,0.0005401864,0.073132955,0.00024233089,0.000027818822,0.92452335],"study_design_scores_gemma":[0.00023212399,0.00017265404,0.0008899696,0.00014049973,0.000018299346,0.000015047784,0.00014205287,0.037005335,0.9601061,0.0011031374,0.000018887316,0.0001559029],"about_ca_topic_score_codex":0.00018196461,"about_ca_topic_score_gemma":0.000108662214,"teacher_disagreement_score":0.9243675,"about_ca_system_score_codex":0.000047996,"about_ca_system_score_gemma":0.000090075686,"threshold_uncertainty_score":0.51779526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08062665,0.00001334958,0.86631316,0.050013978,0.0002337468,0.00045509342,0.0000025432196,0.0007744035,0.0015670967],"genre_scores_gemma":[0.87662274,0.000007254066,0.12149018,0.0015535171,0.000033401207,0.00020654008,0.000002732447,0.000017647533,0.000065985616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988472,0.00018303233,0.0001967196,0.00031045152,0.00023673716,0.00022585674],"domain_scores_gemma":[0.9926512,0.00018533561,0.00029884768,0.00670551,0.00010577477,0.00005328955],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045025756,0.00016262957,0.00014775738,0.00014191626,0.0013670826,0.00039247985,0.005010407,0.000053008964,0.0000018156239],"category_scores_gemma":[0.00014573433,0.00014636722,0.000047771802,0.0001576617,0.00029184195,0.0005856143,0.0004722284,0.00042488732,0.000049833874],"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.0003710806,0.0024720766,0.007335494,0.00015872472,0.00050218374,0.000117286865,0.010950083,0.018238975,0.24239208,0.3493957,0.03967809,0.3283882],"study_design_scores_gemma":[0.0030202465,0.0026025637,0.011296025,0.0012961841,0.000096778575,0.00020165741,0.00022387263,0.8269025,0.11160861,0.016690848,0.023112021,0.0029487102],"about_ca_topic_score_codex":0.0004608539,"about_ca_topic_score_gemma":0.0005606969,"teacher_disagreement_score":0.8086635,"about_ca_system_score_codex":0.00011699589,"about_ca_system_score_gemma":0.00004586588,"threshold_uncertainty_score":0.999933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043917477,0.0013005948,0.9525195,0.0005078397,0.0011502818,0.00031829372,0.0000018953142,0.00013935371,0.00014477473],"genre_scores_gemma":[0.9209615,0.000004310623,0.07820111,0.00004959752,0.0006643112,0.0000106508105,2.3912855e-7,0.000030037949,0.00007827665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785095,0.000087908134,0.000718771,0.00032541584,0.00063027244,0.00038665195],"domain_scores_gemma":[0.9961543,0.00013098489,0.002184878,0.0005874111,0.00077609264,0.00016632161],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013572774,0.00025208932,0.0004997207,0.00026532856,0.0007638333,0.0015383416,0.0024719127,0.00015233885,7.751693e-7],"category_scores_gemma":[0.0002763633,0.00019886545,0.00022228782,0.00012040984,0.000070481394,0.0010729445,0.00015521498,0.0004778123,7.592905e-7],"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.00045401347,0.00032170105,0.0070235063,0.0037197198,0.00061323924,0.0007299874,0.010686813,0.055114493,0.11488754,0.0019865842,0.004428073,0.80003434],"study_design_scores_gemma":[0.0035243698,0.0019699198,0.0043600583,0.007548996,0.00024791216,0.007271629,0.00058215065,0.9023323,0.03896875,0.02516633,0.0062634973,0.0017641071],"about_ca_topic_score_codex":0.000022226162,"about_ca_topic_score_gemma":0.0000126998075,"teacher_disagreement_score":0.877044,"about_ca_system_score_codex":0.00011102356,"about_ca_system_score_gemma":0.0003283713,"threshold_uncertainty_score":0.9994981},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039863884,0.000102301485,0.9937209,0.00059876847,0.00022314966,0.00025638848,0.00001186275,0.00047134233,0.00062891626],"genre_scores_gemma":[0.9309876,0.000011847527,0.068465754,0.00010884439,0.000047345995,0.0000534244,9.162031e-7,0.00002080768,0.0003034382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883723,0.00002816796,0.00020967833,0.00045376254,0.00020246324,0.00026871057],"domain_scores_gemma":[0.9989699,0.00015068776,0.00024096588,0.000379886,0.00017235985,0.00008621555],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028402248,0.00017945272,0.00017704371,0.0001534265,0.0019656383,0.00097029033,0.0005994313,0.000091237824,0.0000053872895],"category_scores_gemma":[0.000014560898,0.00018301238,0.00006461214,0.00011652237,0.0001287181,0.0014551631,0.0000056394983,0.000200618,0.0000025150875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059944457,0.00007618416,0.00020294126,0.00014040273,0.000018504372,0.0000027807419,0.0010080328,0.0033787964,0.01661724,0.00027296325,0.00007355894,0.97814864],"study_design_scores_gemma":[0.0004785861,0.00020260281,0.00016714228,0.00027829196,0.000031074866,0.000016973794,0.00008640621,0.63868773,0.35632432,0.003055464,0.00029035966,0.0003810189],"about_ca_topic_score_codex":0.00012070079,"about_ca_topic_score_gemma":0.00014949124,"teacher_disagreement_score":0.97776765,"about_ca_system_score_codex":0.000063164836,"about_ca_system_score_gemma":0.000110034984,"threshold_uncertainty_score":0.9993337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007370048,0.00021096716,0.98704976,0.0017181253,0.0008717821,0.0006320438,0.000025696298,0.00036433467,0.0017572725],"genre_scores_gemma":[0.317747,0.0000799692,0.6819661,0.000056601126,0.00007012211,0.000046853955,0.0000042852853,0.000012208544,0.000016821996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998448,0.000088918314,0.00032954483,0.0006803925,0.00023348503,0.00021966755],"domain_scores_gemma":[0.9970889,0.000604033,0.00047481456,0.0013951041,0.0003553339,0.00008177938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053722906,0.00024970924,0.00049338414,0.00012856608,0.00016899822,0.00020242484,0.001183976,0.00043768215,0.00001111766],"category_scores_gemma":[0.00042040762,0.00021976634,0.00015191935,0.00005154718,0.0007089394,0.00014187834,0.0014482572,0.00057760347,0.0000010065302],"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.00001389418,0.000018996236,0.00035074566,0.000102693,0.000029205788,0.0000012624787,0.0005628716,0.0000016986249,0.000073808165,0.96407604,0.00017708782,0.034591705],"study_design_scores_gemma":[0.00008918789,0.00016261985,0.00016398967,0.0005688462,0.00003098574,0.000042151896,0.00010654007,0.005052056,0.017649382,0.97575915,0.00011626651,0.0002588376],"about_ca_topic_score_codex":0.00006203195,"about_ca_topic_score_gemma":0.000008868792,"teacher_disagreement_score":0.31037697,"about_ca_system_score_codex":0.000033897137,"about_ca_system_score_gemma":0.00015125154,"threshold_uncertainty_score":0.89618117},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07906436,0.000022597727,0.8780069,0.00049363583,0.00029509127,0.000104333856,0.0000016293842,0.00037038984,0.0416411],"genre_scores_gemma":[0.92083436,0.0000059181143,0.07856216,0.000049800943,0.00003533332,0.0000033141193,7.1085725e-7,0.0000065713098,0.0005018514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915713,0.000028955958,0.00020517847,0.00025718985,0.00018184724,0.00016967904],"domain_scores_gemma":[0.99836445,0.00012346552,0.00034438368,0.0009850524,0.00013768226,0.000044950713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932121,0.0000974509,0.0001525515,0.0000771593,0.00033533672,0.00026225683,0.0014096932,0.000052136817,0.00001994848],"category_scores_gemma":[0.00026022145,0.00009059598,0.00004834126,0.00007769296,0.000066163535,0.00069326547,0.00038188222,0.00008668165,0.000007669862],"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.00002288505,0.00012203856,0.2812011,0.00011029136,0.000044314136,0.00001757662,0.00220566,0.00015043955,0.14749989,0.2856264,0.0037473144,0.27925208],"study_design_scores_gemma":[0.00040496766,0.00014972941,0.04480351,0.00017020604,0.000010904258,0.000011621013,0.00009395642,0.25625566,0.68310684,0.013329613,0.0011147558,0.0005482441],"about_ca_topic_score_codex":0.0008790284,"about_ca_topic_score_gemma":0.000529372,"teacher_disagreement_score":0.84177,"about_ca_system_score_codex":0.000032556873,"about_ca_system_score_gemma":0.00003988388,"threshold_uncertainty_score":0.3694397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033868104,0.00035723232,0.94477504,0.015999695,0.00086913345,0.0006340227,0.000012784482,0.0016515763,0.001832394],"genre_scores_gemma":[0.7608598,0.00015796267,0.2377844,0.0007890946,0.00007148244,0.00023471956,0.000017999297,0.000034121535,0.000050432613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998091,0.00033278522,0.00032619195,0.00061678217,0.00033178463,0.00030146557],"domain_scores_gemma":[0.98539907,0.00023519683,0.00064960594,0.013418144,0.00021652528,0.00008146336],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005828598,0.0003359811,0.00032501764,0.00034541773,0.00092311465,0.0008200197,0.011217547,0.0002306523,0.0000012266446],"category_scores_gemma":[0.000086939704,0.00033585413,0.0001277769,0.00018690512,0.00036131265,0.00044623253,0.0033479324,0.0016087511,0.000035785295],"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.00025303676,0.001816138,0.012330274,0.0009072223,0.0020792924,0.00018187781,0.02136316,0.0071533476,0.41172847,0.010702051,0.048563365,0.48292175],"study_design_scores_gemma":[0.0046188273,0.0010116762,0.019738793,0.0072915335,0.0009734478,0.0010286451,0.00027530603,0.41508847,0.366746,0.03168364,0.13964334,0.011900295],"about_ca_topic_score_codex":0.0009876951,"about_ca_topic_score_gemma":0.0013192132,"teacher_disagreement_score":0.72699165,"about_ca_system_score_codex":0.00022438675,"about_ca_system_score_gemma":0.0001526563,"threshold_uncertainty_score":0.99990934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03072674,0.000015184576,0.9554301,0.00045408643,0.00026295983,0.00006809182,1.3968386e-7,0.0009013087,0.012141422],"genre_scores_gemma":[0.8719915,3.5599575e-7,0.12754884,0.00014646267,0.000042723466,0.00000483566,1.50688e-7,0.0000078751755,0.0002572577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988541,0.00002835624,0.00013655434,0.00040296977,0.00028542455,0.00029259018],"domain_scores_gemma":[0.99843895,0.00009624549,0.00018552475,0.0011075042,0.000097199256,0.00007456273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025721188,0.00013902035,0.00014008123,0.00007265416,0.00064804766,0.0005092396,0.0018379557,0.000037010686,0.000004821503],"category_scores_gemma":[0.000056535995,0.00010190296,0.000032190255,0.00009045144,0.0001174483,0.000227128,0.0005505912,0.00009890704,0.000012473918],"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.000022022556,0.00024514826,0.0030237562,0.000031882453,0.00006853824,0.0001959016,0.002848975,0.08345888,0.0032518625,0.5454229,0.0014853984,0.3599447],"study_design_scores_gemma":[0.00013937139,0.00014596106,0.00092997804,0.00008272264,0.000004021947,0.000075388794,0.000033835426,0.9887688,0.0073142117,0.002142785,0.00009632295,0.00026659342],"about_ca_topic_score_codex":0.000650654,"about_ca_topic_score_gemma":0.00014490735,"teacher_disagreement_score":0.9053099,"about_ca_system_score_codex":0.00003733992,"about_ca_system_score_gemma":0.00007296374,"threshold_uncertainty_score":0.49843243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02760248,0.0001507806,0.9656278,0.0011101054,0.0016062473,0.001860571,0.00006416671,0.001603729,0.00037414403],"genre_scores_gemma":[0.4764899,0.000017595818,0.52304816,0.00012489685,0.000034772773,0.0001445236,0.000019843696,0.00003035751,0.000089967485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965968,0.00014978365,0.00058157195,0.0017342467,0.00039931125,0.0005382532],"domain_scores_gemma":[0.99639165,0.00042687004,0.000617128,0.0018635199,0.0005000596,0.0002007495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014939365,0.00051858975,0.00058663,0.0002824232,0.0005463432,0.0006025176,0.0018411534,0.0004907938,0.0000010080361],"category_scores_gemma":[0.0008000391,0.0005132278,0.00024215964,0.00008773643,0.0002079328,0.00016681965,0.0024216191,0.0006307307,0.0000049174523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015959794,0.0013479207,0.003710202,0.0026288615,0.0002693382,0.000025176883,0.016831562,0.8932964,0.0010049201,0.008208878,0.009877741,0.062639385],"study_design_scores_gemma":[0.00042278063,0.00008523292,0.0006770249,0.00017470263,0.00002609102,0.000008313262,0.00005453357,0.9797432,0.0011962455,0.016940242,0.00009745919,0.0005742071],"about_ca_topic_score_codex":0.0016128868,"about_ca_topic_score_gemma":0.0006813234,"teacher_disagreement_score":0.4488874,"about_ca_system_score_codex":0.00025766075,"about_ca_system_score_gemma":0.00029630974,"threshold_uncertainty_score":0.99973196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9123604,0.00008671807,0.027770942,0.057139367,0.0002270611,0.0005208566,0.000013025362,0.00010883186,0.0017727948],"genre_scores_gemma":[0.91007304,0.00008581332,0.0858577,0.0038746966,0.000013139388,0.00006979383,0.000004594221,0.000011172311,0.000010045075],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987749,0.00019788755,0.00034525408,0.00026188372,0.00019331735,0.0002267502],"domain_scores_gemma":[0.99442244,0.000774804,0.0002848461,0.004438651,0.000043781158,0.000035491626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095832,0.00015420529,0.00018912725,0.00011031342,0.00070710585,0.00019179669,0.0043111253,0.000042546617,0.000008243133],"category_scores_gemma":[0.0000835687,0.00013798109,0.000047791982,0.0001622645,0.00037300333,0.00031148666,0.00088347093,0.00033511015,0.0000019628028],"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.00011757322,0.0018403422,0.1736405,0.00021564956,0.00061144837,0.000055985143,0.01734339,0.0008375844,0.63020396,0.04617887,0.08863592,0.040318754],"study_design_scores_gemma":[0.0070298286,0.0015379693,0.57317305,0.0050573098,0.00029834974,0.00012572645,0.0031894809,0.19703972,0.14059992,0.026556425,0.040856898,0.0045353128],"about_ca_topic_score_codex":0.00096163095,"about_ca_topic_score_gemma":0.00079146953,"teacher_disagreement_score":0.48960406,"about_ca_system_score_codex":0.00007700639,"about_ca_system_score_gemma":0.00003824858,"threshold_uncertainty_score":0.80112153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59111863,0.00025493055,0.39144817,0.014623492,0.00084990344,0.0005119048,0.0000068494674,0.000755566,0.0004305513],"genre_scores_gemma":[0.6934175,0.000040657706,0.30623752,0.00008778069,0.000052615305,0.00001553088,0.0000015389018,0.000021834461,0.0001250333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977755,0.00011866756,0.00096300535,0.000381395,0.0003081781,0.00045325383],"domain_scores_gemma":[0.9932976,0.00059916533,0.0022993153,0.002583354,0.0011024231,0.00011815517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017726729,0.00027774562,0.00061790814,0.00074163254,0.00081536005,0.00033041055,0.0049022636,0.0004217979,0.000014924379],"category_scores_gemma":[0.0021393045,0.00023800203,0.00019190078,0.0003295241,0.0004635844,0.0009750292,0.0010617948,0.00080971664,0.000036029764],"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.00049135764,0.00089883996,0.0015078379,0.00014820306,0.00025993536,0.00068157155,0.0006993007,0.000057029734,0.05187099,0.5254037,0.013389154,0.4045921],"study_design_scores_gemma":[0.003079007,0.0023597507,0.0037008598,0.0007544456,0.00009700245,0.001729278,0.000083984865,0.012767592,0.3152709,0.6527538,0.006634392,0.0007690376],"about_ca_topic_score_codex":0.000036597317,"about_ca_topic_score_gemma":0.000052371994,"teacher_disagreement_score":0.40382305,"about_ca_system_score_codex":0.00024235637,"about_ca_system_score_gemma":0.00016153666,"threshold_uncertainty_score":0.9705441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060439155,0.0000062605623,0.9129603,0.0022212472,0.00024861412,0.00010733941,2.277173e-7,0.0001973866,0.023819491],"genre_scores_gemma":[0.9801328,5.362509e-7,0.019081518,0.00037494622,0.000011137874,0.000008498224,2.5225093e-8,0.000003799015,0.0003867406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994286,0.000020908226,0.00009919213,0.00016667953,0.00016652308,0.000118096956],"domain_scores_gemma":[0.9981955,0.0002474459,0.00012677322,0.0013547306,0.0000544666,0.00002102947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024903077,0.00006622342,0.00008039499,0.0000258163,0.00022300307,0.000096362586,0.0019176694,0.000024127447,0.000012902657],"category_scores_gemma":[0.00040550684,0.000041231826,0.00003765259,0.000041036667,0.00007159665,0.00016379922,0.00022353955,0.00009244927,0.000023711238],"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.000009377697,0.00006433329,0.00024893938,0.000008270076,0.000012020151,0.0000036449399,0.0010346603,0.0013380212,0.0018271527,0.94580823,0.010153152,0.039492194],"study_design_scores_gemma":[0.00030564851,0.000343891,0.005643726,0.00020773408,0.0000064019864,0.000013585602,0.00007310504,0.7539466,0.08482048,0.15394706,0.000282301,0.00040949616],"about_ca_topic_score_codex":0.00009444508,"about_ca_topic_score_gemma":0.000050618608,"teacher_disagreement_score":0.91969365,"about_ca_system_score_codex":0.000010880183,"about_ca_system_score_gemma":0.00002066844,"threshold_uncertainty_score":0.35635388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007543072,0.0000028151544,0.9786197,0.00009464236,0.00061877025,0.00011715517,0.000005772013,0.00030389975,0.012694181],"genre_scores_gemma":[0.98088795,0.000010454382,0.018795712,0.00012812483,0.000008309376,0.000023044066,4.6133596e-7,0.0000044090493,0.00014153363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992633,0.000039191244,0.00028298414,0.00009214297,0.00019295591,0.00012945787],"domain_scores_gemma":[0.9986132,0.00014290564,0.00029045396,0.00079486315,0.000119307886,0.000039296778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504108,0.00009713602,0.00011518543,0.00021420304,0.00047697496,0.0001901815,0.00081143243,0.000060813396,0.000030462808],"category_scores_gemma":[0.000033080763,0.00009299399,0.00007661867,0.0000789059,0.000080493744,0.0030209664,0.000005525589,0.00014757054,0.000060630646],"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.000048901722,0.00007174907,0.000048277434,0.00005194588,0.000038718314,6.798314e-7,0.0069744918,0.0031488573,0.0013063499,0.08488018,0.00020319523,0.9032267],"study_design_scores_gemma":[0.0007028996,0.00022143437,0.00089244853,0.00021256859,0.000022885974,0.00003070886,0.00082276843,0.058663804,0.90339345,0.033954423,0.00062930625,0.00045333576],"about_ca_topic_score_codex":0.000018160263,"about_ca_topic_score_gemma":0.0000074458567,"teacher_disagreement_score":0.97334486,"about_ca_system_score_codex":0.00003631345,"about_ca_system_score_gemma":0.00003804172,"threshold_uncertainty_score":0.3792185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018616231,0.000013623569,0.9967777,0.00035650787,0.00003110091,0.0003333608,1.8582446e-7,0.00017951675,0.00044638343],"genre_scores_gemma":[0.16321893,0.000008999731,0.8366411,0.00004134649,0.000009963951,0.000019149948,1.1031322e-7,0.0000066936104,0.000053721727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993427,0.000057961533,0.00011443304,0.00020470911,0.00016143403,0.00011875363],"domain_scores_gemma":[0.99895895,0.00011761963,0.0001607921,0.0006443809,0.00009124545,0.000027040405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036922298,0.00008842294,0.000099330275,0.000037746482,0.00023837305,0.00017962864,0.00049978093,0.000029902698,0.0000024447104],"category_scores_gemma":[0.00009942258,0.00005111216,0.000013973598,0.00006089108,0.000091092836,0.00014697232,0.00015948724,0.000073786956,8.199405e-7],"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.000024908899,0.00023647117,0.0012193149,0.00004466977,0.00006795025,0.000023180299,0.001972363,0.08004756,0.0010322541,0.030004725,0.0002734995,0.8850531],"study_design_scores_gemma":[0.00008947361,0.0004364002,0.0005236943,0.000056276433,0.0000052786627,0.000014874588,0.000018512997,0.9783414,0.019744622,0.0006703548,0.000012638381,0.0000865009],"about_ca_topic_score_codex":0.00006986055,"about_ca_topic_score_gemma":0.0000047634576,"teacher_disagreement_score":0.8982938,"about_ca_system_score_codex":0.000009665302,"about_ca_system_score_gemma":0.000028732346,"threshold_uncertainty_score":0.20842935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07992696,0.00004969145,0.8281059,0.0020529144,0.00050350744,0.00018449732,1.6770638e-7,0.0011388023,0.088037536],"genre_scores_gemma":[0.8027832,0.0000050921267,0.19619763,0.00013373292,0.00002025029,0.000010179633,8.481427e-8,0.0000054974103,0.00084433827],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999205,0.00004173145,0.0001239111,0.0002791757,0.00014302609,0.00020716463],"domain_scores_gemma":[0.99863243,0.000060710314,0.000071965274,0.0011577042,0.000036809815,0.00004039515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044533436,0.000088017274,0.000100762234,0.00010714752,0.00019470479,0.000277494,0.0018136952,0.000051983043,0.000015003801],"category_scores_gemma":[0.00017289749,0.000078638055,0.000030200896,0.000084281244,0.00003722561,0.0006241298,0.00048189584,0.00012597402,0.000041446845],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026853924,0.0005493889,0.33067197,0.00005038495,0.000026840587,0.0007650578,0.003190823,0.0011043499,0.042864643,0.19148336,0.08243615,0.3468302],"study_design_scores_gemma":[0.0007118598,0.00043953327,0.55310285,0.00021704104,0.000005238609,0.00007626616,0.00005660094,0.3431145,0.06916681,0.02831521,0.0036834346,0.0011106522],"about_ca_topic_score_codex":0.0004135431,"about_ca_topic_score_gemma":0.0006139998,"teacher_disagreement_score":0.7228562,"about_ca_system_score_codex":0.000035127152,"about_ca_system_score_gemma":0.000041861495,"threshold_uncertainty_score":0.3370327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26095605,0.0000038058581,0.7267397,0.0004825681,0.0000809996,0.00011575368,1.1437285e-7,0.00023818921,0.011382794],"genre_scores_gemma":[0.9863914,2.7808633e-7,0.013100447,0.00006890913,0.000025948922,0.000005752418,4.9799365e-8,0.000005648586,0.00040156467],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994499,0.000022113953,0.000072084906,0.00015977093,0.00020454543,0.00009155127],"domain_scores_gemma":[0.9989202,0.000018910487,0.00016799787,0.000772648,0.00010415598,0.000016104796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010305403,0.00006360567,0.00007938829,0.000018683719,0.00024184161,0.00015031864,0.0010817567,0.00001961163,0.0000010021497],"category_scores_gemma":[0.00005631697,0.00003501876,0.000024285515,0.00009559607,0.00006834247,0.00046310804,0.00027584948,0.00006508114,0.0000020817972],"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.0000345297,0.00059530634,0.10666074,0.00018667938,0.000047615333,0.000009657126,0.020163573,0.00036998815,0.115745746,0.34626052,0.0019662366,0.40795943],"study_design_scores_gemma":[0.00020210262,0.00014181134,0.031662434,0.00022075424,0.000012009349,0.000014216454,0.000068102374,0.27245143,0.6888615,0.005976028,0.00016985225,0.00021974974],"about_ca_topic_score_codex":0.000045356108,"about_ca_topic_score_gemma":0.00002906633,"teacher_disagreement_score":0.7254353,"about_ca_system_score_codex":0.000011154792,"about_ca_system_score_gemma":0.000047594775,"threshold_uncertainty_score":0.20101911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015114133,0.000023074108,0.85002,0.0036353334,0.0005951187,0.00030840893,0.0000032577452,0.0034352464,0.12686543],"genre_scores_gemma":[0.6971686,0.000004623694,0.30080208,0.0004116637,0.000024970588,0.000014313205,0.0000017599244,0.000010747916,0.0015612758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862045,0.00007675843,0.00024204377,0.00046000414,0.0002417734,0.00035898888],"domain_scores_gemma":[0.99731237,0.0001216501,0.00023360283,0.002033483,0.00016953552,0.00012938258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049045106,0.00018446014,0.00026451665,0.000089468434,0.0007606538,0.0007572313,0.0027230557,0.00008107008,0.000070343616],"category_scores_gemma":[0.00032388623,0.00015991309,0.00008619971,0.00009218935,0.00024490073,0.00077437225,0.0009193344,0.00020144963,0.0001420235],"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.00006400527,0.0003058513,0.006106323,0.000041014493,0.00009593691,0.00044087824,0.0011446639,0.000055707285,0.008169744,0.9001964,0.043082647,0.040296834],"study_design_scores_gemma":[0.00384138,0.00047181474,0.015486995,0.0001485058,0.00003716419,0.00031968762,0.00014930489,0.65809876,0.2110418,0.0914873,0.016934168,0.0019831117],"about_ca_topic_score_codex":0.00085401477,"about_ca_topic_score_gemma":0.00015473716,"teacher_disagreement_score":0.8087091,"about_ca_system_score_codex":0.000051917188,"about_ca_system_score_gemma":0.00005446422,"threshold_uncertainty_score":0.73019993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07137717,0.000010083122,0.9185904,0.0035315086,0.0005126455,0.00015695243,6.3431463e-7,0.0013519203,0.004468646],"genre_scores_gemma":[0.6245507,7.0583155e-7,0.37376672,0.0001097663,0.000027669274,0.00001010485,6.7718656e-7,0.00000386587,0.0015297731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926364,0.000018560253,0.00011897019,0.0002806408,0.00017844801,0.00013971803],"domain_scores_gemma":[0.9982814,0.000048858008,0.00012904723,0.0013998405,0.00009355656,0.00004727429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022580885,0.00007833014,0.000082799255,0.000044897115,0.00036144225,0.00022632045,0.0013080263,0.000046143225,0.000015529606],"category_scores_gemma":[0.00012703141,0.00006889219,0.00003262922,0.00003994673,0.000033101867,0.0004948427,0.00047697168,0.000080075406,0.00017464087],"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.000012225102,0.00015651956,0.006371493,0.000011906219,0.00001904917,0.00001834871,0.00025514804,0.00011545436,0.0723399,0.7408384,0.03734592,0.14251564],"study_design_scores_gemma":[0.00072881253,0.00012366606,0.07987787,0.00004447899,0.0000075134026,0.00005316515,0.0000055212968,0.5065504,0.3573582,0.051180594,0.0034483732,0.000621479],"about_ca_topic_score_codex":0.00037778646,"about_ca_topic_score_gemma":0.00003650876,"teacher_disagreement_score":0.6896578,"about_ca_system_score_codex":0.000027593578,"about_ca_system_score_gemma":0.000025408328,"threshold_uncertainty_score":0.28093418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28345892,0.000039301332,0.7083946,0.00045895885,0.0027006825,0.0010941167,0.000022232975,0.000525427,0.0033057493],"genre_scores_gemma":[0.94216126,0.00006355932,0.05709134,0.00009162116,0.000046718433,0.00012790173,0.000020086021,0.000020013365,0.00037751804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985458,0.0000389184,0.0003487895,0.00061199936,0.00022987451,0.00022456727],"domain_scores_gemma":[0.99800503,0.0001579854,0.0005937281,0.0009900375,0.00020152694,0.00005167411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000607515,0.00023603937,0.0002831478,0.00022561569,0.00023975073,0.00018984551,0.0009003995,0.00017845724,0.0000073972415],"category_scores_gemma":[0.00010503191,0.00023601398,0.00009450975,0.000052546275,0.00005234253,0.0003293523,0.00039079977,0.00028991594,0.0000015014233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016921578,0.00021485811,0.06383092,0.0019346098,0.00018845576,0.0000026776102,0.0062365215,0.0016556521,0.0021580874,0.017186813,0.054454032,0.85196817],"study_design_scores_gemma":[0.0010100798,0.0015630496,0.03277826,0.00087177486,0.0000632424,0.000027864553,0.00029657624,0.71619725,0.22386605,0.02020824,0.0019043463,0.0012132501],"about_ca_topic_score_codex":0.0013991141,"about_ca_topic_score_gemma":0.0014922428,"teacher_disagreement_score":0.8507549,"about_ca_system_score_codex":0.00010879859,"about_ca_system_score_gemma":0.0001410392,"threshold_uncertainty_score":0.96243703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29850778,0.00023133923,0.695285,0.0051419167,0.00017021933,0.00015876675,0.0000044275203,0.00010426523,0.00039623037],"genre_scores_gemma":[0.85146534,0.0001832185,0.14820006,0.00008328118,0.000017177366,0.000008769618,0.0000036231545,0.000009237982,0.000029302713],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890876,0.000108619395,0.0004378594,0.0002320523,0.00017482277,0.00013788496],"domain_scores_gemma":[0.995321,0.00034146267,0.00094336685,0.0031927917,0.00015320943,0.000048219674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144752,0.00011292554,0.00019496465,0.00019331793,0.0005365907,0.00020123519,0.00299754,0.00005119974,0.0000014277326],"category_scores_gemma":[0.00026912926,0.00012892362,0.000052176096,0.00015983703,0.0002617481,0.00091276754,0.0005148686,0.00015116364,0.0000021024389],"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.000005979035,0.00005711585,0.056617208,0.00006736277,0.000039158505,5.3355257e-7,0.004086836,0.00018799935,0.8462846,0.008321307,0.0010461615,0.08328568],"study_design_scores_gemma":[0.0007661801,0.00006150219,0.1149456,0.00086852297,0.000076288416,0.000017925771,0.00032913094,0.2474891,0.6301877,0.0038888003,0.00067012117,0.00069917785],"about_ca_topic_score_codex":0.00081508927,"about_ca_topic_score_gemma":0.00027020284,"teacher_disagreement_score":0.55295753,"about_ca_system_score_codex":0.000052332616,"about_ca_system_score_gemma":0.00005110519,"threshold_uncertainty_score":0.5570225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9195238,0.0012413998,0.075752996,0.0005155656,0.001944038,0.0002666322,0.0000053087397,0.000087174165,0.00066313735],"genre_scores_gemma":[0.997818,0.00024824438,0.0014284706,0.000031615116,0.0003101718,0.0000062399117,3.8540202e-7,0.000012572574,0.00014431652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986912,0.00010677392,0.00043525544,0.0002574113,0.00021862276,0.0002907164],"domain_scores_gemma":[0.9987414,0.00016434192,0.00044533543,0.00031698475,0.00023820256,0.00009376799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010592618,0.00014747916,0.0003479936,0.00025178926,0.00056326966,0.00049245654,0.00048372423,0.0001059997,3.2522536e-7],"category_scores_gemma":[0.00029856473,0.00013031533,0.000048904978,0.00013071169,0.000036896432,0.00030694608,0.000042602147,0.0003551426,1.610353e-7],"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.00006966486,0.0004136572,0.3211724,0.0012975911,0.0003977799,0.00019422585,0.014834327,0.00040514005,0.06559783,0.103770964,0.0025679632,0.48927847],"study_design_scores_gemma":[0.009067443,0.0063274573,0.1973472,0.011194182,0.00018678421,0.004278055,0.0014588694,0.6634284,0.029625492,0.028134817,0.04524406,0.00370721],"about_ca_topic_score_codex":0.00017241937,"about_ca_topic_score_gemma":0.00006150585,"teacher_disagreement_score":0.6630233,"about_ca_system_score_codex":0.000048716112,"about_ca_system_score_gemma":0.000060183087,"threshold_uncertainty_score":0.53141046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002025412,0.000058185804,0.9954788,0.00036251327,0.00023876817,0.00027829237,0.0000048557254,0.0008222145,0.00073093554],"genre_scores_gemma":[0.8635565,0.0000024782034,0.1357214,0.00027590408,0.000062869745,0.0000910003,0.0000011041078,0.000025383872,0.0002633317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985394,0.00007364681,0.00027976534,0.00048801993,0.00027722042,0.00034197074],"domain_scores_gemma":[0.99886817,0.00035199308,0.0001565581,0.0002856697,0.0002489386,0.00008864999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047799308,0.00019714567,0.00020208253,0.0002177946,0.0006251104,0.00030089976,0.00049312174,0.00010689495,0.000015230992],"category_scores_gemma":[0.00001492761,0.00019651811,0.000099801946,0.00045745735,0.000049062663,0.0008695829,0.0000026184332,0.00022368356,0.000015268884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060200746,0.00016801084,0.00005096156,0.00015681754,0.000019361054,0.000001038388,0.00077117677,0.024286808,0.023233432,0.0006701938,0.00026086296,0.95032114],"study_design_scores_gemma":[0.00027871164,0.00017561954,0.000013597015,0.00015358279,0.000017801283,0.000007439895,0.000017981292,0.7699801,0.22475058,0.0034730884,0.00088111707,0.00025038494],"about_ca_topic_score_codex":0.000037354897,"about_ca_topic_score_gemma":0.000058090005,"teacher_disagreement_score":0.95007074,"about_ca_system_score_codex":0.00009258077,"about_ca_system_score_gemma":0.00011501408,"threshold_uncertainty_score":0.8013776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02584063,0.000028853205,0.9665866,0.006072044,0.00029299647,0.00054736144,0.000017159582,0.0003501515,0.00026420745],"genre_scores_gemma":[0.49390352,0.0000053080703,0.5054613,0.00040634326,0.00003669804,0.00015558544,0.000009207516,0.000011257607,0.000010827673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988345,0.00018687858,0.00030694104,0.0003058474,0.00015509315,0.00021073414],"domain_scores_gemma":[0.9943449,0.00031298588,0.00047428434,0.004563514,0.00025237736,0.000051962503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143754,0.00015113773,0.00020027487,0.00019828674,0.000985397,0.0003280997,0.004370917,0.000064350126,9.940924e-7],"category_scores_gemma":[0.00013543198,0.00016106752,0.00009744933,0.00015549535,0.00023895534,0.00096118916,0.00024757115,0.00019891324,0.0000022525119],"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.000021376027,0.00059873046,0.0029242933,0.00006398315,0.000089463865,0.000002300691,0.0068463446,0.00022880168,0.480059,0.0038258203,0.0051620067,0.50017786],"study_design_scores_gemma":[0.0003459733,0.00016634869,0.0009855008,0.00012149516,0.000017146658,0.0000051948186,0.00007859216,0.74822235,0.2484769,0.00035833407,0.0009644075,0.00025778898],"about_ca_topic_score_codex":0.00027413626,"about_ca_topic_score_gemma":0.00014479642,"teacher_disagreement_score":0.7479935,"about_ca_system_score_codex":0.000096921474,"about_ca_system_score_gemma":0.00008961122,"threshold_uncertainty_score":0.8122324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60447,0.00034421674,0.15262967,0.22844414,0.0006734612,0.00041449608,0.00001066739,0.0003379448,0.012675402],"genre_scores_gemma":[0.97470725,0.00008451189,0.022889271,0.0021463025,0.000015486456,0.000034225588,6.684712e-7,0.000008473221,0.00011383186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923116,0.00012567798,0.00017195806,0.00018386997,0.00014968436,0.00013765754],"domain_scores_gemma":[0.99323195,0.00053400564,0.0002216302,0.0059244656,0.00005931741,0.000028643934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037578205,0.000102222264,0.000118182,0.000051987736,0.0008359916,0.00024214109,0.004682973,0.000032987256,0.0000021767096],"category_scores_gemma":[0.0001338442,0.00007793788,0.00004729543,0.00007920422,0.0006539368,0.0002735278,0.0006097519,0.0002198124,0.000008285602],"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.000046925852,0.0006984656,0.03769747,0.00006574548,0.00017975661,0.000011956053,0.010482435,0.000029137342,0.19606058,0.53648984,0.18369222,0.034545474],"study_design_scores_gemma":[0.0018696915,0.00080442266,0.21618026,0.0022277765,0.00014500866,0.00009507736,0.0004594738,0.091594316,0.21628006,0.035108548,0.4321565,0.0030788418],"about_ca_topic_score_codex":0.00006577726,"about_ca_topic_score_gemma":0.000085549495,"teacher_disagreement_score":0.5013813,"about_ca_system_score_codex":0.000027908676,"about_ca_system_score_gemma":0.00001820717,"threshold_uncertainty_score":0.8702207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06632546,0.0042226063,0.9276744,0.00017072709,0.0006443971,0.00014578667,7.4462315e-7,0.00023839028,0.00057745795],"genre_scores_gemma":[0.95581657,0.000010866998,0.043517236,0.00008449745,0.00016389089,0.0000015807428,1.5727521e-7,0.000018741297,0.0003864574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983739,0.00008537659,0.000548379,0.0002302976,0.0005115593,0.0002504408],"domain_scores_gemma":[0.998343,0.0001158272,0.0007742681,0.00020275047,0.00043296505,0.00013120074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066067,0.00016236446,0.00034979364,0.0002690481,0.00013167418,0.00063435116,0.0007155364,0.000090393754,0.000004340588],"category_scores_gemma":[0.000055028828,0.00013385751,0.00007228424,0.000331294,0.000037719325,0.0013310703,0.00011644557,0.00035016917,0.00000884787],"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.00020598964,0.0004322567,0.2319021,0.0050600427,0.00028238975,0.00044849588,0.014386595,0.007814972,0.08198528,0.0033148169,0.01052351,0.64364356],"study_design_scores_gemma":[0.0054492163,0.00625527,0.008268318,0.026776958,0.00024683043,0.027315581,0.006867636,0.8337246,0.04470958,0.011282499,0.024974922,0.0041285497],"about_ca_topic_score_codex":0.000042880023,"about_ca_topic_score_gemma":0.0000016318415,"teacher_disagreement_score":0.8894911,"about_ca_system_score_codex":0.000087537126,"about_ca_system_score_gemma":0.00023811564,"threshold_uncertainty_score":0.61170626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460304,0.0010303332,0.044881698,0.0011030291,0.0034725524,0.00017765515,8.663335e-7,0.00013626972,0.0031672355],"genre_scores_gemma":[0.9988491,0.00018486184,0.00027276378,0.000069824135,0.00029487224,0.000003618327,1.4340037e-7,0.000009998446,0.00031483837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998646,0.00013198437,0.00033833663,0.00029436592,0.00027778806,0.0003114931],"domain_scores_gemma":[0.9989814,0.00007169175,0.0002803831,0.00039699592,0.0001386887,0.00013081991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089777214,0.00015167714,0.00024775544,0.00023845256,0.0007759907,0.00087732077,0.0005263056,0.000095285985,6.7861515e-7],"category_scores_gemma":[0.00019721143,0.00013044935,0.000031381354,0.00013293725,0.000037791506,0.00020744394,0.000052720887,0.0005106892,0.0000010116197],"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.000030044575,0.00048005537,0.069323696,0.0004023558,0.0002384718,0.0011839753,0.026764147,0.008204125,0.010203288,0.033853583,0.004139098,0.8451772],"study_design_scores_gemma":[0.0034984672,0.0012691086,0.11367445,0.0029103672,0.000051143787,0.0052765654,0.0012392023,0.8459192,0.0043301876,0.004020033,0.015721906,0.002089403],"about_ca_topic_score_codex":0.00026015853,"about_ca_topic_score_gemma":0.000048611793,"teacher_disagreement_score":0.84308773,"about_ca_system_score_codex":0.000066094064,"about_ca_system_score_gemma":0.00004874859,"threshold_uncertainty_score":0.84600246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076172184,0.000035944522,0.9884796,0.0008578747,0.0011915936,0.00048243167,0.000009925275,0.00045436516,0.0008710438],"genre_scores_gemma":[0.64880997,0.0000022798215,0.35062447,0.00021510362,0.000084473446,0.00004340999,0.0000012455563,0.000012506088,0.0002065258],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893326,0.00005213719,0.00018315297,0.00037931278,0.00019824065,0.0002539015],"domain_scores_gemma":[0.9979385,0.0003294016,0.00021715714,0.0012289205,0.00021066256,0.00007534045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492975,0.00013045761,0.00014910242,0.00008656999,0.0008542011,0.0005737674,0.0022986936,0.00007688557,0.000005737745],"category_scores_gemma":[0.00026228954,0.00012852962,0.00007271668,0.0000688561,0.00008948302,0.0012491469,0.00032139538,0.000099357414,0.000016480617],"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.00021022759,0.000924783,0.0679102,0.00022224268,0.00037064252,0.00017136942,0.0022510896,0.013144464,0.17011487,0.2553453,0.30591145,0.18342331],"study_design_scores_gemma":[0.0009548505,0.00014691311,0.009032697,0.00012556081,0.000030945444,0.000056258683,0.000007764638,0.52943134,0.40258384,0.037345618,0.019542793,0.0007414403],"about_ca_topic_score_codex":0.000066853965,"about_ca_topic_score_gemma":0.00003307641,"teacher_disagreement_score":0.6411928,"about_ca_system_score_codex":0.000035533332,"about_ca_system_score_gemma":0.00010568536,"threshold_uncertainty_score":0.65699106},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009018591,0.0001393917,0.9796441,0.009300294,0.00055154815,0.00054875517,0.000030948762,0.00030649794,0.00045986916],"genre_scores_gemma":[0.5325645,0.000015661702,0.46695918,0.0002608143,0.00003899423,0.0001239669,0.0000030916974,0.000015329648,0.00001841651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837685,0.00026394316,0.000354747,0.0003601714,0.00030486652,0.00033940785],"domain_scores_gemma":[0.98580986,0.0017825895,0.00038695397,0.011689125,0.0002703378,0.00006115859],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017429788,0.00017101307,0.00021726401,0.000103653845,0.002075861,0.00034893185,0.014588528,0.000058405338,0.0000010922313],"category_scores_gemma":[0.00038014082,0.00014585885,0.00010138306,0.00023571555,0.00051811663,0.0003957957,0.0010828443,0.00038493462,0.000002102029],"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.000022516,0.000717199,0.0023131734,0.00006608243,0.00016859718,0.000002579058,0.009167776,0.011088294,0.03810608,0.033265624,0.006825462,0.8982566],"study_design_scores_gemma":[0.00025957284,0.00006104822,0.0013177515,0.00008468789,0.000022116781,0.000008603274,0.00020231816,0.98500574,0.011357627,0.00046606397,0.0010090332,0.00020542381],"about_ca_topic_score_codex":0.0007733809,"about_ca_topic_score_gemma":0.00033354855,"teacher_disagreement_score":0.9739175,"about_ca_system_score_codex":0.00009415592,"about_ca_system_score_gemma":0.00007718572,"threshold_uncertainty_score":0.9992233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061414324,0.00006283393,0.8859431,0.007059557,0.0015187098,0.00029769144,0.000006513041,0.0023577793,0.0413395],"genre_scores_gemma":[0.66365075,0.000007881903,0.33132383,0.0008717193,0.00018650621,0.000018421288,0.0000017476091,0.00002869336,0.0039104354],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778146,0.00009023213,0.000298713,0.00083881593,0.0004178521,0.00057291944],"domain_scores_gemma":[0.9958916,0.000108233464,0.0002627664,0.0034370425,0.0001289338,0.00017148182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004763986,0.00030549424,0.0002981248,0.0001446838,0.00080161524,0.0006922143,0.003951524,0.00017215796,0.00006865352],"category_scores_gemma":[0.00028603958,0.00026679118,0.00012832256,0.00012938115,0.00015899203,0.0008196287,0.0013958908,0.000490583,0.0001905525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054067095,0.00036230768,0.004072036,0.00009133559,0.00013443275,0.00030399984,0.005427024,0.00029330858,0.041722007,0.09873089,0.076505154,0.77230346],"study_design_scores_gemma":[0.0020072116,0.0008112617,0.07108358,0.00038929767,0.00006641582,0.0008714616,0.00020603152,0.031509284,0.66882676,0.16719441,0.053321753,0.0037125058],"about_ca_topic_score_codex":0.0010086076,"about_ca_topic_score_gemma":0.00079746055,"teacher_disagreement_score":0.7685909,"about_ca_system_score_codex":0.00007839005,"about_ca_system_score_gemma":0.0001215033,"threshold_uncertainty_score":0.9999784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029188005,0.0000251651,0.96611965,0.00036178713,0.0011031156,0.00052275276,0.00007492746,0.0008349374,0.0017696838],"genre_scores_gemma":[0.8968953,0.0000041107037,0.102618076,0.00009244883,0.00010715065,0.000042091444,0.00013723297,0.000018429782,0.000085174004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978198,0.0001583762,0.0005064753,0.00081006123,0.00040008448,0.00030523544],"domain_scores_gemma":[0.99702036,0.0003184491,0.0007630658,0.0012681312,0.00055190874,0.00007809795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006858892,0.0003262868,0.0003975897,0.00020406011,0.00012606241,0.00014135148,0.0013124212,0.000343565,0.000031614156],"category_scores_gemma":[0.00040380735,0.00031177117,0.00016269005,0.00029903956,0.00008183315,0.0001846535,0.00078720093,0.00045237603,0.000008066941],"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.00159596,0.0037522297,0.09749325,0.0063949395,0.0009741683,0.000104422696,0.009819751,0.07766092,0.23030928,0.11838082,0.06667313,0.38684112],"study_design_scores_gemma":[0.00012509602,0.00016907553,0.00082975905,0.0003438495,0.0000122951205,5.888176e-7,0.000008340919,0.8428175,0.1537992,0.0015111929,0.0000806453,0.00030244322],"about_ca_topic_score_codex":0.001288743,"about_ca_topic_score_gemma":0.00032702496,"teacher_disagreement_score":0.8677073,"about_ca_system_score_codex":0.00042384566,"about_ca_system_score_gemma":0.00037963185,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079887144,0.00002522125,0.91308,0.00021258646,0.002277007,0.0009795722,0.00040652536,0.00055015046,0.0025818117],"genre_scores_gemma":[0.9837018,0.00012219779,0.015282383,0.0005684697,0.000019824569,0.0001156444,0.00010101512,0.000025668001,0.000062983476],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99701715,0.00029391653,0.0011997484,0.0005037687,0.00061712967,0.00036831238],"domain_scores_gemma":[0.997196,0.00057753955,0.0008893973,0.0010750417,0.00017155489,0.00009045381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001984632,0.00045218543,0.00049439794,0.0010565824,0.0003091679,0.00022435855,0.0009434813,0.00029069989,0.000021728747],"category_scores_gemma":[0.000024650497,0.00048143152,0.00019140444,0.00030073343,0.00008848799,0.00157654,0.0000525161,0.001069782,0.000031534757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011293107,0.00039433362,0.000053773947,0.0024254497,0.0006376815,0.0000060813636,0.04319599,0.22061098,0.00078212115,0.005830482,0.0023875188,0.7225463],"study_design_scores_gemma":[0.006405197,0.0019849148,0.0011626082,0.012096264,0.00043673185,0.000117082294,0.010614655,0.4156514,0.51516616,0.029967075,0.0021586504,0.0042392453],"about_ca_topic_score_codex":0.0000975553,"about_ca_topic_score_gemma":0.000021817574,"teacher_disagreement_score":0.9038147,"about_ca_system_score_codex":0.00027154916,"about_ca_system_score_gemma":0.00015716089,"threshold_uncertainty_score":0.9997637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09727937,0.000018736395,0.88654673,0.0002572855,0.00023252683,0.00007331794,5.641394e-7,0.0004491837,0.015142282],"genre_scores_gemma":[0.85377866,0.0000029758671,0.14583972,0.00009263464,0.000059309958,0.0000038941603,7.264037e-7,0.000004245064,0.00021782136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926656,0.000042293435,0.0001899485,0.00019991904,0.00015831062,0.00014294528],"domain_scores_gemma":[0.99919313,0.000107355554,0.00012464376,0.00033766724,0.00020302112,0.000034152567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026034715,0.0000701049,0.00010163059,0.00009100308,0.00009857278,0.000043542106,0.00040662815,0.00003839595,0.00007406734],"category_scores_gemma":[0.000095790405,0.000065391025,0.000031331343,0.0003088198,0.000066524044,0.0003808764,0.00011312762,0.000046709778,0.000035763638],"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.000039730723,0.00021114826,0.14285111,0.00007357906,0.00005725995,0.000007510035,0.0062180096,0.000089503155,0.27761713,0.43523553,0.012578378,0.1250211],"study_design_scores_gemma":[0.00013649758,0.00019074437,0.0046985047,0.000058250356,0.0000040976215,0.000003970626,0.00003916395,0.12941705,0.85405767,0.010364621,0.0008380781,0.00019135373],"about_ca_topic_score_codex":0.00014061303,"about_ca_topic_score_gemma":0.00015952764,"teacher_disagreement_score":0.7564993,"about_ca_system_score_codex":0.000028268614,"about_ca_system_score_gemma":0.00003369589,"threshold_uncertainty_score":0.26665688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14766772,0.00003285684,0.8485099,0.00075171195,0.00042380422,0.0013545094,0.00033659246,0.00026335896,0.0006595244],"genre_scores_gemma":[0.9570733,0.00005899856,0.04165875,0.00066423236,0.00002044422,0.00046264692,0.000006163103,0.000022323018,0.00003319671],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997622,0.00030221965,0.0008765257,0.00046899586,0.00044341187,0.00028681126],"domain_scores_gemma":[0.99630624,0.0016993654,0.00053810695,0.0010217815,0.00030214523,0.00013234316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012395858,0.00042264655,0.00052651664,0.0005541082,0.0002885795,0.00019899441,0.00088330905,0.0002835594,0.000021950755],"category_scores_gemma":[0.00012956059,0.0003629475,0.00014089275,0.00044784765,0.00027998627,0.0007231634,0.00005504044,0.0005844273,0.00000558271],"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.0029808192,0.0009384092,0.00010839055,0.0035410996,0.0015121818,0.000010911488,0.58165854,0.011341986,0.061964303,0.02400942,0.0064701387,0.3054638],"study_design_scores_gemma":[0.00075572735,0.001305774,0.0009326435,0.007367163,0.00017282381,0.00004069006,0.0060105724,0.022589983,0.8959531,0.061925083,0.0013151454,0.0016312614],"about_ca_topic_score_codex":0.00008732577,"about_ca_topic_score_gemma":0.000050158447,"teacher_disagreement_score":0.83398885,"about_ca_system_score_codex":0.00011104237,"about_ca_system_score_gemma":0.00014538737,"threshold_uncertainty_score":0.9998822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5995225,0.0000074980144,0.39814577,0.000052048763,0.00009550883,0.00004847864,4.152617e-7,0.00011637498,0.00201145],"genre_scores_gemma":[0.8223536,0.0000021609196,0.17757799,0.000015213528,0.000008345559,0.000001285643,1.8728738e-7,0.000003255224,0.00003794965],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926746,0.00003220594,0.00018835206,0.00017849714,0.00019818329,0.00013527813],"domain_scores_gemma":[0.9984852,0.00006152388,0.00028927356,0.0009346951,0.00019964548,0.000029649695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986548,0.00007486764,0.0001520566,0.000090814814,0.00019529201,0.000034935387,0.0009872183,0.00004614055,0.000004799104],"category_scores_gemma":[0.00020508246,0.00006940048,0.000049792714,0.00008118995,0.00008553939,0.000504125,0.00025508093,0.000072453346,0.0000031632032],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122805395,0.000051001618,0.91425943,0.00006246915,0.000006441501,0.0000010018845,0.00012484372,0.00005338642,0.06564571,0.0101342825,0.00013941481,0.0095097395],"study_design_scores_gemma":[0.00007650451,0.00007722094,0.21662296,0.000069698726,0.0000028922116,0.0000021223727,0.0000040104055,0.36711174,0.41566956,0.00028979956,0.0000063136467,0.000067181754],"about_ca_topic_score_codex":0.0006869301,"about_ca_topic_score_gemma":0.00013032803,"teacher_disagreement_score":0.6976365,"about_ca_system_score_codex":0.00004267758,"about_ca_system_score_gemma":0.00006974106,"threshold_uncertainty_score":0.28300694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05726708,0.0003034868,0.9365989,0.00003487113,0.002675757,0.002091749,0.00008114628,0.0008904233,0.000056611956],"genre_scores_gemma":[0.9790599,0.00008712756,0.019861111,0.000027443804,0.00013287416,0.00068061054,0.0000047848225,0.00006657933,0.00007962042],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99599886,0.0006089711,0.0009990878,0.0012168419,0.00072500634,0.00045121857],"domain_scores_gemma":[0.99674016,0.00028066593,0.0008342004,0.0014601042,0.0005276951,0.00015717126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011965964,0.00054364034,0.0007141565,0.0007245492,0.00050653,0.0003302792,0.0010526953,0.00053062814,0.000010196923],"category_scores_gemma":[0.0000138087025,0.0006134269,0.00018607549,0.00043705292,0.0001445774,0.00054830767,0.000053211697,0.0007761912,0.0000067962415],"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.00018916371,0.00096284354,0.0001553181,0.0034781606,0.0012285934,0.000031826727,0.030144263,0.02544527,0.7447034,0.0006889577,0.0009065756,0.1920656],"study_design_scores_gemma":[0.0011802058,0.0010491876,0.0001220501,0.0014572763,0.00014156546,0.00016857895,0.00040226942,0.0637599,0.9296179,0.00054595456,0.0004667273,0.0010883869],"about_ca_topic_score_codex":0.0025537417,"about_ca_topic_score_gemma":0.00014472015,"teacher_disagreement_score":0.92179275,"about_ca_system_score_codex":0.00025211886,"about_ca_system_score_gemma":0.00032152486,"threshold_uncertainty_score":0.9996317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017485577,0.00002039068,0.98835975,0.00060544536,0.00015679057,0.00011193884,5.300725e-7,0.00048019862,0.008516399],"genre_scores_gemma":[0.54812557,0.0000012200253,0.4516492,0.000100412806,0.000007831719,0.0000031503544,8.712133e-8,0.0000036508047,0.00010893157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992734,0.000052558105,0.00013724127,0.0002132668,0.0001733096,0.00015020775],"domain_scores_gemma":[0.9981304,0.00013592062,0.00016920744,0.0014396956,0.00009189545,0.000032876786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044632566,0.00008392979,0.0001320081,0.000050649698,0.00018883485,0.00012885046,0.0018445547,0.000044918663,0.000012144711],"category_scores_gemma":[0.00021304694,0.00007169559,0.000044416265,0.000055741377,0.00007996296,0.00038025083,0.00023467543,0.00006918859,0.000015088036],"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.000063677086,0.00070584693,0.07048696,0.00015282373,0.000094978604,0.00008651566,0.0018692217,0.0013470418,0.17628543,0.54066265,0.03814427,0.17010057],"study_design_scores_gemma":[0.00025503183,0.00026119774,0.0056207376,0.00005504035,0.000004965648,0.000005813334,0.000010955265,0.2426967,0.7348474,0.015364086,0.00061620155,0.00026183197],"about_ca_topic_score_codex":0.00035521935,"about_ca_topic_score_gemma":0.000022563258,"teacher_disagreement_score":0.558562,"about_ca_system_score_codex":0.00001610503,"about_ca_system_score_gemma":0.000076025586,"threshold_uncertainty_score":0.3427672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058373436,0.00097599474,0.9849325,0.00023397007,0.00459123,0.001367425,0.00014121768,0.0015602327,0.0003600981],"genre_scores_gemma":[0.95908743,0.00018730013,0.037638035,0.00026364112,0.00017156702,0.0003582072,0.000007500594,0.00013373622,0.0021525593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540794,0.0005099264,0.0007806316,0.0018854415,0.0006918862,0.0007241583],"domain_scores_gemma":[0.99643797,0.00017382854,0.00041281575,0.002268532,0.00025268743,0.00045419176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008691068,0.00084387517,0.0008790756,0.00060501235,0.00057628157,0.0006475137,0.0016006165,0.0009306564,0.000011335393],"category_scores_gemma":[0.000038175473,0.00079291733,0.00043674879,0.0003543584,0.00023609014,0.00019384526,0.000046192315,0.001572968,0.000033488373],"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.00012628865,0.0043233414,0.0006877117,0.0073002554,0.0045478498,0.0007591544,0.053454936,0.178578,0.17221211,0.0013651699,0.0037356955,0.5729095],"study_design_scores_gemma":[0.004075545,0.000992873,0.0011900703,0.0066435505,0.00057881535,0.0019338098,0.00088045077,0.9312992,0.026610775,0.00062143727,0.019044861,0.006128631],"about_ca_topic_score_codex":0.00061686186,"about_ca_topic_score_gemma":0.00055694964,"teacher_disagreement_score":0.9532501,"about_ca_system_score_codex":0.0002597725,"about_ca_system_score_gemma":0.00030919607,"threshold_uncertainty_score":0.9994522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5322629,0.00021218015,0.4524185,0.009249974,0.0013909052,0.00018062566,0.0000022496358,0.0015097415,0.002772876],"genre_scores_gemma":[0.8656318,0.000019067438,0.13375528,0.00030184304,0.000180992,0.0000028560344,2.7234987e-7,0.000016566384,0.00009128315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803716,0.00009481297,0.000750734,0.0003173,0.00035021122,0.00044980372],"domain_scores_gemma":[0.99703074,0.00011726448,0.00084443035,0.00079588185,0.0010902042,0.00012148436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931858,0.00022399388,0.00047791813,0.0010650641,0.00017700437,0.00007892015,0.002187403,0.00030845543,0.00004392971],"category_scores_gemma":[0.0005019752,0.0001846284,0.00013326698,0.0013012133,0.0006690303,0.0004712687,0.0004985425,0.0006810524,0.00007841202],"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.00018134843,0.000998622,0.008423415,0.00008408055,0.00029169052,0.0030083398,0.0019509557,0.0000039153556,0.34247643,0.5039382,0.040843062,0.097799964],"study_design_scores_gemma":[0.0005799456,0.001858502,0.0006260278,0.00013631965,0.000022053173,0.0038389834,0.00009691504,0.0014405377,0.85231113,0.13009678,0.008666866,0.0003259154],"about_ca_topic_score_codex":0.0000117133895,"about_ca_topic_score_gemma":0.000034130884,"teacher_disagreement_score":0.5098347,"about_ca_system_score_codex":0.00016203366,"about_ca_system_score_gemma":0.00017060895,"threshold_uncertainty_score":0.75289273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015720813,0.00008633168,0.9754093,0.00010900728,0.006289106,0.0005098537,0.000033969776,0.0012440992,0.00059748086],"genre_scores_gemma":[0.9904293,0.0000066529024,0.008475357,0.00015267632,0.00027730322,0.00017829642,0.0000039144047,0.00004102335,0.00043547445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655944,0.00035820965,0.000744114,0.0008947377,0.0008122633,0.00063120865],"domain_scores_gemma":[0.99784374,0.00018392537,0.00030171152,0.00091547205,0.0005573556,0.00019781798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073525816,0.00042733297,0.00042632336,0.0005636933,0.0007709105,0.00045816804,0.0009416764,0.0002634978,0.000031213513],"category_scores_gemma":[0.000024137971,0.00039620287,0.00023011609,0.0010056369,0.0001632324,0.0007009186,0.0000097773545,0.00041303705,0.00011064139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011681959,0.0019035948,0.000032164964,0.00018230162,0.00029052165,0.00006333121,0.021092417,0.8373386,0.07136745,0.020034617,0.0015561979,0.046021946],"study_design_scores_gemma":[0.0002924754,0.00030449615,0.0000074995205,0.00040199197,0.00003206401,0.00015857862,0.0007630585,0.9627333,0.034397867,0.00023278399,0.00021462448,0.00046126143],"about_ca_topic_score_codex":0.0007220802,"about_ca_topic_score_gemma":0.0004979547,"teacher_disagreement_score":0.9747085,"about_ca_system_score_codex":0.00049458374,"about_ca_system_score_gemma":0.00024022334,"threshold_uncertainty_score":0.99984896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007910672,0.000058145186,0.97710747,0.0010606679,0.0051827137,0.0006974241,0.000051319348,0.0014022555,0.013648969],"genre_scores_gemma":[0.9617196,0.00009413697,0.034068074,0.002341083,0.00017497009,0.0005049052,0.000016558997,0.000035573263,0.001045099],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975938,0.00033875852,0.0007314935,0.00038994537,0.00057123747,0.00037471726],"domain_scores_gemma":[0.996591,0.0004862957,0.0005366697,0.0019724006,0.00032333314,0.00009034251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015437483,0.00038537942,0.000272399,0.0004633574,0.00075299933,0.0005964729,0.002304413,0.00030352006,0.000057423727],"category_scores_gemma":[0.000043327156,0.00031686795,0.00025716453,0.00047030576,0.00027109086,0.0017001379,0.000047689926,0.0013721796,0.00027297193],"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.00022266593,0.00021465492,0.000003847627,0.00045959372,0.00026538834,0.0000046531186,0.048565574,0.016474504,0.000117794894,0.17494024,0.012342124,0.746389],"study_design_scores_gemma":[0.00076791266,0.00048162782,0.00008251293,0.0012465927,0.00013983104,0.00010103789,0.001182623,0.17400771,0.044537593,0.73105866,0.04419596,0.0021979497],"about_ca_topic_score_codex":0.000016328293,"about_ca_topic_score_gemma":0.000011503807,"teacher_disagreement_score":0.96092856,"about_ca_system_score_codex":0.00027574957,"about_ca_system_score_gemma":0.00026973162,"threshold_uncertainty_score":0.99992836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31897545,0.000023476645,0.65946,0.0051058726,0.00046291674,0.0006620949,0.0000051816914,0.00037325197,0.014931751],"genre_scores_gemma":[0.992913,0.0000037384925,0.006059442,0.00050572684,0.000030065234,0.00004348827,1.3620581e-7,0.000005959044,0.00043842985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993877,0.000021856777,0.00012056677,0.00016927281,0.00013621285,0.00016442292],"domain_scores_gemma":[0.99833494,0.00033010784,0.00016421643,0.0010436623,0.00010457425,0.000022524697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726105,0.00008218792,0.0001225257,0.000033564564,0.00037369164,0.00009778986,0.0016455706,0.00003456392,0.000003989023],"category_scores_gemma":[0.00027375322,0.000050394712,0.000058040503,0.000030587493,0.0000625126,0.00023511668,0.000072194794,0.00007656052,0.0000074210834],"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.00014437902,0.00022896513,0.009191838,0.00012839754,0.000084554,0.0000021798314,0.001722071,0.00026847085,0.015425164,0.92266226,0.020381395,0.029760335],"study_design_scores_gemma":[0.0004972208,0.0008256066,0.0060223807,0.00008900997,0.0000061764067,0.0000046490777,0.000021791187,0.67089367,0.30853963,0.01230864,0.0005796619,0.00021157495],"about_ca_topic_score_codex":0.00007262292,"about_ca_topic_score_gemma":0.000020913236,"teacher_disagreement_score":0.9103536,"about_ca_system_score_codex":0.0000116267,"about_ca_system_score_gemma":0.000023371807,"threshold_uncertainty_score":0.3057907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06194292,0.00013323223,0.9213376,0.00019220792,0.0011609666,0.00023899719,0.000006780323,0.0014030592,0.013584244],"genre_scores_gemma":[0.37029514,0.00003070579,0.6289893,0.00011701915,0.0001011841,0.000015790733,0.0000042054126,0.000017151207,0.00042953613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981349,0.00012430089,0.00045817185,0.0006642577,0.000337267,0.00028112094],"domain_scores_gemma":[0.9975581,0.00009709565,0.00037969285,0.0015909894,0.00030181019,0.000072276394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006475796,0.00026894553,0.00045174084,0.0002629789,0.000064988766,0.00013879841,0.0025271354,0.00026764342,0.00005491532],"category_scores_gemma":[0.00012313806,0.00025116227,0.0001854302,0.00020904183,0.00008213421,0.0001450581,0.0038212046,0.00036119088,0.000023687704],"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.00006759348,0.00074973516,0.04261227,0.0018659387,0.0008036069,0.00008773741,0.012697366,0.00071338064,0.09247125,0.5229115,0.13313355,0.1918861],"study_design_scores_gemma":[0.00038228155,0.000252488,0.0011822667,0.0008090723,0.000043831333,0.000046637113,0.00004613608,0.2991703,0.5838934,0.109823816,0.002805851,0.00154394],"about_ca_topic_score_codex":0.0007328058,"about_ca_topic_score_gemma":0.00011178734,"teacher_disagreement_score":0.49142215,"about_ca_system_score_codex":0.00007431009,"about_ca_system_score_gemma":0.00016342507,"threshold_uncertainty_score":0.99999404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12878731,0.000013943776,0.86494726,0.00009925084,0.00022548977,0.000086441534,0.0000023289274,0.001082336,0.0047556707],"genre_scores_gemma":[0.5484042,0.0000011756575,0.4513176,0.00012827797,0.00003199424,0.0000015871658,4.2025437e-7,0.0000055645833,0.00010915365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894667,0.00005117866,0.00023141515,0.00029972466,0.00022606213,0.00024497742],"domain_scores_gemma":[0.9987614,0.0001295743,0.000109685054,0.0006935164,0.00024454156,0.00006125968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036958294,0.00011372885,0.0001689457,0.00010829323,0.000111246176,0.0000557284,0.0010170421,0.000052179814,0.00008089094],"category_scores_gemma":[0.00019023215,0.00010369015,0.00005647543,0.00034445518,0.00016232963,0.00035162494,0.00043267172,0.000094556315,0.00005296121],"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.000050999595,0.00068389246,0.14181107,0.00036416762,0.00008965449,0.000025334763,0.010327528,0.000010194633,0.084242195,0.45100984,0.038166605,0.2732185],"study_design_scores_gemma":[0.00020614263,0.00043100186,0.007597288,0.00011853062,0.0000055571877,0.000023162718,0.00009014091,0.018730098,0.9251486,0.046186388,0.0010184817,0.00044461148],"about_ca_topic_score_codex":0.00028910034,"about_ca_topic_score_gemma":0.00031958075,"teacher_disagreement_score":0.8409064,"about_ca_system_score_codex":0.000037989965,"about_ca_system_score_gemma":0.000053195257,"threshold_uncertainty_score":0.42283618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025053385,0.000043984204,0.9832316,0.004667604,0.00033699683,0.00018388775,0.000016193526,0.0006235609,0.008390844],"genre_scores_gemma":[0.6493921,0.0000833818,0.35018042,0.00016442366,0.00001729476,0.000051067065,0.0000017074567,0.000012485691,0.00009706224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985056,0.00027294195,0.00041995407,0.00028929324,0.0002665105,0.00024571046],"domain_scores_gemma":[0.99592924,0.00064069196,0.00018266722,0.0027271681,0.0004197147,0.00010051113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218005,0.00015592971,0.00019726079,0.00024850154,0.00074712065,0.00010705225,0.0016448234,0.00010460791,0.00006755211],"category_scores_gemma":[0.00009136981,0.00016793342,0.00012454473,0.00071680505,0.00041515342,0.0005967544,0.000032080814,0.0004351085,0.00006474969],"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.00019163953,0.0093130125,0.0017739213,0.00014984384,0.0008265071,0.000015728365,0.023418244,0.00088586425,0.06622728,0.49633235,0.01622677,0.38463885],"study_design_scores_gemma":[0.00069521205,0.001068651,0.00083589833,0.0003491894,0.00013625213,0.00018548306,0.0003974564,0.31546453,0.64052993,0.019748844,0.01962496,0.0009636087],"about_ca_topic_score_codex":0.00030503728,"about_ca_topic_score_gemma":0.001103743,"teacher_disagreement_score":0.6468868,"about_ca_system_score_codex":0.00009602477,"about_ca_system_score_gemma":0.00019961222,"threshold_uncertainty_score":0.6848126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2719966,0.000023278455,0.7260156,0.000027892007,0.00023614954,0.00009604615,7.150655e-7,0.00040456027,0.0011991735],"genre_scores_gemma":[0.6060609,1.4159332e-7,0.39376155,0.00009860494,0.000056744313,5.153953e-7,1.7711848e-7,0.0000073073375,0.000014036574],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877536,0.00008355197,0.00030884577,0.00033947348,0.00021496126,0.00027781288],"domain_scores_gemma":[0.9987647,0.00026042436,0.00019304859,0.0004258307,0.00030121012,0.000054807984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046217206,0.0001466023,0.00021679616,0.00021690404,0.00019814039,0.000098873825,0.0006575012,0.000051979372,0.000011380921],"category_scores_gemma":[0.00018241323,0.00013636235,0.000055666853,0.0005255685,0.000121312674,0.00038992794,0.00045431475,0.00011769086,0.000010033179],"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.000058137957,0.0004998039,0.027048746,0.0001899412,0.00023010981,0.00004807981,0.056014273,0.00469096,0.60562533,0.18311577,0.0014346502,0.12104421],"study_design_scores_gemma":[0.00009809369,0.00015065816,0.00021985361,0.0001444512,0.000005399134,0.00003153946,0.00009772556,0.9047026,0.0921877,0.0021604737,0.000013795583,0.00018768017],"about_ca_topic_score_codex":0.00019632705,"about_ca_topic_score_gemma":0.000042340485,"teacher_disagreement_score":0.90001166,"about_ca_system_score_codex":0.000061890714,"about_ca_system_score_gemma":0.00006563825,"threshold_uncertainty_score":0.5560695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24818023,0.000023299915,0.74960506,0.00044010297,0.00064926036,0.00085686287,0.000039615385,0.000069183996,0.00013640113],"genre_scores_gemma":[0.9991582,0.00003944387,0.0005829141,0.00016964976,0.000008183786,0.000029947165,0.0000023091727,0.0000071567824,0.0000021672554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977734,0.000764644,0.00068559585,0.00018430632,0.00040422863,0.00018779315],"domain_scores_gemma":[0.9960973,0.0017283133,0.00084082986,0.0012035782,0.00011269585,0.000017252107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027621004,0.0002230294,0.00026593934,0.00020184577,0.0004267953,0.00011044459,0.0013208629,0.0001454619,0.0000023378636],"category_scores_gemma":[0.00007045042,0.00010714385,0.00025456882,0.00061618985,0.0005347941,0.000334803,0.0000699942,0.0010126253,0.0000017794129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038868244,0.00014481515,0.0004370157,0.0002665384,0.00014830315,1.5888983e-7,0.0281526,0.66084474,0.000202485,0.26469368,0.000034365596,0.044686615],"study_design_scores_gemma":[0.00077632803,0.00006540166,0.005447867,0.0008047782,0.00007579127,0.000014410672,0.0011059454,0.7872905,0.050757732,0.1533813,0.000010882105,0.00026902714],"about_ca_topic_score_codex":0.00036366584,"about_ca_topic_score_gemma":0.000092777205,"teacher_disagreement_score":0.750978,"about_ca_system_score_codex":0.000082316044,"about_ca_system_score_gemma":0.00008177735,"threshold_uncertainty_score":0.43994096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010335173,0.00007048475,0.9924217,0.0006603322,0.0018234284,0.0019903684,0.0005069109,0.0015140054,0.0009094374],"genre_scores_gemma":[0.6949131,0.00040457075,0.30249527,0.00056080776,0.00003938043,0.0007676173,0.0006149947,0.000044258417,0.00016001624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978508,0.00012783277,0.00083610957,0.00049804366,0.0003805596,0.00030668732],"domain_scores_gemma":[0.9912598,0.0015328279,0.0005446218,0.0062058247,0.00035936307,0.00009756431],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017325256,0.0003645613,0.00035042732,0.0005930008,0.0005271546,0.000708542,0.0090241935,0.00040072767,0.000016669826],"category_scores_gemma":[0.00004868606,0.00037810882,0.00020636183,0.0003045172,0.00008380627,0.004185539,0.00020416755,0.0010881309,0.0000767151],"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.00019220589,0.00026987627,0.0000067376013,0.00089468976,0.00016666453,2.6717436e-7,0.0039193644,0.43799612,0.000109625405,0.011356245,0.0019391726,0.54314905],"study_design_scores_gemma":[0.00039648422,0.000056046243,0.0000074730265,0.0003819292,0.000051040468,0.0000043362193,0.00008109665,0.9738033,0.0048789424,0.007484305,0.012428884,0.00042617938],"about_ca_topic_score_codex":0.000044097196,"about_ca_topic_score_gemma":0.000013656413,"teacher_disagreement_score":0.69480973,"about_ca_system_score_codex":0.00017443624,"about_ca_system_score_gemma":0.00036353755,"threshold_uncertainty_score":0.9998671},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063893504,0.000041452844,0.9302518,0.0002020343,0.002653232,0.0010910884,0.000028024624,0.001222119,0.0006167859],"genre_scores_gemma":[0.94158435,0.000009024648,0.05634911,0.00022316977,0.00012330053,0.00045431833,0.0000053009917,0.00007035868,0.001181085],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957851,0.00060993247,0.0010559362,0.0011029432,0.00071305135,0.0007330195],"domain_scores_gemma":[0.9973946,0.00025173769,0.0003869996,0.0012628201,0.0005092953,0.0001945394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011836465,0.0005564096,0.0006558668,0.0007675229,0.00053228764,0.00059795944,0.00092908496,0.00038379035,0.00004780673],"category_scores_gemma":[0.000041974945,0.0004699556,0.00022486782,0.0012926878,0.0001422652,0.0013253047,0.00001183791,0.0009220684,0.00014856107],"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.0059025963,0.025965083,0.016988635,0.0018475471,0.0019918238,0.0013764517,0.22664042,0.037209164,0.40407643,0.0053969435,0.014171902,0.25843298],"study_design_scores_gemma":[0.0022532137,0.0008152825,0.00042559655,0.0015007401,0.000040775125,0.00014422637,0.0018208488,0.9175996,0.073704876,0.00005699995,0.00081399066,0.0008238426],"about_ca_topic_score_codex":0.00064251525,"about_ca_topic_score_gemma":0.007260681,"teacher_disagreement_score":0.88039047,"about_ca_system_score_codex":0.00053229276,"about_ca_system_score_gemma":0.00019448414,"threshold_uncertainty_score":0.99977523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6018183,0.000037055244,0.3699159,0.0011382959,0.0016122004,0.00068520557,0.000027846669,0.0017356457,0.02302952],"genre_scores_gemma":[0.9628742,0.000017152348,0.03628099,0.0005604834,0.000043145876,0.000025482661,0.0000026787254,0.000022130598,0.00017374982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801624,0.00020416068,0.00034198,0.00067631423,0.0004882889,0.0002730083],"domain_scores_gemma":[0.9965176,0.0008728556,0.00033242448,0.0020125133,0.00020857288,0.000056047513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057005737,0.00031870484,0.00033331022,0.0003007697,0.00013719084,0.00015446142,0.0028821107,0.00024284511,0.000088139124],"category_scores_gemma":[0.00040726617,0.00020515679,0.00022334624,0.00026382878,0.00010635974,0.000074690186,0.0015314244,0.00072013016,0.000040577146],"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.000043146385,0.00035269378,0.0049185352,0.00016780561,0.0002128801,0.000013385815,0.0045868647,0.000087877605,0.0062943567,0.93636394,0.03123135,0.015727153],"study_design_scores_gemma":[0.00024704987,0.0013404118,0.009484928,0.001903954,0.000031404063,0.000014739264,0.0001139726,0.06696277,0.4835456,0.4340795,0.0007158228,0.0015598426],"about_ca_topic_score_codex":0.00025372233,"about_ca_topic_score_gemma":0.00006937435,"teacher_disagreement_score":0.50228447,"about_ca_system_score_codex":0.000079686084,"about_ca_system_score_gemma":0.000098101686,"threshold_uncertainty_score":0.8366051},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39786416,0.00037617836,0.6001599,0.00008511787,0.0011986708,0.000056466935,3.6719163e-7,0.000120475626,0.00013869985],"genre_scores_gemma":[0.9965965,0.000034056575,0.0018638831,0.00011098713,0.0013164238,0.0000033251808,0.0000020577831,0.000013461,0.000059284408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998292,0.0002881806,0.00041070272,0.000331353,0.00032692272,0.000350789],"domain_scores_gemma":[0.9990296,0.00015550367,0.00020813363,0.0001491489,0.000307749,0.00014988602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065634976,0.00016554669,0.0002376239,0.00024760354,0.00051315175,0.0003307268,0.0002732465,0.00009355299,0.0000010882902],"category_scores_gemma":[0.00006905961,0.00015055574,0.000023718452,0.0005043739,0.000041287745,0.00013387461,0.000030167646,0.0005065651,5.579387e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075254407,0.00013885755,0.0030243124,0.000019671514,0.000030971816,0.00003936605,0.0035484184,0.893472,0.00025022958,0.018571895,0.00014170227,0.080755055],"study_design_scores_gemma":[0.00023137106,0.00050847826,0.0038676902,0.0002277814,0.0000049020978,0.000391877,0.0000966627,0.992844,0.000009899037,0.0010863543,0.00054156943,0.0001894578],"about_ca_topic_score_codex":0.000054309752,"about_ca_topic_score_gemma":0.00005338125,"teacher_disagreement_score":0.59873235,"about_ca_system_score_codex":0.00006784506,"about_ca_system_score_gemma":0.000050263297,"threshold_uncertainty_score":0.6139485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511555,0.00008931291,0.14418165,0.00080971885,0.00027296873,0.00025479816,0.000008560258,0.0004959529,0.0027315049],"genre_scores_gemma":[0.7959406,0.000025828298,0.20275646,0.0011268364,0.000039201117,0.000009149396,0.000003428608,0.000014338638,0.00008416808],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99823314,0.00006642878,0.00042614326,0.00054771145,0.00032834333,0.00039821657],"domain_scores_gemma":[0.9989725,0.00012931302,0.00018401342,0.000529389,0.000099372955,0.00008544766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068820454,0.00020972369,0.00026156544,0.00023323594,0.00022307872,0.00009708511,0.00070169376,0.00006282638,0.0001311269],"category_scores_gemma":[0.000020338806,0.00020782823,0.000060966802,0.00033136792,0.0001169616,0.0006066248,0.00054295425,0.00015364977,0.000009756552],"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.000057083857,0.0002921182,0.15180703,0.00045422176,0.00038202567,0.000051490762,0.032428984,0.000009687648,0.18454139,0.0063182334,0.075304,0.54835373],"study_design_scores_gemma":[0.0007500309,0.0006756809,0.013848299,0.00051675225,0.000042273125,0.000077714976,0.0017125139,0.05314467,0.9217606,0.004511694,0.0021272942,0.00083246775],"about_ca_topic_score_codex":0.00041090164,"about_ca_topic_score_gemma":0.0001896015,"teacher_disagreement_score":0.7372192,"about_ca_system_score_codex":0.00006081847,"about_ca_system_score_gemma":0.00003969064,"threshold_uncertainty_score":0.8474989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006019868,0.000082770704,0.9966458,0.0007450001,0.0004286408,0.00046301485,0.000052296997,0.00042309088,0.000557372],"genre_scores_gemma":[0.5533812,0.000057106132,0.44628754,0.000053648873,0.000021461914,0.00011040415,0.0000031758675,0.000011925845,0.00007354554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988911,0.00011328346,0.0003731707,0.0002716831,0.00013566589,0.00021507531],"domain_scores_gemma":[0.9964786,0.00083037885,0.00024853542,0.0018517232,0.00053468905,0.00005604045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035796987,0.00014257511,0.00018669193,0.00028435185,0.0007648907,0.00006641249,0.0016417215,0.00008848623,0.0000071506597],"category_scores_gemma":[0.000030984258,0.00015807764,0.000117404335,0.0006110684,0.00019365414,0.00041406613,0.000018119164,0.00021792499,0.000004832739],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017597458,0.00039700675,0.000028246932,0.000034807428,0.00011302783,1.9154916e-7,0.0034267877,0.00030937704,0.07029929,0.0055473815,0.00020470501,0.9196216],"study_design_scores_gemma":[0.0002076419,0.00020204175,0.000017434106,0.00007572523,0.000021550424,0.0000031706927,0.000072965304,0.77278084,0.22457808,0.0011714472,0.0007046523,0.00016447356],"about_ca_topic_score_codex":0.00044510458,"about_ca_topic_score_gemma":0.0011765262,"teacher_disagreement_score":0.91945714,"about_ca_system_score_codex":0.0001233296,"about_ca_system_score_gemma":0.00012556331,"threshold_uncertainty_score":0.6446219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8509268,0.000065873595,0.14585337,0.000109847504,0.00018710256,0.00024750867,0.0000021812778,0.00022192638,0.0023853523],"genre_scores_gemma":[0.9807918,0.000037864185,0.019025557,0.00005743703,0.000014140879,0.000011366195,0.0000014073797,0.000016629254,0.000043817192],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981476,0.00016278496,0.00058825023,0.00044387634,0.00030363034,0.00035382577],"domain_scores_gemma":[0.9985824,0.00046221976,0.00025636976,0.00048789513,0.00014233412,0.00006873942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062156556,0.00023780644,0.0005183687,0.00022630437,0.00009193065,0.00006154502,0.0004978494,0.000102671846,0.000023831659],"category_scores_gemma":[0.00012847669,0.00020919793,0.000069785536,0.00036067012,0.00016498973,0.00035468143,0.00035060523,0.0001755127,0.0000025979894],"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.00044166687,0.000937034,0.49529576,0.0020146307,0.000371558,0.00010722316,0.12042175,0.0003645188,0.209046,0.05360932,0.0013173617,0.11607317],"study_design_scores_gemma":[0.004863362,0.0005054856,0.082235485,0.0019759103,0.000051616495,0.00023867888,0.0014934753,0.18998995,0.68409353,0.03314312,0.000070682734,0.0013386762],"about_ca_topic_score_codex":0.00042997848,"about_ca_topic_score_gemma":0.000612573,"teacher_disagreement_score":0.47504753,"about_ca_system_score_codex":0.00005332212,"about_ca_system_score_gemma":0.000060653187,"threshold_uncertainty_score":0.8530844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005997862,0.0000031932937,0.9851628,0.000699652,0.00019287007,0.00012545152,0.0000018869825,0.0016415424,0.0061747525],"genre_scores_gemma":[0.5333419,1.7760938e-7,0.4659805,0.0005807815,0.00004179702,0.000003161956,0.000002950406,0.0000064141013,0.000042352338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.0000559528,0.0001453362,0.00030908085,0.00023252878,0.0001838485],"domain_scores_gemma":[0.99892545,0.000037578193,0.000078598605,0.000520636,0.00037374563,0.00006400986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001965704,0.000109120185,0.0001037983,0.000111748275,0.0002014527,0.0001193132,0.00045987993,0.00004720926,0.00007153307],"category_scores_gemma":[0.000041222513,0.000089224755,0.000021773394,0.00058978534,0.0003387956,0.00028893517,0.00006854475,0.000083743354,0.00005069997],"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.000072999814,0.00020650937,0.10650539,0.000035789813,0.000032971304,0.000013461705,0.00059354166,0.0003686684,0.0009554934,0.860199,0.009087359,0.021928832],"study_design_scores_gemma":[0.0003128368,0.00040204503,0.0016790114,0.000028589156,0.000004889971,0.000041826697,0.000025256328,0.9228867,0.063655555,0.0048278454,0.005878102,0.00025728525],"about_ca_topic_score_codex":0.00050552876,"about_ca_topic_score_gemma":0.0007241276,"teacher_disagreement_score":0.9225181,"about_ca_system_score_codex":0.00004530739,"about_ca_system_score_gemma":0.000118066324,"threshold_uncertainty_score":0.363848},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2562443,0.00005684992,0.7379921,0.0003486528,0.00025483605,0.00011280578,0.0000016919765,0.00046029134,0.0045284997],"genre_scores_gemma":[0.87367594,0.0000069520315,0.12543185,0.0005047768,0.000090780166,0.000009845828,0.0000027000017,0.000007891655,0.00026926704],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893904,0.00004212062,0.00018937772,0.0003668308,0.00021692789,0.0002456885],"domain_scores_gemma":[0.9990767,0.00017750125,0.000107653046,0.0003034107,0.00025776893,0.000076964556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003137745,0.00013179066,0.000118503995,0.00012416029,0.00033952363,0.0001448777,0.0003797081,0.00006483746,0.00006665004],"category_scores_gemma":[0.0000743491,0.00012473653,0.000024397237,0.00026771787,0.00014444064,0.00056559616,0.00013221665,0.00010648245,0.000021227503],"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.000101703285,0.00019068053,0.787133,0.00017345493,0.00006134732,0.000015299498,0.0029597569,0.00050694385,0.019469636,0.08368281,0.013627051,0.09207832],"study_design_scores_gemma":[0.00021756892,0.00014790206,0.01065092,0.000058347137,0.000004375797,0.000012029655,0.000015780179,0.9435637,0.04324765,0.00045923344,0.0013944372,0.00022805663],"about_ca_topic_score_codex":0.0003853129,"about_ca_topic_score_gemma":0.0007261903,"teacher_disagreement_score":0.94305676,"about_ca_system_score_codex":0.00009196317,"about_ca_system_score_gemma":0.00014306222,"threshold_uncertainty_score":0.5086608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016999379,0.0000977524,0.9885783,0.003688794,0.00019158992,0.0004897505,0.000039917093,0.0010304836,0.004183484],"genre_scores_gemma":[0.90408313,0.00021224341,0.094139844,0.0008488126,0.000021197886,0.00048283537,0.000004722001,0.000023638655,0.00018358619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866915,0.00021096542,0.00027871874,0.0004261253,0.00015560204,0.0002594326],"domain_scores_gemma":[0.99504715,0.00075264834,0.00010532046,0.0038111338,0.00015854595,0.00012517204],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003137525,0.00022158338,0.00018089719,0.0003095201,0.0013532805,0.00019753558,0.0021400054,0.00010493502,0.000009938042],"category_scores_gemma":[0.000010940155,0.00021286916,0.00009294729,0.0007006478,0.00048586525,0.00033756165,0.000027992173,0.00050027284,0.00012869714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101099846,0.0038675184,0.00016859973,0.000053226293,0.00043390368,0.0000018739504,0.0172444,0.00052411325,0.013067492,0.13021445,0.004312312,0.830011],"study_design_scores_gemma":[0.002090494,0.0045926673,0.001417432,0.00067078474,0.00021655436,0.00029655438,0.0020426305,0.35921207,0.31146613,0.07880209,0.23554796,0.0036446443],"about_ca_topic_score_codex":0.00011938596,"about_ca_topic_score_gemma":0.00036071095,"teacher_disagreement_score":0.9023832,"about_ca_system_score_codex":0.00009817342,"about_ca_system_score_gemma":0.000066953886,"threshold_uncertainty_score":0.99994683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048963554,0.000005646443,0.9286269,0.000035021952,0.00058776967,0.000111636495,1.6962099e-7,0.001346648,0.020322675],"genre_scores_gemma":[0.30729607,3.6380354e-7,0.6922024,0.00013756486,0.00024937504,0.0000043403415,4.3321407e-7,0.000008975751,0.000100519115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988799,0.000052117088,0.00019717652,0.0004070945,0.00020988278,0.0002538206],"domain_scores_gemma":[0.9991976,0.000020935247,0.000091019974,0.00048709888,0.00014983887,0.000053505246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029993703,0.00012856182,0.000113619935,0.00014547167,0.00026729828,0.00025645207,0.00060853193,0.00007430815,0.000013412482],"category_scores_gemma":[0.000025950907,0.000119399025,0.000039152234,0.00053915073,0.000055492605,0.0008965021,0.00034141535,0.00014638426,0.000021819806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015047419,0.000047087196,0.00057207706,0.000009016443,0.00000996924,0.0000027230662,0.0013526063,0.00002267358,0.013054199,0.0103231715,0.00046536437,0.97413963],"study_design_scores_gemma":[0.00009015145,0.000055744822,0.00010885877,0.0000123845475,0.0000023815032,0.00013372832,0.000058274647,0.9512797,0.04666038,0.0010367654,0.00038802702,0.00017359202],"about_ca_topic_score_codex":0.00016679814,"about_ca_topic_score_gemma":0.0000059673134,"teacher_disagreement_score":0.973966,"about_ca_system_score_codex":0.00008018039,"about_ca_system_score_gemma":0.000041364645,"threshold_uncertainty_score":0.48689508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13263674,0.000023710674,0.865714,0.00066791766,0.00006448169,0.00012065207,0.000016705944,0.0001972746,0.0005585227],"genre_scores_gemma":[0.8427994,0.00027584942,0.15671352,0.00008249429,0.0000057103284,0.000030717118,0.000002416665,0.000005403409,0.00008444026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992296,0.000059942726,0.00025732527,0.00019267856,0.0001382663,0.00012217184],"domain_scores_gemma":[0.99741507,0.00019094282,0.0001092242,0.0020446763,0.00019700862,0.00004308755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265451,0.000096856515,0.00015745191,0.00037003338,0.00034196008,0.000029908362,0.0011537214,0.00004178997,0.000009466453],"category_scores_gemma":[0.0000055745054,0.00009777515,0.00007221555,0.0011246573,0.00024510283,0.00021610537,0.000022447486,0.00017130961,0.0000046176337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032450076,0.001974622,0.0036622728,0.000049515253,0.00090175524,3.8119745e-7,0.00446754,0.000687841,0.04670897,0.0041238945,0.000104558254,0.9372862],"study_design_scores_gemma":[0.00028769227,0.0010318763,0.0108476365,0.000067256675,0.00032989797,0.0000062750237,0.00015271497,0.7436309,0.24197257,0.0007437747,0.0006071251,0.0003222983],"about_ca_topic_score_codex":0.00026332826,"about_ca_topic_score_gemma":0.0019573274,"teacher_disagreement_score":0.9369639,"about_ca_system_score_codex":0.00004199971,"about_ca_system_score_gemma":0.000040991632,"threshold_uncertainty_score":0.3987155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19556323,0.000024568988,0.7927821,0.00022642149,0.00028642183,0.00006315901,4.46761e-7,0.00036607878,0.010687535],"genre_scores_gemma":[0.89962435,0.0000014393072,0.100077614,0.00009871458,0.000051099032,0.0000016417081,2.8147738e-7,0.0000037317366,0.00014113521],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993985,0.000031623662,0.00014245811,0.0001715748,0.00012877268,0.00012705532],"domain_scores_gemma":[0.9993265,0.00009537725,0.00010237468,0.0002800074,0.00016826992,0.000027437534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001595675,0.000061649494,0.000086587504,0.000078145364,0.00006728016,0.000035156834,0.0004477674,0.00002960598,0.000022578599],"category_scores_gemma":[0.00007422912,0.000055100263,0.000025383066,0.0002531121,0.000049674712,0.0003176579,0.00013561174,0.00004876035,0.000007918554],"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.000030904735,0.00011386888,0.19420496,0.00007325606,0.000043339252,0.000013978583,0.008330999,0.00014389776,0.25542432,0.23598678,0.009104376,0.29652932],"study_design_scores_gemma":[0.00008249314,0.00016827145,0.0038362916,0.000026047004,0.0000026134378,0.0000072610283,0.00003734013,0.43391043,0.5584852,0.0030295006,0.0002668731,0.00014764961],"about_ca_topic_score_codex":0.00055988645,"about_ca_topic_score_gemma":0.00044207202,"teacher_disagreement_score":0.7040611,"about_ca_system_score_codex":0.000026218844,"about_ca_system_score_gemma":0.000029347411,"threshold_uncertainty_score":0.22469236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777943,0.00023936108,0.9235571,0.006898118,0.00029528575,0.00027252128,0.0000031096858,0.0010889327,0.029866157],"genre_scores_gemma":[0.7708316,0.000067152476,0.22862661,0.00026423592,0.000020686597,0.000051983283,0.0000030763026,0.000007861015,0.00012681895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890274,0.00025031276,0.0002671292,0.00024954506,0.000115554074,0.0002146997],"domain_scores_gemma":[0.99613106,0.000302145,0.000093424045,0.0032842138,0.00014454272,0.000044617238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051881163,0.00011080184,0.00012644887,0.00017813031,0.00019631308,0.000117942196,0.0048105405,0.000057695383,0.000012415943],"category_scores_gemma":[0.00013460642,0.00011636342,0.000033804372,0.00055820786,0.00023427444,0.00041305475,0.0018024598,0.000292316,0.00013491845],"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.000036017405,0.0014010194,0.1783374,0.000040940286,0.00006322378,0.00002291253,0.03648459,0.00011112087,0.010508648,0.5915057,0.019954141,0.16153426],"study_design_scores_gemma":[0.00055840454,0.00060480303,0.035908774,0.0006581212,0.000012258016,0.00009430096,0.00072863564,0.84649915,0.011474945,0.08121358,0.021209506,0.0010375157],"about_ca_topic_score_codex":0.00097142864,"about_ca_topic_score_gemma":0.004269928,"teacher_disagreement_score":0.84638804,"about_ca_system_score_codex":0.00010084215,"about_ca_system_score_gemma":0.00006459901,"threshold_uncertainty_score":0.8939261},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31203517,0.00003856173,0.6734908,0.0010335533,0.0005513609,0.00020477925,0.0000019855408,0.00078670523,0.011857048],"genre_scores_gemma":[0.9471189,0.0000039199526,0.052101888,0.0005034413,0.000088353416,0.0000062082604,4.011718e-7,0.000008184478,0.0001687373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989514,0.00008748633,0.00020329414,0.00027196715,0.00025386253,0.00023199688],"domain_scores_gemma":[0.99874824,0.00016638539,0.000115777,0.0007526557,0.0001764537,0.000040467792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059437915,0.00012136908,0.0001564488,0.00007732852,0.00020122483,0.00006021279,0.0012366254,0.000052678417,0.000057563608],"category_scores_gemma":[0.00008105604,0.00008104679,0.00006643983,0.00040207448,0.00033050097,0.0002562362,0.00052842137,0.00013194015,0.000020922584],"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.00008653027,0.00092983333,0.025071917,0.00023070532,0.0001953756,0.000035119105,0.021292744,0.00007083639,0.13797906,0.61048454,0.14724757,0.056375746],"study_design_scores_gemma":[0.00026989414,0.0005772459,0.029698227,0.00016944722,0.000010864973,0.0000392736,0.00017213114,0.46573305,0.44695804,0.05509048,0.0008287864,0.00045256794],"about_ca_topic_score_codex":0.00021738258,"about_ca_topic_score_gemma":0.0002461511,"teacher_disagreement_score":0.63508373,"about_ca_system_score_codex":0.00002769623,"about_ca_system_score_gemma":0.000037504327,"threshold_uncertainty_score":0.3304992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15636513,0.00070843,0.8261703,0.0020674472,0.003858194,0.00058687635,0.000010067505,0.0016253758,0.008608131],"genre_scores_gemma":[0.99306184,0.000045371828,0.005438164,0.0006326301,0.0003758291,0.00003124664,0.0000048743486,0.000024082126,0.0003859342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997206,0.0005542397,0.0004358861,0.0008227028,0.00051213766,0.0004690321],"domain_scores_gemma":[0.99785715,0.00053102965,0.00031028097,0.00090110383,0.00023152056,0.00016889768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075179024,0.00035695627,0.00042359217,0.00012177348,0.00059274293,0.0009278117,0.0015615455,0.00013588679,0.0000210507],"category_scores_gemma":[0.00005800258,0.0002646357,0.00007994193,0.00029654556,0.0002670381,0.00035703264,0.00046715888,0.000389558,0.0002562506],"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.0001991275,0.0005244763,0.022671701,0.0002373718,0.0009567045,0.0005927588,0.024554467,0.00050900946,0.0075415457,0.3574624,0.14061373,0.44413668],"study_design_scores_gemma":[0.0015895762,0.00622986,0.02254191,0.0035874,0.00009018094,0.0007078671,0.0030623097,0.89096594,0.0018975184,0.010537094,0.056056913,0.0027334518],"about_ca_topic_score_codex":0.0007766289,"about_ca_topic_score_gemma":0.00003326809,"teacher_disagreement_score":0.8904569,"about_ca_system_score_codex":0.000051778676,"about_ca_system_score_gemma":0.00010312083,"threshold_uncertainty_score":0.99998057},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047293445,0.00006937939,0.97872615,0.00023778398,0.0012031719,0.0009880204,0.000023086659,0.0015877348,0.01243531],"genre_scores_gemma":[0.29441264,0.000028722225,0.6921772,0.00012710858,0.00010823122,0.00033168544,0.0010513316,0.000051503812,0.011711584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984914,0.00006421515,0.0004053024,0.00052443263,0.00025404553,0.00026061843],"domain_scores_gemma":[0.9962268,0.0002728712,0.00036082228,0.0023312913,0.00074712234,0.00006110469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003878849,0.00026507003,0.0002703382,0.00024567416,0.0003684195,0.00017392404,0.002873695,0.0003468784,0.000011893935],"category_scores_gemma":[0.00014205862,0.00027679402,0.00014343289,0.00023641334,0.000037550937,0.00037956864,0.00020969998,0.00024959727,0.00004437981],"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.00005058276,0.00036592086,0.00023944964,0.0003584516,0.00012195224,9.3179574e-7,0.008866298,0.000004017101,0.011276015,0.25285932,0.043137286,0.68271977],"study_design_scores_gemma":[0.00036141902,0.00019587348,0.002501599,0.00033092432,0.000043324646,0.0000050336243,0.00025618737,0.91862506,0.032922573,0.020957926,0.022869933,0.00093017035],"about_ca_topic_score_codex":0.00024491825,"about_ca_topic_score_gemma":0.0021003678,"teacher_disagreement_score":0.918621,"about_ca_system_score_codex":0.00010594221,"about_ca_system_score_gemma":0.0001652386,"threshold_uncertainty_score":0.9999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12257822,0.0001614051,0.8661373,0.00044821334,0.0014900011,0.00091120123,0.000007704999,0.0018614455,0.006404462],"genre_scores_gemma":[0.88758415,0.000019556039,0.11179577,0.00012281393,0.000036801626,0.000028722307,0.000019779474,0.000023353108,0.00036904152],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978365,0.0001602533,0.0005711667,0.0007296143,0.00040735753,0.00029516304],"domain_scores_gemma":[0.9974932,0.00018197084,0.0005916835,0.0012571454,0.00041635893,0.000059661546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006531893,0.00030257757,0.00047636655,0.0002886063,0.000060114027,0.00016514352,0.0018642925,0.00031280715,0.000016042146],"category_scores_gemma":[0.0002011526,0.0002748807,0.00014859009,0.00027958493,0.000056969955,0.00031080272,0.0021974917,0.0006367142,0.00002485516],"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.00014120016,0.0013110348,0.12262348,0.006526511,0.00083777437,0.00012884148,0.014859954,0.032423124,0.30251104,0.21467027,0.0233877,0.28057906],"study_design_scores_gemma":[0.00015443604,0.00013301843,0.0018081683,0.000325367,0.000019952657,0.00001598698,0.000024845334,0.77533185,0.21725938,0.0043628477,0.00009562582,0.00046850843],"about_ca_topic_score_codex":0.0005463272,"about_ca_topic_score_gemma":0.000043735647,"teacher_disagreement_score":0.76500595,"about_ca_system_score_codex":0.000117374424,"about_ca_system_score_gemma":0.00019639578,"threshold_uncertainty_score":0.9999703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015343748,0.00038009215,0.98328406,0.00018429112,0.00043175096,0.00018799493,0.0000039741412,0.000054391934,0.00012967284],"genre_scores_gemma":[0.8955529,0.0000020939103,0.10404034,0.000033623084,0.00031961713,0.0000073049077,8.812612e-7,0.000011767174,0.00003148096],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852127,0.000068650064,0.000731126,0.00014316879,0.00035904266,0.00017673132],"domain_scores_gemma":[0.99738914,0.00008894485,0.0010025378,0.0001272593,0.001333692,0.00005842052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443625,0.000107628584,0.00024731387,0.0002594841,0.00024851656,0.00024188917,0.00053246535,0.0000437488,0.000003370445],"category_scores_gemma":[0.00006318051,0.00009008811,0.00008860065,0.0002650943,0.00004168343,0.0010955861,0.000042459742,0.00010471683,9.608382e-7],"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.00022334197,0.0004175306,0.013676312,0.0025610116,0.0004074607,0.000025724174,0.044291012,0.005988047,0.59439754,0.009374535,0.016503341,0.31213418],"study_design_scores_gemma":[0.0018228967,0.0031388947,0.0007305529,0.0039266716,0.00015063229,0.000827943,0.008386262,0.7572203,0.21561725,0.0022850898,0.0051886574,0.0007047994],"about_ca_topic_score_codex":0.000050802842,"about_ca_topic_score_gemma":0.000013720055,"teacher_disagreement_score":0.88020915,"about_ca_system_score_codex":0.0000858352,"about_ca_system_score_gemma":0.00029386283,"threshold_uncertainty_score":0.36736867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009539393,0.000090678484,0.98930943,0.0041099633,0.0013901548,0.0020599328,0.00015943726,0.0022847268,0.0005003016],"genre_scores_gemma":[0.4616387,0.000054602177,0.5365854,0.00023861248,0.000036181733,0.0012567743,0.000040650328,0.000043961983,0.0001051433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972788,0.000563051,0.0006197012,0.000812485,0.0003493263,0.0003766459],"domain_scores_gemma":[0.9894334,0.0014564655,0.0004075423,0.0079353005,0.0006600525,0.00010725268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008905795,0.0004343586,0.0003904731,0.00050555164,0.0010735602,0.00031253876,0.0053465413,0.00048311532,0.000012612143],"category_scores_gemma":[0.00005014554,0.0004993294,0.00039322276,0.0005337572,0.00021544873,0.0003280889,0.00007341788,0.0010815954,0.000050240247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024498874,0.0044254013,0.000021062533,0.00042623593,0.0006682376,0.0000022392962,0.005123225,0.78334373,0.005815646,0.014322164,0.017349785,0.16825731],"study_design_scores_gemma":[0.00030693834,0.00022356436,0.000023593315,0.00022632962,0.000072826886,0.0000030541232,0.000010705997,0.9430194,0.028534345,0.025675071,0.0014067916,0.0004974079],"about_ca_topic_score_codex":0.00023793326,"about_ca_topic_score_gemma":0.00026527198,"teacher_disagreement_score":0.4615433,"about_ca_system_score_codex":0.00038728793,"about_ca_system_score_gemma":0.0005564601,"threshold_uncertainty_score":0.99974585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18225428,0.00001962039,0.81563157,0.0003493843,0.000076561635,0.0002442689,0.000002127729,0.00062547886,0.00079669413],"genre_scores_gemma":[0.6174626,0.000003907281,0.38207752,0.00022947992,0.000029272405,0.000018605888,0.0000010604472,0.000008272884,0.00016931014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909306,0.00004988086,0.00014079367,0.00037589032,0.00012096342,0.00021942459],"domain_scores_gemma":[0.9991729,0.00016456652,0.00009498766,0.00032503682,0.00018480506,0.00005767575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053661066,0.00012429354,0.00012077369,0.00007280635,0.00018710282,0.00017370886,0.00034821156,0.000045424727,0.0000023609848],"category_scores_gemma":[0.00005952753,0.00009963194,0.000017462226,0.0001837384,0.0000878155,0.00068717723,0.00010839438,0.00007388975,0.000005558926],"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.00032127,0.00014688821,0.008515725,0.00020397983,0.00009921335,0.00004002319,0.038327556,0.00022457937,0.30140355,0.40773213,0.0019266487,0.24105841],"study_design_scores_gemma":[0.00087544194,0.0026282326,0.002759445,0.00033375277,0.000030948555,0.00018746007,0.00085666316,0.56748223,0.26737833,0.15571076,0.0008023804,0.0009543345],"about_ca_topic_score_codex":0.0005872992,"about_ca_topic_score_gemma":0.00083340757,"teacher_disagreement_score":0.5672577,"about_ca_system_score_codex":0.00003182446,"about_ca_system_score_gemma":0.000048628255,"threshold_uncertainty_score":0.40628728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024198364,0.00003831367,0.9684911,0.00041523823,0.00063206983,0.00025481463,0.000002925336,0.0007293815,0.0052378075],"genre_scores_gemma":[0.7088966,0.0000022646047,0.29027855,0.00024082967,0.00019131115,0.000029245151,0.0000028263482,0.000007125256,0.00035129357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989403,0.000031801057,0.00020764003,0.00036739116,0.00017306933,0.00027981825],"domain_scores_gemma":[0.99879473,0.0003250804,0.0001341151,0.00028412978,0.00040907244,0.00005284606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300159,0.00011584504,0.00012611272,0.000121595236,0.00032275033,0.00011182719,0.0005017088,0.00006277211,0.000031489428],"category_scores_gemma":[0.00022703843,0.00011386122,0.000051961622,0.00027575096,0.00006654869,0.000498672,0.00013186799,0.00006768296,0.000021439844],"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.000046059587,0.000064916705,0.0030081654,0.00006140345,0.00005566356,0.0000018478311,0.0030049053,0.000112823334,0.41136777,0.4953693,0.007836478,0.079070665],"study_design_scores_gemma":[0.00021778213,0.00014759263,0.0004596491,0.00006434183,0.0000049140463,0.000004513009,0.000043893524,0.42872885,0.55916643,0.009511757,0.0013962105,0.0002540576],"about_ca_topic_score_codex":0.00019494687,"about_ca_topic_score_gemma":0.00045895885,"teacher_disagreement_score":0.6846982,"about_ca_system_score_codex":0.00013298019,"about_ca_system_score_gemma":0.000115809016,"threshold_uncertainty_score":0.46431258},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77429587,0.00022673054,0.21947658,0.0036720345,0.000283929,0.00018170837,0.0000010340206,0.00056736567,0.0012947682],"genre_scores_gemma":[0.9433051,0.00001781293,0.055381626,0.0011614765,0.000021054535,0.000006059362,0.0000026306684,0.0000137417155,0.00009049693],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988115,0.00006833212,0.00022336173,0.00031276207,0.00023739268,0.00034668142],"domain_scores_gemma":[0.9989915,0.000112446374,0.0001587588,0.0006486279,0.000054810054,0.000033857752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037196264,0.0001164616,0.00017487898,0.000147595,0.000050235732,0.000045324956,0.0007276206,0.00004817742,0.0000145483145],"category_scores_gemma":[0.000043799,0.00012393051,0.00008293937,0.00036707055,0.00002351075,0.00026667147,0.000122774,0.00022871734,0.000033909695],"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.0000069330085,0.000034437875,0.008187495,0.000029034672,0.00002921394,0.0000055826467,0.00022217247,0.000056287696,0.9451991,0.038879547,0.002850764,0.0044994317],"study_design_scores_gemma":[0.00062514935,0.00050033024,0.005730049,0.00017862224,0.000019492252,0.00014053086,0.000025184754,0.016313868,0.95838356,0.005045066,0.01226241,0.00077573874],"about_ca_topic_score_codex":0.00002894882,"about_ca_topic_score_gemma":0.000018606559,"teacher_disagreement_score":0.16900925,"about_ca_system_score_codex":0.00015221308,"about_ca_system_score_gemma":0.00006897579,"threshold_uncertainty_score":0.50537395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21115105,0.000037334237,0.7855223,0.000045020424,0.0009443018,0.00032534808,0.000009496364,0.0008442472,0.0011209436],"genre_scores_gemma":[0.97898644,0.000023559614,0.019793924,0.00020849274,0.000320226,0.0000012916903,0.000011147202,0.00003743229,0.0006174825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750775,0.00021242634,0.00019716655,0.0013932614,0.00016945561,0.00051992334],"domain_scores_gemma":[0.99744135,0.0001637155,0.00037092553,0.0014429019,0.00040514267,0.0001759558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003919458,0.0004508959,0.0004101174,0.0003872902,0.00032886487,0.00015053185,0.00197371,0.00040202323,0.000020025609],"category_scores_gemma":[0.000038104754,0.00047110207,0.00016374126,0.0006116961,0.00030338357,0.0003264074,0.0016386466,0.00088345545,0.000035104462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011297506,0.00012829223,0.003478619,0.000044318967,0.00015102426,0.00040223467,0.00020706689,0.96113044,0.00004208619,0.03328073,0.0008718265,0.00015040193],"study_design_scores_gemma":[0.0002776437,0.00022899886,0.00046038753,0.0003733053,0.000067795634,0.000034541248,0.0000330592,0.99001443,0.00043799178,0.0073481044,0.000091971255,0.00063175766],"about_ca_topic_score_codex":0.0003625161,"about_ca_topic_score_gemma":0.00004777794,"teacher_disagreement_score":0.7678354,"about_ca_system_score_codex":0.00046300504,"about_ca_system_score_gemma":0.00030591091,"threshold_uncertainty_score":0.99977404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052736983,0.00008044357,0.945832,0.00005701275,0.00021185276,0.00021427391,0.000004696865,0.00041887182,0.00044383755],"genre_scores_gemma":[0.95477206,0.000001343891,0.04496754,0.000109682966,0.000016467951,0.000016926075,3.084741e-7,0.000019805668,0.00009587859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985991,0.00007193018,0.0003202013,0.00040820855,0.0003395121,0.0002610472],"domain_scores_gemma":[0.99902755,0.00022911256,0.00018362392,0.00029936622,0.00019732874,0.00006301268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028203338,0.00019292225,0.00025295743,0.00034056412,0.00019971478,0.000133665,0.00050453824,0.00008131571,0.000031088097],"category_scores_gemma":[0.0000061969695,0.00018793035,0.0000982144,0.0006355821,0.00005480985,0.0008447981,0.0000046473665,0.00033077618,0.000032209406],"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.00013060105,0.0005640128,0.00023386662,0.00039332415,0.000085955275,0.000013950875,0.0103143025,0.084532335,0.33633482,0.00074882695,0.000038548096,0.56660944],"study_design_scores_gemma":[0.00030142508,0.00034866293,0.000028837207,0.0006109319,0.000019603076,0.00003121995,0.00015666852,0.5838427,0.41326404,0.0010504234,0.00001566842,0.000329867],"about_ca_topic_score_codex":0.0000201499,"about_ca_topic_score_gemma":0.000008689113,"teacher_disagreement_score":0.90203506,"about_ca_system_score_codex":0.000075760494,"about_ca_system_score_gemma":0.00013806368,"threshold_uncertainty_score":0.7663577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039274205,0.0000081733515,0.9975461,0.00014066616,0.001075025,0.00027036387,0.000056640205,0.00022445832,0.00028582814],"genre_scores_gemma":[0.90012383,0.00002067136,0.098807134,0.0005720504,0.000017609178,0.00020699139,0.0000024913795,0.000008057864,0.00024113814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913394,0.00008599509,0.00033664008,0.000108579035,0.00018170869,0.00015313581],"domain_scores_gemma":[0.9975738,0.0014606755,0.00016133982,0.00047468653,0.00029561,0.00003388247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061383075,0.00010629416,0.00011945698,0.00013639877,0.00023280414,0.00008853118,0.00040393363,0.000048979055,0.00001567256],"category_scores_gemma":[0.00007058481,0.00008676874,0.00012381264,0.0003363986,0.00006439572,0.0007730399,0.0000037422076,0.00015599924,0.00001948546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016700777,0.000052961048,1.3357445e-7,0.000040356197,0.000035796413,0.0000010264272,0.0055522188,0.016530901,0.00012454843,0.0071799345,0.0000643414,0.9704011],"study_design_scores_gemma":[0.00026563564,0.00013299748,0.000004601601,0.000043615546,0.000021406628,0.000036358648,0.0002586702,0.7516728,0.2226818,0.02348711,0.0012473357,0.00014765853],"about_ca_topic_score_codex":0.0000074036984,"about_ca_topic_score_gemma":0.0000042104352,"teacher_disagreement_score":0.9702534,"about_ca_system_score_codex":0.000035769724,"about_ca_system_score_gemma":0.0000901785,"threshold_uncertainty_score":0.35383263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013148857,0.00020334464,0.9762989,0.00012487557,0.0012279832,0.0003848215,0.00000977055,0.001267017,0.0073343976],"genre_scores_gemma":[0.5342027,0.000025059633,0.4647934,0.0000698766,0.000020187004,0.000010821305,0.0000032034247,0.000017731263,0.0008570133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980127,0.00009645956,0.00046877784,0.0007694086,0.00034536104,0.00030729946],"domain_scores_gemma":[0.99728703,0.00018256056,0.00041634945,0.0018182708,0.00022748242,0.00006829343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060121296,0.00030537054,0.0005018812,0.00027525786,0.000042880176,0.00013544201,0.0027702108,0.0003155121,0.000019383097],"category_scores_gemma":[0.00014577588,0.00029143813,0.00021060774,0.00018386461,0.000045070705,0.00019030599,0.004356568,0.00063898135,0.000058280024],"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.0000556707,0.0021441125,0.29520786,0.005619854,0.0010183894,0.00012944582,0.025356635,0.023031687,0.07998021,0.19063082,0.02469631,0.352129],"study_design_scores_gemma":[0.00026423778,0.0000885241,0.0037119936,0.0007769032,0.000023898916,0.000020352589,0.00009666136,0.8828285,0.106387645,0.0045241136,0.0003802659,0.00089691597],"about_ca_topic_score_codex":0.0010027768,"about_ca_topic_score_gemma":0.00012414338,"teacher_disagreement_score":0.8597968,"about_ca_system_score_codex":0.000096370044,"about_ca_system_score_gemma":0.00019381533,"threshold_uncertainty_score":0.99995375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56132823,0.00004429429,0.43654394,0.00034065152,0.00017512299,0.00035308095,8.8340545e-7,0.0004088922,0.00080491445],"genre_scores_gemma":[0.93262273,0.0000051558204,0.066953056,0.00030598752,0.000057798858,0.000013501224,0.0000017470619,0.000016307271,0.00002371417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761164,0.00036968192,0.0006372496,0.000533091,0.00038842965,0.00045989524],"domain_scores_gemma":[0.99775237,0.0008938244,0.0002572648,0.0008642595,0.00017528699,0.00005702076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013290917,0.00023627921,0.00037808192,0.00022075335,0.00021812954,0.00007515995,0.0014549991,0.00008225577,0.00001809511],"category_scores_gemma":[0.00017890154,0.00018142872,0.000108354216,0.00076616666,0.00018854204,0.00025890366,0.00054930465,0.00024034317,0.0000066985267],"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.0005086473,0.0015742909,0.14884605,0.00042467608,0.0004392767,0.00010853834,0.0893774,0.0019247124,0.45010427,0.021390071,0.00779933,0.27750275],"study_design_scores_gemma":[0.0026240374,0.00023467498,0.027031181,0.00043781797,0.000018749386,0.000045337838,0.0013850217,0.5749636,0.39099485,0.0015337449,0.00018057822,0.0005504014],"about_ca_topic_score_codex":0.0007871469,"about_ca_topic_score_gemma":0.0018972553,"teacher_disagreement_score":0.5730389,"about_ca_system_score_codex":0.000081415914,"about_ca_system_score_gemma":0.000085259046,"threshold_uncertainty_score":0.73984486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05914854,0.0010938739,0.9124243,0.00022090043,0.0017600246,0.0005169522,0.0000099905765,0.0012623137,0.023563087],"genre_scores_gemma":[0.64023715,0.00031770364,0.3590128,0.00003865599,0.00002972138,0.000009123273,0.0000036626307,0.000014861354,0.00033631382],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818605,0.000094730676,0.0004306526,0.00071543443,0.00033114819,0.00024195698],"domain_scores_gemma":[0.99795043,0.00019553812,0.00040617908,0.0011286619,0.00025339337,0.000065769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052220956,0.00026691068,0.00046454175,0.0007234906,0.000048901213,0.00012653576,0.0010092568,0.00034486988,0.000010747069],"category_scores_gemma":[0.0001458437,0.0002563249,0.00010443815,0.000550391,0.00010652178,0.00026370183,0.001904314,0.0005547043,0.000014019296],"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.000034675013,0.00034565316,0.117196925,0.0030521534,0.0002972683,0.000016006705,0.0015356801,0.0004224826,0.0042950506,0.3720699,0.004331407,0.4964028],"study_design_scores_gemma":[0.0011446197,0.0009976021,0.032475404,0.0026256228,0.00015537137,0.00040787822,0.00027157992,0.20180865,0.4737301,0.28160614,0.0015547934,0.0032222578],"about_ca_topic_score_codex":0.00067310396,"about_ca_topic_score_gemma":0.000011948949,"teacher_disagreement_score":0.5810886,"about_ca_system_score_codex":0.00006556136,"about_ca_system_score_gemma":0.00019058911,"threshold_uncertainty_score":0.9999889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035365563,0.000026590182,0.95940965,0.001850766,0.00023979478,0.0015912949,0.000046351197,0.0010119892,0.00045798754],"genre_scores_gemma":[0.8160203,0.000017424101,0.18288398,0.0001204531,0.00001614049,0.0005611797,0.000051007104,0.000033329434,0.00029616297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982248,0.00022073847,0.00044436194,0.00047935353,0.0003325211,0.0002982272],"domain_scores_gemma":[0.9955861,0.00061348366,0.0002365436,0.0030114707,0.0004576241,0.000094767835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003971517,0.00024840247,0.00024992527,0.00033417682,0.00066535076,0.00017079612,0.0013516386,0.00010969269,0.0000126061805],"category_scores_gemma":[0.000021270753,0.00024896848,0.00009392374,0.00072625687,0.000087844724,0.0008295449,0.000014901016,0.00038083506,0.000048189813],"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.0017171293,0.0139572825,0.0009344091,0.0002682414,0.0008248016,0.0000037652194,0.006110065,0.073927194,0.48912847,0.04682358,0.0020169243,0.36428815],"study_design_scores_gemma":[0.0035196037,0.0017790479,0.0009346126,0.00015670533,0.000094989075,0.000022805121,0.00010377897,0.92216897,0.0688856,0.001065681,0.00069462194,0.00057355606],"about_ca_topic_score_codex":0.00009523288,"about_ca_topic_score_gemma":0.00046340615,"teacher_disagreement_score":0.8482418,"about_ca_system_score_codex":0.00018847383,"about_ca_system_score_gemma":0.00019046574,"threshold_uncertainty_score":0.99999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5695042,0.00002816904,0.4279589,0.00027594375,0.00015788026,0.0003097681,7.1138635e-7,0.00039737913,0.0013670549],"genre_scores_gemma":[0.91730064,0.000004434407,0.08227137,0.00033902502,0.00004597081,0.000009722566,0.0000010611877,0.000011113807,0.000016658647],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809813,0.00027503882,0.00053875323,0.00041706662,0.0002986394,0.00037239303],"domain_scores_gemma":[0.9979789,0.0009646346,0.0002086691,0.00066637323,0.00013709048,0.00004430178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937416,0.00018219023,0.0002894273,0.00018291616,0.00017455743,0.0000576582,0.0011681045,0.000060715418,0.000018115526],"category_scores_gemma":[0.00019989969,0.00013585195,0.00008282422,0.0006666971,0.00012771554,0.00022015505,0.00045846496,0.00019831392,0.0000066430557],"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.00043572535,0.00136776,0.248711,0.0002823692,0.000342998,0.00007100137,0.110180296,0.0011552945,0.34914824,0.015931847,0.008852586,0.26352087],"study_design_scores_gemma":[0.0023587744,0.00025947302,0.03379332,0.00032742156,0.000013183614,0.000035685902,0.0010640408,0.6350139,0.32503527,0.001511465,0.00013598075,0.00045151683],"about_ca_topic_score_codex":0.0008473314,"about_ca_topic_score_gemma":0.0021878788,"teacher_disagreement_score":0.63385856,"about_ca_system_score_codex":0.00006389186,"about_ca_system_score_gemma":0.00007331864,"threshold_uncertainty_score":0.55398816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43025288,0.000011066308,0.5598973,0.00038130014,0.00025278973,0.0000888572,3.93541e-7,0.0003544117,0.008760999],"genre_scores_gemma":[0.9424461,0.0000016900242,0.056996845,0.00037469738,0.000108741515,0.0000022111433,1.2435248e-7,0.000010084147,0.000059498772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892664,0.00005543907,0.00020950848,0.00027347307,0.00029587006,0.00023907534],"domain_scores_gemma":[0.99892867,0.00019403143,0.00008503929,0.00066352,0.0001024265,0.00002632987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060127594,0.000119576405,0.00013548216,0.00011423418,0.00020228143,0.000083921266,0.0009109123,0.000043704866,0.000017875793],"category_scores_gemma":[0.000057292953,0.0000782172,0.00006355188,0.00044544108,0.0001767294,0.0001980134,0.00024011731,0.00012216042,0.000007213232],"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.000027746684,0.00021079289,0.019218657,0.000028260345,0.00008322623,0.000010805957,0.003056619,0.0006801798,0.11804253,0.83694607,0.007264398,0.01443074],"study_design_scores_gemma":[0.00007559648,0.00031339392,0.0045042257,0.00013717849,0.000013905763,0.00004049777,0.00021490626,0.17632678,0.7325541,0.0852453,0.00023746143,0.00033664764],"about_ca_topic_score_codex":0.00032214844,"about_ca_topic_score_gemma":0.00017151274,"teacher_disagreement_score":0.75170076,"about_ca_system_score_codex":0.000029162871,"about_ca_system_score_gemma":0.0000309495,"threshold_uncertainty_score":0.3189605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36185518,0.00011473719,0.61536133,0.012640707,0.0037293653,0.00039304228,0.0000065047484,0.002028357,0.003870751],"genre_scores_gemma":[0.85536194,0.000016505235,0.1432113,0.0007697107,0.0002816753,0.000012853506,6.437825e-7,0.000030163608,0.00031518552],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972219,0.00013753305,0.0010048355,0.00051126495,0.00046369774,0.00066078635],"domain_scores_gemma":[0.9959817,0.00017761877,0.00083173846,0.0011058223,0.0016272599,0.00027585818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009104047,0.00032973805,0.0006410725,0.0019461852,0.00036363205,0.00012609869,0.0024642353,0.0003966649,0.000118020915],"category_scores_gemma":[0.00092578225,0.00029410742,0.00018853598,0.00278494,0.0005268591,0.0004924588,0.00071989896,0.0009746122,0.0002302503],"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.0004430519,0.0018999018,0.0152786225,0.00009478137,0.0005204736,0.0027763771,0.004090292,0.00004496164,0.33559927,0.2023909,0.32853425,0.10832711],"study_design_scores_gemma":[0.0014183628,0.006290634,0.0024778156,0.00042773786,0.0000858756,0.0075333263,0.00047852047,0.004616834,0.83330196,0.07261287,0.069635645,0.0011204192],"about_ca_topic_score_codex":0.000050367104,"about_ca_topic_score_gemma":0.00015922765,"teacher_disagreement_score":0.4977027,"about_ca_system_score_codex":0.00035847074,"about_ca_system_score_gemma":0.00026703934,"threshold_uncertainty_score":0.9999511},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15069264,0.0000118735625,0.8455031,0.0005146499,0.001186642,0.0006679281,0.000024491721,0.0003018892,0.001096809],"genre_scores_gemma":[0.9964282,0.00001598593,0.0032651632,0.00022397187,0.000016903441,0.00002790047,0.0000015866527,0.000013996725,0.000006283487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766403,0.0005683475,0.0008526985,0.000215346,0.00048788814,0.00021165583],"domain_scores_gemma":[0.997267,0.0008525044,0.00058816967,0.001143411,0.00011982,0.00002910071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049905,0.0002569611,0.00029943357,0.0002616605,0.00028087888,0.00010364166,0.0017232939,0.00016184317,0.000013597324],"category_scores_gemma":[0.00005145694,0.00015357591,0.00030012263,0.0010319444,0.00021039686,0.00036164527,0.00006650815,0.0011725109,0.000007756971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029438443,0.0003504656,0.00070587697,0.0006026453,0.00033241982,0.0000016610713,0.061316226,0.6735161,0.0018416503,0.21294229,0.00021795175,0.047878325],"study_design_scores_gemma":[0.00025854894,0.00006354952,0.0020236652,0.0011764384,0.00009187892,0.00002846793,0.0009684356,0.6826234,0.19330777,0.11896551,0.000040364182,0.0004519587],"about_ca_topic_score_codex":0.00014316953,"about_ca_topic_score_gemma":0.000032971537,"teacher_disagreement_score":0.84573555,"about_ca_system_score_codex":0.00011224426,"about_ca_system_score_gemma":0.0001493162,"threshold_uncertainty_score":0.6262644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005130132,0.000076797005,0.9875793,0.0015982335,0.00028384815,0.00032367237,0.000026690857,0.0004621541,0.0045191906],"genre_scores_gemma":[0.87702405,0.00004594413,0.12244678,0.00014895992,0.000003642523,0.000051957366,0.000004507967,0.00001561692,0.00025851696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00018649615,0.00034416636,0.00026739415,0.00024534835,0.000184351],"domain_scores_gemma":[0.99545586,0.0009569162,0.00020228165,0.0030929383,0.00023100196,0.00006099942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023917638,0.00014951655,0.00019960316,0.0003036213,0.00027760884,0.00005258836,0.002285315,0.00008370901,0.00005874684],"category_scores_gemma":[0.000012658309,0.0001633351,0.00013252135,0.00071674486,0.0001285371,0.00033053162,0.000012052158,0.00033702765,0.00008328546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018179374,0.0059211385,0.012423041,0.0004051485,0.00057971623,0.0000039468077,0.010608635,0.44958892,0.12335841,0.09022235,0.0018643832,0.3048425],"study_design_scores_gemma":[0.000619187,0.00026360905,0.0006300501,0.00019626983,0.00003255772,0.0000040157947,0.0001518121,0.8383983,0.15599649,0.0015504041,0.0016980704,0.0004592279],"about_ca_topic_score_codex":0.00027387234,"about_ca_topic_score_gemma":0.00053059176,"teacher_disagreement_score":0.87189394,"about_ca_system_score_codex":0.00009294413,"about_ca_system_score_gemma":0.00018321081,"threshold_uncertainty_score":0.6660613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16804056,0.000015586338,0.8276117,0.000036126028,0.0005991177,0.0003739296,0.000004033487,0.0013741284,0.001944847],"genre_scores_gemma":[0.9581434,0.0000073324754,0.0409176,0.00006799722,0.000042910793,4.546575e-7,0.000010848312,0.00003538363,0.00077405735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778545,0.00013203402,0.0002096355,0.0012985799,0.00013393852,0.0004403685],"domain_scores_gemma":[0.99714863,0.00022323261,0.000378553,0.0017558759,0.00035909633,0.00013459646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029044325,0.000432182,0.0004381564,0.00036331837,0.00013093799,0.00019239212,0.002666946,0.00030805447,0.000005822755],"category_scores_gemma":[0.00005648854,0.00044260267,0.00013313026,0.0008420943,0.00010720426,0.00026941157,0.002768612,0.0012118325,0.00007981848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023222668,0.000060302922,0.0011545622,0.000066243185,0.00007779384,0.00021558453,0.00034412727,0.9514481,0.000017661918,0.045771766,0.00014672504,0.0006739099],"study_design_scores_gemma":[0.00025501376,0.00014026351,0.00020715577,0.0004000486,0.000059438586,0.000021514812,0.000090114874,0.99000365,0.000117249474,0.008100074,0.000031579366,0.0005739106],"about_ca_topic_score_codex":0.00017882245,"about_ca_topic_score_gemma":0.000044167853,"teacher_disagreement_score":0.79010284,"about_ca_system_score_codex":0.00032614975,"about_ca_system_score_gemma":0.00041197077,"threshold_uncertainty_score":0.9998026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54497606,0.00010918298,0.41954577,0.0013868716,0.0009310277,0.0005831022,0.0000073058236,0.0041373754,0.028323326],"genre_scores_gemma":[0.9316584,0.0000072601674,0.064996704,0.0019973514,0.000017611903,0.000009070742,0.0000070299607,0.000017289802,0.0012892789],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983316,0.00023397368,0.00025256065,0.0005051706,0.00031490688,0.00036178788],"domain_scores_gemma":[0.99809915,0.00040781306,0.00008691869,0.0011687184,0.00014556956,0.00009181591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027964,0.00017769111,0.00023815288,0.00015557787,0.00007215998,0.0001614438,0.0013126652,0.000086327156,0.0001670499],"category_scores_gemma":[0.00014418302,0.00015853744,0.00006640463,0.00070977863,0.000020944033,0.0006593215,0.00036752102,0.00021301727,0.0006657594],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003061434,0.00036471616,0.8254947,0.000064426116,0.00007520314,0.000020507521,0.0024910322,0.00006983592,0.037176177,0.030704482,0.07941898,0.02408931],"study_design_scores_gemma":[0.001413662,0.0011115044,0.6040723,0.00019108766,0.000014305287,0.00008191795,0.0001890429,0.25999817,0.072665535,0.006910963,0.051085614,0.0022659427],"about_ca_topic_score_codex":0.0031718498,"about_ca_topic_score_gemma":0.0011050183,"teacher_disagreement_score":0.38668236,"about_ca_system_score_codex":0.0000556774,"about_ca_system_score_gemma":0.00004965474,"threshold_uncertainty_score":0.8557212},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08075607,0.00003959751,0.9131608,0.00078308483,0.002058863,0.000885898,0.000013400793,0.00084577454,0.001456516],"genre_scores_gemma":[0.98616457,0.0000021243347,0.011250817,0.0021058521,0.00015223898,0.00009213886,0.0000024832304,0.000024282352,0.00020549996],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849313,0.000060574228,0.00024630193,0.0005220252,0.00024101535,0.00043696276],"domain_scores_gemma":[0.99839854,0.0002619608,0.00015739651,0.0008822246,0.00020759187,0.00009225447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042514628,0.00018952713,0.00028124524,0.0001251061,0.00012828718,0.00034450428,0.00244018,0.00009822073,0.000018927183],"category_scores_gemma":[0.00006349191,0.00018220689,0.00011893147,0.00026356673,0.000037556285,0.0010843318,0.000123251,0.00016681175,0.00009441643],"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.0011750968,0.003908832,0.1758291,0.0036436357,0.0008801565,0.00015611373,0.010498773,0.012902384,0.11912861,0.16488917,0.3232034,0.18378472],"study_design_scores_gemma":[0.0032219463,0.00053496106,0.011905139,0.00020584775,0.000029973802,0.00004348142,0.000023064358,0.60307103,0.28367844,0.091574855,0.004345772,0.0013654646],"about_ca_topic_score_codex":0.00019890467,"about_ca_topic_score_gemma":0.00010221169,"teacher_disagreement_score":0.9054085,"about_ca_system_score_codex":0.0000599418,"about_ca_system_score_gemma":0.000063380874,"threshold_uncertainty_score":0.7430181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003209006,0.0000018186404,0.989665,0.00018436839,0.0011895589,0.0006568785,0.000009548593,0.001521155,0.0035627172],"genre_scores_gemma":[0.95441526,0.000002574694,0.043642778,0.0017257914,0.000012395087,0.000070268055,0.0000035177488,0.00001648038,0.00011096117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984186,0.00023497027,0.00042149183,0.00023223013,0.00041428235,0.0002784132],"domain_scores_gemma":[0.9977817,0.0009844416,0.00023945347,0.000748555,0.00016524267,0.00008062718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013219764,0.00022073046,0.00018630188,0.0006271107,0.0002991648,0.00018293224,0.00062575215,0.00012407624,0.0001277623],"category_scores_gemma":[0.000043797732,0.00021823,0.0001287538,0.0005369631,0.0000308172,0.0014369293,0.0000029501305,0.0003810462,0.0005514108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002750305,0.00014868793,0.0000065521826,0.000047523863,0.00003267249,0.0000016070096,0.003971136,0.8752794,0.0011228191,0.032911114,0.00009880395,0.0861046],"study_design_scores_gemma":[0.0006143371,0.00048973894,0.000016819218,0.00009255591,0.000009042652,0.0000067029528,0.00013164435,0.93923134,0.05620213,0.002704453,0.00021530666,0.00028592855],"about_ca_topic_score_codex":0.000014473476,"about_ca_topic_score_gemma":0.0000073733113,"teacher_disagreement_score":0.9512062,"about_ca_system_score_codex":0.00012757163,"about_ca_system_score_gemma":0.000116173665,"threshold_uncertainty_score":0.8899161},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15884995,0.000005713656,0.8366866,0.0003275744,0.00027205187,0.00017452752,0.00000784854,0.00011844157,0.0035572783],"genre_scores_gemma":[0.9895702,0.000006605935,0.009770475,0.0006050265,0.0000045028128,0.000008372254,9.5736e-7,0.0000039489473,0.000029915645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992598,0.00008763812,0.00023486529,0.00010724668,0.00020383883,0.00010658644],"domain_scores_gemma":[0.99894404,0.00059657136,0.000120107274,0.00023073485,0.00007712848,0.000031427368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597946,0.000098237564,0.00010136862,0.00019509059,0.00023060244,0.00010931687,0.00020602175,0.00004494329,0.000040949275],"category_scores_gemma":[0.000015033613,0.00007735199,0.000039297196,0.00016554598,0.00012468938,0.0009872009,0.000007758566,0.00018797709,0.000026981726],"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.000081485305,0.00006068807,0.00019775497,0.000056774035,0.00003668329,2.3319852e-7,0.006972053,0.006272058,0.00043241223,0.92611384,0.0000855575,0.059690468],"study_design_scores_gemma":[0.0010755956,0.0008349748,0.004314929,0.00034675357,0.000025741623,0.000090333735,0.0017227924,0.6318847,0.033831365,0.32450747,0.0007252676,0.00064008974],"about_ca_topic_score_codex":0.000009318821,"about_ca_topic_score_gemma":0.0000017279941,"teacher_disagreement_score":0.83072025,"about_ca_system_score_codex":0.000033510838,"about_ca_system_score_gemma":0.00002642258,"threshold_uncertainty_score":0.31543228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60591435,0.000018194034,0.39145252,0.00017172692,0.000390499,0.00064572395,0.0000035121857,0.0005407007,0.0008627523],"genre_scores_gemma":[0.92008084,0.0000030422766,0.07921195,0.00023963233,0.000045215562,0.000054189906,0.000002047742,0.000027053598,0.00033604773],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854994,0.00005369854,0.00018529945,0.00049663946,0.000291303,0.00042311195],"domain_scores_gemma":[0.9983135,0.0005464709,0.000098227894,0.00074554153,0.0002106737,0.00008557311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040401786,0.00017368373,0.00021881673,0.00015680252,0.00014339543,0.0004078878,0.0020755243,0.00007215878,0.0000046036585],"category_scores_gemma":[0.00003326792,0.00015014311,0.000058324735,0.00039420184,0.000026481299,0.0008800217,0.0002809202,0.00018923332,0.00003455882],"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.00043511577,0.0005538063,0.83284986,0.0006277916,0.00008849515,0.00003860791,0.002626802,0.002393575,0.13469747,0.0032889324,0.008683266,0.013716289],"study_design_scores_gemma":[0.0017433402,0.00066736323,0.0031782864,0.00011794622,0.000010793646,0.000016828279,0.0000433513,0.2361413,0.7563615,0.0005349076,0.0006747393,0.0005096827],"about_ca_topic_score_codex":0.00021754441,"about_ca_topic_score_gemma":0.000102552534,"teacher_disagreement_score":0.82967156,"about_ca_system_score_codex":0.000059542075,"about_ca_system_score_gemma":0.000088134504,"threshold_uncertainty_score":0.6122658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746008,0.0007038346,0.021689152,0.0004270937,0.00051550183,0.000591546,0.000022961616,0.00040479243,0.001044346],"genre_scores_gemma":[0.9969018,0.00041807492,0.0023394302,0.000094892595,0.000009213336,0.00008242814,0.0000062958366,0.000032207943,0.00011566593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976104,0.00013750036,0.00032227405,0.0007680501,0.00067153637,0.0004902531],"domain_scores_gemma":[0.9976047,0.0001925265,0.0005018138,0.0013404209,0.00025119886,0.000109332505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036645224,0.0004952132,0.0006143075,0.00017279506,0.00020263118,0.00024843385,0.0015701633,0.00021675134,0.000003380528],"category_scores_gemma":[0.000011069541,0.0002830472,0.00015015501,0.00061542075,0.00027995525,0.00016537214,0.0009899542,0.0008407453,0.0000016263193],"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.000031509073,0.00020979739,0.3316864,0.00020929577,0.00016224178,0.00002201599,0.0010972584,0.000018820936,0.000042430045,0.6654212,0.00032208976,0.0007769575],"study_design_scores_gemma":[0.0010765162,0.0010685957,0.13227272,0.000898757,0.0002021944,0.00015725564,0.00043897767,0.0030029058,0.00542148,0.85389096,0.00022974005,0.0013399168],"about_ca_topic_score_codex":0.00036652677,"about_ca_topic_score_gemma":0.0002523202,"teacher_disagreement_score":0.19941369,"about_ca_system_score_codex":0.000042854797,"about_ca_system_score_gemma":0.00012881195,"threshold_uncertainty_score":0.99996215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5283733,0.000004395365,0.47045532,0.000018939336,0.00020938549,0.00025902188,0.000018364259,0.00017213023,0.00048914435],"genre_scores_gemma":[0.98891646,0.000048635637,0.0107249785,0.00005592975,0.000017144595,0.0000018476007,0.000051014846,0.000017558134,0.0001664532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838394,0.00017388932,0.00034382628,0.0007281463,0.00013907762,0.00023112753],"domain_scores_gemma":[0.9976577,0.00011885151,0.00071387284,0.0011799367,0.00026202243,0.00006758071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033620806,0.00026589964,0.0004255324,0.0004218618,0.000058940463,0.000029945046,0.0015427227,0.00023140872,0.00004050787],"category_scores_gemma":[0.000032149008,0.00031957717,0.00014231062,0.0005526223,0.000084662584,0.00034857632,0.0010431013,0.00034834037,0.000006535118],"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.00011065606,0.0008089321,0.0077668508,0.0013172325,0.00054575375,0.00007914626,0.0018075103,0.05530839,0.18507773,0.7414305,0.0005095888,0.0052376776],"study_design_scores_gemma":[0.0006601966,0.0004223832,0.006573228,0.0015690133,0.00017697793,0.0000049621967,0.00008634029,0.719428,0.13656336,0.13341813,0.000111541296,0.0009858414],"about_ca_topic_score_codex":0.00030865788,"about_ca_topic_score_gemma":0.000006221542,"teacher_disagreement_score":0.66411966,"about_ca_system_score_codex":0.00012991334,"about_ca_system_score_gemma":0.00013294477,"threshold_uncertainty_score":0.9999256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9186684,0.00026805964,0.07918011,0.00027607245,0.00057469244,0.0004305734,0.000013486951,0.00038216147,0.00020643846],"genre_scores_gemma":[0.96687895,0.00005166733,0.03280795,0.00007882447,0.000050100243,0.00002796479,0.0000211526,0.00002598306,0.00005742618],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976859,0.00018280464,0.0006341256,0.0007989829,0.00041387323,0.00028428476],"domain_scores_gemma":[0.99720496,0.0004589378,0.00081796397,0.0011620012,0.00028411014,0.00007203383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076789234,0.00036786278,0.00069512747,0.00073020766,0.00008518293,0.00006057369,0.00093750487,0.0004219945,0.0000022760746],"category_scores_gemma":[0.0005350727,0.00037269676,0.0001421828,0.0007670633,0.00016666588,0.00021102067,0.0014383022,0.0006932216,0.00000932005],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011376858,0.0016250042,0.92409235,0.0040501817,0.00023020188,0.000077018056,0.0024442975,0.021100024,0.01275418,0.005681482,0.0027544673,0.025077002],"study_design_scores_gemma":[0.00025326942,0.00047552894,0.46534163,0.0013804428,0.000052668012,0.00001167352,0.00001688625,0.24429712,0.2768177,0.010718203,0.000014292424,0.0006205954],"about_ca_topic_score_codex":0.001030484,"about_ca_topic_score_gemma":0.0000236036,"teacher_disagreement_score":0.45875075,"about_ca_system_score_codex":0.00008173353,"about_ca_system_score_gemma":0.00010882686,"threshold_uncertainty_score":0.9998725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41795984,0.000114167626,0.5773981,0.0003729768,0.00038131923,0.0025068754,0.00008208685,0.00050347176,0.000681144],"genre_scores_gemma":[0.9985078,0.00022570933,0.0008035698,0.0000869444,0.000050337996,0.000060055423,0.00004727403,0.000040697236,0.00017763757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959284,0.0010012195,0.00055472524,0.0015860446,0.00034073394,0.00058884727],"domain_scores_gemma":[0.9932583,0.0019156671,0.0012345554,0.0029956037,0.0003913802,0.0002045078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019185542,0.00069756404,0.0010680062,0.0004676136,0.00078020117,0.00031618902,0.0031368968,0.00050389604,0.000010960664],"category_scores_gemma":[0.00073075696,0.000588448,0.00072470075,0.00063493283,0.00078579574,0.00036991495,0.0012688391,0.0010643412,0.000008478452],"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.04598713,0.0059548747,0.07482822,0.00326116,0.0033638093,0.0015566881,0.0044317837,0.16745588,0.007250259,0.65424114,0.014454337,0.017214688],"study_design_scores_gemma":[0.04065617,0.0010086773,0.0042811907,0.0026882093,0.00086864474,0.000029298779,0.00017914062,0.59434474,0.03523362,0.31663552,0.0012908016,0.0027839623],"about_ca_topic_score_codex":0.0006492878,"about_ca_topic_score_gemma":0.00025499696,"teacher_disagreement_score":0.5805479,"about_ca_system_score_codex":0.00013768808,"about_ca_system_score_gemma":0.00027188694,"threshold_uncertainty_score":0.9996567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4057984,0.0001409305,0.59096605,0.00013426138,0.0012518459,0.00093054154,0.000013583178,0.0007070557,0.000057371126],"genre_scores_gemma":[0.87234753,0.00014903388,0.12672321,0.00015111493,0.0001858406,0.00022437805,0.000014745938,0.00005310286,0.00015101841],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996809,0.0002934653,0.00071606744,0.0012054489,0.00041368313,0.0005623316],"domain_scores_gemma":[0.9958545,0.0007856815,0.0006966865,0.001971147,0.00054892205,0.0001430627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010175352,0.00054043677,0.0009002987,0.00027010095,0.0002334019,0.00007941125,0.0023972658,0.00058403984,0.0000029009007],"category_scores_gemma":[0.0007187244,0.00057257194,0.00033681933,0.00028483162,0.00019617668,0.0001972193,0.0019943952,0.0008103034,0.000020878171],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001317765,0.0056865485,0.66593695,0.015655318,0.0018830555,0.0025832253,0.030204525,0.044125363,0.13647623,0.003695988,0.055074524,0.03736052],"study_design_scores_gemma":[0.0013875382,0.002255926,0.09449598,0.0037971113,0.00027816053,0.00034983392,0.00007741349,0.46654955,0.3973046,0.029050391,0.00052081887,0.0039326735],"about_ca_topic_score_codex":0.000108004075,"about_ca_topic_score_gemma":0.000010763445,"teacher_disagreement_score":0.57144094,"about_ca_system_score_codex":0.00013193594,"about_ca_system_score_gemma":0.0004533813,"threshold_uncertainty_score":0.9996726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21677034,0.00005943928,0.77458954,0.00006630315,0.00064986234,0.00025184758,0.000021112166,0.00047642348,0.0071151424],"genre_scores_gemma":[0.9918638,0.000107043765,0.0070547597,0.000021795304,0.000068459594,8.5729425e-7,0.000013472877,0.000022213635,0.0008476118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980609,0.00014240433,0.00029081298,0.001037364,0.00013703849,0.00033148946],"domain_scores_gemma":[0.9961124,0.00022723501,0.0010844292,0.002098708,0.0003594909,0.00011775613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033959,0.00032987143,0.00047124832,0.0003574326,0.0003247064,0.00020906172,0.0034271374,0.00033565046,0.000014256556],"category_scores_gemma":[0.00018912529,0.0004063201,0.00022496679,0.00029245572,0.00017620416,0.0005798652,0.0026016827,0.00058155454,0.000012450986],"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.0001976637,0.00044989662,0.19780587,0.0013123931,0.00052653503,0.0007634432,0.0036001767,0.19771376,0.007988963,0.5647298,0.002084581,0.022826897],"study_design_scores_gemma":[0.00045050107,0.00009685859,0.0038047945,0.0006352612,0.0001044747,0.000006467364,0.00009541707,0.9141926,0.013580114,0.06570393,0.0003394647,0.0009900976],"about_ca_topic_score_codex":0.0011914945,"about_ca_topic_score_gemma":0.00046260929,"teacher_disagreement_score":0.77509344,"about_ca_system_score_codex":0.00024967626,"about_ca_system_score_gemma":0.0002516765,"threshold_uncertainty_score":0.9998389},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42523238,0.00010530995,0.57334125,0.000027646742,0.00043560023,0.0005980085,0.00004920647,0.0001711278,0.000039475744],"genre_scores_gemma":[0.99111086,0.00016468999,0.008578362,0.0000443491,0.0000052026417,0.00005443747,0.000014805246,0.000019360445,0.000007926854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738824,0.00038806096,0.0011383106,0.0003956214,0.00042698497,0.000262754],"domain_scores_gemma":[0.9974326,0.00066352676,0.00090073247,0.0007606862,0.0001709956,0.000071451235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012783627,0.00042796507,0.00075578166,0.00089897425,0.00015911726,0.00013990674,0.00050944585,0.0003598784,0.000004743635],"category_scores_gemma":[0.000055148463,0.0004093223,0.0001370276,0.00022958395,0.00018902679,0.00095459924,0.000054300832,0.00079104654,6.2968707e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009306697,0.00020918321,0.00065583887,0.0069518257,0.0004951881,0.000005788223,0.14327882,0.7123519,0.0071754144,0.020807577,0.000025005982,0.10711274],"study_design_scores_gemma":[0.003277206,0.00021369052,0.0048379865,0.0029230807,0.00013115392,0.000083257204,0.0026414122,0.64362663,0.2581935,0.082998835,0.0000074845843,0.0010657522],"about_ca_topic_score_codex":0.00014099469,"about_ca_topic_score_gemma":0.00006670884,"teacher_disagreement_score":0.5658785,"about_ca_system_score_codex":0.00010601039,"about_ca_system_score_gemma":0.00013476584,"threshold_uncertainty_score":0.99983585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22395484,0.000033568158,0.7654027,0.000059792324,0.0011430527,0.00038109804,0.000007766003,0.0022762928,0.006740898],"genre_scores_gemma":[0.9796018,0.00007875082,0.019078776,0.000126777,0.00010814202,0.0000021064543,0.00001056259,0.00005013801,0.00094296114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970107,0.00021165982,0.00033536187,0.001708536,0.00014357969,0.00059016753],"domain_scores_gemma":[0.99635136,0.00022591301,0.00060418283,0.0022578796,0.0003355256,0.0002251173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006284898,0.0005093108,0.00053927704,0.00042358326,0.00028970867,0.0001692983,0.0038440793,0.00049604755,0.000055913097],"category_scores_gemma":[0.0001908725,0.0006357858,0.00030096536,0.00061362475,0.00008771092,0.0004011995,0.004347839,0.0011557451,0.00011312081],"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.00011011257,0.00048179075,0.006696193,0.00033894758,0.0004205402,0.002229139,0.0061480748,0.087711245,0.0011713563,0.88926536,0.0007156549,0.004711583],"study_design_scores_gemma":[0.0003636447,0.00011810587,0.00035443762,0.00021485702,0.00007966139,0.000021409374,0.00007989282,0.9438647,0.001955142,0.051708575,0.00030604735,0.0009335082],"about_ca_topic_score_codex":0.0014106631,"about_ca_topic_score_gemma":0.0012145129,"teacher_disagreement_score":0.8561535,"about_ca_system_score_codex":0.0003433612,"about_ca_system_score_gemma":0.0003241827,"threshold_uncertainty_score":0.99960935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34791282,0.000016128004,0.6510235,0.00004552629,0.00017764127,0.0005331727,0.00007791654,0.00017006152,0.00004321122],"genre_scores_gemma":[0.9648983,0.00007196427,0.034733843,0.000025247296,0.00003756045,0.0000049795945,0.000048036258,0.00001943035,0.00016064578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983102,0.00010199947,0.00023475669,0.0009232791,0.000118951124,0.00031081407],"domain_scores_gemma":[0.99851334,0.00015042022,0.00029470993,0.0006401153,0.00030667285,0.000094758914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048396704,0.0002574324,0.00033902086,0.0003664666,0.00013336191,0.000049230406,0.0008723256,0.00018671546,0.0000044879534],"category_scores_gemma":[0.000016261403,0.00027390115,0.00012315673,0.0002938583,0.00013447163,0.0002044265,0.0012838749,0.00022426476,0.0000014756979],"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.0003748086,0.0012781116,0.013601714,0.0027462437,0.0014237623,0.0003608102,0.010590283,0.023680098,0.13106044,0.13580768,0.00037364688,0.6787024],"study_design_scores_gemma":[0.00050206354,0.00014932382,0.0022014165,0.00042994978,0.00006858952,0.000004762117,0.00012027798,0.95160794,0.03918559,0.005248357,0.00006708088,0.0004146172],"about_ca_topic_score_codex":0.000042671927,"about_ca_topic_score_gemma":0.0000045165384,"teacher_disagreement_score":0.92792785,"about_ca_system_score_codex":0.00017525777,"about_ca_system_score_gemma":0.00012667767,"threshold_uncertainty_score":0.99997133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04529427,0.00007345679,0.94751126,0.00013717296,0.001286364,0.0005235641,0.0000029421192,0.0018208781,0.0033501112],"genre_scores_gemma":[0.9874633,0.00001931205,0.010824734,0.000061368715,0.00013556788,0.0000040892564,0.000012920582,0.000032203163,0.0014465097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977915,0.00018486172,0.0002463905,0.0011374899,0.00014839553,0.0004913088],"domain_scores_gemma":[0.9972345,0.00013362165,0.00040789085,0.0017893123,0.0002380146,0.00019665484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004747241,0.0003810772,0.0003323973,0.00035776515,0.00019383147,0.00012116063,0.0022539515,0.0004235429,0.000018467314],"category_scores_gemma":[0.00012168213,0.00045418533,0.0001972686,0.00064204424,0.00009439977,0.0006279403,0.0026761426,0.00093871844,0.0002219018],"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.00005963732,0.00053782685,0.0028907019,0.00030750735,0.00017740577,0.00032162282,0.0023704136,0.1335242,0.00073045376,0.8486969,0.0019480779,0.0084352745],"study_design_scores_gemma":[0.00044647447,0.0001246312,0.001626353,0.00043574724,0.00018288704,0.0000357283,0.00005102594,0.8851287,0.0014097,0.10871768,0.00041965366,0.0014214453],"about_ca_topic_score_codex":0.00019047406,"about_ca_topic_score_gemma":0.000043177046,"teacher_disagreement_score":0.942169,"about_ca_system_score_codex":0.00041102906,"about_ca_system_score_gemma":0.00019612406,"threshold_uncertainty_score":0.99979097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101010695,0.000052436724,0.89362144,0.00008492295,0.002931099,0.0012018129,0.000013056219,0.00069837045,0.00038616647],"genre_scores_gemma":[0.95182264,0.00009369826,0.04682881,0.00009418411,0.00021079848,0.000018258828,0.000025641528,0.000029234852,0.00087671605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780583,0.00010082408,0.00023348915,0.001315521,0.00009348803,0.00045082578],"domain_scores_gemma":[0.9976842,0.00026884803,0.00035683962,0.0011650204,0.00036200718,0.00016310644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054393907,0.00035921147,0.00035935923,0.00016917803,0.00029555894,0.00015635202,0.0015831561,0.00047677834,0.000008816403],"category_scores_gemma":[0.0001247201,0.00042701775,0.00014065478,0.00045556217,0.00014255228,0.00037512582,0.0017206025,0.00078849436,0.000012582482],"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.00046821753,0.0005992517,0.042520177,0.0017757942,0.00041058773,0.00047340136,0.0036297152,0.38121784,0.0016890203,0.45779845,0.022908863,0.0865087],"study_design_scores_gemma":[0.0002665864,0.00008136819,0.00079528516,0.00015136873,0.000058341953,0.000012477548,0.000018468321,0.96029353,0.0011714912,0.03524342,0.0013594301,0.0005482032],"about_ca_topic_score_codex":0.000116899675,"about_ca_topic_score_gemma":0.00030135797,"teacher_disagreement_score":0.85081196,"about_ca_system_score_codex":0.00012340181,"about_ca_system_score_gemma":0.00022250408,"threshold_uncertainty_score":0.99981815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45174065,0.000039367005,0.5430152,0.00016063622,0.00083499524,0.0001798274,0.000002908585,0.0012250118,0.0028013785],"genre_scores_gemma":[0.9934448,0.000053704945,0.00461733,0.00014608019,0.000116421914,0.0000010557117,0.000008264452,0.000023060218,0.0015892746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792457,0.00032276515,0.00016207938,0.0011422843,0.000114196046,0.00033408272],"domain_scores_gemma":[0.9971754,0.00039150295,0.00028535543,0.0019025081,0.00015251036,0.000092708935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041509912,0.00029589134,0.00026922143,0.00011877286,0.00032755826,0.00020962511,0.004244246,0.00029024444,0.000045527016],"category_scores_gemma":[0.00013247007,0.00027539962,0.00019850882,0.00049544004,0.00015892649,0.0002675257,0.004947776,0.001234083,0.00030232655],"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.00015522596,0.0006558644,0.28109396,0.00025429143,0.0017686429,0.009597949,0.017883765,0.26439285,0.00051192526,0.3674728,0.039446257,0.016766464],"study_design_scores_gemma":[0.0002919831,0.00024687083,0.014771892,0.00039674935,0.00013674135,0.000047408616,0.00020810805,0.7703005,0.00044538968,0.20792589,0.004095273,0.0011332125],"about_ca_topic_score_codex":0.0009351451,"about_ca_topic_score_gemma":0.000092779046,"teacher_disagreement_score":0.5417041,"about_ca_system_score_codex":0.00018241435,"about_ca_system_score_gemma":0.00014436588,"threshold_uncertainty_score":0.99996984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.567927,0.000056340225,0.41113856,0.0001912851,0.00083602016,0.0005634275,0.0000119011875,0.00092478836,0.018350657],"genre_scores_gemma":[0.9911967,0.00011672843,0.007423346,0.00011449058,0.000039892744,0.0000023689372,0.0000028549293,0.000025645597,0.0010780094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801654,0.00028735495,0.00026605086,0.0009788724,0.00013241186,0.00031876747],"domain_scores_gemma":[0.9962052,0.00042211168,0.00048583528,0.002570296,0.0002277174,0.000088803245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005262824,0.00034609262,0.00038601368,0.00030744044,0.00015996351,0.000038152193,0.0039409776,0.00030651296,0.00004070523],"category_scores_gemma":[0.00013812486,0.000305287,0.00028301703,0.0006586454,0.00022990831,0.00018571941,0.0028854099,0.0009721659,0.000053823627],"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.000060245766,0.0002231396,0.00085338583,0.000089515444,0.00009210864,0.00017813407,0.0008124852,0.010889441,0.0003078338,0.98411936,0.001988427,0.0003859031],"study_design_scores_gemma":[0.00032163778,0.00056913897,0.0012618093,0.00091847085,0.00012421673,0.000013922452,0.00011848069,0.34929314,0.014028585,0.6319446,0.00036980433,0.0010361896],"about_ca_topic_score_codex":0.00029686405,"about_ca_topic_score_gemma":0.000029558327,"teacher_disagreement_score":0.42326963,"about_ca_system_score_codex":0.00011875471,"about_ca_system_score_gemma":0.00020405186,"threshold_uncertainty_score":0.9999399},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06832335,0.00016486418,0.924827,0.00015094264,0.0007378533,0.00026872102,0.00001680002,0.0017388014,0.0037716676],"genre_scores_gemma":[0.9624597,0.00022035153,0.03386035,0.000104252584,0.00006158143,0.0000011528055,0.000008368572,0.000030873798,0.003253364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978289,0.00010120867,0.00016843482,0.0013768595,0.00010614925,0.00041844745],"domain_scores_gemma":[0.9967304,0.000115939125,0.00037266046,0.002393001,0.00017367699,0.00021432775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032114596,0.00038284852,0.0003747677,0.00032082692,0.00049434626,0.00046881783,0.0031919465,0.0003818965,0.000011451007],"category_scores_gemma":[0.00016268571,0.00047112312,0.00016774179,0.00021020233,0.00022149512,0.0006464606,0.0049557425,0.00080236193,0.00003379009],"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.00020478741,0.0007259289,0.39071718,0.0017020458,0.00093622296,0.0051028524,0.006470167,0.056500208,0.00042404296,0.41093034,0.022304008,0.103982225],"study_design_scores_gemma":[0.0012553339,0.0003130944,0.012184578,0.0011536231,0.0002975835,0.00011773297,0.0002446014,0.5946489,0.0026964007,0.37657046,0.0068447925,0.0036728715],"about_ca_topic_score_codex":0.0010645766,"about_ca_topic_score_gemma":0.00031308673,"teacher_disagreement_score":0.89413637,"about_ca_system_score_codex":0.0001916025,"about_ca_system_score_gemma":0.00022844845,"threshold_uncertainty_score":0.99977404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5162945,0.00017753441,0.48128676,0.00006755115,0.00036072693,0.00017289548,0.000017936401,0.0005690976,0.0010530412],"genre_scores_gemma":[0.9956041,0.00014813786,0.0033871122,0.000023298386,0.00003927268,4.2242388e-7,0.000007799332,0.000016066633,0.0007737767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984343,0.00015798397,0.00022986754,0.000780808,0.00010609784,0.00029096406],"domain_scores_gemma":[0.9977809,0.00031930293,0.00045752822,0.000893445,0.0003602908,0.0001885137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005340379,0.0003043599,0.00050559844,0.00040801926,0.00007901651,0.000105299194,0.001459077,0.0003427201,0.000007077536],"category_scores_gemma":[0.00037086455,0.0003160989,0.00013232991,0.00086691405,0.00014421952,0.00033247916,0.002597644,0.00047210653,0.000004743534],"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.0004253813,0.0012151209,0.35991266,0.0008609007,0.0025074459,0.00066343945,0.016108464,0.05629965,0.0023133026,0.48233706,0.043043733,0.03431284],"study_design_scores_gemma":[0.0018390116,0.00087473576,0.011944095,0.0008682439,0.00033012926,0.000017016631,0.0008480874,0.39979342,0.038156386,0.54027474,0.0026093486,0.0024448005],"about_ca_topic_score_codex":0.00087256747,"about_ca_topic_score_gemma":0.00020332332,"teacher_disagreement_score":0.47930965,"about_ca_system_score_codex":0.00017559581,"about_ca_system_score_gemma":0.00050071336,"threshold_uncertainty_score":0.99992913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05966268,0.000062633604,0.93787014,0.000029634386,0.0008880397,0.0005938258,0.000043998094,0.0004734131,0.00037564163],"genre_scores_gemma":[0.8307084,0.00004972187,0.16880609,0.000025957008,0.00012491872,0.0000033027063,0.000016294232,0.000024147444,0.00024116876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806976,0.000101815385,0.00031657118,0.0010491197,0.00009166167,0.00037108676],"domain_scores_gemma":[0.9970622,0.00033854408,0.000802984,0.0010287847,0.000670205,0.00009726382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004751203,0.00031354735,0.00043605716,0.00042108764,0.00020488113,0.00009179362,0.0017865249,0.00032786155,0.0000059583226],"category_scores_gemma":[0.00013307159,0.0003857593,0.00024029573,0.00052908616,0.0001251803,0.0004167243,0.0014602497,0.00034364837,0.000002744872],"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.00062386814,0.001406862,0.044904225,0.005805022,0.003124842,0.0004660201,0.015351166,0.1420765,0.061038032,0.2790683,0.005227096,0.44090807],"study_design_scores_gemma":[0.00026418746,0.00011352351,0.000091421665,0.00023295224,0.000056088254,0.0000017662708,0.000053067914,0.9645297,0.018814797,0.015356621,0.000091335074,0.00039452358],"about_ca_topic_score_codex":0.00088161306,"about_ca_topic_score_gemma":0.00023075637,"teacher_disagreement_score":0.8224532,"about_ca_system_score_codex":0.00035333438,"about_ca_system_score_gemma":0.00030847112,"threshold_uncertainty_score":0.99985945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4771536,0.000013631081,0.520519,0.000044417236,0.000222741,0.000229452,0.000003390194,0.00049300643,0.0013207428],"genre_scores_gemma":[0.98268706,0.000017681059,0.017062675,0.00008218335,0.000026172362,0.000002374245,0.000008578691,0.000025414556,0.000087841174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982082,0.00018763992,0.00015831835,0.000990038,0.00011935069,0.000336433],"domain_scores_gemma":[0.9980387,0.00048141505,0.0003333709,0.0008785001,0.0001246905,0.00014333168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003621626,0.00035396212,0.00032445267,0.000548699,0.00020592668,0.0001583934,0.00087751704,0.00022116567,0.000009315645],"category_scores_gemma":[0.000056123114,0.00037296195,0.00008370695,0.0004522796,0.00008051251,0.00082545186,0.0011135393,0.00070163544,0.000012279473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006974932,0.0007396981,0.16991565,0.0006439076,0.00038283004,0.0029502278,0.0034487736,0.7397697,0.0011625253,0.07330711,0.00030192698,0.006680141],"study_design_scores_gemma":[0.00031793682,0.00029173243,0.008192462,0.0006383316,0.00007187962,0.000039868566,0.00007152247,0.9864138,0.0008006837,0.0025569256,0.000030453011,0.0005744326],"about_ca_topic_score_codex":0.0001131693,"about_ca_topic_score_gemma":0.000030911793,"teacher_disagreement_score":0.5055335,"about_ca_system_score_codex":0.00037430233,"about_ca_system_score_gemma":0.000105374536,"threshold_uncertainty_score":0.9998722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30094203,0.00009838574,0.6928686,0.000027212434,0.0050081615,0.00042151773,0.000011403325,0.00057562644,0.00004703558],"genre_scores_gemma":[0.99293345,0.0000038245676,0.0066334503,0.000096335476,0.00018892235,0.00003532516,0.0000057018815,0.000039315753,0.00006368203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969745,0.00043189552,0.0006544276,0.0008373985,0.0005370371,0.0005647262],"domain_scores_gemma":[0.9982945,0.00020699593,0.00027232798,0.0007979221,0.00023614924,0.0001921453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007629694,0.00037875355,0.0004314357,0.00031768042,0.0005355185,0.00046075185,0.0005184661,0.00017773709,0.000008092135],"category_scores_gemma":[0.000005634274,0.00035751984,0.00014200625,0.00064685347,0.00004395144,0.00056431507,0.000010709008,0.00048696663,0.000016840904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000258526,0.00021788618,0.000053200853,0.00002849169,0.00001833346,0.0000031828995,0.001220754,0.9835959,0.0031795255,0.00061141874,0.00003481017,0.011010642],"study_design_scores_gemma":[0.0003341616,0.00030063075,0.00006306237,0.00050106796,0.000023016624,0.00009978279,0.00037597792,0.99586064,0.0019926636,0.000028183875,0.00004472413,0.0003760716],"about_ca_topic_score_codex":0.00028085805,"about_ca_topic_score_gemma":0.00017127821,"teacher_disagreement_score":0.6919914,"about_ca_system_score_codex":0.00026084486,"about_ca_system_score_gemma":0.00007670084,"threshold_uncertainty_score":0.9998877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003363409,0.000002318927,0.96983486,0.0006256643,0.0006639932,0.00012986796,0.000011147298,0.00027519223,0.025093537],"genre_scores_gemma":[0.9970241,0.0000074050577,0.001824087,0.00092955615,0.0000104325845,0.0000418666,8.411213e-7,0.0000061390583,0.00015552592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896467,0.00012727854,0.00032250673,0.00012135827,0.0003019142,0.00016225132],"domain_scores_gemma":[0.99770993,0.0004126497,0.0003552558,0.0013279766,0.00015097127,0.00004320774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720432,0.00013278138,0.00012921325,0.00018098338,0.00078606606,0.0001958371,0.0013421683,0.00007301693,0.00007453138],"category_scores_gemma":[0.00006234652,0.00010127153,0.00010801255,0.00011868165,0.00023470851,0.0015396252,0.000007791226,0.00021668729,0.00007717657],"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.000016870827,0.000052071147,0.0000016265677,0.0000092085365,0.000019931244,2.4899646e-7,0.0013690635,0.001019487,0.00012989859,0.8376865,0.00040595155,0.15928917],"study_design_scores_gemma":[0.00052412297,0.00032951272,0.000578895,0.00015320715,0.000021434253,0.000022890441,0.00024731125,0.06366418,0.36082146,0.571353,0.0018510547,0.00043288723],"about_ca_topic_score_codex":0.000060700026,"about_ca_topic_score_gemma":0.000028771039,"teacher_disagreement_score":0.99366075,"about_ca_system_score_codex":0.00005174909,"about_ca_system_score_gemma":0.000051196646,"threshold_uncertainty_score":0.6045864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24393062,0.00007554624,0.74894017,0.0003907376,0.0014048913,0.0010976905,0.00015743628,0.0012617733,0.0027411554],"genre_scores_gemma":[0.9577155,0.00032011358,0.040272217,0.00049334415,0.00009946758,0.0003516045,0.000046816094,0.000094372735,0.0006065828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933091,0.00037650488,0.002848987,0.0008538201,0.0014297063,0.0011818899],"domain_scores_gemma":[0.9936934,0.0016469145,0.0014012195,0.0019505636,0.0009491218,0.00035876842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00332964,0.0009826993,0.0010437458,0.0023118628,0.00070853863,0.00033157176,0.0021074908,0.0006446041,0.00010867344],"category_scores_gemma":[0.00028908584,0.0008465956,0.00057362794,0.0020097655,0.00033347151,0.008214912,0.00007623547,0.0007938141,0.0006844935],"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.0010160649,0.0016229411,0.00014070487,0.00097607943,0.00041647957,0.00004884617,0.028675219,0.030645996,0.118245654,0.2957475,0.0014080649,0.5210565],"study_design_scores_gemma":[0.005142725,0.0014624994,0.0014221326,0.0026229732,0.00019478364,0.0002866829,0.00058882334,0.73497623,0.22529243,0.018056678,0.0072190943,0.0027349156],"about_ca_topic_score_codex":0.00003580759,"about_ca_topic_score_gemma":0.00018052253,"teacher_disagreement_score":0.7137849,"about_ca_system_score_codex":0.0007954776,"about_ca_system_score_gemma":0.00056820293,"threshold_uncertainty_score":0.99939847},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3660947,0.000054761083,0.6263933,0.0042353612,0.0001348691,0.00071992987,0.000017428792,0.00031054346,0.0020390654],"genre_scores_gemma":[0.79525316,0.0000070545757,0.203251,0.0011007276,0.000051538696,0.00005863752,6.5756353e-7,0.000020063379,0.00025714506],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979024,0.00013568254,0.00050771615,0.00068660674,0.00038350228,0.0003840923],"domain_scores_gemma":[0.9972936,0.0011352126,0.00020924445,0.0009972018,0.00018540949,0.00017934339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054652675,0.0002995874,0.00043953292,0.0001888034,0.00015875639,0.00011023629,0.001208628,0.00012423626,0.000037394475],"category_scores_gemma":[0.0004031838,0.00022586458,0.00009185079,0.000751417,0.00019379192,0.00027724198,0.00037239536,0.00017463155,0.0000053539784],"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.00015157051,0.00016181689,0.0012936357,0.000080680555,0.00011048769,0.000009905873,0.04773627,0.0000054945876,0.88907975,0.006415908,0.034113955,0.020840531],"study_design_scores_gemma":[0.00024020438,0.0010144853,0.0033810537,0.0010637066,0.000020310554,0.000011754502,0.0011611595,0.0025634945,0.978377,0.008678524,0.0029670023,0.00052133773],"about_ca_topic_score_codex":0.00071050663,"about_ca_topic_score_gemma":0.00057413266,"teacher_disagreement_score":0.42915845,"about_ca_system_score_codex":0.000059452137,"about_ca_system_score_gemma":0.0001283691,"threshold_uncertainty_score":0.92104906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08057089,0.0018276422,0.9025355,0.009112607,0.00016217816,0.0008051929,0.000008587757,0.0010529115,0.003924476],"genre_scores_gemma":[0.9282063,0.000293896,0.07081244,0.00039601413,0.000007709092,0.00005668897,0.000005563799,0.0000094172365,0.00021192525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880755,0.00041933477,0.00017981761,0.00024470064,0.00017897256,0.00016960198],"domain_scores_gemma":[0.9949376,0.0009142927,0.00011793599,0.0038880706,0.000099963545,0.000042119893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074738375,0.00011883964,0.00017450648,0.00017994431,0.00035127546,0.0001656857,0.0027175855,0.000060771305,0.000012430471],"category_scores_gemma":[0.0000642248,0.00009261611,0.00008582686,0.0012746406,0.00010903788,0.00029271268,0.0011812038,0.00025818433,0.000029379536],"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.00009491082,0.0021086861,0.2667587,0.00013614903,0.0052353265,0.000015920665,0.07683052,0.011496281,0.06294679,0.43355694,0.07327592,0.06754384],"study_design_scores_gemma":[0.00022136544,0.00013565397,0.146514,0.000042577318,0.00020028105,0.000012520001,0.00014997486,0.8353548,0.0010634162,0.009263768,0.006650349,0.00039127053],"about_ca_topic_score_codex":0.00021803139,"about_ca_topic_score_gemma":0.00022633433,"teacher_disagreement_score":0.84763545,"about_ca_system_score_codex":0.00003088332,"about_ca_system_score_gemma":0.000041275474,"threshold_uncertainty_score":0.5049995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17014316,0.000005445293,0.82821614,0.000072360606,0.00047869826,0.00025721738,0.0000029459782,0.00034412622,0.0004798987],"genre_scores_gemma":[0.5108555,3.7096063e-7,0.48905098,0.000025014038,0.000018738649,0.000017399612,7.193859e-7,0.0000060412804,0.000025247487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.000026168482,0.000244916,0.00034045006,0.00018033822,0.0002647374],"domain_scores_gemma":[0.99889964,0.00021947906,0.00011996282,0.00056403136,0.00012648739,0.00007037267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081178616,0.00011842615,0.00018021406,0.00015166568,0.00011554333,0.000063615116,0.00082579214,0.00007513629,0.00000669602],"category_scores_gemma":[0.0000678713,0.00010211284,0.000075741256,0.0002252911,0.000043199878,0.0001719322,0.00010404548,0.00014203874,0.0000018521672],"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.000004144743,0.00020331577,0.00020863759,0.000028880075,0.000010896949,0.0000034181423,0.002040671,0.00013145352,0.3693579,0.018692326,0.000344355,0.608974],"study_design_scores_gemma":[0.00011714786,0.0001121367,0.00020298483,0.00001767005,0.000002847904,0.000011239934,0.00004494017,0.6207183,0.3778884,0.0006282363,0.00014688897,0.0001092077],"about_ca_topic_score_codex":0.000052031217,"about_ca_topic_score_gemma":0.000045616107,"teacher_disagreement_score":0.6205868,"about_ca_system_score_codex":0.000015928737,"about_ca_system_score_gemma":0.000048720776,"threshold_uncertainty_score":0.4164041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1331674,0.00025072022,0.85889316,0.00028614438,0.0016965491,0.0004174689,0.000008609059,0.00075423805,0.0045257187],"genre_scores_gemma":[0.9001455,0.000031313793,0.099169426,0.000063696476,0.000030161264,0.000013390737,0.00001341691,0.00001928266,0.0005138126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981708,0.00011074623,0.0004395158,0.0006684848,0.00034532804,0.00026515592],"domain_scores_gemma":[0.997661,0.00026858473,0.00059102813,0.0011732195,0.0002570425,0.000049110447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035094362,0.00026843045,0.000418945,0.00027429487,0.000054451495,0.00013741684,0.0017314024,0.00024964145,0.000018245295],"category_scores_gemma":[0.00010690646,0.00026308215,0.00014687826,0.00022233112,0.000038587106,0.00026907862,0.0018631511,0.00052937993,0.000012195683],"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.00009761625,0.0004336589,0.19140114,0.003815537,0.00054468884,0.00008896771,0.013478938,0.23963833,0.07105374,0.07205035,0.0055397428,0.4018573],"study_design_scores_gemma":[0.00006787194,0.00004132215,0.0020288897,0.00020658164,0.0000098845585,0.000004224565,0.000022098655,0.9820562,0.012144812,0.003079508,0.00002774546,0.00031085822],"about_ca_topic_score_codex":0.0017073874,"about_ca_topic_score_gemma":0.0005874153,"teacher_disagreement_score":0.7669781,"about_ca_system_score_codex":0.00021070277,"about_ca_system_score_gemma":0.0002231452,"threshold_uncertainty_score":0.9999821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46255806,0.0002474522,0.5272096,0.002694442,0.00043161178,0.00046526812,0.0000027540527,0.00062913966,0.005761698],"genre_scores_gemma":[0.880018,0.00011785394,0.11966583,0.00013654986,0.000009619467,0.0000105702975,0.0000028836544,0.000013066789,0.000025630763],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800247,0.0006657962,0.00054561195,0.00020685996,0.00030874053,0.0002705248],"domain_scores_gemma":[0.9958649,0.0016250588,0.00050358014,0.001339574,0.0005828447,0.00008402637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009229919,0.00015331658,0.00027265953,0.000501773,0.00022051638,0.0001008701,0.0027325246,0.0000918915,0.00001764016],"category_scores_gemma":[0.0006827159,0.00015464363,0.00007794531,0.0013455211,0.000118692325,0.0002934875,0.00013612809,0.0012476413,0.00001817762],"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.00018917788,0.0024460377,0.30947244,0.0001279491,0.00023496745,0.0000762017,0.007080444,0.19719018,0.3254515,0.06359101,0.00071530725,0.09342478],"study_design_scores_gemma":[0.0006565911,0.0004542511,0.0050330106,0.00062733295,0.000009841858,0.00019205938,0.0000981617,0.96651524,0.02371356,0.0019112383,0.00047647266,0.00031222656],"about_ca_topic_score_codex":0.000037862163,"about_ca_topic_score_gemma":0.00016894369,"teacher_disagreement_score":0.7693251,"about_ca_system_score_codex":0.0002172517,"about_ca_system_score_gemma":0.0003598845,"threshold_uncertainty_score":0.6306184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0785605,0.000028109282,0.91506904,0.00025864397,0.002171185,0.0009869694,0.000019304218,0.0019239293,0.0009822969],"genre_scores_gemma":[0.8273645,0.0000060614466,0.1712123,0.00027662225,0.000109685076,0.00015244579,0.0000021118133,0.00007027465,0.0008059647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969456,0.000107686814,0.0006655398,0.0009957151,0.00049911696,0.00078632287],"domain_scores_gemma":[0.9969138,0.001324838,0.00033107155,0.0009973464,0.00026330436,0.00016967063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007916842,0.00041763665,0.00045150123,0.0003930532,0.0005444795,0.000272317,0.0011023397,0.00019327895,0.00004757491],"category_scores_gemma":[0.00011065014,0.0004562509,0.000293295,0.00073187926,0.000047053152,0.0006828429,0.00001337566,0.00058493455,0.00016944055],"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.00023227814,0.0012783451,0.00056094443,0.00041025213,0.00018558356,0.00003184079,0.0037223205,0.09121303,0.1669962,0.0014067796,0.00035889808,0.73360354],"study_design_scores_gemma":[0.00097119494,0.0009404492,0.00006243493,0.00033698717,0.00003349042,0.00008622138,0.00008045667,0.9299722,0.065388106,0.0003875412,0.0010897185,0.00065125216],"about_ca_topic_score_codex":0.00015499095,"about_ca_topic_score_gemma":0.00017794978,"teacher_disagreement_score":0.8387591,"about_ca_system_score_codex":0.00020331172,"about_ca_system_score_gemma":0.0001604188,"threshold_uncertainty_score":0.99978894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420605,0.000121546225,0.3488996,0.005687529,0.00037346795,0.0003158603,0.000010509479,0.0003285466,0.0022023995],"genre_scores_gemma":[0.6592856,0.00003655358,0.3403941,0.0002464015,0.0000052672353,0.000012590582,0.0000030466167,0.000007784881,0.000008637279],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882936,0.00020415091,0.00042157192,0.00021038165,0.0001763066,0.00015819808],"domain_scores_gemma":[0.9948635,0.00042135167,0.00038039056,0.004150695,0.0001526552,0.000031404412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979065,0.00011885822,0.00023681931,0.0002363813,0.0000817307,0.000025660505,0.0036496182,0.00006252066,0.0000049836926],"category_scores_gemma":[0.000064810905,0.00013256299,0.00009698922,0.0004716403,0.00026045158,0.0002457411,0.0005002284,0.00023737323,0.000008420232],"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.000010091975,0.000179193,0.018417347,0.00014320323,0.00010123345,9.177418e-7,0.003829651,0.00047941194,0.91223216,0.030774375,0.0031988465,0.030633578],"study_design_scores_gemma":[0.0017168277,0.00036391852,0.019590752,0.0012245481,0.000090448004,0.00013361036,0.00077989337,0.09615241,0.862661,0.011171492,0.004864012,0.00125106],"about_ca_topic_score_codex":0.00019420237,"about_ca_topic_score_gemma":0.000081726284,"teacher_disagreement_score":0.095673,"about_ca_system_score_codex":0.000044469456,"about_ca_system_score_gemma":0.00004820522,"threshold_uncertainty_score":0.67819595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033606386,0.00020781768,0.98841715,0.0045739557,0.00065935263,0.0011992981,0.00039583293,0.00089496945,0.00029096153],"genre_scores_gemma":[0.81163806,0.00061479287,0.18695363,0.000108425644,0.000028877112,0.0004987758,0.000067955814,0.00004685094,0.000042622967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.00027954875,0.000838215,0.00067020126,0.00032336285,0.00030194808],"domain_scores_gemma":[0.99325264,0.001486632,0.0007590853,0.003692384,0.0006847136,0.00012457624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037459127,0.00037435855,0.00059149193,0.00042834887,0.0005854141,0.00016241233,0.0043695886,0.00036630422,0.000005802922],"category_scores_gemma":[0.000057041074,0.00043706782,0.00036466744,0.00067053584,0.00017091756,0.00030450852,0.00011982017,0.001171022,0.0000061778087],"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.00045953842,0.004178077,0.0006186306,0.0036508539,0.0020406754,0.000009120976,0.026764287,0.23015957,0.10227136,0.16738047,0.002873119,0.4595943],"study_design_scores_gemma":[0.00035569188,0.00014861762,0.000046439844,0.0004771399,0.00010833813,0.0000023578818,0.00009223715,0.8959911,0.09282438,0.009011433,0.00037517655,0.0005671],"about_ca_topic_score_codex":0.00071710296,"about_ca_topic_score_gemma":0.0010074204,"teacher_disagreement_score":0.8082774,"about_ca_system_score_codex":0.00022732891,"about_ca_system_score_gemma":0.00046926897,"threshold_uncertainty_score":0.99980813},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00855909,0.00005159433,0.9368371,0.004318299,0.0014797677,0.00035399594,0.000008620758,0.0052966396,0.043094926],"genre_scores_gemma":[0.53203547,0.00002147964,0.46664453,0.0008401934,0.00015167943,0.00003706058,0.0000051771335,0.000023193068,0.00024125892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736774,0.0001632101,0.00042940053,0.0012111345,0.0004292646,0.00039927967],"domain_scores_gemma":[0.9975749,0.00023120904,0.00028068476,0.0015649524,0.00015245736,0.00019574144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054680964,0.00041868235,0.00050022773,0.00015887414,0.00015448949,0.000604891,0.0034472218,0.0003465419,0.000035544326],"category_scores_gemma":[0.0003461821,0.0004146824,0.00023436281,0.0003038821,0.000068540205,0.00025446567,0.006061168,0.0014303451,0.00008353509],"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.00004022214,0.0004039465,0.009334957,0.0013674116,0.00040382272,0.0003275051,0.015605977,0.00064060866,0.016416186,0.6857433,0.1273403,0.14237578],"study_design_scores_gemma":[0.00022622666,0.00023795338,0.0009924058,0.0006510894,0.00005219536,0.00008164833,0.00007862129,0.50165886,0.08977767,0.39703026,0.0068121077,0.0024009442],"about_ca_topic_score_codex":0.0010214103,"about_ca_topic_score_gemma":0.00036478648,"teacher_disagreement_score":0.52347636,"about_ca_system_score_codex":0.00019135687,"about_ca_system_score_gemma":0.00018399733,"threshold_uncertainty_score":0.9998305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017276566,0.000058974292,0.97751284,0.00025939234,0.0003969089,0.00021619456,0.0000022091563,0.0014887508,0.0027881807],"genre_scores_gemma":[0.96389544,0.0000033670772,0.03446905,0.00048672064,0.000025645342,0.000022698021,4.5327383e-7,0.000030507443,0.0010661227],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844533,0.00008215465,0.00026329103,0.0005495938,0.0002717545,0.0003878467],"domain_scores_gemma":[0.9991179,0.000115146264,0.00011100422,0.00042427125,0.00012709195,0.000104580104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037500937,0.00022372302,0.00020064827,0.00029876438,0.00032359554,0.00030201356,0.00071204244,0.000109460765,0.00009134385],"category_scores_gemma":[0.000002641295,0.00022429087,0.00010861603,0.0007475628,0.000040837338,0.0011348731,0.000004377174,0.00045078085,0.0003123354],"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.000192847,0.00045835276,0.00021713917,0.00021943368,0.00005630835,0.000024835683,0.0026000163,0.03592443,0.12089705,0.0004859844,0.00034573855,0.83857787],"study_design_scores_gemma":[0.0004946998,0.00059192866,0.00006994952,0.00033812405,0.000022110919,0.000059101036,0.00020300414,0.25098923,0.7434509,0.0022483955,0.00085330586,0.00067924795],"about_ca_topic_score_codex":0.000053605898,"about_ca_topic_score_gemma":0.000017992106,"teacher_disagreement_score":0.94661885,"about_ca_system_score_codex":0.00010724308,"about_ca_system_score_gemma":0.00018001568,"threshold_uncertainty_score":0.9146316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037460938,0.00027650778,0.9579271,0.00016678218,0.0016399167,0.00064665,0.000033013122,0.0005163459,0.0013327427],"genre_scores_gemma":[0.99706674,0.000011230474,0.0010637328,0.00019267232,0.00004016315,0.00014037809,0.0000014938879,0.00003554221,0.0014480498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981677,0.00011765355,0.0003022289,0.00066671055,0.0003489367,0.0003967829],"domain_scores_gemma":[0.998721,0.00019545048,0.00010944247,0.0006999209,0.00008911407,0.00018505049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034199626,0.00026665174,0.00031740085,0.00027281677,0.0003100631,0.00019389774,0.00047390125,0.00014442689,0.000006540907],"category_scores_gemma":[0.000007701767,0.00024105578,0.00018776071,0.00025388523,0.000050838513,0.000059726437,0.0000037912857,0.00017882537,0.000007549863],"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.000053340314,0.0003939175,0.00018529328,0.0006815565,0.0004091963,0.000021832786,0.005245009,0.31411678,0.08706982,0.015692575,0.0007600175,0.57537067],"study_design_scores_gemma":[0.002308842,0.0015293986,0.00031950936,0.0009788639,0.00011965302,0.0005575397,0.0016731259,0.8923216,0.06289971,0.0005245597,0.034723707,0.002043514],"about_ca_topic_score_codex":0.00018200216,"about_ca_topic_score_gemma":0.000060605813,"teacher_disagreement_score":0.9596058,"about_ca_system_score_codex":0.00008821395,"about_ca_system_score_gemma":0.000078283265,"threshold_uncertainty_score":0.98299694},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016072714,0.00011274779,0.9796351,0.00014801408,0.0013338233,0.0006224973,0.000018278794,0.0017212662,0.014800978],"genre_scores_gemma":[0.2497595,0.000032977674,0.6851056,0.0002245598,0.00030474365,0.00037199087,0.00018334246,0.000107963744,0.063909315],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99823225,0.0000373106,0.00035866926,0.0006898134,0.00028671455,0.00039527018],"domain_scores_gemma":[0.99830765,0.0003882784,0.00027336314,0.0005829908,0.0003621325,0.00008561031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038576167,0.00032958563,0.00033194985,0.0002775388,0.00020894865,0.00017729201,0.0014973797,0.00032990487,0.000019598521],"category_scores_gemma":[0.0001854515,0.00026493557,0.00020663382,0.00012378035,0.000012623888,0.00032748768,0.00006903029,0.00020291949,0.00004201769],"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.00009270053,0.0001990324,0.00038155203,0.0007631478,0.0002178364,0.0000202209,0.0044222525,0.000005567352,0.14998865,0.14015868,0.027064824,0.6766855],"study_design_scores_gemma":[0.0008047567,0.00046829195,0.0010380112,0.0018309292,0.00008093813,0.000013434557,0.00020727521,0.03970919,0.82392013,0.11441402,0.014990609,0.0025224094],"about_ca_topic_score_codex":0.00011666231,"about_ca_topic_score_gemma":0.00038084682,"teacher_disagreement_score":0.6741631,"about_ca_system_score_codex":0.000081301776,"about_ca_system_score_gemma":0.00015708116,"threshold_uncertainty_score":0.9999803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001609209,0.000013217715,0.9855899,0.0001972456,0.00054701563,0.0010397072,0.000017696868,0.0011936371,0.011240644],"genre_scores_gemma":[0.4647405,0.00001044125,0.53448796,0.00020772006,0.00001774367,0.00024000175,0.000025079671,0.000023688091,0.0002468344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759173,0.0001650585,0.00048277288,0.0009038982,0.00059411896,0.0002624302],"domain_scores_gemma":[0.9968001,0.00017788965,0.00048517468,0.0020694758,0.00040515346,0.000062211075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043202238,0.00036468898,0.00048485567,0.0006328112,0.000042872463,0.00011845387,0.0019647316,0.00038749937,0.000020739877],"category_scores_gemma":[0.00004327163,0.00033700324,0.00019768308,0.00039946102,0.00004467804,0.00021559367,0.0010936834,0.00035822103,0.0000025503318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011794529,0.00010548558,0.00004885728,0.00009609473,0.000014501662,9.681381e-7,0.00005232588,0.9453286,0.00006240609,0.050884195,0.00046983923,0.0029249464],"study_design_scores_gemma":[0.00014277261,0.00015930196,0.000028594513,0.0003222658,0.000008777769,7.002831e-7,0.0000023641053,0.95550144,0.022999248,0.020472147,0.000020042831,0.0003423334],"about_ca_topic_score_codex":0.0013135017,"about_ca_topic_score_gemma":0.00003667459,"teacher_disagreement_score":0.4645796,"about_ca_system_score_codex":0.00007879345,"about_ca_system_score_gemma":0.00030373794,"threshold_uncertainty_score":0.9999082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049839087,0.000014686152,0.92474395,0.00067458965,0.0004159253,0.0008208382,0.0000017549255,0.0039271307,0.019562067],"genre_scores_gemma":[0.4837972,0.000004007767,0.51310545,0.00030193527,0.000029555931,0.00002866606,0.0000012764709,0.0000129856035,0.0027189292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865973,0.000026109463,0.00023093053,0.0004953469,0.00019356102,0.00039434814],"domain_scores_gemma":[0.9986832,0.00022773817,0.00010249332,0.0007775966,0.00014867792,0.000060258546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656505,0.00017226486,0.00020722143,0.0001498608,0.00010318876,0.0001824706,0.0011926655,0.00009053663,0.000046085315],"category_scores_gemma":[0.00007756412,0.00015514423,0.000073575335,0.0003231917,0.00002210461,0.00078342477,0.00031016138,0.00011736488,0.00007471946],"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.000016131693,0.00006830121,0.0048126774,0.00012184597,0.000021608745,0.000006464874,0.0003633045,0.000023490595,0.22257604,0.65890247,0.008979045,0.104108594],"study_design_scores_gemma":[0.0001381444,0.00027842977,0.000091822614,0.00007692769,0.0000038440508,0.000024428056,0.000031819418,0.03714606,0.9021803,0.05493814,0.004717736,0.00037232845],"about_ca_topic_score_codex":0.00019450975,"about_ca_topic_score_gemma":0.000028844348,"teacher_disagreement_score":0.6796043,"about_ca_system_score_codex":0.00009731336,"about_ca_system_score_gemma":0.00006485707,"threshold_uncertainty_score":0.6326598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8040632,0.000095710144,0.17289056,0.0009504159,0.002258824,0.002625128,0.00010868479,0.0006233482,0.016384127],"genre_scores_gemma":[0.9628048,0.00001820472,0.036709968,0.0002688417,0.000020056284,0.000057269495,0.000021357038,0.000023665674,0.00007582305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730957,0.000071917864,0.0011483078,0.00026831953,0.0005245493,0.00067735615],"domain_scores_gemma":[0.9972058,0.00045105492,0.0007179892,0.001252712,0.00028589004,0.00008658965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011716796,0.00030051955,0.0004483766,0.00037137975,0.0002197699,0.00024990248,0.0022411365,0.00016260493,0.000006297432],"category_scores_gemma":[0.000155324,0.00023345195,0.0002386886,0.00076284166,0.00026814683,0.00119801,0.0007949011,0.0005024135,0.000043973087],"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.0001316466,0.0003647931,0.10177259,0.0008693256,0.00015571745,0.0000062293116,0.014989196,0.00013157487,0.00045943324,0.8340592,0.002062361,0.04499794],"study_design_scores_gemma":[0.008750031,0.002197399,0.051098347,0.002280137,0.000067516055,0.00022584162,0.008481819,0.6277354,0.031234995,0.2307858,0.03420878,0.0029339623],"about_ca_topic_score_codex":0.00009234073,"about_ca_topic_score_gemma":0.00010791774,"teacher_disagreement_score":0.62760377,"about_ca_system_score_codex":0.00013702008,"about_ca_system_score_gemma":0.00008016105,"threshold_uncertainty_score":0.9519894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5780168,0.000009364421,0.42146674,0.000028522012,0.000033354747,0.00026702826,0.000006441687,0.000113507966,0.000058236183],"genre_scores_gemma":[0.9602617,0.00001541378,0.039534345,0.00008732137,0.0000056436666,0.000027257256,0.000011126967,0.0000070865085,0.000050131155],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875885,0.000048140962,0.0003478381,0.00026059302,0.00033820258,0.00024640077],"domain_scores_gemma":[0.9990805,0.00006017425,0.00029808356,0.00031206204,0.00018300231,0.0000661885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040701497,0.00018255324,0.0002941079,0.0005079622,0.000065473025,0.00007801858,0.0003668403,0.000040468734,0.00001512816],"category_scores_gemma":[0.000008310174,0.00014830459,0.00006677888,0.00073437614,0.000042286447,0.0012099012,0.00013369719,0.0001158884,0.000010939699],"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.00038445537,0.00068431953,0.58676326,0.0006875381,0.0024089722,0.0000134866405,0.05545997,0.118221134,0.021493623,0.0004905882,0.00015927841,0.21323335],"study_design_scores_gemma":[0.000750949,0.0004676296,0.13200553,0.000046660392,0.00008141282,0.0000028156026,0.00009244507,0.8573752,0.008963957,0.000002729955,0.00002534576,0.00018530485],"about_ca_topic_score_codex":0.0000767818,"about_ca_topic_score_gemma":0.000031864623,"teacher_disagreement_score":0.7391541,"about_ca_system_score_codex":0.000050647526,"about_ca_system_score_gemma":0.000044215507,"threshold_uncertainty_score":0.6047686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503778,0.0000668269,0.9195768,0.00061754073,0.0015926759,0.0018349614,0.00017436345,0.000586372,0.00051264366],"genre_scores_gemma":[0.9665294,0.000020711686,0.031939745,0.00012816746,0.000029274503,0.0006195216,0.000041253166,0.000034581048,0.00065732055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975261,0.00022711151,0.000689494,0.00068321533,0.000445193,0.0004288664],"domain_scores_gemma":[0.99725515,0.00052856887,0.00023158714,0.0014489269,0.00039950435,0.00013626818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008041561,0.00031213436,0.00035303526,0.00032779237,0.0005057635,0.00035671232,0.0006795705,0.00018587027,0.00006505091],"category_scores_gemma":[0.000015832336,0.00029889448,0.0001486623,0.0004410575,0.0000737202,0.0006643292,0.0000187098,0.00037087876,0.000097998745],"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.0009778598,0.010910162,0.0011954684,0.0014026914,0.0012524108,0.000036458856,0.06285617,0.0835023,0.11630497,0.3700803,0.020721871,0.33075935],"study_design_scores_gemma":[0.0026221862,0.0015831275,0.00027058274,0.00046059873,0.00011082399,0.00012718375,0.007317391,0.8916492,0.08712365,0.0006999222,0.006930524,0.0011048366],"about_ca_topic_score_codex":0.00024827555,"about_ca_topic_score_gemma":0.00056341867,"teacher_disagreement_score":0.89149165,"about_ca_system_score_codex":0.00032290656,"about_ca_system_score_gemma":0.00011613398,"threshold_uncertainty_score":0.9999463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2447616,0.00010081188,0.75363845,0.0003562606,0.000075701544,0.000680429,0.00002091931,0.00014326719,0.0002225854],"genre_scores_gemma":[0.93724805,0.00006529031,0.0625513,0.000011667022,9.820996e-7,0.000076140124,0.000003231001,0.0000116526735,0.000031685526],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998609,0.00028671906,0.00042497925,0.00023129019,0.00030920721,0.00013878189],"domain_scores_gemma":[0.9974439,0.0004544484,0.0002133449,0.0015358602,0.00030689943,0.000045539295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004872627,0.00013326672,0.00029554666,0.00030507005,0.00018691897,0.000033109776,0.000789809,0.000069270354,0.0000049551145],"category_scores_gemma":[0.000011101805,0.00012405908,0.000056402005,0.0006031318,0.0002272032,0.00019440796,0.000013088967,0.00024452843,0.0000049509213],"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.00037308334,0.00811062,0.0008319814,0.03939132,0.0013750718,0.0000027524652,0.052983064,0.14930207,0.60946214,0.049263272,0.0001442294,0.088760406],"study_design_scores_gemma":[0.00054741633,0.00046477842,0.0002932342,0.0037967057,0.000086510205,0.000054627642,0.0019865753,0.70981,0.28260383,0.0000968041,0.000003583493,0.00025594616],"about_ca_topic_score_codex":0.00016645163,"about_ca_topic_score_gemma":0.000090582165,"teacher_disagreement_score":0.69248646,"about_ca_system_score_codex":0.00008060217,"about_ca_system_score_gemma":0.00007224578,"threshold_uncertainty_score":0.50589824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6274403,0.000090491514,0.35752675,0.012708007,0.00016854295,0.00052753073,0.000004303616,0.00068427937,0.00084982836],"genre_scores_gemma":[0.73331344,0.000034206183,0.26431638,0.0022083034,0.00001244214,0.00005193627,0.00000559461,0.000018115286,0.000039546034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868304,0.00018293962,0.00026991323,0.0003874709,0.00019305387,0.00028360804],"domain_scores_gemma":[0.9961105,0.00037342508,0.00017773679,0.0031228228,0.00012796612,0.00008754241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004046782,0.00020781285,0.00024083065,0.00015104694,0.0002257424,0.00018666367,0.0024360868,0.00006353308,0.00000802416],"category_scores_gemma":[0.000039066126,0.00019320412,0.00004465127,0.00029899884,0.00036087882,0.0002968135,0.00046509033,0.00038251525,0.000056848443],"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.00012758364,0.0010853979,0.04607515,0.00036775606,0.0005733575,0.00007312802,0.016633056,0.0030234242,0.778387,0.042238723,0.00494137,0.10647403],"study_design_scores_gemma":[0.0037084755,0.0009600479,0.020906108,0.0012083268,0.00013103202,0.0005409533,0.0006149967,0.92360276,0.035785723,0.0010181131,0.00871411,0.0028093795],"about_ca_topic_score_codex":0.0003276398,"about_ca_topic_score_gemma":0.000643648,"teacher_disagreement_score":0.9205793,"about_ca_system_score_codex":0.000067719935,"about_ca_system_score_gemma":0.00010241765,"threshold_uncertainty_score":0.78786355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0709756e-7,0.00021316564,0.5638722,0.00005880905,0.0002703675,0.0005086938,0.0000011158555,0.006518654,0.42855677],"genre_scores_gemma":[0.00012066418,0.00008620632,0.56328964,0.00013827326,0.00013849999,0.00008124954,0.00000555118,0.00027946822,0.43586048],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983591,0.00006740818,0.0002376471,0.00069402484,0.00022673131,0.00041510287],"domain_scores_gemma":[0.9985062,0.00023792402,0.0002949222,0.000828864,0.00007212086,0.000059992944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045581843,0.00034654603,0.00042345814,0.00051749084,0.00009076997,0.00019266832,0.0014910302,0.0004194985,0.000076063094],"category_scores_gemma":[0.00016462551,0.00032846144,0.00016602722,0.00021924266,0.000027116088,0.0001523398,0.00041068325,0.00037965598,0.00011821505],"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.0000038138846,0.000038591694,0.00035263557,0.00030437048,0.00007612407,0.000006003497,0.00023853047,0.0000027739425,0.0009010364,0.06061562,0.655585,0.28187552],"study_design_scores_gemma":[0.00007222212,0.00015009643,0.0000019571976,0.00032947346,0.000012253795,0.000012306049,0.000017848639,0.014021478,0.008002687,0.0010568014,0.97578007,0.0005428119],"about_ca_topic_score_codex":0.00028469865,"about_ca_topic_score_gemma":0.00019231548,"teacher_disagreement_score":0.32019508,"about_ca_system_score_codex":0.00008072764,"about_ca_system_score_gemma":0.000055092525,"threshold_uncertainty_score":0.99991673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056641996,0.0000074679606,0.93877393,0.001199287,0.00039442396,0.0008177007,0.0000026844366,0.00086511055,0.0012974077],"genre_scores_gemma":[0.8337739,8.937593e-7,0.16422337,0.0012826085,0.00002379607,0.00006691502,0.0000073121864,0.0000140652455,0.0006071065],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987161,0.00006803723,0.00021473898,0.00047961317,0.00026419375,0.0002572913],"domain_scores_gemma":[0.99884325,0.0002542066,0.00010794507,0.0005873632,0.00015355668,0.00005365681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039049174,0.00015643862,0.00014945754,0.00017981233,0.00012665764,0.00017358232,0.0005594884,0.000073201314,0.00001357367],"category_scores_gemma":[0.00014602454,0.00013977937,0.00006036975,0.00022980674,0.000014203461,0.00035929462,0.0000772488,0.0001156395,0.000033753146],"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.0001840626,0.00063129177,0.02674163,0.00050222484,0.00003239891,0.0000062474974,0.0028371797,0.0037815413,0.59702677,0.15099056,0.004540454,0.21272567],"study_design_scores_gemma":[0.00029704667,0.00044895423,0.0028297745,0.00010427737,0.0000027003261,0.0000015445182,0.000012758344,0.9089399,0.08580048,0.0009415736,0.00040620432,0.00021476546],"about_ca_topic_score_codex":0.000038548285,"about_ca_topic_score_gemma":0.000051773703,"teacher_disagreement_score":0.9051584,"about_ca_system_score_codex":0.00009727361,"about_ca_system_score_gemma":0.00008904253,"threshold_uncertainty_score":0.57000375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024349643,0.0022029234,0.97207,0.0004214813,0.00036153485,0.00023244921,0.000005108394,0.00031258274,0.000044323027],"genre_scores_gemma":[0.84231424,0.0000017670858,0.15681976,0.0002700091,0.0005431509,0.000006613982,7.274972e-7,0.00002698417,0.00001671345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793494,0.00012287832,0.00075140037,0.00030748508,0.0005801502,0.00030313263],"domain_scores_gemma":[0.9974651,0.00016434497,0.00097367656,0.00020220659,0.00091470586,0.00028000705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010447653,0.000202623,0.00043264517,0.00010603161,0.00024260153,0.0007244274,0.0012772308,0.000102554186,0.0000032406517],"category_scores_gemma":[0.00019203463,0.0001671029,0.0001458008,0.00037743628,0.00003776501,0.0007585611,0.00006732843,0.00031162103,0.000002046667],"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.0009539112,0.0017473061,0.017949842,0.008043696,0.00043800703,0.00071825227,0.04082906,0.28489682,0.17113154,0.004801764,0.03744214,0.43104768],"study_design_scores_gemma":[0.00053908525,0.0013654571,0.00009516274,0.0010963641,0.000041616357,0.00048980286,0.0006894811,0.9849161,0.006913121,0.0003106455,0.0031548352,0.00038831242],"about_ca_topic_score_codex":0.000028540782,"about_ca_topic_score_gemma":0.0000035667113,"teacher_disagreement_score":0.8179646,"about_ca_system_score_codex":0.00009716275,"about_ca_system_score_gemma":0.0003833061,"threshold_uncertainty_score":0.69856703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010246749,0.000105504136,0.98472095,0.0010494427,0.00023231607,0.0007169673,0.00001530392,0.0008275217,0.0020852278],"genre_scores_gemma":[0.78665084,0.0002493239,0.2124826,0.00008951896,0.00000463206,0.0004054229,0.0000021962262,0.000019076633,0.00009636865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00020372737,0.0003880212,0.00041410394,0.00022010089,0.00027360444],"domain_scores_gemma":[0.9969468,0.00031719275,0.000079990685,0.0024691464,0.000118888274,0.00006799627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408462,0.0001884213,0.00021823782,0.0005362279,0.00032795192,0.00015275103,0.0015984364,0.00011851783,0.000006427008],"category_scores_gemma":[0.000010752587,0.00020737125,0.000075108685,0.001125839,0.00013196586,0.0005915985,0.000038846116,0.00064130954,0.000024788487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043356347,0.0021881168,0.004719799,0.00012749941,0.00013636982,0.000014731964,0.010984249,0.000990055,0.060658958,0.012685842,0.00041221303,0.9070388],"study_design_scores_gemma":[0.0012648326,0.0005495182,0.0065615177,0.0015594402,0.000072491406,0.00025818634,0.0014027238,0.776712,0.1925632,0.010577398,0.0065189307,0.0019597712],"about_ca_topic_score_codex":0.00030950236,"about_ca_topic_score_gemma":0.0004645185,"teacher_disagreement_score":0.90507907,"about_ca_system_score_codex":0.000090998525,"about_ca_system_score_gemma":0.00006195895,"threshold_uncertainty_score":0.8456354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20363396,0.00004105628,0.7822721,0.01302562,0.00017096051,0.00033877866,0.000008005173,0.00046152933,0.000048000686],"genre_scores_gemma":[0.76878995,0.000024041547,0.23012087,0.0009397554,0.00003014308,0.0000749643,0.0000065774425,0.000012400782,0.0000012712809],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895495,0.0001621785,0.00034014753,0.00024211819,0.00014441436,0.00015616447],"domain_scores_gemma":[0.9977717,0.00034721795,0.00027360534,0.0013672679,0.00018081421,0.000059429487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021656128,0.00012155267,0.0001920915,0.00013016896,0.0002272983,0.000057072302,0.0018009741,0.00006766038,6.66015e-7],"category_scores_gemma":[0.000082159284,0.00013922341,0.00009250393,0.0005924332,0.00019618354,0.0003495229,0.00019491058,0.0002071231,0.000003887122],"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.000033296827,0.000058496338,0.00088592904,0.000055015058,0.000039910476,4.1553417e-7,0.0016839637,0.00014718651,0.92830044,0.007904739,0.0005365842,0.06035405],"study_design_scores_gemma":[0.00081992935,0.00019306185,0.00052226684,0.00007385565,0.000034928264,0.000028146256,0.00021972545,0.3542148,0.6398434,0.0006856299,0.0029625876,0.00040164622],"about_ca_topic_score_codex":0.00007974241,"about_ca_topic_score_gemma":0.00005304515,"teacher_disagreement_score":0.565156,"about_ca_system_score_codex":0.00004678695,"about_ca_system_score_gemma":0.00003802238,"threshold_uncertainty_score":0.5677366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10613491,0.0000023035739,0.88958025,0.0015866034,0.0008999142,0.0012115734,0.000053350675,0.0005058093,0.00002527386],"genre_scores_gemma":[0.9500701,0.0000075428507,0.048522063,0.0007331924,0.00042271722,0.00018929828,0.000016915157,0.000027548449,0.000010658857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819005,0.00007669803,0.00068854593,0.000277746,0.00041172726,0.00035526245],"domain_scores_gemma":[0.9985083,0.00038197084,0.00031129812,0.00032938548,0.00023118252,0.00023788269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033661196,0.00031398813,0.00040772677,0.00016667186,0.00037425503,0.0002699823,0.00045641934,0.00040785916,0.000012317202],"category_scores_gemma":[0.000052125994,0.0002847266,0.000085532534,0.0006100824,0.00010816038,0.00077564607,0.000007877176,0.0007472729,0.0000062818335],"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.011052702,0.0010472477,0.00031138244,0.0003499326,0.0010677403,0.00003597177,0.046721946,0.20248184,0.0033237976,0.0066951835,0.006553365,0.7203589],"study_design_scores_gemma":[0.008738053,0.0060858815,0.000009873157,0.00027294166,0.00025405682,0.00006144882,0.0005285227,0.865813,0.11518777,0.00046783613,0.0015730119,0.0010075604],"about_ca_topic_score_codex":0.00018639395,"about_ca_topic_score_gemma":0.00005544118,"teacher_disagreement_score":0.84393513,"about_ca_system_score_codex":0.000096947944,"about_ca_system_score_gemma":0.00026846054,"threshold_uncertainty_score":0.9999605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013015922,0.0003032377,0.97891283,0.0027310485,0.00003187556,0.00047135047,0.000027915126,0.00010882102,0.004396984],"genre_scores_gemma":[0.49018466,0.00014020808,0.50955325,0.00008706779,0.0000014726397,0.00002609645,0.000002282118,0.0000043759737,5.6664413e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877536,0.000116168936,0.00066220714,0.00016056692,0.00018211882,0.00010355476],"domain_scores_gemma":[0.9920767,0.0051353667,0.00067307724,0.0019308918,0.0001544979,0.000029464702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031792457,0.00011172733,0.0002970591,0.000107195636,0.00004295594,0.00000602095,0.0023129585,0.000045585963,0.000005666616],"category_scores_gemma":[0.0014775081,0.00011842294,0.00007326379,0.0004889289,0.00017661323,0.00020457679,0.00044674904,0.00020770013,5.2705605e-7],"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.0001938187,0.0049683773,0.020565867,0.0045335093,0.00020534142,0.0000031230243,0.07314893,0.02406636,0.04705163,0.66036063,0.00028712276,0.1646153],"study_design_scores_gemma":[0.0006845496,0.0005099226,0.00037338978,0.0010263101,0.000022333785,0.0000014801745,0.0014026217,0.7537088,0.11592509,0.12595609,0.00016325529,0.00022617231],"about_ca_topic_score_codex":0.000025573849,"about_ca_topic_score_gemma":0.000088571265,"teacher_disagreement_score":0.7296424,"about_ca_system_score_codex":0.000020496824,"about_ca_system_score_gemma":0.000041884232,"threshold_uncertainty_score":0.48291475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017647306,0.00055246236,0.9785445,0.000747536,0.00074990955,0.00077416963,0.00016456663,0.0005173045,0.0003022933],"genre_scores_gemma":[0.9960425,0.000019382784,0.0032334821,0.00042823973,0.00007709955,0.000077773824,0.0000026011967,0.00003443783,0.000084517094],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816746,0.0001654683,0.00042456578,0.0005781053,0.00035204447,0.00031234982],"domain_scores_gemma":[0.9987898,0.00016589045,0.0001658633,0.00048638793,0.00011942939,0.00027265874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029027817,0.0002637892,0.00043606263,0.00016797497,0.0002867318,0.00010826331,0.00053457747,0.00014531061,0.000004307428],"category_scores_gemma":[0.000028347431,0.00024680502,0.00021085671,0.0003260456,0.0000914709,0.00008753639,0.00000439844,0.00023277402,0.000002115719],"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.00009092954,0.00032575981,0.00033788354,0.0018881953,0.00069860375,0.00003290887,0.0165467,0.052238915,0.75169134,0.006502535,0.0027317065,0.16691451],"study_design_scores_gemma":[0.0030071153,0.003419009,0.00034164928,0.00095697725,0.00026983174,0.00029304958,0.0019882373,0.53380543,0.41347745,0.00037329385,0.039873596,0.0021943292],"about_ca_topic_score_codex":0.00012754054,"about_ca_topic_score_gemma":0.000029462888,"teacher_disagreement_score":0.97839516,"about_ca_system_score_codex":0.00004470637,"about_ca_system_score_gemma":0.00011475867,"threshold_uncertainty_score":0.9999984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78980565,0.0000034646107,0.20607041,0.00014896876,0.00002421976,0.00014804184,0.000002992036,0.00008277904,0.0037134953],"genre_scores_gemma":[0.8965389,7.672586e-7,0.10330192,0.00011235093,0.0000019395095,0.0000035420167,0.0000010209632,0.000004749972,0.000034771823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99924505,0.000052910797,0.0001622988,0.00019712899,0.00021371832,0.00012887717],"domain_scores_gemma":[0.99916065,0.00035106094,0.000086955515,0.00029110708,0.000085999796,0.000024255374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003469138,0.00008765759,0.00014830401,0.00006230973,0.000048893333,0.000023415216,0.0002777529,0.000024293931,0.000031162],"category_scores_gemma":[0.000016878837,0.00005445513,0.000032199157,0.00024907207,0.00010770305,0.000092019574,0.00015556892,0.000089143585,0.0000043247446],"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.000010328665,0.00005637403,0.23254171,0.000018506922,0.000015608886,8.64301e-7,0.00042026784,0.000104536266,0.0002069732,0.7661176,0.0000751984,0.00043207285],"study_design_scores_gemma":[0.0006193043,0.00060078845,0.46280834,0.00036020856,0.000016494127,0.00009282875,0.00023369363,0.23938146,0.01933256,0.2760141,0.0000954138,0.0004447923],"about_ca_topic_score_codex":0.00006618171,"about_ca_topic_score_gemma":0.00010565845,"teacher_disagreement_score":0.49010345,"about_ca_system_score_codex":0.000006962801,"about_ca_system_score_gemma":0.000022688824,"threshold_uncertainty_score":0.22206157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067583984,0.000038722457,0.9863942,0.0048016184,0.000097887525,0.0005838213,0.000022253169,0.00032217836,0.0009808736],"genre_scores_gemma":[0.8182088,0.000014208351,0.18133104,0.00021866389,0.0000034207178,0.00019832731,0.0000020880657,0.000015032323,0.000008435467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837464,0.00029697068,0.0004942455,0.00028407056,0.00037613264,0.00017396374],"domain_scores_gemma":[0.9971984,0.000335593,0.00021474359,0.0019621477,0.0001898191,0.00009928299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053689623,0.00015543523,0.0002318481,0.00019274316,0.00037562812,0.000044491157,0.0028620835,0.00007452717,0.000004108149],"category_scores_gemma":[0.000057599238,0.00014352916,0.00012164592,0.0010533888,0.00011288235,0.00028506585,0.0000389097,0.00046687722,0.000008626004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059276175,0.0011699459,0.00001936141,0.00017821978,0.00019409394,4.6773692e-7,0.042568427,0.7711894,0.014241758,0.003755134,0.00027257967,0.16635132],"study_design_scores_gemma":[0.00021182952,0.00009623402,0.00016578361,0.000090419446,0.00004306565,0.00000764021,0.00074237137,0.8953499,0.102735184,0.00028031773,0.000103365746,0.0001738574],"about_ca_topic_score_codex":0.0001311826,"about_ca_topic_score_gemma":0.00012171412,"teacher_disagreement_score":0.81145036,"about_ca_system_score_codex":0.00006325822,"about_ca_system_score_gemma":0.00011400418,"threshold_uncertainty_score":0.5852949},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088478264,0.00091517717,0.9357864,0.059117008,0.0005197504,0.00090396905,0.000019961413,0.00007734577,0.0017755834],"genre_scores_gemma":[0.717211,0.00009522408,0.28121206,0.0013077381,0.000035151235,0.00008742935,0.0000060949264,0.000013337531,0.000031962343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758714,0.00084370346,0.000737355,0.00017409948,0.00049466896,0.0001630169],"domain_scores_gemma":[0.9931524,0.0010607797,0.0010981628,0.0027892822,0.0017933889,0.00010601171],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0026284158,0.00014386361,0.00027913455,0.000035336296,0.0009400365,0.0005083525,0.016830903,0.00008178929,0.0000031862567],"category_scores_gemma":[0.0002526171,0.00011740013,0.00036308105,0.0006100257,0.00026774165,0.0008064901,0.0023172959,0.00042574108,0.0000019488714],"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.00006306729,0.0011135695,0.000708609,0.00007923077,0.0011662528,6.880338e-7,0.032600947,0.04068184,0.0070697777,0.62340254,0.24482933,0.048284154],"study_design_scores_gemma":[0.00070757896,0.000104673716,0.00008432345,0.0001269228,0.00006910396,0.00005144842,0.0008016589,0.97346246,0.00033180797,0.008314038,0.015778417,0.00016754685],"about_ca_topic_score_codex":0.00003737341,"about_ca_topic_score_gemma":0.000011852327,"teacher_disagreement_score":0.9327806,"about_ca_system_score_codex":0.00021609667,"about_ca_system_score_gemma":0.00077724905,"threshold_uncertainty_score":0.9884885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04194488,0.000050790535,0.9533634,0.0026262365,0.00008459582,0.0002541643,0.000010817457,0.0008897468,0.00077534065],"genre_scores_gemma":[0.7125487,0.000005531659,0.28718328,0.00018859906,0.000022407057,0.000018216917,0.0000053886106,0.000008555034,0.000019304358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.000019973388,0.00027696262,0.00031252386,0.00016592343,0.00023820152],"domain_scores_gemma":[0.99898386,0.00036357748,0.00013238819,0.00030174744,0.00011981618,0.00009860755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022068065,0.00013145665,0.00022054778,0.00007393558,0.000117286145,0.000065208435,0.00089884625,0.00005666795,0.000006211492],"category_scores_gemma":[0.00029236203,0.00011792198,0.000095364674,0.0004884662,0.000046716763,0.00024565644,0.00030992622,0.00008635942,0.0000043892865],"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.00036791502,0.0011807652,0.1663953,0.0028546064,0.0004846031,0.000096665026,0.025728468,0.0060995375,0.06134938,0.4678758,0.061409358,0.2061576],"study_design_scores_gemma":[0.0004068909,0.00072237663,0.0017879214,0.00009346051,0.000022428358,0.000012045896,0.0003073246,0.80371416,0.18414491,0.0038524142,0.004558211,0.00037786082],"about_ca_topic_score_codex":0.000050760093,"about_ca_topic_score_gemma":0.0000757561,"teacher_disagreement_score":0.79761463,"about_ca_system_score_codex":0.000030812138,"about_ca_system_score_gemma":0.00004206123,"threshold_uncertainty_score":0.48087192},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019726913,0.00003745243,0.9592654,0.0058946474,0.00017967151,0.00011364803,5.207736e-7,0.0028875396,0.011894219],"genre_scores_gemma":[0.7799673,0.0000034979414,0.21675676,0.0030980753,0.000027912693,0.000004077904,6.336109e-7,0.0000104320925,0.00013127494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894786,0.000036296347,0.0001758889,0.00039588197,0.00018553255,0.00025855232],"domain_scores_gemma":[0.9992661,0.000078300174,0.000053732492,0.00041881733,0.000045060937,0.00013800558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016846367,0.00012179658,0.00013004369,0.000060607348,0.00009593852,0.00013898234,0.0010703315,0.00005205202,0.0000334954],"category_scores_gemma":[0.00015371485,0.00011592508,0.000059471164,0.00044351345,0.00001580676,0.0003570373,0.0004340417,0.00017237253,0.00018615536],"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.000023972305,0.00012495792,0.012226464,0.00007070644,0.000066083754,0.000160362,0.0069563584,0.00016939946,0.14864872,0.24780566,0.02815205,0.5555953],"study_design_scores_gemma":[0.00021173898,0.00018368113,0.0015829215,0.000023621305,0.0000059572317,0.000027400381,0.00007607778,0.9511524,0.033789925,0.005680845,0.006757433,0.00050798623],"about_ca_topic_score_codex":0.0000415539,"about_ca_topic_score_gemma":0.000020363343,"teacher_disagreement_score":0.950983,"about_ca_system_score_codex":0.000043291566,"about_ca_system_score_gemma":0.000039424092,"threshold_uncertainty_score":0.47272876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5028688,0.000057971716,0.49586555,0.00024548062,0.00026348853,0.00021028901,9.305052e-7,0.00035035674,0.0001371503],"genre_scores_gemma":[0.72279537,0.000028482917,0.27693537,0.000072537194,0.00011240506,0.000009354353,7.1400046e-7,0.000006961976,0.000038805727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993106,0.000018777655,0.00018040357,0.00022518655,0.00011206225,0.00015298111],"domain_scores_gemma":[0.99942887,0.00008613904,0.00013701196,0.00021287834,0.00007048167,0.00006459536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008776759,0.000086301196,0.00014497883,0.000045649944,0.000046513323,0.000026062366,0.00034811255,0.000053187476,0.0000054485076],"category_scores_gemma":[0.00003284963,0.00008482323,0.000046379035,0.00035156895,0.000024016255,0.00015509794,0.00007928481,0.00008532772,0.000004375089],"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.00012246615,0.000036167934,0.0055086897,0.00027339187,0.000051936237,0.0000049559976,0.0033673232,0.14155471,0.0020701059,0.01874362,0.0099818325,0.8182848],"study_design_scores_gemma":[0.00022712273,0.00046684968,0.00047882614,0.00003694453,0.000010321404,0.00001704906,0.000070597875,0.95788103,0.03785969,0.00068035116,0.0021022528,0.00016897642],"about_ca_topic_score_codex":0.000056565303,"about_ca_topic_score_gemma":0.0000021726005,"teacher_disagreement_score":0.81811583,"about_ca_system_score_codex":0.000014508583,"about_ca_system_score_gemma":0.000036594214,"threshold_uncertainty_score":0.34589908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783803,0.030012716,0.08325828,0.09142666,0.00042506985,0.0009477205,0.00011607246,0.00047770946,0.009532766],"genre_scores_gemma":[0.7839155,0.0054465267,0.2092893,0.00050532393,0.00004195272,0.000008467139,0.0000128327,0.000017758359,0.00076232216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976366,0.0005823,0.0007976362,0.0003731839,0.0002379095,0.00037237746],"domain_scores_gemma":[0.9947692,0.0012004327,0.0006507061,0.0019538603,0.0012898232,0.00013594395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015035957,0.0002501311,0.00052413926,0.00021314304,0.00034451607,0.00010159392,0.0015260138,0.0001322498,0.00005782874],"category_scores_gemma":[0.00096331415,0.0002906056,0.00013521196,0.00059582177,0.0005868571,0.0008526018,0.0011906949,0.00050160784,0.00004037381],"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.0001920024,0.0065779593,0.015447609,0.0012007273,0.0013448751,0.000029238774,0.046803575,0.0015544122,0.084886484,0.25219288,0.10955027,0.48021996],"study_design_scores_gemma":[0.00042219338,0.00071469694,0.01090396,0.0020848,0.00012223274,0.00019590984,0.00027997213,0.3023068,0.6519278,0.013662125,0.016457528,0.00092194363],"about_ca_topic_score_codex":0.0005949298,"about_ca_topic_score_gemma":0.00048331424,"teacher_disagreement_score":0.56704134,"about_ca_system_score_codex":0.000037547514,"about_ca_system_score_gemma":0.00023200754,"threshold_uncertainty_score":0.9999546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004459498,0.00019424669,0.98688114,0.0054610358,0.0004994057,0.00088255794,0.00003484053,0.0024530473,0.003147785],"genre_scores_gemma":[0.7190154,0.00024798015,0.28005153,0.00019254535,0.000021116786,0.00035048413,0.000019937623,0.000037416885,0.00006355151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973082,0.0004537812,0.00051755394,0.00084402785,0.0005679736,0.00030847668],"domain_scores_gemma":[0.99258375,0.00045579212,0.00041284255,0.005829142,0.0005502574,0.00016820256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003848909,0.00042367473,0.00040877252,0.00074347534,0.0007697599,0.0002767261,0.0043436764,0.0003598984,0.0000030062506],"category_scores_gemma":[0.000026099502,0.00044956425,0.00022423104,0.0017709925,0.00013304903,0.00063502806,0.00014822847,0.00219792,0.00006983005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016667394,0.0035515828,0.00016866026,0.0004261266,0.0009876757,0.000020798205,0.008036652,0.58322704,0.0014878934,0.16618632,0.0024109082,0.23332968],"study_design_scores_gemma":[0.00023689582,0.00018879732,0.0002704948,0.00025565483,0.0001394352,0.00002517434,0.000041902116,0.9469624,0.004343641,0.046663452,0.00023027195,0.0006418584],"about_ca_topic_score_codex":0.000752254,"about_ca_topic_score_gemma":0.0011565854,"teacher_disagreement_score":0.71856946,"about_ca_system_score_codex":0.0007508379,"about_ca_system_score_gemma":0.00053187186,"threshold_uncertainty_score":0.9997956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102748005,0.000051243198,0.98665625,0.002376353,0.000039729748,0.00028747405,0.000041823274,0.00024136702,0.000030986805],"genre_scores_gemma":[0.6662545,0.00027247562,0.3331898,0.00018920169,0.0000025499448,0.00006994647,0.0000059613994,0.0000058451856,0.000009709141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.000115389856,0.0002587931,0.00019350431,0.00009367399,0.00010837737],"domain_scores_gemma":[0.9978761,0.00080875854,0.00010842441,0.001019586,0.00012737475,0.0000597477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022697951,0.00009632473,0.00020732678,0.00025395627,0.00020643017,0.000030239595,0.001161964,0.000041707863,0.0000027180297],"category_scores_gemma":[0.000018636318,0.000100175595,0.00009232163,0.0009841747,0.00010662425,0.00020656896,0.000015224077,0.00017239229,0.000001219029],"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.00027671325,0.0020006076,0.001066173,0.00023456062,0.0027091969,9.4947137e-7,0.024044044,0.15882601,0.025029026,0.005958877,0.0004683088,0.77938557],"study_design_scores_gemma":[0.0001316944,0.00026729857,0.00055509264,0.000019595802,0.00020221964,7.676705e-7,0.00005355979,0.9851544,0.013242562,0.0001269945,0.00014805458,0.00009776834],"about_ca_topic_score_codex":0.000017406592,"about_ca_topic_score_gemma":0.00007302761,"teacher_disagreement_score":0.8263284,"about_ca_system_score_codex":0.000025287754,"about_ca_system_score_gemma":0.000044404645,"threshold_uncertainty_score":0.40850422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029183382,0.00004023897,0.7548093,0.06984529,0.00037127218,0.00078916055,0.000027075464,0.0055120336,0.13942225],"genre_scores_gemma":[0.6467267,0.0000014622851,0.32792082,0.023302257,0.00017078337,0.00004908615,0.000009059338,0.000024985653,0.0017947991],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987794,0.00007219436,0.00016542741,0.00050893746,0.00021486849,0.00025914705],"domain_scores_gemma":[0.9989828,0.00019531186,0.00006473474,0.0005851321,0.00004867738,0.00012334762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006868457,0.00016324666,0.00014865582,0.00006205385,0.00007017706,0.00009524093,0.0012223728,0.00005161565,0.00023187495],"category_scores_gemma":[0.00024948033,0.0001355882,0.000083843566,0.0003093682,0.00003731789,0.00017766119,0.0006462488,0.00028702564,0.00024407715],"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.00007246608,0.000088551424,0.00029446042,0.000037492013,0.000034802146,0.00023821219,0.0069165393,0.000032487354,0.016037349,0.0052018017,0.77389264,0.1971532],"study_design_scores_gemma":[0.0014541894,0.004534563,0.019629665,0.00046061302,0.000026965708,0.0007510978,0.00031344016,0.12817132,0.72494423,0.009363096,0.107493296,0.0028575216],"about_ca_topic_score_codex":0.000047330755,"about_ca_topic_score_gemma":0.000009736517,"teacher_disagreement_score":0.7089069,"about_ca_system_score_codex":0.00003846697,"about_ca_system_score_gemma":0.00004143984,"threshold_uncertainty_score":0.55291265},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029932544,0.00006588968,0.9671129,0.029201083,0.00030254864,0.001195466,0.00003193836,0.0014656698,0.00059457414],"genre_scores_gemma":[0.75245583,0.000030486997,0.24533665,0.0013078508,0.000017436041,0.00080094766,0.0000025502638,0.000022228764,0.000026005251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831414,0.00046123457,0.00036871928,0.0003461497,0.0002752898,0.00023448127],"domain_scores_gemma":[0.9935732,0.0029465805,0.00014328319,0.0030547553,0.00016955101,0.000112631315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062139065,0.00020398891,0.00021864116,0.00012520216,0.0012596155,0.00015745344,0.002931719,0.00007448392,0.0000053124168],"category_scores_gemma":[0.000035129484,0.00016771271,0.00020867027,0.0005261204,0.000115825445,0.00014586221,0.000017388036,0.00048050034,0.000056274723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033717122,0.0023689202,0.000008665001,0.00027033413,0.00037189134,0.0000055182104,0.0076729697,0.7776208,0.016763555,0.08027776,0.015427419,0.09887501],"study_design_scores_gemma":[0.00030320784,0.00031402797,0.00001837734,0.00010253895,0.000042190568,0.0000044152816,0.00012555678,0.9694317,0.026525205,0.00016044863,0.0027902543,0.00018210326],"about_ca_topic_score_codex":0.000059233706,"about_ca_topic_score_gemma":0.000038076854,"teacher_disagreement_score":0.7524259,"about_ca_system_score_codex":0.00017040886,"about_ca_system_score_gemma":0.00011762225,"threshold_uncertainty_score":0.9688072},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004656746,0.000024922427,0.9952901,0.001151326,0.000018213035,0.00046310696,0.0000019301704,0.0017736434,0.0008110874],"genre_scores_gemma":[0.71198833,4.5307413e-8,0.28757954,0.0003217762,0.000029585466,0.000042246655,0.0000026340845,0.0000088367315,0.000027020871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991779,0.000005476192,0.00016518385,0.0003414957,0.00011956258,0.00019041415],"domain_scores_gemma":[0.9994697,0.0001279354,0.00007404961,0.00015356722,0.00009409971,0.00008066925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007204347,0.00009644154,0.0001000617,0.000037327016,0.00015470998,0.00030099897,0.000623712,0.000028768673,0.0000016198256],"category_scores_gemma":[0.000033307362,0.00009455882,0.000044817523,0.0003185309,0.000020944484,0.00037640287,0.00020283354,0.00008558091,0.000015628111],"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.000003882997,0.000041384286,0.000082471706,0.00007323478,0.000006494552,7.8153596e-7,0.000984298,0.0029068356,0.0011096818,0.007990819,0.00033513483,0.986465],"study_design_scores_gemma":[0.000071060575,0.000061009752,0.000022138274,0.0000143588195,0.0000024352073,0.000005571057,0.000038608698,0.9957329,0.00019375539,0.0034338639,0.00029901887,0.00012530053],"about_ca_topic_score_codex":9.807137e-7,"about_ca_topic_score_gemma":7.901062e-7,"teacher_disagreement_score":0.99282604,"about_ca_system_score_codex":0.000028517952,"about_ca_system_score_gemma":0.000059426537,"threshold_uncertainty_score":0.38559967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13143721,0.0000069222815,0.86239547,0.004149235,0.00012449232,0.00025884417,0.000002502699,0.00038204598,0.0012432538],"genre_scores_gemma":[0.7939476,0.0000058487126,0.2049574,0.0010288979,0.000023100876,0.000027050824,7.4546864e-7,0.000005740374,0.000003655433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992784,0.00004086839,0.00017960349,0.000226224,0.00013929135,0.00013559892],"domain_scores_gemma":[0.99893296,0.0005764231,0.00010767487,0.00026813985,0.00007630502,0.000038514383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452975,0.000088334964,0.00012215636,0.000035525303,0.00009033563,0.000042977754,0.0005141096,0.000037830898,0.000003906285],"category_scores_gemma":[0.00031219292,0.00006235536,0.00006849785,0.00020189064,0.000047081114,0.00012216606,0.00010187071,0.000089750756,0.000008031578],"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.000027174317,0.000021087733,0.00029944268,0.000026308462,0.000016924909,8.1805314e-7,0.0006705385,0.00011057575,0.06603758,0.8812723,0.012239473,0.039277773],"study_design_scores_gemma":[0.000140725,0.0002434174,0.000081077684,0.00002686459,0.000005171529,0.0000064396327,0.00010158046,0.13934852,0.81745774,0.04219193,0.00027333564,0.00012318768],"about_ca_topic_score_codex":0.0000056788936,"about_ca_topic_score_gemma":0.000009141013,"teacher_disagreement_score":0.8390804,"about_ca_system_score_codex":0.000016673604,"about_ca_system_score_gemma":0.000028659657,"threshold_uncertainty_score":0.25427777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061304953,0.000057625777,0.91620475,0.0020479823,0.00012222765,0.00011723046,0.0000013594453,0.0012086667,0.01893523],"genre_scores_gemma":[0.769139,0.0000040629716,0.2300302,0.0007308631,0.00002830001,0.000002495242,3.8466987e-7,0.000007208656,0.000057493206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990398,0.000035191923,0.0002208873,0.00029478554,0.00021909962,0.0001901943],"domain_scores_gemma":[0.999273,0.00008930844,0.0000883877,0.00037799912,0.0000781598,0.00009312033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958799,0.00010629767,0.00017637495,0.0000631812,0.000053600645,0.000058922335,0.0009893682,0.000045451106,0.000031380063],"category_scores_gemma":[0.00012980138,0.00009680045,0.00006480277,0.00042215883,0.000032190903,0.00030425758,0.00040443166,0.00012459248,0.000027886794],"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.000032731274,0.00018668083,0.09116757,0.00013537679,0.00008163745,0.000056026696,0.012023111,0.00019310201,0.3572954,0.36859196,0.024929728,0.14530669],"study_design_scores_gemma":[0.00028097114,0.00032308302,0.002505595,0.000067322006,0.000007830658,0.000016289732,0.00019229081,0.21406905,0.7765642,0.0042605666,0.0012817096,0.00043111603],"about_ca_topic_score_codex":0.000066691675,"about_ca_topic_score_gemma":0.00002470586,"teacher_disagreement_score":0.70783406,"about_ca_system_score_codex":0.00001662502,"about_ca_system_score_gemma":0.000039659964,"threshold_uncertainty_score":0.3947408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23264088,0.00006571379,0.7603738,0.00016365515,0.0005073845,0.00028876265,0.000019779767,0.0010590556,0.0048810053],"genre_scores_gemma":[0.97472066,0.00008584924,0.02477053,0.00010143821,0.00005999274,8.286711e-7,0.000008522799,0.000028992597,0.00022315946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771065,0.00016266228,0.00032110518,0.0012648324,0.00016065396,0.00038012955],"domain_scores_gemma":[0.9973452,0.00017359863,0.0004997787,0.0015569018,0.00023554807,0.00018895428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033382067,0.00038215518,0.00055948657,0.0003682855,0.00013310908,0.00010408707,0.0034675386,0.00032604052,0.000016860782],"category_scores_gemma":[0.00012242356,0.00047067576,0.00031395146,0.00086752744,0.00013939687,0.00037563933,0.0042546135,0.00085663144,0.00003551477],"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.00014645717,0.00042991104,0.08223523,0.0007607721,0.00057504064,0.0014807787,0.004298986,0.061788276,0.010060256,0.8280767,0.0033534437,0.0067941165],"study_design_scores_gemma":[0.00054895604,0.00021276555,0.0028668933,0.0005716469,0.00014225511,0.00001561522,0.00021051781,0.8419423,0.023345293,0.1285228,0.0003130452,0.0013079032],"about_ca_topic_score_codex":0.0003056081,"about_ca_topic_score_gemma":0.000089178044,"teacher_disagreement_score":0.78015405,"about_ca_system_score_codex":0.00019880365,"about_ca_system_score_gemma":0.0002545111,"threshold_uncertainty_score":0.9997745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00962187,0.0005838226,0.94585013,0.0053463816,0.0006211542,0.0011926334,0.000028535498,0.0022712026,0.03448426],"genre_scores_gemma":[0.71362555,0.00007051857,0.28281137,0.0002722357,0.000021473435,0.00049068895,0.00013597838,0.000069306865,0.0025028854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900351,0.005788047,0.00077981665,0.0017647191,0.00095520506,0.0006771049],"domain_scores_gemma":[0.98792106,0.0018228395,0.00092637766,0.006221484,0.002855061,0.00025316761],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0067342697,0.0006353205,0.0006317115,0.00065481226,0.00039451502,0.0010351255,0.0055091316,0.0005109632,0.000042367996],"category_scores_gemma":[0.0009072386,0.00068044366,0.00047709316,0.0010257144,0.00027106688,0.00016983876,0.0039903927,0.0010574595,0.000056237597],"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.000040428684,0.0038108202,0.0072473492,0.0011164803,0.00027355918,0.000044270593,0.013228057,0.010397615,0.008553997,0.7318604,0.009375019,0.21405198],"study_design_scores_gemma":[0.00045084275,0.0000014695017,0.00067888974,0.0029555885,0.000032825814,0.000011613201,0.000025072655,0.79641706,0.17697595,0.00817539,0.013251618,0.0010236674],"about_ca_topic_score_codex":0.001753361,"about_ca_topic_score_gemma":0.000729424,"teacher_disagreement_score":0.78601944,"about_ca_system_score_codex":0.00023454621,"about_ca_system_score_gemma":0.0008368788,"threshold_uncertainty_score":0.99987155},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031914035,0.000032939646,0.9767044,0.018833434,0.00024063876,0.0006893201,0.0011707753,0.0018472091,0.00016212526],"genre_scores_gemma":[0.7809942,0.000044521446,0.21792088,0.00047723873,0.000022620283,0.00033633938,0.00016542737,0.000020850099,0.000017947847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982838,0.00019736476,0.00042890193,0.0004577158,0.00022336244,0.00040886836],"domain_scores_gemma":[0.996758,0.00050864875,0.00016404902,0.0021078694,0.00026641207,0.0001950477],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00032336815,0.00022399791,0.0002537814,0.000105514104,0.0013165042,0.00015237936,0.002432864,0.00012130263,0.0000137572615],"category_scores_gemma":[0.000061712686,0.00025679645,0.00022378466,0.0009824198,0.00012040222,0.00045205423,0.00004409893,0.00051646016,0.000039443126],"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.0012151478,0.022456171,0.00065643806,0.0015572942,0.0014035568,0.00002217532,0.053951066,0.023773976,0.23099811,0.38439545,0.09818382,0.18138678],"study_design_scores_gemma":[0.00057664746,0.00016634431,0.00015482817,0.00006216043,0.000042442964,0.0000060992297,0.00012149,0.97701335,0.011966108,0.002168665,0.007383157,0.00033871355],"about_ca_topic_score_codex":0.0000464464,"about_ca_topic_score_gemma":0.00031766493,"teacher_disagreement_score":0.9532394,"about_ca_system_score_codex":0.00019120994,"about_ca_system_score_gemma":0.00009699915,"threshold_uncertainty_score":0.99998844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13395348,0.0000023070934,0.86343247,0.00013055593,0.00007713055,0.00015273754,0.000011976663,0.00033893329,0.0019003932],"genre_scores_gemma":[0.9850008,0.000009405002,0.01425012,0.0006881878,0.000003992119,0.000026199124,0.0000012574648,0.0000069034772,0.000013163427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923,0.000058608475,0.00024758736,0.00013117435,0.0001854294,0.00014718987],"domain_scores_gemma":[0.99936956,0.00017091235,0.00009332507,0.00022953772,0.000063898005,0.00007275232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029196127,0.0001225578,0.00012648394,0.0001693264,0.00013539675,0.00006236852,0.00019424372,0.000052259904,0.000021161131],"category_scores_gemma":[0.000012149624,0.0001055398,0.000047312165,0.0003958637,0.000044741748,0.00090493984,0.0000036491306,0.00019688212,0.00002884904],"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.0008159356,0.00032140894,0.0010691037,0.00033789716,0.00018797575,0.0000097284255,0.045555275,0.009043006,0.0008547996,0.63139796,0.00029112687,0.31011578],"study_design_scores_gemma":[0.004551098,0.004480091,0.0036371802,0.0013929496,0.00021795,0.00040079246,0.0043831947,0.26443857,0.6204546,0.0891851,0.0041100127,0.0027484568],"about_ca_topic_score_codex":0.000004754494,"about_ca_topic_score_gemma":0.0000072557905,"teacher_disagreement_score":0.8510473,"about_ca_system_score_codex":0.000016449409,"about_ca_system_score_gemma":0.000025652758,"threshold_uncertainty_score":0.43037882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028830968,0.000017266742,0.9688692,0.0012753372,0.0001999005,0.00018560405,0.0000033376455,0.00029568785,0.0003227014],"genre_scores_gemma":[0.79324925,0.0000033253837,0.20642297,0.00023487475,0.000045376215,0.00001897984,0.0000012095747,0.0000034874993,0.000020520716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948543,0.000012728909,0.00012258565,0.00020842942,0.000086922875,0.00008389114],"domain_scores_gemma":[0.9995351,0.00014886251,0.00006525159,0.000101043035,0.00010451588,0.00004526939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082716455,0.000060655784,0.0001003176,0.000040498024,0.00004748933,0.000062063824,0.0002244072,0.000029907504,0.000007674041],"category_scores_gemma":[0.00013322486,0.000056203542,0.00002784018,0.00015010618,0.00004322196,0.00036143273,0.00017598724,0.000039432056,8.39167e-7],"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.0003146857,0.0001725997,0.07183093,0.0005744317,0.00012311855,0.0000037439545,0.0045075635,0.00080358627,0.08111912,0.27158025,0.025733488,0.5432365],"study_design_scores_gemma":[0.0007460146,0.00036077277,0.0029180495,0.000030106265,0.00000914725,0.000040144972,0.00012025358,0.6606421,0.32183614,0.01092295,0.0021393527,0.00023497766],"about_ca_topic_score_codex":0.00002577894,"about_ca_topic_score_gemma":0.00000554988,"teacher_disagreement_score":0.7644183,"about_ca_system_score_codex":0.0000063143752,"about_ca_system_score_gemma":0.000022139717,"threshold_uncertainty_score":0.2291914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14103942,0.000039582155,0.8447013,0.01097337,0.0011585586,0.0010342443,0.000011760525,0.00095749664,0.000084274],"genre_scores_gemma":[0.9282442,6.93474e-7,0.06530082,0.0055586835,0.0006520506,0.00012566015,0.000006711494,0.000052647516,0.000058547863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977031,0.00016435423,0.00041053863,0.00079407555,0.0004459678,0.00048196418],"domain_scores_gemma":[0.99832314,0.00034278017,0.00036479274,0.00064758136,0.00016937057,0.00015233137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027407668,0.00033276208,0.00042034494,0.0001260291,0.00017012353,0.00028278568,0.00080778246,0.00011184116,0.0000015386471],"category_scores_gemma":[0.00007031612,0.00028448467,0.00009899867,0.00046030112,0.000048859973,0.00029241474,0.00006618976,0.00028862798,0.000015823864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020869859,0.000044750508,0.0004951424,0.0006335711,0.00020193099,0.00016391241,0.011229362,0.49149466,0.40553704,0.0014694082,0.087008946,0.0015125743],"study_design_scores_gemma":[0.0024703848,0.00056908256,0.00017350394,0.0006308052,0.00009208712,0.0001806771,0.00023215913,0.877247,0.108371176,0.00015259885,0.008112428,0.0017681291],"about_ca_topic_score_codex":0.00031189393,"about_ca_topic_score_gemma":0.00007562512,"teacher_disagreement_score":0.7872048,"about_ca_system_score_codex":0.00012977663,"about_ca_system_score_gemma":0.00008252936,"threshold_uncertainty_score":0.9999607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087464764,0.0002707154,0.9843388,0.013221712,0.0000222669,0.00053759763,0.000016827795,0.0002747552,0.0004426833],"genre_scores_gemma":[0.44476056,0.00013412377,0.5541372,0.000705398,0.0000047379917,0.00021839957,0.000023966619,0.000010675201,0.000004967744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998821,0.00015541613,0.00048182547,0.0002176496,0.00015055975,0.00017354693],"domain_scores_gemma":[0.9971498,0.000555866,0.00044865502,0.0011325966,0.00064421823,0.00006882247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034666114,0.0001193465,0.00026160703,0.00018351029,0.000121198114,0.000027796646,0.0018389359,0.00006753121,0.0000057502375],"category_scores_gemma":[0.0003846438,0.00012851454,0.00018506697,0.000773622,0.00010559285,0.00021414034,0.0001987384,0.000082077415,4.711413e-7],"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.00065566716,0.0041514924,0.008495422,0.0012990999,0.0008453816,0.0000015201831,0.008760119,0.34135106,0.06610549,0.34240377,0.07732696,0.14860402],"study_design_scores_gemma":[0.00027452936,0.00031309412,0.00008759307,0.00006228225,0.000012674322,4.3923075e-7,0.000041850217,0.8103871,0.18354324,0.001419557,0.0036989667,0.00015871233],"about_ca_topic_score_codex":0.00012445026,"about_ca_topic_score_gemma":0.000064497945,"teacher_disagreement_score":0.469036,"about_ca_system_score_codex":0.000005466913,"about_ca_system_score_gemma":0.0001248674,"threshold_uncertainty_score":0.5240671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018654027,0.00006213741,0.99312294,0.0038647887,0.000086948814,0.00020380186,0.0000052879655,0.0007302124,0.000058470792],"genre_scores_gemma":[0.66049445,0.000010214612,0.33869934,0.0007333424,0.000021267027,0.000018432112,8.4863444e-7,0.000015534351,0.0000065957984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985758,0.00007789465,0.0002627448,0.000496878,0.00031789282,0.0002687899],"domain_scores_gemma":[0.99938107,0.00010250996,0.000112249734,0.00014638554,0.00009550038,0.00016230176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021853237,0.0001802755,0.0001541408,0.00012733442,0.0003713514,0.00032176147,0.00024052184,0.00007513068,0.000025132635],"category_scores_gemma":[0.000006132338,0.00018888328,0.000051195155,0.00047573348,0.000049809445,0.0012957057,0.0000057146776,0.00039298576,0.00001543163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123932305,0.00005215972,0.000010413383,0.000027895268,0.000013164681,0.000014751652,0.0015402144,0.00018134617,0.0045972667,0.000035726764,0.000060395832,0.9934543],"study_design_scores_gemma":[0.00034913537,0.00034960054,0.000045608427,0.000058700123,0.00003255275,0.000093991686,0.00046519376,0.93938047,0.058241542,0.0004801825,0.00020078362,0.00030222203],"about_ca_topic_score_codex":0.000025050309,"about_ca_topic_score_gemma":0.000015815913,"teacher_disagreement_score":0.993152,"about_ca_system_score_codex":0.0000738093,"about_ca_system_score_gemma":0.0001617719,"threshold_uncertainty_score":0.77024364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00999414,0.00006758679,0.74455243,0.24150595,0.0001795461,0.00026514073,0.0000118133885,0.0016046045,0.0018187681],"genre_scores_gemma":[0.6047639,0.000021275831,0.34320667,0.0518767,0.000043465996,0.000035689478,0.000018401297,0.000017925078,0.000015965152],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.00019533178,0.00026648832,0.00033946478,0.0002422442,0.00023669298],"domain_scores_gemma":[0.9960552,0.00040745712,0.0001251471,0.003230187,0.00007598137,0.00010606615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024370982,0.00016211941,0.00016701387,0.00012152547,0.0002762406,0.0001291689,0.0041859844,0.000050028797,0.0000061549194],"category_scores_gemma":[0.00013268518,0.00017345436,0.00007939699,0.00067480165,0.00011243448,0.0002452595,0.00040193362,0.00044993166,0.000098901786],"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.000093876704,0.0018849564,0.007973455,0.00012889625,0.00010904149,0.00006647831,0.0066954577,0.036882173,0.24527244,0.026204828,0.57737994,0.097308464],"study_design_scores_gemma":[0.00031577286,0.00016923918,0.00042599652,0.000094931806,0.0000103018,0.0000049657865,0.000040503783,0.91017467,0.008390526,0.0001947648,0.079802506,0.00037581666],"about_ca_topic_score_codex":0.00010072627,"about_ca_topic_score_gemma":0.000029281371,"teacher_disagreement_score":0.8732925,"about_ca_system_score_codex":0.00009500487,"about_ca_system_score_gemma":0.000057315854,"threshold_uncertainty_score":0.77786696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11245182,0.000014424767,0.88316065,0.00007505583,0.0001653211,0.00020305194,0.000001567128,0.00064772106,0.0032803908],"genre_scores_gemma":[0.96650255,0.000052769643,0.03316354,0.000027371145,0.000022212753,6.0241746e-7,0.0000074954387,0.000013944619,0.00020952901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986662,0.00011473425,0.00019161061,0.00070754054,0.00011947692,0.00020042068],"domain_scores_gemma":[0.9984838,0.00006722966,0.00047129398,0.00068082585,0.00020398218,0.00009287102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001698462,0.00023060518,0.0003186128,0.0002081018,0.00009939411,0.000048531652,0.0010919502,0.00016024256,0.000009808719],"category_scores_gemma":[0.000046360332,0.00025416075,0.00010708619,0.0005180055,0.00014044206,0.00024537722,0.0013484749,0.00069707975,0.000009048907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010341638,0.00004272107,0.029755939,0.00029216098,0.00020708924,0.00022078624,0.0011544757,0.5818113,0.00071977434,0.3842031,0.00011377198,0.0013754552],"study_design_scores_gemma":[0.00047241102,0.000574094,0.00070361665,0.0003993463,0.00011447338,0.000027541295,0.00037231835,0.9613723,0.009788686,0.02502782,0.00043390284,0.0007134855],"about_ca_topic_score_codex":0.00029064852,"about_ca_topic_score_gemma":0.000023016837,"teacher_disagreement_score":0.8540507,"about_ca_system_score_codex":0.00014453365,"about_ca_system_score_gemma":0.00020018958,"threshold_uncertainty_score":0.99999106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025598286,0.00003056387,0.9694638,0.0006313365,0.0007487367,0.0006596964,0.00001643662,0.0018612879,0.000989807],"genre_scores_gemma":[0.49869418,0.000006542324,0.50092983,0.00020078827,0.000059584487,0.000048701706,0.000005177908,0.000022495167,0.00003268122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784887,0.00009307284,0.00049677596,0.0009226428,0.000309089,0.00032952175],"domain_scores_gemma":[0.99766856,0.00020818155,0.0004029755,0.001252245,0.0003320419,0.00013597355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005760174,0.00030865552,0.00052148435,0.00022371596,0.00010440712,0.00022265365,0.002677319,0.00029298037,0.000005485302],"category_scores_gemma":[0.0002394165,0.00032386556,0.00023214173,0.00019013078,0.000025369567,0.0003066065,0.0017660074,0.00046156856,0.0000035948253],"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.000012394898,0.00007284257,0.00064449344,0.00048294815,0.000077329685,0.000008210346,0.0030267034,0.00008223764,0.084277496,0.89929354,0.00042793815,0.011593859],"study_design_scores_gemma":[0.0001242658,0.00032285592,0.00011415745,0.0002670702,0.000023869481,0.0000050273984,0.00006990124,0.37562037,0.3128716,0.30998334,0.00005353168,0.00054399733],"about_ca_topic_score_codex":0.0005638483,"about_ca_topic_score_gemma":0.00007229112,"teacher_disagreement_score":0.58931017,"about_ca_system_score_codex":0.00007800731,"about_ca_system_score_gemma":0.00016739941,"threshold_uncertainty_score":0.9999213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048411437,0.00003446154,0.9864389,0.0061749946,0.000094790725,0.0009048033,0.000030488283,0.000983709,0.0004967234],"genre_scores_gemma":[0.65970325,0.000017848308,0.33969155,0.00022578773,0.000005685287,0.00032570222,0.0000037302711,0.000016744716,0.000009687897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985218,0.00023356777,0.0003778974,0.00035498646,0.00030937704,0.00020235771],"domain_scores_gemma":[0.99681807,0.00020771459,0.00021832035,0.002331928,0.00029747013,0.00012650054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907459,0.00020465035,0.00025566007,0.00025369215,0.00039765416,0.00006077143,0.0019264736,0.00009180703,0.000019639147],"category_scores_gemma":[0.000014454039,0.00019850174,0.00014077213,0.0013951433,0.0004551478,0.0003197818,0.00001304103,0.00045722025,0.000016572689],"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.0014640284,0.011188601,0.0022268987,0.0015848244,0.0015748241,0.000031354946,0.022154823,0.12340617,0.20727628,0.06288969,0.0019209657,0.5642815],"study_design_scores_gemma":[0.0012336195,0.0012822418,0.00030794766,0.00042292735,0.00011751106,0.00003853384,0.0003784503,0.4466178,0.54633516,0.00095165597,0.0016503504,0.00066379417],"about_ca_topic_score_codex":0.00010009505,"about_ca_topic_score_gemma":0.00017598186,"teacher_disagreement_score":0.6548621,"about_ca_system_score_codex":0.00004441545,"about_ca_system_score_gemma":0.00020176076,"threshold_uncertainty_score":0.80946666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046114452,0.0000036174574,0.9752907,0.01973502,0.0000877334,0.00040284844,0.000003911519,0.001994879,0.0020201567],"genre_scores_gemma":[0.44779745,3.5135354e-8,0.54586947,0.00623872,0.000024132994,0.000029118795,0.0000014376318,0.00001235726,0.00002726096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981559,0.0002372694,0.0002732218,0.0006383709,0.00040548036,0.00028978504],"domain_scores_gemma":[0.9971717,0.001734631,0.00009107068,0.0005646762,0.0001229653,0.00031495927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029571378,0.00022256737,0.00027490468,0.00018044065,0.00015991912,0.00013853892,0.0010413761,0.000053757372,0.00005778171],"category_scores_gemma":[0.00061208144,0.0001852338,0.00008805694,0.0009088529,0.000022413891,0.00009591595,0.00023395337,0.00020416058,0.00020192037],"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.00008550832,0.00048884854,0.00008335399,0.00007140387,0.000048786875,0.00007445497,0.003091985,0.30206436,0.009969219,0.06618766,0.02748727,0.5903472],"study_design_scores_gemma":[0.00015350895,0.00041926873,0.0002086624,0.00009644567,0.000007661431,0.0000047669237,0.000038419425,0.9901226,0.0068485886,0.0014439716,0.00041035644,0.00024574547],"about_ca_topic_score_codex":0.000050534632,"about_ca_topic_score_gemma":0.000008749659,"teacher_disagreement_score":0.68805826,"about_ca_system_score_codex":0.000063587686,"about_ca_system_score_gemma":0.00009595748,"threshold_uncertainty_score":0.7553615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078901206,0.00003111384,0.9740145,0.0024062286,0.00037730474,0.00025063707,3.0685558e-7,0.0009413909,0.021189513],"genre_scores_gemma":[0.48078248,0.000006803386,0.5120165,0.0014495088,0.000085400454,0.00013569674,7.074744e-7,0.00001531426,0.0055076187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990608,0.00007388794,0.00016792148,0.00026454884,0.00015831685,0.00027453442],"domain_scores_gemma":[0.9980384,0.0010033302,0.0000661532,0.00072072906,0.000117644966,0.000053706688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204907,0.00009968027,0.00010855236,0.000032852782,0.0002960852,0.0002083235,0.0012201774,0.00004114917,0.000010500836],"category_scores_gemma":[0.00039423016,0.00006194483,0.000078980236,0.00013097057,0.00003346077,0.0001590732,0.00020218956,0.000077267876,0.000037385616],"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.000014320068,0.000025942712,0.00029067812,0.00000821295,0.000013736108,4.5399108e-7,0.00026261015,0.000008827056,0.0011525194,0.7767347,0.080581635,0.14090633],"study_design_scores_gemma":[0.00044010236,0.00019917909,0.0002510567,0.000015106907,0.0000070393844,0.000016182206,0.000022228858,0.41228822,0.035032757,0.112085335,0.43934807,0.00029472314],"about_ca_topic_score_codex":0.000026824946,"about_ca_topic_score_gemma":0.00017514385,"teacher_disagreement_score":0.66464937,"about_ca_system_score_codex":0.000021615822,"about_ca_system_score_gemma":0.000032174543,"threshold_uncertainty_score":0.2526037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016070437,0.00009918708,0.97033113,0.009073487,0.0006518097,0.00033973757,0.000017029923,0.0012921045,0.0021250595],"genre_scores_gemma":[0.80099255,0.000020228385,0.19302045,0.00056527957,0.00013652125,0.00007244773,0.0000015725819,0.000036592308,0.005154362],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848896,0.00006514341,0.00019189047,0.000535938,0.00024396711,0.00047412168],"domain_scores_gemma":[0.9982985,0.00045091144,0.00012761191,0.0008512191,0.00013878483,0.00013292901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048210542,0.00020498049,0.00020735123,0.00015153864,0.00017930914,0.00014924882,0.0011304497,0.00010263743,0.000021685804],"category_scores_gemma":[0.0004123489,0.00015424896,0.00011912415,0.0002610361,0.00007552137,0.00052268646,0.00027074266,0.00010039694,0.000104046965],"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.00013328719,0.00031065036,0.023223575,0.00011672307,0.00012319817,0.00005201212,0.0067041274,0.000029661805,0.11912762,0.17254262,0.25818458,0.41945195],"study_design_scores_gemma":[0.0026568912,0.0011445736,0.0058689653,0.00074287324,0.00005363833,0.00013844042,0.00043341902,0.021375883,0.41397846,0.032027315,0.5190684,0.0025111383],"about_ca_topic_score_codex":0.00010043251,"about_ca_topic_score_gemma":0.0005421121,"teacher_disagreement_score":0.7849221,"about_ca_system_score_codex":0.00011112518,"about_ca_system_score_gemma":0.00008225842,"threshold_uncertainty_score":0.629009},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114508,0.00004971875,0.98392063,0.0016057574,0.00040602993,0.0008638329,0.000008432507,0.0014528075,0.00024197553],"genre_scores_gemma":[0.96717584,9.3219626e-7,0.031807095,0.0005717534,0.00014840576,0.00019888955,0.000059509013,0.000009495312,0.000028062914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871343,0.000040570914,0.0005580508,0.00019819874,0.0002946934,0.0001950345],"domain_scores_gemma":[0.9987341,0.000043610016,0.0004922523,0.00019917688,0.00044424896,0.00008658367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247845,0.00013875579,0.00014733784,0.00009482358,0.00021501398,0.000810558,0.00046935532,0.0000901259,9.426055e-7],"category_scores_gemma":[0.00014818301,0.00013619878,0.000052132615,0.00036988917,0.000017769775,0.004770523,0.00005906245,0.00011602705,0.000028031573],"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.00028260436,0.00011246505,0.0011417881,0.00798642,0.00006536753,0.0000030914707,0.061189305,0.06541372,0.10108909,0.05675939,0.029169254,0.6767875],"study_design_scores_gemma":[0.0002789053,0.000070302514,0.00006707441,0.000053778735,0.0000049938894,0.000013746409,0.00016621621,0.9856082,0.009149325,0.000093599425,0.0043348884,0.00015897417],"about_ca_topic_score_codex":0.000018488072,"about_ca_topic_score_gemma":7.9789953e-7,"teacher_disagreement_score":0.9557251,"about_ca_system_score_codex":0.000064447406,"about_ca_system_score_gemma":0.0000758373,"threshold_uncertainty_score":0.7816229},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017051904,0.0009824272,0.9581941,0.01816905,0.0016903521,0.0012402167,0.000035487807,0.0017786608,0.0008578376],"genre_scores_gemma":[0.8135965,0.00009078074,0.18082343,0.0044872365,0.000049839327,0.00054304,0.00023106766,0.00004409449,0.00013403222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962088,0.0013085717,0.00081113353,0.00072948635,0.0006070898,0.0003349247],"domain_scores_gemma":[0.9882213,0.001516699,0.00069027726,0.00901198,0.00045825084,0.000101475714],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007786167,0.00041632482,0.0006280158,0.0004732224,0.00048710915,0.00065998593,0.0074759685,0.0002936327,0.000007720147],"category_scores_gemma":[0.0005543394,0.00046117557,0.00026332674,0.00061896804,0.00021576766,0.00029948496,0.0030277565,0.0014429567,0.00006328652],"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.000035926103,0.0037483575,0.0041723046,0.038023714,0.0030858577,0.00018027375,0.021698056,0.045077495,0.1238663,0.6727811,0.0853656,0.0019649784],"study_design_scores_gemma":[0.0011019227,0.00017396858,0.003622277,0.055618946,0.00063918205,0.00028939996,0.0005661801,0.90710986,0.012107565,0.013573738,0.000546348,0.004650607],"about_ca_topic_score_codex":0.00025520692,"about_ca_topic_score_gemma":0.00012498928,"teacher_disagreement_score":0.86203235,"about_ca_system_score_codex":0.00049819326,"about_ca_system_score_gemma":0.00032817168,"threshold_uncertainty_score":0.999784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003983165,0.00019684652,0.9729573,0.0014251199,0.0054357196,0.0010887712,0.00000974733,0.0027244226,0.015763728],"genre_scores_gemma":[0.6157728,0.000023048271,0.38108054,0.00028408653,0.0006557953,0.00039579393,0.00001458541,0.00004746295,0.0017259016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742323,0.00007152776,0.00047012424,0.0009680958,0.0003261323,0.0007408929],"domain_scores_gemma":[0.9973972,0.00019813873,0.00033331636,0.001696467,0.00016068872,0.00021422346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093372643,0.0004503439,0.00049001566,0.00025613603,0.00017344103,0.00048108803,0.0023281237,0.00037879165,0.000032967313],"category_scores_gemma":[0.00013770204,0.00041389663,0.00031906107,0.0001747056,0.000041545205,0.00035597358,0.0037304123,0.00063718745,0.000052525636],"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.00002851017,0.00047743414,0.00071648293,0.0014954028,0.00021592148,0.000022967208,0.01032295,0.0004665015,0.0027810533,0.5860399,0.057641085,0.33979177],"study_design_scores_gemma":[0.0009922395,0.00046383552,0.00077819737,0.002579348,0.00016801998,0.00021027967,0.00027676133,0.5505173,0.14830011,0.19767013,0.092207305,0.005836449],"about_ca_topic_score_codex":0.00014972597,"about_ca_topic_score_gemma":0.000018349652,"teacher_disagreement_score":0.61537445,"about_ca_system_score_codex":0.00019278836,"about_ca_system_score_gemma":0.00012618056,"threshold_uncertainty_score":0.99983126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007555294,0.000035392386,0.956425,0.00064969563,0.0010466431,0.0009888178,0.000008352282,0.0036838467,0.02960693],"genre_scores_gemma":[0.40880677,0.000008673583,0.58887446,0.00050117564,0.00014833255,0.00034259967,0.0000052885025,0.000042987325,0.0012696955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968583,0.00014021105,0.00053074816,0.001253252,0.0005887632,0.0006287442],"domain_scores_gemma":[0.99660254,0.00017830318,0.00023089173,0.0024880415,0.0001903318,0.00030991618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004382697,0.00051809533,0.0005245535,0.00050946965,0.00009513594,0.00031666638,0.0039956504,0.0003818818,0.000025734285],"category_scores_gemma":[0.0002065373,0.0003825932,0.00029655578,0.00042422934,0.00004345633,0.00028712946,0.0053015584,0.0006919653,0.00025584598],"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.000031476626,0.0011003718,0.0052396883,0.0014183444,0.00041275713,0.00005868163,0.013883695,0.00023833809,0.0018883052,0.6120898,0.037178244,0.32646027],"study_design_scores_gemma":[0.0010319769,0.00088481035,0.0075203334,0.0017367451,0.00010429311,0.0001772174,0.00013522613,0.19109176,0.056921724,0.7218328,0.010261073,0.008302023],"about_ca_topic_score_codex":0.0001350395,"about_ca_topic_score_gemma":0.000020751886,"teacher_disagreement_score":0.40125147,"about_ca_system_score_codex":0.00012194869,"about_ca_system_score_gemma":0.00018043436,"threshold_uncertainty_score":0.9998626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018004205,0.0017710725,0.9784966,0.00042135935,0.0007463346,0.00009341413,8.507798e-7,0.0002835214,0.00018263052],"genre_scores_gemma":[0.9582712,0.000017558179,0.041089896,0.00006843691,0.00031451165,0.0000029528262,5.8140273e-8,0.00002312408,0.00021223443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977746,0.00013253787,0.0008093778,0.00024727627,0.0006927603,0.0003434599],"domain_scores_gemma":[0.99746346,0.00020146024,0.0011292225,0.00026746778,0.0007698886,0.00016847628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013387915,0.0001923659,0.00036121375,0.0003207012,0.00016133011,0.00032115547,0.0012796371,0.00011276778,0.000005788925],"category_scores_gemma":[0.00019588837,0.00011898105,0.00013707869,0.00037965778,0.000053408818,0.0017678074,0.00010269767,0.00025154557,0.000018621675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007341214,0.0002766313,0.014891908,0.0007767098,0.00011747603,0.0005361116,0.0024722817,0.00030286686,0.11643153,0.0010477805,0.0075434605,0.85552984],"study_design_scores_gemma":[0.015091112,0.012531178,0.010629331,0.14021711,0.0006078503,0.05435027,0.0032946868,0.14151084,0.4881167,0.08338312,0.039561186,0.010706604],"about_ca_topic_score_codex":0.0000145348695,"about_ca_topic_score_gemma":0.0000012128627,"teacher_disagreement_score":0.940267,"about_ca_system_score_codex":0.00018264397,"about_ca_system_score_gemma":0.00040356856,"threshold_uncertainty_score":0.48519063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066899166,0.0008947681,0.8776077,0.010852711,0.0030644822,0.00075730693,0.000007582862,0.005239381,0.0346769],"genre_scores_gemma":[0.8378873,0.000011044764,0.15307032,0.001171761,0.00020740204,0.000042558866,0.0000036893662,0.000053084794,0.007552848],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774534,0.0001845283,0.00026531753,0.0006539678,0.0005984316,0.000552399],"domain_scores_gemma":[0.9977497,0.000134859,0.00015757776,0.0013329193,0.00028126652,0.0003436776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085411227,0.0002866391,0.00031787783,0.00023816453,0.00014680973,0.00026206448,0.001572251,0.00015928199,0.000033052118],"category_scores_gemma":[0.0005603154,0.00027270356,0.00012124537,0.00068411976,0.000050738323,0.00067507854,0.00065578567,0.00035681107,0.0006954276],"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.0002050534,0.0006528489,0.043736186,0.00008833353,0.00019856777,0.0006582303,0.032520384,0.0006883429,0.005016821,0.04840919,0.80179346,0.06603261],"study_design_scores_gemma":[0.005086346,0.0013529125,0.010822994,0.00043516821,0.0000877143,0.00054045935,0.0015459639,0.110442206,0.07532321,0.029943697,0.76056665,0.003852653],"about_ca_topic_score_codex":0.00019375219,"about_ca_topic_score_gemma":0.0002586589,"teacher_disagreement_score":0.7709881,"about_ca_system_score_codex":0.00018630543,"about_ca_system_score_gemma":0.00025368598,"threshold_uncertainty_score":0.9999725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017087895,0.0005987015,0.9680702,0.0009444991,0.004933541,0.0016145912,0.000013779584,0.0019606634,0.0047760913],"genre_scores_gemma":[0.9027603,0.00003607524,0.09210184,0.000588173,0.00082009647,0.00056973385,0.000004903329,0.00009375372,0.003025111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968023,0.0001622064,0.0005197427,0.0012775892,0.00052083516,0.00071738515],"domain_scores_gemma":[0.99538606,0.0013071726,0.0005853128,0.002304137,0.00031528296,0.00010201901],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017722446,0.0005225393,0.0005222508,0.0003744829,0.00042966954,0.0010724226,0.004124408,0.00039151584,0.000025166202],"category_scores_gemma":[0.0004895171,0.0003286639,0.00035955166,0.0005297992,0.00010789053,0.00041538753,0.005261635,0.00065481913,0.00001703114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006929228,0.00034087888,0.000991299,0.0018444767,0.00046999715,0.00006322678,0.0036298817,0.0003897483,0.020764956,0.20163822,0.041502487,0.72829556],"study_design_scores_gemma":[0.0009423165,0.0004838152,0.00062434026,0.0018240018,0.00014808653,0.000071789,0.0002438133,0.5855778,0.13133807,0.2712625,0.0045199483,0.0029635336],"about_ca_topic_score_codex":0.00054300553,"about_ca_topic_score_gemma":0.00007037947,"teacher_disagreement_score":0.8856724,"about_ca_system_score_codex":0.00030305382,"about_ca_system_score_gemma":0.00034826624,"threshold_uncertainty_score":0.99996454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23081489,0.000033558594,0.7516558,0.003655389,0.00016997787,0.0001815658,3.4663194e-7,0.001483252,0.0120052],"genre_scores_gemma":[0.7153398,0.000007222402,0.2831948,0.00056067255,0.000024080196,0.000017402175,3.1863448e-7,0.000004977495,0.00085071573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991695,0.000046358484,0.00012439763,0.00029901165,0.00015020935,0.00021048443],"domain_scores_gemma":[0.9992712,0.00014583605,0.000028368377,0.00040296567,0.00005243235,0.00009916213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015150133,0.00009867851,0.00011336071,0.00007208202,0.00007547246,0.00019331563,0.00049704575,0.000051125648,0.00007457033],"category_scores_gemma":[0.00005062952,0.00007809284,0.00002100759,0.00015448825,0.000060032813,0.0003847242,0.00038166528,0.00014606981,0.000108931396],"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.0000023923367,0.00008156817,0.008767992,0.000017563076,0.000014680863,0.000012438977,0.0007320904,0.0000028114825,0.008038134,0.6021011,0.035911355,0.3443179],"study_design_scores_gemma":[0.00074305525,0.00076897244,0.14988153,0.00007501059,0.000009384575,0.00023244318,0.00009379691,0.21477415,0.06601209,0.55390716,0.012137358,0.0013650773],"about_ca_topic_score_codex":0.00057459035,"about_ca_topic_score_gemma":0.000049350117,"teacher_disagreement_score":0.4845249,"about_ca_system_score_codex":0.000013136136,"about_ca_system_score_gemma":0.000018693432,"threshold_uncertainty_score":0.31845337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034242538,0.000076339056,0.9804438,0.003387188,0.00030069,0.0006274545,0.0000032071007,0.0021639338,0.009573145],"genre_scores_gemma":[0.7555604,0.0000028271477,0.24116716,0.001388717,0.00012499739,0.00006949227,0.0000026001574,0.000024235633,0.0016595627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987473,0.000047406946,0.00019775925,0.00048384359,0.00023745988,0.00028623806],"domain_scores_gemma":[0.99897724,0.00013146835,0.00009478191,0.00047498316,0.00018320286,0.0001383242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002077459,0.00016501032,0.00021336616,0.00005350434,0.000091957496,0.00018588774,0.00090737385,0.000067937544,0.0000066382663],"category_scores_gemma":[0.00009085724,0.00012418428,0.000056207056,0.00041040248,0.000024634543,0.00037869293,0.00015677648,0.00013433654,0.000030501893],"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.00045855503,0.00036545328,0.008542955,0.0010013285,0.00035307484,0.00013673726,0.015409467,0.0012923143,0.027427062,0.50568235,0.37832585,0.06100483],"study_design_scores_gemma":[0.0015807999,0.0024762272,0.00046303327,0.00024497273,0.00004548239,0.00010888181,0.0002949585,0.7472749,0.08264896,0.0017380733,0.1617363,0.0013874235],"about_ca_topic_score_codex":0.00019346616,"about_ca_topic_score_gemma":0.000044343975,"teacher_disagreement_score":0.7521362,"about_ca_system_score_codex":0.000043406522,"about_ca_system_score_gemma":0.00007333046,"threshold_uncertainty_score":0.5064088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051179165,0.00019437526,0.98533773,0.0008253411,0.0030230302,0.0020401196,0.000008545218,0.0021032465,0.0013496712],"genre_scores_gemma":[0.067583025,0.00008904775,0.9280387,0.0002871842,0.00020107417,0.0009382805,0.00008907722,0.000050774423,0.002722797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971202,0.00018306896,0.00052553107,0.0014083916,0.00036239342,0.0004004283],"domain_scores_gemma":[0.996683,0.00024321052,0.00050247787,0.0014418762,0.0010441594,0.000085286345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007697638,0.0004178604,0.00045536036,0.00032646305,0.00019082677,0.00057491724,0.0011633874,0.0005479057,0.000018862422],"category_scores_gemma":[0.0006337143,0.0004234067,0.0002996502,0.0003421405,0.00004447515,0.0004692879,0.0014498556,0.00065111154,0.0000130388835],"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.00025097356,0.0025720964,0.0036527144,0.0028196631,0.0010205846,0.00012990255,0.035514645,0.0066685285,0.009728258,0.046778664,0.11205877,0.7788052],"study_design_scores_gemma":[0.0007563502,0.00027385072,0.00058413483,0.0012848502,0.0000847532,0.000068596084,0.00057309284,0.84844303,0.12709421,0.01591806,0.0033973858,0.0015216938],"about_ca_topic_score_codex":0.0005303282,"about_ca_topic_score_gemma":0.001131725,"teacher_disagreement_score":0.8417745,"about_ca_system_score_codex":0.00033627232,"about_ca_system_score_gemma":0.00042172716,"threshold_uncertainty_score":0.9998218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27275887,0.0005616458,0.713997,0.00036687852,0.0016995465,0.0003571961,0.000002980952,0.0005520737,0.009703817],"genre_scores_gemma":[0.8513074,0.00014510934,0.14833958,0.000032710996,0.000034531575,0.000023188752,0.000016067039,0.000014348323,0.0000870867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978592,0.00016410407,0.00060634,0.0007399344,0.00033775365,0.00029267813],"domain_scores_gemma":[0.99783003,0.00043052892,0.00043954828,0.0010031704,0.00024218281,0.000054548538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004934365,0.00026349394,0.00048176022,0.00031864495,0.000045370096,0.00016413021,0.0013444014,0.0003203256,0.000035936413],"category_scores_gemma":[0.0002850024,0.00028161192,0.00013406479,0.00043373226,0.00003397901,0.00029942303,0.0017233652,0.0005888796,0.0000031592006],"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.0006193452,0.0014807986,0.20934567,0.0039224452,0.00075076503,0.00078674365,0.04215962,0.09700909,0.050591893,0.2883084,0.0029786672,0.30204654],"study_design_scores_gemma":[0.0020714677,0.00025726252,0.020956581,0.0022473347,0.00005268403,0.000010136604,0.00064722117,0.8325128,0.106221676,0.032592986,0.00021085287,0.0022190255],"about_ca_topic_score_codex":0.0023938231,"about_ca_topic_score_gemma":0.0019280104,"teacher_disagreement_score":0.7355037,"about_ca_system_score_codex":0.00018116583,"about_ca_system_score_gemma":0.00030788887,"threshold_uncertainty_score":0.9999636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5086683,0.00086665497,0.46253186,0.004527845,0.0027635496,0.0024138785,0.000029426206,0.0074825548,0.010715892],"genre_scores_gemma":[0.8987976,0.00014857893,0.09252409,0.00072268135,0.00023345165,0.00022912477,0.0007747865,0.0001971765,0.0063725156],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99594915,0.00029433728,0.00059508,0.0014871068,0.00094622176,0.00072812143],"domain_scores_gemma":[0.9966477,0.00042298215,0.000764315,0.0014026351,0.0004600065,0.0003023345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005032502,0.0009071599,0.0011311254,0.00031508508,0.00031514393,0.00050522987,0.0022232388,0.00044119736,0.00009280974],"category_scores_gemma":[0.00017523461,0.00081759196,0.00019075898,0.0008334272,0.00010258712,0.0003413635,0.00026845498,0.0010157775,0.00020934522],"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.0041213552,0.0024358134,0.0031841309,0.005999188,0.0036052126,0.0030197466,0.22266696,0.003538825,0.43557024,0.22332467,0.05848066,0.034053206],"study_design_scores_gemma":[0.0057880078,0.0059916023,0.020900732,0.007836592,0.0012654861,0.0002224907,0.008790856,0.32386604,0.57833225,0.012965735,0.02146628,0.012573931],"about_ca_topic_score_codex":0.0028551307,"about_ca_topic_score_gemma":0.004966996,"teacher_disagreement_score":0.39012927,"about_ca_system_score_codex":0.00021799226,"about_ca_system_score_gemma":0.00051988725,"threshold_uncertainty_score":0.9994275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5156669,0.000995697,0.39715394,0.08210707,0.0006321582,0.00030023552,0.0000034141576,0.0016527851,0.00148778],"genre_scores_gemma":[0.9709242,0.00009439152,0.027890855,0.00097655976,0.000070583934,0.0000029316607,3.121838e-7,0.000014360378,0.000025782982],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854773,0.000089995745,0.00055608124,0.00029956602,0.00018924207,0.000317401],"domain_scores_gemma":[0.9984633,0.00011825251,0.0005777457,0.00031138363,0.00037068236,0.00015863855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119812,0.00019356885,0.0004889176,0.00041102653,0.00010525645,0.00008283451,0.0011787821,0.00022655868,0.00001367413],"category_scores_gemma":[0.00047008993,0.00016176232,0.00007389272,0.00085558736,0.00024347246,0.00039418222,0.00032599148,0.0006605659,0.000015004621],"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.00022805994,0.0003719165,0.003295987,0.00024967236,0.0003112957,0.0020959666,0.00383609,0.000044705095,0.71960354,0.2177715,0.02025883,0.03193245],"study_design_scores_gemma":[0.0007807154,0.001388293,0.00058671046,0.00012075791,0.000024650388,0.0012505804,0.00017774035,0.008104578,0.9121783,0.07146163,0.0035847318,0.00034130926],"about_ca_topic_score_codex":0.000006525462,"about_ca_topic_score_gemma":0.0000043743526,"teacher_disagreement_score":0.45525733,"about_ca_system_score_codex":0.00004818544,"about_ca_system_score_gemma":0.0000876497,"threshold_uncertainty_score":0.6596476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06475564,0.0009971736,0.92048085,0.011519583,0.00090753194,0.00039008353,0.00015124447,0.00055516395,0.00024272368],"genre_scores_gemma":[0.8978459,0.00039251262,0.100297,0.0005898256,0.0000537434,0.00010981171,0.00067318924,0.000024369743,0.0000136151075],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749744,0.00056071783,0.0007140945,0.0005825322,0.00035827348,0.00028693076],"domain_scores_gemma":[0.9918036,0.0007519499,0.00092896627,0.0058045,0.0006359376,0.00007508452],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005358012,0.0003101036,0.00046438456,0.0002306371,0.0003830565,0.00032404767,0.0056459564,0.00024977818,0.0000067442284],"category_scores_gemma":[0.00024501825,0.00038264433,0.00021794932,0.0006422884,0.00026459008,0.00037651503,0.0033803678,0.0010977054,0.0000034382222],"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.00006316859,0.0025251105,0.10776685,0.0039109667,0.0023592026,0.00017335358,0.049974184,0.068907216,0.47610733,0.04971548,0.14194436,0.09655277],"study_design_scores_gemma":[0.00080773945,0.0001028542,0.0065571573,0.005698332,0.0003025737,0.00008181921,0.0008420619,0.7322429,0.23856907,0.0032577391,0.008058407,0.0034793876],"about_ca_topic_score_codex":0.002513372,"about_ca_topic_score_gemma":0.0013929819,"teacher_disagreement_score":0.8330903,"about_ca_system_score_codex":0.0005017583,"about_ca_system_score_gemma":0.00038977264,"threshold_uncertainty_score":0.99986255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048566805,0.000034498946,0.9846553,0.007983615,0.00006975032,0.0005551098,0.000020931473,0.00071796484,0.0011061138],"genre_scores_gemma":[0.785013,0.000028301747,0.21427602,0.00049879245,0.000012502787,0.00012878767,0.000008999861,0.000023143337,0.000010451756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845886,0.0003017704,0.00029811164,0.00045492308,0.00025456687,0.00023177809],"domain_scores_gemma":[0.9975376,0.000584136,0.00021410019,0.0013843476,0.00012897748,0.00015083917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030549994,0.00023590247,0.00021290619,0.00022371676,0.0009965125,0.0002517668,0.0010269278,0.00010003217,0.00000404622],"category_scores_gemma":[0.000033339973,0.00022969999,0.000057687557,0.00071374286,0.0001396461,0.0006180656,0.000014772664,0.00070047786,0.000004066221],"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.0007716137,0.0029203487,0.004444648,0.0007437695,0.000512162,0.00001622546,0.054412972,0.32703462,0.038186736,0.04327975,0.00021344256,0.52746373],"study_design_scores_gemma":[0.0003786306,0.0002629677,0.00027258293,0.0001375021,0.0000313602,0.0000058448295,0.00009934281,0.9830301,0.015259504,0.00020436091,0.000050554787,0.0002672566],"about_ca_topic_score_codex":0.0002809526,"about_ca_topic_score_gemma":0.0009912493,"teacher_disagreement_score":0.7801563,"about_ca_system_score_codex":0.00014909625,"about_ca_system_score_gemma":0.0001077602,"threshold_uncertainty_score":0.9366894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039806176,0.000083460895,0.9295555,0.0014671509,0.0022439624,0.00079675106,0.00004409395,0.0058979187,0.020104986],"genre_scores_gemma":[0.89634174,0.000052470794,0.10196725,0.0007731903,0.000105449624,0.00007748361,0.000027657628,0.00006505904,0.00058967463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629754,0.00023061567,0.00067555066,0.0015184511,0.0006390671,0.00063876045],"domain_scores_gemma":[0.99588794,0.0008791472,0.0006669381,0.001991346,0.00037224157,0.00020237247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007493018,0.0006490096,0.00072565797,0.00039044843,0.00024286703,0.00042420416,0.0027701159,0.00054438866,0.000106692314],"category_scores_gemma":[0.00053788436,0.00053318526,0.00024889642,0.00030739102,0.00014079708,0.00018149604,0.0022458523,0.000968605,0.000055205594],"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.000082651335,0.00039648195,0.0029821089,0.0003400653,0.00049617654,0.00012860076,0.002013076,0.00013942823,0.04921729,0.7622181,0.03907826,0.14290775],"study_design_scores_gemma":[0.0025559915,0.0012138037,0.000509927,0.004685958,0.00011063356,0.0002171638,0.00016898141,0.369607,0.2756227,0.33577913,0.0034860799,0.006042615],"about_ca_topic_score_codex":0.0007312523,"about_ca_topic_score_gemma":0.00023923589,"teacher_disagreement_score":0.8565356,"about_ca_system_score_codex":0.00019860578,"about_ca_system_score_gemma":0.0003109362,"threshold_uncertainty_score":0.999712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031975854,0.00019834802,0.9660076,0.0003390735,0.00042998142,0.0002677072,0.000021984402,0.0004677617,0.00029172536],"genre_scores_gemma":[0.6529186,0.000043665586,0.34689346,0.000024523306,0.000006310957,0.000044577126,0.000010241697,0.000013681012,0.00004494895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842983,0.00025597206,0.0005592733,0.00030437508,0.00027266666,0.00017786768],"domain_scores_gemma":[0.9961693,0.00032438463,0.0002920727,0.0027687075,0.00038806658,0.000057437323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036821218,0.0001516563,0.00022584354,0.0002135822,0.00046741017,0.00009616925,0.0010349347,0.000109958535,0.000008513382],"category_scores_gemma":[0.000042089618,0.00018088253,0.00009875775,0.0009260097,0.000073594034,0.00054854614,0.00001850689,0.00033582788,0.000009381643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070611827,0.00047027593,0.000082994324,0.000066585075,0.000063276486,0.0000016775979,0.0011640639,0.9243986,0.04286679,0.007491877,0.000025009922,0.02336178],"study_design_scores_gemma":[0.0001360017,0.000025053068,0.00023060181,0.00014408866,0.00002816683,0.000035034955,0.00011063746,0.97071266,0.027585927,0.0007739449,0.00005752624,0.0001603386],"about_ca_topic_score_codex":0.00021698214,"about_ca_topic_score_gemma":0.00016415498,"teacher_disagreement_score":0.6209428,"about_ca_system_score_codex":0.00017398917,"about_ca_system_score_gemma":0.00019258833,"threshold_uncertainty_score":0.73761755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015971893,0.000007760949,0.97175485,0.0006432872,0.000026145393,0.00006553865,4.9424113e-8,0.0005514405,0.010979019],"genre_scores_gemma":[0.7079568,0.0000022514052,0.29184353,0.00013493694,0.0000073789033,0.0000015159383,3.022709e-7,0.0000026240257,0.000050677292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994879,0.000022427925,0.00011547363,0.00014018215,0.0001499392,0.00008412507],"domain_scores_gemma":[0.9996557,0.000026282805,0.000082562474,0.00013200073,0.00006495277,0.00003850285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008232168,0.000055695476,0.00008594341,0.000032707976,0.000037028076,0.000021731868,0.00023097137,0.000018354309,0.000016367585],"category_scores_gemma":[0.000039490147,0.000044598626,0.000017784036,0.00022244437,0.000032330045,0.00018159692,0.00009435272,0.000091352966,0.0000051777242],"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.00012515018,0.000049651237,0.07934145,0.0001885138,0.00012383783,0.000024719315,0.010229905,0.027343784,0.06718815,0.6678523,0.0016540877,0.14587848],"study_design_scores_gemma":[0.0004573987,0.0027330758,0.0007863612,0.000080687605,0.000012114497,0.00006404136,0.00077451597,0.4212247,0.56904894,0.0012528122,0.0031678947,0.00039743815],"about_ca_topic_score_codex":0.00006018443,"about_ca_topic_score_gemma":0.000003894706,"teacher_disagreement_score":0.6919849,"about_ca_system_score_codex":0.0000110726305,"about_ca_system_score_gemma":0.000028795155,"threshold_uncertainty_score":0.18186793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010983649,0.00010029698,0.9846182,0.0015025013,0.00020519247,0.0002226172,0.000049530736,0.00032970455,0.0019883325],"genre_scores_gemma":[0.61877584,0.0002271829,0.38083768,0.000042748445,0.000003775092,0.00003410128,0.0000064749793,0.000011920194,0.000060269955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841774,0.00033082085,0.0005806854,0.00027223217,0.000232692,0.00016584904],"domain_scores_gemma":[0.99480367,0.00078332704,0.00030878044,0.0035141313,0.0005300978,0.000059984573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038416282,0.00015413096,0.000311017,0.00024698395,0.0002632209,0.00003840607,0.0019716546,0.000111903355,0.000045063392],"category_scores_gemma":[0.000068265836,0.00018013972,0.00015905489,0.0008564145,0.00025506158,0.00022681711,0.00004155895,0.00035487412,0.000009080644],"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.00007709187,0.0036904728,0.00023279572,0.00025567462,0.0007180246,0.000013502826,0.00825517,0.017828368,0.79761183,0.045070946,0.00038541137,0.1258607],"study_design_scores_gemma":[0.00068719377,0.00020828324,0.0003267477,0.00037817942,0.00010555382,0.00010955612,0.00019038797,0.41249183,0.57733,0.0076331715,0.00017874278,0.0003603215],"about_ca_topic_score_codex":0.00035202483,"about_ca_topic_score_gemma":0.0012596,"teacher_disagreement_score":0.6077922,"about_ca_system_score_codex":0.00006115996,"about_ca_system_score_gemma":0.00033886454,"threshold_uncertainty_score":0.73458844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004564197,0.00024462244,0.99119246,0.0011837162,0.00015354411,0.00020036395,0.000017666229,0.0005028848,0.0019405456],"genre_scores_gemma":[0.5790243,0.0002711125,0.42047608,0.000057582478,0.000002463265,0.000055786742,0.000006539133,0.000013171209,0.000092957984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985792,0.00024311297,0.00036094157,0.00032831103,0.00026912332,0.0002192942],"domain_scores_gemma":[0.99595904,0.00053865684,0.00018454967,0.0027722158,0.00048049638,0.000065025924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859206,0.00016416084,0.0002132245,0.00026809564,0.0005750739,0.00009434707,0.0014494391,0.00008521998,0.000022550208],"category_scores_gemma":[0.00003140039,0.00016889971,0.00007675491,0.0015920985,0.00013095471,0.0004522036,0.00002735159,0.0004071099,0.000015487092],"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.00012255333,0.008093519,0.0013467559,0.00045379074,0.00091889815,0.000027941796,0.0061002015,0.12572202,0.2170247,0.33540818,0.00025771078,0.30452374],"study_design_scores_gemma":[0.0006365866,0.00021064977,0.0004123653,0.0005299335,0.00012246166,0.000098870914,0.0003306039,0.7085892,0.28282624,0.0050818515,0.0006313874,0.0005298126],"about_ca_topic_score_codex":0.00008925661,"about_ca_topic_score_gemma":0.00045510838,"teacher_disagreement_score":0.5828672,"about_ca_system_score_codex":0.0001439465,"about_ca_system_score_gemma":0.00029282706,"threshold_uncertainty_score":0.688753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027145648,0.0018794285,0.9497527,0.0033068492,0.00011871201,0.00009875293,0.000005535311,0.0005822799,0.017110115],"genre_scores_gemma":[0.6029483,0.00020679658,0.39662066,0.00011317384,0.0000046011087,0.000012967944,0.0000049313608,0.000004789758,0.00008375691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991613,0.0001592431,0.00024011898,0.00017284711,0.00013168459,0.00013478311],"domain_scores_gemma":[0.9959962,0.00040443457,0.00012529605,0.0031322902,0.0003049905,0.000036826925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002581651,0.000077394754,0.0001406692,0.00007129182,0.00018769277,0.000054795295,0.002270635,0.000045591394,0.000011287041],"category_scores_gemma":[0.00028794268,0.00008791793,0.000065414846,0.0005528078,0.00008428932,0.00025084338,0.0012772672,0.00018488459,0.000013127184],"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.0000013609628,0.0002886783,0.002119359,0.00002920677,0.00004950852,0.0000022878412,0.0032010542,0.0000106439575,0.46211067,0.48563695,0.0014179145,0.045132376],"study_design_scores_gemma":[0.00011629993,0.000026884196,0.00079830404,0.00011680125,0.0000092336495,0.00001572372,0.000224213,0.012897619,0.96225905,0.010483863,0.012852636,0.00019933909],"about_ca_topic_score_codex":0.00004690642,"about_ca_topic_score_gemma":0.00016490577,"teacher_disagreement_score":0.5758027,"about_ca_system_score_codex":0.000031998174,"about_ca_system_score_gemma":0.0001256833,"threshold_uncertainty_score":0.42194423},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042779345,0.0002246847,0.9860917,0.007950528,0.00039960007,0.00035353738,0.00003844,0.0010089461,0.0035047955],"genre_scores_gemma":[0.50276047,0.0002762136,0.49487555,0.00063274126,0.000010526724,0.00044259496,0.0000112843945,0.000023444845,0.00096717104],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851227,0.00022713302,0.00035770412,0.0004057481,0.0002040319,0.00029313547],"domain_scores_gemma":[0.9946546,0.0010340643,0.00011086465,0.003693188,0.00040083122,0.00010643286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034029724,0.00018911748,0.00022910451,0.00017220774,0.00084725633,0.00017090734,0.002267023,0.00010954914,0.00003948687],"category_scores_gemma":[0.000058672602,0.00021576537,0.00024270103,0.00068288826,0.0001117669,0.00036000944,0.00002586667,0.0003960881,0.000049958708],"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.00025293825,0.010155557,0.00019862049,0.0003714235,0.0014474515,0.0000347706,0.0179216,0.017404046,0.20577526,0.21771409,0.041262195,0.48746204],"study_design_scores_gemma":[0.0015917417,0.00021318703,0.000095736905,0.00022350089,0.00015011159,0.00012094152,0.00050376076,0.31613627,0.60885453,0.01648132,0.05464094,0.0009879327],"about_ca_topic_score_codex":0.000059340804,"about_ca_topic_score_gemma":0.0009525349,"teacher_disagreement_score":0.5023327,"about_ca_system_score_codex":0.0001255548,"about_ca_system_score_gemma":0.00027542977,"threshold_uncertainty_score":0.87986565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51101863,0.0001610646,0.48036918,0.0006382435,0.001413616,0.0015856533,0.000057313806,0.002884657,0.0018716112],"genre_scores_gemma":[0.8038541,0.000014914408,0.19532369,0.0003271156,0.00013846268,0.00016082397,0.000026270916,0.000044717322,0.000109919136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965382,0.00025318938,0.00065138127,0.0011656751,0.0005321256,0.00085939944],"domain_scores_gemma":[0.9972168,0.0002179051,0.00055003946,0.0011747011,0.0005557272,0.00028478424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075810496,0.0005068488,0.00062606245,0.00019150415,0.0005742567,0.00023163349,0.0015830304,0.00031842498,0.0000282609],"category_scores_gemma":[0.00035146458,0.0005176773,0.00025330944,0.00055358786,0.00058427587,0.00077123794,0.00054476334,0.0005261337,0.000063042506],"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.0012992632,0.009234253,0.17751527,0.0027613125,0.0007101927,0.00029879474,0.03300401,0.0000050793974,0.038332053,0.38203847,0.16039535,0.19440596],"study_design_scores_gemma":[0.0026512654,0.0019817348,0.019781457,0.00062823016,0.00014586975,0.0005625597,0.0007550768,0.016975967,0.837161,0.11314035,0.0034750667,0.0027413936],"about_ca_topic_score_codex":0.0009500113,"about_ca_topic_score_gemma":0.00035212396,"teacher_disagreement_score":0.79882896,"about_ca_system_score_codex":0.00017891466,"about_ca_system_score_gemma":0.0001436889,"threshold_uncertainty_score":0.9997275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028358428,0.0011022183,0.93335974,0.0018383053,0.0036346999,0.0017300944,0.000043839955,0.0037546216,0.02617807],"genre_scores_gemma":[0.97736114,0.00003765232,0.016497795,0.00020663916,0.0010869645,0.00017460673,0.000020935708,0.00010539071,0.0045088697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940093,0.00086068077,0.0010065164,0.0016035072,0.0012960307,0.0012239406],"domain_scores_gemma":[0.99659085,0.00028173698,0.00060763815,0.001727925,0.0005732069,0.00021863109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002088933,0.00077497703,0.00067653495,0.00045966965,0.00075174845,0.0007327934,0.0018179051,0.000668332,0.00014781517],"category_scores_gemma":[0.00031152373,0.00082502706,0.00034527556,0.0014771754,0.00018932561,0.0010737493,0.0006710456,0.0012842942,0.0006597727],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035955705,0.0035369906,0.03219713,0.0016629758,0.00037530574,0.0014665787,0.008034275,0.0049670087,0.051135574,0.16340971,0.06425163,0.66860324],"study_design_scores_gemma":[0.003487287,0.0035899826,0.027154844,0.003158069,0.00042425137,0.0013231955,0.0008917526,0.58339924,0.13720854,0.19648507,0.0351356,0.0077421414],"about_ca_topic_score_codex":0.0065626134,"about_ca_topic_score_gemma":0.0034241737,"teacher_disagreement_score":0.94900274,"about_ca_system_score_codex":0.00048077753,"about_ca_system_score_gemma":0.00048996427,"threshold_uncertainty_score":0.99942005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20220195,0.00072829047,0.78078544,0.013122799,0.00086436403,0.00052086584,0.000056675806,0.00093041133,0.00078919233],"genre_scores_gemma":[0.6721863,0.00019019644,0.3257408,0.0014728894,0.000016584765,0.0001719603,0.00016104282,0.000026563557,0.00003362984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674094,0.000787247,0.00088004005,0.000781797,0.00046366622,0.00034630683],"domain_scores_gemma":[0.9858979,0.0005474388,0.0008277031,0.0122325225,0.0003920899,0.000102368285],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00078261184,0.0003567761,0.0008658942,0.0011326486,0.00023982902,0.0003038172,0.0100929905,0.00030632614,0.000022253376],"category_scores_gemma":[0.00018798003,0.00044432757,0.00064145186,0.002448295,0.00028517077,0.00025711802,0.0048644813,0.001243826,0.000010426025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058323392,0.004225496,0.028299786,0.0012992263,0.035854794,0.00016315849,0.06737951,0.3985132,0.2821602,0.0062830956,0.11085317,0.064910054],"study_design_scores_gemma":[0.00031197033,0.000040904713,0.009718689,0.0004825151,0.0020445767,0.000011977162,0.0004414891,0.9701845,0.01272144,0.0003679875,0.002258544,0.0014154279],"about_ca_topic_score_codex":0.0018001517,"about_ca_topic_score_gemma":0.0027782104,"teacher_disagreement_score":0.5716713,"about_ca_system_score_codex":0.00025159394,"about_ca_system_score_gemma":0.00029154154,"threshold_uncertainty_score":0.99980086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05815908,0.00045244934,0.9238436,0.0014037845,0.00089532655,0.00017628926,0.0000016217883,0.0013310642,0.013736748],"genre_scores_gemma":[0.41899085,0.000045546196,0.58035904,0.00047270634,0.00004323795,0.000009633006,0.0000023246628,0.000020112984,0.00005653935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972774,0.00033525436,0.0005732342,0.0007468715,0.0005515477,0.00051570457],"domain_scores_gemma":[0.99735415,0.000452235,0.0002622424,0.0012225162,0.0005039415,0.00020492707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012624437,0.0002468397,0.00043128282,0.00009880183,0.00019682903,0.0003150911,0.00084697874,0.00014111033,0.00013843706],"category_scores_gemma":[0.001386321,0.0002441797,0.00016218472,0.0009967071,0.00006060877,0.0012239608,0.0007662987,0.00041295393,0.000026034046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018714525,0.0007937762,0.0056932606,0.00022785552,0.000085272215,0.0003405364,0.0052969065,0.00005247089,0.0107280165,0.07854188,0.0021946654,0.8960267],"study_design_scores_gemma":[0.00073381985,0.000817159,0.0026471699,0.00071500905,0.00008462501,0.002193146,0.0026098345,0.37368098,0.5556422,0.054707557,0.0046998924,0.0014685944],"about_ca_topic_score_codex":0.00035972998,"about_ca_topic_score_gemma":0.00042491546,"teacher_disagreement_score":0.8945581,"about_ca_system_score_codex":0.000100635356,"about_ca_system_score_gemma":0.0007796526,"threshold_uncertainty_score":0.995736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02004589,0.00006822304,0.97599316,0.0013232117,0.0003427701,0.00022777976,0.0000014699025,0.00093826244,0.0010592442],"genre_scores_gemma":[0.263563,0.0000048053985,0.7354053,0.00051168044,0.000057745274,0.00001951816,0.0000023353552,0.000016321557,0.00041929155],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998577,0.000035274046,0.00020002174,0.0005944247,0.0002708256,0.00032244917],"domain_scores_gemma":[0.9983102,0.0005864115,0.00006999401,0.0007378303,0.00021755089,0.00007799497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026734074,0.00017415662,0.00021558622,0.00009127728,0.00018479991,0.00022775737,0.00060582545,0.000075411386,0.00002065544],"category_scores_gemma":[0.00020740004,0.0001293865,0.00007712729,0.00047953427,0.000026898679,0.00026295224,0.00028467568,0.00016271304,0.000008267196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007227837,0.00010343881,0.00068692997,0.00004761037,0.000041011866,0.00009631137,0.0010059093,0.00075434154,0.0073169507,0.053253938,0.0109169865,0.9257043],"study_design_scores_gemma":[0.002807501,0.001163676,0.0009211275,0.0005104047,0.000047655678,0.0008993598,0.00016014674,0.054333314,0.63611174,0.2641937,0.03740861,0.0014427715],"about_ca_topic_score_codex":0.00003475414,"about_ca_topic_score_gemma":0.00043276258,"teacher_disagreement_score":0.9242615,"about_ca_system_score_codex":0.000042388863,"about_ca_system_score_gemma":0.00011734455,"threshold_uncertainty_score":0.5276229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009580839,0.00048929563,0.9836606,0.00056756823,0.0026118285,0.00043171673,0.00003344435,0.0012205025,0.0014041967],"genre_scores_gemma":[0.94711715,0.000077492616,0.04943842,0.0002964573,0.0001332653,0.00018547791,0.000013592205,0.00004369295,0.0026944247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705124,0.00041159114,0.00063316984,0.0008735617,0.00051891356,0.00051154656],"domain_scores_gemma":[0.9982048,0.00026885665,0.00018865422,0.0007998647,0.00035388352,0.00018391346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068501814,0.00037514,0.000411318,0.00032238392,0.0005652748,0.00053567387,0.0004783014,0.0002634552,0.000040404935],"category_scores_gemma":[0.00004221313,0.0003531475,0.000198562,0.00075401727,0.00005473315,0.0007035817,0.000010294332,0.0007405487,0.00005660731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048458693,0.004312512,0.0012593801,0.0015056566,0.0009960057,0.000568446,0.04831785,0.33369172,0.2453638,0.019542508,0.03228638,0.31167114],"study_design_scores_gemma":[0.0015057928,0.0004281678,0.0001820128,0.0011807131,0.00008989223,0.0008243474,0.0032792133,0.5154331,0.4574109,0.0017931742,0.016307212,0.0015654865],"about_ca_topic_score_codex":0.00014098003,"about_ca_topic_score_gemma":0.00063495897,"teacher_disagreement_score":0.93753636,"about_ca_system_score_codex":0.00016582455,"about_ca_system_score_gemma":0.00015422568,"threshold_uncertainty_score":0.99989206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288704,0.000008797083,0.9328735,0.0028881938,0.000098011995,0.0003381464,0.000006747694,0.0005163576,0.00038323438],"genre_scores_gemma":[0.667803,0.0000016231818,0.331021,0.0010961929,0.000024172008,0.00001742594,0.000003232548,0.000006669692,0.000026663376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910474,0.000034046654,0.00024927023,0.00028934184,0.00015846486,0.00016415348],"domain_scores_gemma":[0.9991642,0.00016428501,0.00012060306,0.00027354277,0.0002123829,0.000064992026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024142444,0.000096064,0.0001592602,0.00003743777,0.0000590784,0.000043477332,0.0004529076,0.000035086603,0.00003692142],"category_scores_gemma":[0.0001116141,0.00009156451,0.000072816205,0.00018468306,0.000016609636,0.00031074803,0.0002130902,0.000059185208,0.000009350072],"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.00016648091,0.00035779987,0.056643296,0.0013917551,0.00025613396,0.000023796538,0.036976833,0.00019864063,0.15438624,0.27161816,0.18179896,0.29618192],"study_design_scores_gemma":[0.00041160505,0.00031389587,0.0034334897,0.000023593857,0.000015997372,0.000004197114,0.00061145803,0.05949687,0.9304615,0.0041670906,0.0008309672,0.00022928276],"about_ca_topic_score_codex":0.00014015049,"about_ca_topic_score_gemma":0.00020922124,"teacher_disagreement_score":0.7760753,"about_ca_system_score_codex":0.000025263638,"about_ca_system_score_gemma":0.000052296225,"threshold_uncertainty_score":0.37338924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05478647,0.0031140922,0.7083056,0.22713,0.002580723,0.0002846001,6.3407157e-7,0.000109131004,0.0036887373],"genre_scores_gemma":[0.9664184,0.0011339122,0.021632114,0.010061611,0.00016959362,0.0000045557326,2.4811106e-7,0.000008334708,0.00057124934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987775,0.00012567523,0.00036355146,0.000121951845,0.00042700398,0.00018430539],"domain_scores_gemma":[0.99887484,0.00034463606,0.0004708047,0.00019330278,0.00007242806,0.000043972646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016759167,0.000091938884,0.00012121389,0.00014454192,0.00022642332,0.00024698765,0.0010861199,0.000016518763,0.000006168575],"category_scores_gemma":[0.000039597082,0.000053614887,0.000048265014,0.000095915515,0.000028885588,0.00022856095,0.00029024514,0.00024367074,0.0000045635397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008406409,0.0002124651,0.003414559,0.00012749742,0.0008823915,0.00033272657,0.026855532,0.0022083549,0.000360054,0.12716259,0.08110579,0.757254],"study_design_scores_gemma":[0.0023669188,0.0011507772,0.058005415,0.004494838,0.000120463774,0.0041913847,0.0062371483,0.27307272,0.0016817512,0.033478785,0.61411566,0.0010841438],"about_ca_topic_score_codex":0.000023920125,"about_ca_topic_score_gemma":0.0000020895695,"teacher_disagreement_score":0.9116319,"about_ca_system_score_codex":0.00008905638,"about_ca_system_score_gemma":0.00001170935,"threshold_uncertainty_score":0.23817076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17333353,0.00009975601,0.8244504,0.0011346297,0.00015119312,0.00022895439,0.00003325588,0.0004406738,0.0001276239],"genre_scores_gemma":[0.92527616,0.00016147313,0.07423339,0.0001502905,0.00000929009,0.00010062802,0.0000076089273,0.0000149239495,0.000046246354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826604,0.00023940596,0.00038276453,0.00056220754,0.00026986716,0.0002797355],"domain_scores_gemma":[0.9965026,0.00024924605,0.00014984387,0.0027532533,0.00023289348,0.000112161426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029631957,0.00022392515,0.00031332005,0.00034907917,0.00084572507,0.00021815542,0.0012205871,0.00011261913,0.000020751975],"category_scores_gemma":[0.000016389418,0.00023991472,0.00017877136,0.0017489861,0.00015134602,0.00043043905,0.00006090258,0.0005548949,0.0000018218391],"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.00008291653,0.0029552155,0.0033641162,0.00036565916,0.0029749512,0.000030105011,0.014239844,0.026967566,0.33414593,0.028223993,0.00010164915,0.58654803],"study_design_scores_gemma":[0.00048504403,0.00027710112,0.004319968,0.0001927215,0.0005638491,0.000045813238,0.00043227448,0.6204231,0.36566278,0.0065960824,0.00015530504,0.0008460069],"about_ca_topic_score_codex":0.00023195634,"about_ca_topic_score_gemma":0.0033350976,"teacher_disagreement_score":0.75194263,"about_ca_system_score_codex":0.00018436325,"about_ca_system_score_gemma":0.00011043859,"threshold_uncertainty_score":0.97834384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005277789,0.00029599038,0.9817463,0.0016666856,0.000932263,0.00093955424,0.000016918473,0.0020420016,0.007082457],"genre_scores_gemma":[0.46533883,0.00003935098,0.53325444,0.00031837102,0.00006438622,0.00037064392,0.000107896354,0.000029830735,0.00047625977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975084,0.00020942924,0.0005939023,0.00095795083,0.00032761652,0.00040271512],"domain_scores_gemma":[0.993057,0.0006575025,0.00021087048,0.0053456915,0.00061363715,0.00011529136],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008942808,0.0003730208,0.0005046662,0.00018713457,0.00027937678,0.0008618191,0.005656058,0.000339755,0.000014773111],"category_scores_gemma":[0.00022478808,0.00039962004,0.0003495828,0.00027355683,0.000092267815,0.00023440261,0.00823249,0.00079111155,0.0000071127524],"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.00009436063,0.003873992,0.008647876,0.004402712,0.0022665942,0.00016389736,0.04595941,0.003182888,0.114631325,0.31146523,0.09212155,0.4131902],"study_design_scores_gemma":[0.00038994392,0.00024728116,0.0002656276,0.0017301418,0.0001604146,0.00007317366,0.0012010449,0.75732976,0.19118106,0.034288134,0.010394132,0.0027392863],"about_ca_topic_score_codex":0.00020052517,"about_ca_topic_score_gemma":0.00067619514,"teacher_disagreement_score":0.7541469,"about_ca_system_score_codex":0.00015724967,"about_ca_system_score_gemma":0.00034879893,"threshold_uncertainty_score":0.99984556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139083,0.00020883456,0.17600724,0.0055792374,0.00081503013,0.00015514721,0.000006851296,0.0005409742,0.0027783972],"genre_scores_gemma":[0.767079,0.00016405669,0.23229848,0.00038055127,0.00002090198,0.000020701247,0.000014410978,0.00001066655,0.000011219199],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985995,0.00026926055,0.0003623006,0.0002870264,0.0002445563,0.00023731869],"domain_scores_gemma":[0.9958559,0.00038764314,0.00012525603,0.003384077,0.0001936993,0.00005340719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039683038,0.00014222559,0.00021010576,0.00013682625,0.00033116565,0.00006944372,0.0029057623,0.000052952313,0.000007517008],"category_scores_gemma":[0.00007001471,0.00016902514,0.00010047496,0.00061912026,0.00030273144,0.00045653895,0.0010014758,0.00034293102,0.000012462986],"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.00006765919,0.0007152906,0.012309011,0.00016800014,0.00028521803,0.000041987736,0.0047578765,0.0015251345,0.8780636,0.025423976,0.012051052,0.0645912],"study_design_scores_gemma":[0.001046373,0.00025304974,0.008962172,0.00041800918,0.000088036984,0.00012404597,0.0003098294,0.36097702,0.61877656,0.00045133076,0.007520106,0.0010734648],"about_ca_topic_score_codex":0.000058602138,"about_ca_topic_score_gemma":0.00010808336,"teacher_disagreement_score":0.3594519,"about_ca_system_score_codex":0.00012943917,"about_ca_system_score_gemma":0.00011228956,"threshold_uncertainty_score":0.6892645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076478054,0.000042183787,0.8474434,0.008574725,0.018691316,0.0012406459,0.0005112838,0.0030115172,0.11283714],"genre_scores_gemma":[0.97114795,0.00007897395,0.012447659,0.011580049,0.00056531554,0.0013042382,0.0013543664,0.000078372526,0.0014430688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954512,0.00049594615,0.0011327065,0.0006596464,0.0018636418,0.00039685663],"domain_scores_gemma":[0.99635583,0.00066812796,0.0011285589,0.0014692952,0.00024192515,0.00013623173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021994812,0.00054943084,0.00041629848,0.00088788616,0.00037489546,0.0008953097,0.0049199145,0.00030933743,0.00091584923],"category_scores_gemma":[0.0001883918,0.00059623696,0.0004165582,0.0004041484,0.00008128392,0.0015682735,0.0014685746,0.0016671544,0.00026202938],"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.000467081,0.0004662864,0.00031320506,0.00024406641,0.00040144342,0.000042377116,0.0078068585,0.21581194,0.001094841,0.6952833,0.049678124,0.028390497],"study_design_scores_gemma":[0.001694175,0.0007391568,0.0007182253,0.00057064777,0.00008421155,0.000091277645,0.0005783271,0.63376606,0.039778497,0.12292362,0.19632806,0.002727735],"about_ca_topic_score_codex":0.00005207846,"about_ca_topic_score_gemma":0.000004177052,"teacher_disagreement_score":0.96350014,"about_ca_system_score_codex":0.0012900123,"about_ca_system_score_gemma":0.00034483548,"threshold_uncertainty_score":0.99999744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011532203,0.0016683222,0.9734557,0.00059922616,0.003144171,0.0020550124,0.00010020361,0.000878663,0.0065664696],"genre_scores_gemma":[0.31235892,0.0003255079,0.6851173,0.00017041634,0.0005741648,0.00064890785,0.00017848834,0.00014789213,0.0004783703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99165493,0.0007568998,0.0016625267,0.002957025,0.0013566271,0.0016120089],"domain_scores_gemma":[0.99181783,0.0012843952,0.0009122847,0.0042697075,0.0013044968,0.0004112585],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.003561747,0.0011495554,0.0019695256,0.0007481251,0.00035111868,0.0010086228,0.005558607,0.0012986995,0.00009376085],"category_scores_gemma":[0.00065136194,0.0012604026,0.0012493682,0.0016642493,0.00021035883,0.0004999298,0.004666018,0.002302395,0.000012768343],"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.00025183384,0.0020132717,0.0024452256,0.0034464567,0.0013676392,0.00020325062,0.007981326,0.0119974045,0.005910509,0.0031763238,0.048049763,0.913157],"study_design_scores_gemma":[0.0017933552,0.00036044302,0.00052737194,0.003477312,0.00036892787,0.0001696948,0.0027231805,0.92124665,0.050157722,0.01441126,0.0012751046,0.003488976],"about_ca_topic_score_codex":0.00034699167,"about_ca_topic_score_gemma":0.00038151367,"teacher_disagreement_score":0.909668,"about_ca_system_score_codex":0.0004818982,"about_ca_system_score_gemma":0.0012019048,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065343514,0.000091737194,0.9120333,0.00039854823,0.00017172289,0.000028761797,2.7845996e-7,0.0004393953,0.021492718],"genre_scores_gemma":[0.6143475,0.000008307859,0.38489777,0.00010226737,0.0000023078796,0.0000014530244,2.750391e-7,0.0000028818758,0.00063720386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994073,0.000030600004,0.00013364799,0.0001907009,0.0001204148,0.00011735562],"domain_scores_gemma":[0.99931216,0.00009346679,0.000040731622,0.0004205707,0.00010797969,0.000025108602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015394037,0.000055501605,0.00010005776,0.000049543647,0.000029727391,0.000032417258,0.00038546073,0.000028995364,0.000039539176],"category_scores_gemma":[0.00008948794,0.000052299263,0.000043430297,0.00027985784,0.000015769627,0.00016012242,0.00025990666,0.000059460508,0.000011809353],"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.0000031440259,0.00019400491,0.015242053,0.00008001212,0.00004453116,0.00010324188,0.0018271102,0.0000838333,0.37481532,0.37719968,0.0038672606,0.22653984],"study_design_scores_gemma":[0.00011010563,0.00004652881,0.0026996883,0.00006846693,0.0000046909045,0.00008535338,0.00011626652,0.2203518,0.76100653,0.014442738,0.0008469739,0.00022088453],"about_ca_topic_score_codex":0.000021525815,"about_ca_topic_score_gemma":0.000095402276,"teacher_disagreement_score":0.549004,"about_ca_system_score_codex":0.00002233196,"about_ca_system_score_gemma":0.000054396154,"threshold_uncertainty_score":0.2132702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64655876,0.00008793276,0.3500914,0.00023713839,0.0009214507,0.00097084563,0.000029521298,0.00062541704,0.00047751146],"genre_scores_gemma":[0.8311079,0.00003533638,0.16693698,0.00010702242,0.00005043731,0.000052895262,0.0006540015,0.000054722204,0.0010006668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974619,0.00012090837,0.0007614201,0.00084621797,0.00046037216,0.00034919055],"domain_scores_gemma":[0.9980343,0.000103673585,0.0007945302,0.0005828305,0.0003558584,0.0001288028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000494045,0.00046831465,0.00057352934,0.0004558964,0.00017717526,0.00025559426,0.00056997075,0.00028722355,0.00007142896],"category_scores_gemma":[0.00014767949,0.0004611075,0.00008480737,0.0003383024,0.000052368046,0.00083167024,0.00014906094,0.0002652273,0.000015544276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019200037,0.0001456971,0.0007561504,0.0026032543,0.00021451348,0.0000132040905,0.011284376,0.001296027,0.010225835,0.0052269036,0.004277929,0.96376413],"study_design_scores_gemma":[0.0023978641,0.0008794582,0.046023414,0.0011884894,0.00030078876,0.000046559737,0.0056342892,0.7177611,0.21779123,0.005830474,0.00010587984,0.0020404744],"about_ca_topic_score_codex":0.0012869706,"about_ca_topic_score_gemma":0.002903497,"teacher_disagreement_score":0.9617236,"about_ca_system_score_codex":0.000071628645,"about_ca_system_score_gemma":0.00014833902,"threshold_uncertainty_score":0.99978405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000705829,0.000055859175,0.98981416,0.0005742877,0.0016840829,0.00020999936,0.0000050378258,0.0031389531,0.003811817],"genre_scores_gemma":[0.12793307,0.00018138064,0.86898565,0.00014799602,0.000048910006,0.0000718383,0.000040517207,0.000051235722,0.0025394089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975974,0.00014730652,0.0006176684,0.0008682607,0.00046185782,0.00030753354],"domain_scores_gemma":[0.99727094,0.0002564749,0.0004978286,0.0015780192,0.000319894,0.00007686154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054093753,0.00031557636,0.00048575297,0.0004466771,0.000056711862,0.00012813072,0.002120897,0.0003828595,0.000025077466],"category_scores_gemma":[0.00017816547,0.00031574199,0.0002282455,0.00051381584,0.000052269734,0.000172711,0.0027526561,0.00032086825,0.000012542416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038503353,0.00027668994,0.00092714006,0.00048583944,0.00026330614,0.0000445724,0.0018636774,0.82872117,0.0012163379,0.07580881,0.045756515,0.044597425],"study_design_scores_gemma":[0.00012416714,0.00003942126,0.000058932008,0.00016086728,0.000014167512,0.0000034285895,0.000026680622,0.9775038,0.014147576,0.00727498,0.00028717128,0.00035883152],"about_ca_topic_score_codex":0.0020973957,"about_ca_topic_score_gemma":0.0004203163,"teacher_disagreement_score":0.14878258,"about_ca_system_score_codex":0.00008847431,"about_ca_system_score_gemma":0.00022503037,"threshold_uncertainty_score":0.9999295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07430164,0.01563472,0.9007361,0.0028733176,0.000644589,0.00010428092,0.0000017647196,0.00031038042,0.005393218],"genre_scores_gemma":[0.90646553,0.00727443,0.08584068,0.00023999602,0.000094412455,0.0000030387555,0.0000017316735,0.00001415365,0.00006605353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853724,0.00039423996,0.00042268878,0.00019327324,0.00021711076,0.00023541972],"domain_scores_gemma":[0.9973968,0.00071771524,0.00035652082,0.0011867734,0.0002442442,0.00009793554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009325236,0.00013343581,0.00024501877,0.00014730806,0.0006797589,0.00026439584,0.001334138,0.00005972999,0.0000028180107],"category_scores_gemma":[0.000047211048,0.00013153262,0.00008656529,0.00052763324,0.00008440881,0.0002894737,0.0007513763,0.00059406395,0.0000017272548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008406036,0.00015018869,0.014074899,0.000017725315,0.0000589214,0.000028239385,0.001153173,0.00012577359,0.003489006,0.037624862,0.00043687664,0.94283193],"study_design_scores_gemma":[0.0016691973,0.00081694906,0.009508546,0.005534378,0.00010826774,0.004256651,0.0010263639,0.7580217,0.04494668,0.03534993,0.13698311,0.0017782302],"about_ca_topic_score_codex":0.000009019975,"about_ca_topic_score_gemma":0.000021454964,"teacher_disagreement_score":0.9410537,"about_ca_system_score_codex":0.000046668367,"about_ca_system_score_gemma":0.00009944717,"threshold_uncertainty_score":0.5363745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002836247,0.0002659215,0.98357815,0.003871883,0.003016703,0.0009811621,0.000011864906,0.0022141947,0.0032238632],"genre_scores_gemma":[0.048636027,0.00004103104,0.9473894,0.001098388,0.00027580833,0.00023536672,0.000058623224,0.00005445122,0.0022108909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970523,0.00012802139,0.00043853288,0.0014758602,0.0003931345,0.000512137],"domain_scores_gemma":[0.99661374,0.00034882667,0.00022921061,0.002206884,0.0004918391,0.00010947302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005067211,0.00049025664,0.00060021516,0.00020268967,0.00014694162,0.0006572928,0.0023609614,0.0004893293,0.000055240555],"category_scores_gemma":[0.00028790114,0.0004446047,0.000312859,0.00039407014,0.000053245603,0.00016047613,0.0037824186,0.00096088985,0.0000064942924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009037077,0.00061239523,0.00040168778,0.00245443,0.000645212,0.0002115374,0.0077283992,0.0055590984,0.002402643,0.059139658,0.18102066,0.7397339],"study_design_scores_gemma":[0.0029958524,0.0008782734,0.0011684124,0.0025516904,0.00029812046,0.00043841221,0.0002262971,0.09645731,0.14430897,0.6286538,0.11450324,0.0075195725],"about_ca_topic_score_codex":0.00046096538,"about_ca_topic_score_gemma":0.0006512412,"teacher_disagreement_score":0.73221433,"about_ca_system_score_codex":0.00009519068,"about_ca_system_score_gemma":0.00038429216,"threshold_uncertainty_score":0.99980056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009942371,0.000011400821,0.9855671,0.00015485588,0.00044922007,0.00010058412,0.000027509797,0.0004359764,0.0033109721],"genre_scores_gemma":[0.9709573,0.000013274835,0.028260596,0.00050681975,0.0000048628112,0.000029779436,0.000010530004,0.000006016188,0.00021086057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987341,0.00015800392,0.00047234347,0.00016074756,0.00030391142,0.00017088516],"domain_scores_gemma":[0.9985656,0.00021614238,0.00020291551,0.0006832607,0.00027041382,0.000061629755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482463,0.00013105675,0.00022980465,0.0007879968,0.000141413,0.00008020951,0.00043143434,0.000099078745,0.000219171],"category_scores_gemma":[0.000037458074,0.000135881,0.0002348912,0.0019789306,0.000042014035,0.0014961675,0.0000043662835,0.00020587695,0.00007721913],"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.0001437661,0.00043197314,0.00004434005,0.00011374554,0.0019649272,0.00000783393,0.019518761,0.44578254,0.0034821928,0.05367753,0.000660861,0.47417152],"study_design_scores_gemma":[0.0005100912,0.00012924976,0.0005074906,0.00005159818,0.00044629123,0.00002080182,0.0015675469,0.5687535,0.42138717,0.0051192683,0.0010632612,0.00044378542],"about_ca_topic_score_codex":0.000023548513,"about_ca_topic_score_gemma":0.00005479793,"teacher_disagreement_score":0.96101487,"about_ca_system_score_codex":0.00006808153,"about_ca_system_score_gemma":0.00011837078,"threshold_uncertainty_score":0.55410665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006289161,0.00007009749,0.98473483,0.0005833064,0.0002534259,0.000501298,0.0000013695443,0.00059654575,0.006969945],"genre_scores_gemma":[0.5148416,0.0000054810184,0.48276642,0.0005896445,0.000043128613,0.00007894469,0.0000012777793,0.000015650961,0.0016578236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849707,0.00003335421,0.00017843004,0.00063718745,0.00023469384,0.00041927057],"domain_scores_gemma":[0.99887925,0.00021931248,0.00005970796,0.0004258538,0.0002548447,0.00016104245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058960874,0.00016868462,0.0002185367,0.00035378244,0.00012680971,0.00033991833,0.00040813434,0.000044680284,9.3110833e-7],"category_scores_gemma":[0.00014538343,0.0001427089,0.00003644721,0.0017017311,0.000018031285,0.00031967746,0.0003701693,0.00010515547,0.0000028574468],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001709934,0.0009756273,0.0021568874,0.0007632059,0.0002747679,0.0001944729,0.023838213,0.002375898,0.0071601975,0.34176594,0.023771044,0.5965527],"study_design_scores_gemma":[0.0015134467,0.0015699168,0.0005196191,0.00021358649,0.000032455348,0.0006615766,0.0009179533,0.5855649,0.38759226,0.009344161,0.0104024615,0.0016676513],"about_ca_topic_score_codex":0.000046170866,"about_ca_topic_score_gemma":0.000014999318,"teacher_disagreement_score":0.5948851,"about_ca_system_score_codex":0.00004272265,"about_ca_system_score_gemma":0.00006409396,"threshold_uncertainty_score":0.58195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22901522,0.00022303469,0.766175,0.0006671734,0.0013036133,0.00028969333,0.000006161268,0.0006326835,0.0016874545],"genre_scores_gemma":[0.89050555,0.0000062672984,0.108776644,0.00011177873,0.000026780039,0.000045910823,0.0000011452204,0.000014809123,0.00051112834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.00010435068,0.00022993945,0.0002708916,0.00025911798,0.00025822694],"domain_scores_gemma":[0.9987317,0.00044678283,0.00015601907,0.00057363184,0.000068045934,0.000023826866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187634,0.00010672883,0.00016313157,0.00010217289,0.00045989422,0.00004124868,0.0010339905,0.000020033613,0.000009251847],"category_scores_gemma":[0.00013558603,0.000088241926,0.00009811047,0.00046193102,0.000048930364,0.000083186394,0.0005481472,0.000111128764,4.922634e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017502515,0.0003394294,0.00022516357,0.0001677229,0.000113051196,0.00003415517,0.03898642,0.42348528,0.1751176,0.3305675,0.008978238,0.021810425],"study_design_scores_gemma":[0.00026253643,0.00032022863,0.000015001587,0.000024111194,0.000010736088,0.000031155527,0.0012774977,0.6511335,0.33110172,0.003066891,0.012518201,0.00023842313],"about_ca_topic_score_codex":0.00016084299,"about_ca_topic_score_gemma":0.000010700791,"teacher_disagreement_score":0.6614903,"about_ca_system_score_codex":0.00004341987,"about_ca_system_score_gemma":0.000044025324,"threshold_uncertainty_score":0.35984012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75218236,0.00007373527,0.24188039,0.000023930415,0.0005816056,0.00022972723,0.000004071196,0.0005837066,0.0044404943],"genre_scores_gemma":[0.6930245,0.00047772485,0.30596843,0.000020128502,0.000019230867,0.000012536273,0.000060118233,0.000015803138,0.00040150384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983008,0.00006172563,0.0005336833,0.00052437827,0.00035740092,0.0002220353],"domain_scores_gemma":[0.998179,0.00028609525,0.0005324884,0.0005092013,0.0004252898,0.000067906956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032992466,0.0002874369,0.00043396128,0.00029579815,0.00026127708,0.00007580275,0.0004713399,0.00029354496,0.000007893966],"category_scores_gemma":[0.0003216388,0.0003006303,0.00006766155,0.00033891437,0.000103639715,0.0005569511,0.000099847966,0.00036406567,0.000006035896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020719232,0.0003739172,0.16073331,0.0043985373,0.00024677734,0.00003522043,0.01659428,0.0014283146,0.006585464,0.031850077,0.0026703568,0.77487653],"study_design_scores_gemma":[0.00032292877,0.00014461452,0.039449643,0.0009491905,0.0000506847,0.00015832823,0.00040924555,0.75843275,0.19727647,0.0019639246,0.00005243864,0.00078975555],"about_ca_topic_score_codex":0.00013267326,"about_ca_topic_score_gemma":0.00023562208,"teacher_disagreement_score":0.7740868,"about_ca_system_score_codex":0.000061906896,"about_ca_system_score_gemma":0.00017442084,"threshold_uncertainty_score":0.99994457},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36925626,0.00013040788,0.62473595,0.00033744823,0.0013793816,0.00019880287,0.000012638358,0.000500163,0.003448926],"genre_scores_gemma":[0.9912958,0.000006993734,0.008250619,0.00018728575,0.00006636254,0.000036677982,0.0000030673868,0.000013460293,0.000139746],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986334,0.00012888137,0.00027755302,0.0003420819,0.00039944478,0.00021866361],"domain_scores_gemma":[0.99881774,0.00019461429,0.00030430057,0.00052677834,0.00011240223,0.00004416391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042993188,0.000117813215,0.00017862169,0.00020571626,0.00031171006,0.0001711084,0.002182167,0.000030929637,0.000060616512],"category_scores_gemma":[0.00005911138,0.00013081082,0.000060851286,0.00076745375,0.00003470891,0.00086071074,0.0007082335,0.00021177408,0.000002709723],"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.00011264936,0.0006226013,0.40153635,0.00029534363,0.00013094423,0.0001294416,0.0104637,0.032743216,0.19511846,0.03240215,0.028358463,0.29808667],"study_design_scores_gemma":[0.0006201828,0.00033748045,0.009784016,0.00012114034,0.00002474076,0.00005341393,0.00024640065,0.3352532,0.6382366,0.0085264975,0.0058315275,0.0009648131],"about_ca_topic_score_codex":0.0006846661,"about_ca_topic_score_gemma":0.00014771476,"teacher_disagreement_score":0.6220395,"about_ca_system_score_codex":0.00012077695,"about_ca_system_score_gemma":0.00008012313,"threshold_uncertainty_score":0.53343105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25565073,0.000872299,0.7014919,0.005400973,0.00029607932,0.0013788661,0.000034929904,0.00094164954,0.03393257],"genre_scores_gemma":[0.58547974,0.00071454246,0.40886638,0.000101861406,0.000033192282,0.0003961701,0.00010108447,0.00006441201,0.004242604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.975886,0.019844333,0.0010880011,0.0014491079,0.0007082748,0.0010242767],"domain_scores_gemma":[0.98432755,0.0068498948,0.0013798381,0.003180338,0.0038496852,0.0004126629],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017318921,0.0007441281,0.0007136988,0.00044322264,0.0009647303,0.0023224032,0.003015253,0.00087234075,0.000120201854],"category_scores_gemma":[0.005532924,0.00088636164,0.000422226,0.0009611142,0.0020343317,0.00075191853,0.0019936673,0.0013323164,0.00009602827],"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.000038933576,0.0013968842,0.07875786,0.00092584203,0.00023900319,0.000025095038,0.056252353,0.0051864497,0.040197432,0.6334044,0.0020344574,0.18154134],"study_design_scores_gemma":[0.0008959362,0.000003893218,0.021761747,0.007324551,0.00014955808,0.00025901545,0.0004961873,0.36092257,0.5285575,0.06843027,0.009923286,0.0012754843],"about_ca_topic_score_codex":0.0039431294,"about_ca_topic_score_gemma":0.0013846334,"teacher_disagreement_score":0.56497407,"about_ca_system_score_codex":0.000746777,"about_ca_system_score_gemma":0.002299757,"threshold_uncertainty_score":0.9993587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014940978,0.00030057473,0.9683179,0.013745459,0.00010490425,0.00026301364,0.000049572358,0.00096300384,0.0013145512],"genre_scores_gemma":[0.667096,0.0007841639,0.33088496,0.0004620593,0.0000072104795,0.000073413634,0.000010668617,0.000023030952,0.0006584897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984273,0.00032502928,0.00030822324,0.00043584662,0.00024093153,0.00026268992],"domain_scores_gemma":[0.9953557,0.0013161425,0.00008062536,0.0027688197,0.00031553963,0.00016315823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016491183,0.00023131447,0.0002431646,0.000155045,0.00080495415,0.00015861171,0.0012305899,0.00011545349,0.000042999614],"category_scores_gemma":[0.000023189867,0.00021402679,0.00008685555,0.0009768438,0.00020657195,0.00036522152,0.00002224924,0.0006525254,0.000011967542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000371268,0.018439054,0.00083370396,0.00026810027,0.0015050495,0.00017493447,0.0203579,0.0025372624,0.13850006,0.0580073,0.0028113045,0.75619406],"study_design_scores_gemma":[0.0074005416,0.002381484,0.015800636,0.0025670838,0.0009081538,0.002060351,0.0034239152,0.52646285,0.3431654,0.023943828,0.06725668,0.0046290806],"about_ca_topic_score_codex":0.000106645515,"about_ca_topic_score_gemma":0.0015442013,"teacher_disagreement_score":0.751565,"about_ca_system_score_codex":0.000074228665,"about_ca_system_score_gemma":0.00020155164,"threshold_uncertainty_score":0.8727759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03341964,0.0027518072,0.95339483,0.0067826696,0.00015711405,0.0010024422,0.00004330629,0.0011719335,0.0012762609],"genre_scores_gemma":[0.7974249,0.0002849336,0.20104164,0.0001367018,0.00002967064,0.00068822945,0.00022302114,0.000039756327,0.00013117152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980039,0.00032418987,0.00043270396,0.00048906915,0.00036828365,0.00038186344],"domain_scores_gemma":[0.99445754,0.0009866663,0.0003514212,0.0030150048,0.0010773612,0.00011202564],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007038134,0.00026948578,0.00033500165,0.00016826969,0.0013762256,0.00047974312,0.002740051,0.00013235553,0.0000020488137],"category_scores_gemma":[0.00013769587,0.0002722338,0.00010318795,0.00078884984,0.00019840896,0.00079144456,0.0008746191,0.0004229574,0.000009705098],"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.000088418725,0.0016716521,0.0054984656,0.0006710952,0.00043859883,0.000017077706,0.0276075,0.0008642848,0.029981753,0.87928134,0.0022632035,0.05161659],"study_design_scores_gemma":[0.00041323734,0.00010787179,0.00041790592,0.00057933945,0.00004380659,0.00013914857,0.0013147112,0.98849446,0.0059592933,0.0011880092,0.00090319547,0.0004390309],"about_ca_topic_score_codex":0.00030863818,"about_ca_topic_score_gemma":0.0006047213,"teacher_disagreement_score":0.9876302,"about_ca_system_score_codex":0.00022630962,"about_ca_system_score_gemma":0.00034436176,"threshold_uncertainty_score":0.999973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11764844,0.008035938,0.6147853,0.008359159,0.005146031,0.016686128,0.00020948926,0.007997023,0.22113247],"genre_scores_gemma":[0.9817043,0.00006871005,0.0029597182,0.000037580354,0.000045754685,0.00044854687,0.000020568583,0.00002513197,0.014689704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862975,0.000011548037,0.0006747254,0.00034260645,0.00022163312,0.00011972458],"domain_scores_gemma":[0.9971905,0.00031198494,0.00091161474,0.00079826487,0.00078193774,0.000005736574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066517934,0.00020347517,0.00037460186,0.00044646065,0.00009585159,0.000060347702,0.0008208127,0.00044681775,0.000001358229],"category_scores_gemma":[0.00024381187,0.00015119801,0.000049336344,0.00041166262,0.00021256808,0.00013591175,0.00018586805,0.00036223323,6.249938e-7],"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.0000042910233,0.000008179062,0.0001438154,0.00018579165,0.000033296263,1.532966e-7,0.00009377516,0.0000012975892,0.00037005614,0.9880409,0.0024800932,0.008638322],"study_design_scores_gemma":[0.00095674687,0.0022788441,0.00007187565,0.007737054,0.00010243688,0.00008629052,0.00090782787,0.005395351,0.32329246,0.31329775,0.34434912,0.0015242703],"about_ca_topic_score_codex":0.000028250957,"about_ca_topic_score_gemma":0.0000023629414,"teacher_disagreement_score":0.8640559,"about_ca_system_score_codex":0.000036372345,"about_ca_system_score_gemma":0.00009382607,"threshold_uncertainty_score":0.61656755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050854636,0.00010330762,0.9674632,0.0019724474,0.017117118,0.0024902157,0.0003268222,0.0026677658,0.0027736672],"genre_scores_gemma":[0.934591,0.000078561236,0.059864882,0.0005840204,0.00037129535,0.0028505328,0.00006033159,0.00014916809,0.0014502307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924636,0.0012470931,0.0015060322,0.0021237326,0.0016210065,0.0010385459],"domain_scores_gemma":[0.9950048,0.00069564226,0.0006550901,0.0026033684,0.0005427597,0.0004983494],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025400573,0.0009577913,0.0010621153,0.0013376924,0.001030685,0.0013806432,0.0021177598,0.0007618722,0.00018911331],"category_scores_gemma":[0.0001146433,0.0009817791,0.00072882377,0.0012596982,0.000054526266,0.00096542237,0.00013771294,0.0038020336,0.00023055529],"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.0036519568,0.016791247,0.00035487747,0.0037514383,0.0030306997,0.001384356,0.0994969,0.17247312,0.026537634,0.018154353,0.11680755,0.5375659],"study_design_scores_gemma":[0.002408599,0.0036813759,0.00007974039,0.0046093883,0.0005680753,0.00089949864,0.0067276047,0.86676997,0.043305542,0.0071841846,0.05782853,0.0059374617],"about_ca_topic_score_codex":0.00092540035,"about_ca_topic_score_gemma":0.002138439,"teacher_disagreement_score":0.9295055,"about_ca_system_score_codex":0.0015372963,"about_ca_system_score_gemma":0.0005280911,"threshold_uncertainty_score":0.999656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058229,0.00015057641,0.9876208,0.0021603582,0.0013538459,0.00026683212,0.0000038565977,0.002302643,0.00031823298],"genre_scores_gemma":[0.4021503,0.000021953489,0.596533,0.000935166,0.00010186162,0.000019419704,0.000005295167,0.000037074464,0.00019590816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963939,0.00028837557,0.000691538,0.001232448,0.00057838816,0.0008153196],"domain_scores_gemma":[0.99642897,0.0006767202,0.00023209778,0.002187132,0.00027667842,0.00019839861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000508955,0.00046923684,0.00051573536,0.0003043535,0.00080884434,0.00034627068,0.0017900759,0.00020575413,0.000043082953],"category_scores_gemma":[0.0000812951,0.0005197172,0.0003018489,0.0013744122,0.00006594566,0.0006097535,0.00018441257,0.0008741483,0.0001466495],"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.0000128339225,0.0004154958,0.00006820374,0.00003689849,0.0001327532,0.0002670734,0.00166622,0.09230957,0.0021170613,0.0016697532,0.00032739664,0.9009767],"study_design_scores_gemma":[0.0014357606,0.00037793332,0.00057059806,0.0003612337,0.00006268549,0.0011077843,0.00015310163,0.95370305,0.020185528,0.019169208,0.0015074901,0.0013656268],"about_ca_topic_score_codex":0.00030573967,"about_ca_topic_score_gemma":0.000051965155,"teacher_disagreement_score":0.8996111,"about_ca_system_score_codex":0.00019104761,"about_ca_system_score_gemma":0.00015407697,"threshold_uncertainty_score":0.99972546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039091382,0.000120071985,0.95348805,0.00065180386,0.004400669,0.0009014436,0.00027495713,0.0009343918,0.00013720317],"genre_scores_gemma":[0.98331755,0.000014960622,0.014170223,0.0002028966,0.00008622857,0.0010868568,0.000025306164,0.00004383269,0.0010521705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965828,0.00054648303,0.00068145787,0.0010320588,0.0006668756,0.0004903443],"domain_scores_gemma":[0.99790734,0.00043950672,0.00024627766,0.0009744642,0.00028835493,0.00014408174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011602467,0.00038395904,0.00045798524,0.0004280249,0.0012580944,0.00026869564,0.00065693684,0.00016482543,0.000020643565],"category_scores_gemma":[0.00003391377,0.00035924872,0.00022962861,0.00085956673,0.00007732811,0.00030470963,0.000021488633,0.0006021128,0.0000043976797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008404796,0.0030387158,0.00007124,0.00042665238,0.00021412167,0.000022152473,0.013042623,0.85048497,0.015962513,0.017001072,0.008525762,0.090369724],"study_design_scores_gemma":[0.002010392,0.0016323555,0.000057288238,0.00021084746,0.00007062007,0.00017437717,0.001171645,0.91225976,0.05312929,0.0017875177,0.026508896,0.0009869899],"about_ca_topic_score_codex":0.00061378715,"about_ca_topic_score_gemma":0.0008225232,"teacher_disagreement_score":0.94422615,"about_ca_system_score_codex":0.00037964078,"about_ca_system_score_gemma":0.00012835283,"threshold_uncertainty_score":0.999886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010171335,0.00016106536,0.9879523,0.00057270227,0.00027775357,0.00029644842,0.0000045331167,0.00028790068,0.00027596374],"genre_scores_gemma":[0.3658671,0.0000124749085,0.6338141,0.00004763701,0.000016051894,0.00001952643,0.000003154872,0.00001106202,0.00020891672],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987154,0.000081875325,0.00033135587,0.00041745597,0.00018827777,0.00026561238],"domain_scores_gemma":[0.99894136,0.00013611546,0.000112443224,0.00051727035,0.00024689548,0.00004591274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063079764,0.00013334084,0.00021717988,0.00019394477,0.00005881126,0.00004833015,0.00048730196,0.000098221826,0.000008058336],"category_scores_gemma":[0.0002013451,0.00013859828,0.00007818161,0.0006137705,0.000037073427,0.00041683653,0.000133575,0.00011321145,0.0000021058238],"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.000024939729,0.00034357238,0.0015035166,0.000068450405,0.00002906812,0.000009080178,0.0014434177,0.0013864748,0.94527304,0.032036707,0.0010947845,0.016786959],"study_design_scores_gemma":[0.0005424176,0.00020964922,0.0018787188,0.00011911313,0.000012395991,0.00012927076,0.00042598826,0.12862575,0.8536097,0.013835473,0.0002581602,0.00035335828],"about_ca_topic_score_codex":0.00049654156,"about_ca_topic_score_gemma":0.00015396085,"teacher_disagreement_score":0.35569578,"about_ca_system_score_codex":0.00007518697,"about_ca_system_score_gemma":0.0001844883,"threshold_uncertainty_score":0.56518734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017342683,0.00013323572,0.98884636,0.00048220324,0.00204207,0.00013741029,7.85309e-8,0.00134047,0.0068447655],"genre_scores_gemma":[0.026032731,0.000008484489,0.97126794,0.00031470024,0.00031579938,0.000054910808,0.000001468837,0.000016072972,0.0019878657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987095,0.00019692014,0.00019595388,0.00046604144,0.0001217792,0.00030978516],"domain_scores_gemma":[0.9985444,0.00072192407,0.000072672075,0.00034449412,0.00024171943,0.00007477114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016923,0.00012194403,0.00017921402,0.00007178695,0.00018401076,0.00021219473,0.00048865995,0.00008345964,0.000018870887],"category_scores_gemma":[0.0015314223,0.0001241018,0.0001177841,0.00037253945,0.000013435504,0.0002740259,0.00037873694,0.00018221034,0.0000064124556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009038856,0.000054159635,0.00011363261,0.00002581869,0.0000269558,0.00001540274,0.0015389665,0.00013711749,0.012289766,0.09967865,0.0016719453,0.8844386],"study_design_scores_gemma":[0.00026800347,0.000116872354,0.00002850774,0.00001683027,0.000007754047,0.0000625563,0.000076548466,0.7603073,0.16116732,0.020848874,0.056840282,0.0002591507],"about_ca_topic_score_codex":0.000022750353,"about_ca_topic_score_gemma":0.000024048863,"teacher_disagreement_score":0.8841794,"about_ca_system_score_codex":0.000051504845,"about_ca_system_score_gemma":0.00008480725,"threshold_uncertainty_score":0.50607246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09494094,0.00025197468,0.9016602,0.0004127759,0.0008161179,0.00058808195,0.00001557511,0.0006422602,0.00067205227],"genre_scores_gemma":[0.996992,0.000013651377,0.0017459132,0.0002470596,0.000032996548,0.00027116376,0.0000017669523,0.00004613762,0.0006493078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750483,0.0003301769,0.0003538167,0.00076024904,0.00061776844,0.00043316148],"domain_scores_gemma":[0.9986881,0.0001333665,0.00015620925,0.0007537949,0.000068474175,0.00020004108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005148553,0.0003200167,0.00036980255,0.00032992937,0.00097015384,0.0002093787,0.000591649,0.00009458487,0.000028070657],"category_scores_gemma":[0.0000067401993,0.00027832104,0.000122013254,0.0005982509,0.00007310934,0.00019335249,0.000010564359,0.00062824605,0.000003755881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009969303,0.00054628355,0.0010043618,0.00042845865,0.0006302449,0.00043715077,0.017396897,0.5170764,0.054766282,0.0010928316,0.0002269237,0.4062945],"study_design_scores_gemma":[0.013150741,0.008351671,0.0024622984,0.0029619744,0.0007692874,0.01640673,0.012359619,0.8715576,0.038512018,0.0014333302,0.02348095,0.00855379],"about_ca_topic_score_codex":0.00022160404,"about_ca_topic_score_gemma":0.0001507991,"teacher_disagreement_score":0.9020511,"about_ca_system_score_codex":0.00012404581,"about_ca_system_score_gemma":0.00012605787,"threshold_uncertainty_score":0.9999669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01309359,0.000056590245,0.9613608,0.0032801065,0.0005090262,0.00022420193,0.000002999575,0.0013488672,0.020123802],"genre_scores_gemma":[0.32734337,0.0000039232123,0.66847336,0.00096652686,0.000052463187,0.00004126189,0.000005034322,0.000012668667,0.0031013843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866533,0.00006771473,0.00023613249,0.00052127097,0.00019188804,0.0003176532],"domain_scores_gemma":[0.9984073,0.0002536207,0.00006775253,0.0008473187,0.00033955742,0.0000844608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035105358,0.00014240113,0.00020356927,0.00006089686,0.00016636464,0.00016282556,0.00072602514,0.000073324925,0.000084079584],"category_scores_gemma":[0.00027434222,0.00013627975,0.00011386422,0.0003183287,0.00004887168,0.0002547265,0.0003876689,0.000117765325,0.000032264103],"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.000024733821,0.00031564687,0.0010046068,0.00007044899,0.000070516704,0.000043743934,0.0011128215,0.000028682303,0.079273514,0.6867473,0.17597446,0.055333488],"study_design_scores_gemma":[0.0005592293,0.00015439538,0.002095384,0.000058455356,0.000013931897,0.00012615183,0.00012043287,0.11249712,0.7179894,0.13083613,0.034900367,0.000648998],"about_ca_topic_score_codex":0.000055167024,"about_ca_topic_score_gemma":0.00029069316,"teacher_disagreement_score":0.63871586,"about_ca_system_score_codex":0.000053902408,"about_ca_system_score_gemma":0.00013004156,"threshold_uncertainty_score":0.5557327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032066822,0.00020468161,0.95989835,0.0015470183,0.0006866846,0.00013861345,0.000004766936,0.0012430968,0.0042099613],"genre_scores_gemma":[0.5469381,0.000016653248,0.45079887,0.000591687,0.000054610595,0.00001856378,0.000014077002,0.000010188346,0.0015572531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984295,0.00013465794,0.00026499588,0.0005369324,0.00030667186,0.00032726454],"domain_scores_gemma":[0.9984408,0.0003573176,0.0000995219,0.00046368744,0.0005339058,0.00010473931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032725616,0.0001706969,0.00019588969,0.00009669627,0.0002028181,0.00018686705,0.00058440113,0.0000891609,0.00010545182],"category_scores_gemma":[0.0002999928,0.0001685197,0.00009353872,0.00055795885,0.00007167403,0.00046174464,0.00039962423,0.00021636428,0.000070703674],"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.000024022156,0.0004157669,0.042289324,0.00004467898,0.00010514823,0.00041536966,0.0015524285,0.00019447676,0.09398566,0.8356782,0.015965581,0.0093293395],"study_design_scores_gemma":[0.0017647184,0.00019195287,0.06270231,0.00030119673,0.000032402313,0.0011128768,0.0005769094,0.30455256,0.59747344,0.021607324,0.008131372,0.0015529227],"about_ca_topic_score_codex":0.000043269552,"about_ca_topic_score_gemma":0.00015636474,"teacher_disagreement_score":0.8140709,"about_ca_system_score_codex":0.00008359632,"about_ca_system_score_gemma":0.0002847972,"threshold_uncertainty_score":0.6872034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61823905,0.000051358144,0.38063163,0.000057702684,0.000098390636,0.00014353928,0.0000024458097,0.0002327602,0.00054311793],"genre_scores_gemma":[0.71061313,0.000012984642,0.2892609,0.00006409459,0.000015059486,0.000005210257,0.000001317703,0.000006198034,0.000021147027],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990406,0.000015371632,0.00024448725,0.00027906796,0.00015470307,0.0002657791],"domain_scores_gemma":[0.9989033,0.00038263516,0.00011629726,0.0003702781,0.00016905827,0.00005845937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561298,0.00013032695,0.0002293826,0.00008723911,0.00014251485,0.000039225724,0.0003974798,0.000066619024,0.0000013729859],"category_scores_gemma":[0.00015992265,0.0001251979,0.000043228592,0.00015816046,0.00019134277,0.00026632677,0.00022807244,0.00009972106,0.0000020193424],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014184497,0.00030168233,0.78885376,0.0009800422,0.00006390658,0.00000986655,0.004586807,0.000054901706,0.020855151,0.03351806,0.002131195,0.14850277],"study_design_scores_gemma":[0.00034143313,0.00024756516,0.46003002,0.00014096378,0.000014721379,0.000029876805,0.00010832998,0.16875638,0.3548608,0.014856699,0.00027228086,0.00034091363],"about_ca_topic_score_codex":0.00011422612,"about_ca_topic_score_gemma":0.00027034903,"teacher_disagreement_score":0.33400565,"about_ca_system_score_codex":0.00002479316,"about_ca_system_score_gemma":0.000026428053,"threshold_uncertainty_score":0.5105422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09772324,0.001353349,0.89897925,0.000106397805,0.0014788307,0.0002381589,0.000002214779,0.000028341454,0.00009023375],"genre_scores_gemma":[0.9921641,0.000002941944,0.0073370566,0.00007468487,0.0003416004,0.000001504552,0.0000010485481,0.000015723163,0.00006134117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980229,0.00043122884,0.00051035965,0.00029839578,0.00035575606,0.00038134013],"domain_scores_gemma":[0.9977458,0.00024815096,0.00089810375,0.0002227181,0.0007406439,0.00014455826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016049938,0.00018578865,0.00045407208,0.00009249412,0.0004657468,0.0010258575,0.000679185,0.00006615309,0.0000021272717],"category_scores_gemma":[0.000027540083,0.00014549735,0.000057623245,0.00025521984,0.000040526524,0.00083995704,0.00035230842,0.00044535473,2.9527646e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012255315,0.00017424847,0.0084689,0.00020726475,0.00051747006,0.0016702244,0.0034800237,0.9178353,0.03190735,0.0055513275,0.004087429,0.025977908],"study_design_scores_gemma":[0.000668424,0.00018780625,0.00069731724,0.0014827197,0.00003096341,0.0039056288,0.00046429108,0.9917974,0.0003433418,0.00007906435,0.00012815223,0.00021489541],"about_ca_topic_score_codex":0.00005327696,"about_ca_topic_score_gemma":0.000015407917,"teacher_disagreement_score":0.8944409,"about_ca_system_score_codex":0.00007366419,"about_ca_system_score_gemma":0.00020851941,"threshold_uncertainty_score":0.9892367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14890301,0.00029789313,0.8501099,0.00015397595,0.00015760849,0.00014323796,0.000008197959,0.00004559398,0.00018062108],"genre_scores_gemma":[0.9994713,0.00000773704,0.00024523688,0.00013540911,0.00007787498,0.00002991667,0.0000063766834,0.000009128345,0.000017038345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985392,0.00022902997,0.00049001654,0.00021794414,0.0003973452,0.00012646355],"domain_scores_gemma":[0.99827796,0.0008448187,0.00051542494,0.00011656423,0.00018459088,0.000060611306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016179745,0.00010244781,0.00013765057,0.00028794422,0.00025385316,0.0001374675,0.0006443743,0.000029519939,0.000010100995],"category_scores_gemma":[0.00010357587,0.000110860245,0.000038404392,0.00024350645,0.000042082607,0.00044851555,0.00028627532,0.00037506127,9.2658615e-7],"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.000019748742,0.00018076283,0.0034131473,0.0000082155875,0.00004025191,0.000017169112,0.0026885753,0.024290945,0.0058037844,0.6711946,0.000107433865,0.29223537],"study_design_scores_gemma":[0.001526755,0.00035974843,0.015210073,0.00029716088,0.000030465124,0.0012477953,0.0018441756,0.055434138,0.0010866334,0.9206539,0.0017522046,0.0005569574],"about_ca_topic_score_codex":0.0000053216568,"about_ca_topic_score_gemma":0.0000015278712,"teacher_disagreement_score":0.8505683,"about_ca_system_score_codex":0.000114757655,"about_ca_system_score_gemma":0.000048928025,"threshold_uncertainty_score":0.45207494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11775647,0.0005892902,0.88053274,0.00022568917,0.00046793846,0.00030184505,0.00000859226,0.000074139476,0.000043280445],"genre_scores_gemma":[0.96533895,0.0000020275018,0.03437749,0.00006985179,0.00012559528,0.000028526421,0.0000011735077,0.000015505479,0.000040874103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787587,0.00018758865,0.0008670152,0.00019505338,0.0006636799,0.0002107975],"domain_scores_gemma":[0.9969591,0.00021149317,0.0016978253,0.00016968083,0.0008977341,0.000064181106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024076567,0.00012928253,0.00037128833,0.00024365759,0.00031280817,0.00016020042,0.00072911626,0.000034611778,0.000008620681],"category_scores_gemma":[0.000054475353,0.00011975047,0.00013872552,0.00033900596,0.000024028692,0.0006775066,0.00017079012,0.00024823946,3.7775976e-7],"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.0011487205,0.0018101769,0.035696656,0.012211063,0.0009214909,0.00039872585,0.07143666,0.03772146,0.36572596,0.011160818,0.047057282,0.414711],"study_design_scores_gemma":[0.0054472466,0.0069363345,0.0030085777,0.0039064884,0.00040998255,0.005696957,0.035481784,0.63443446,0.28560942,0.011901137,0.005466419,0.0017011988],"about_ca_topic_score_codex":0.00007672663,"about_ca_topic_score_gemma":0.000009194778,"teacher_disagreement_score":0.84758246,"about_ca_system_score_codex":0.00020985525,"about_ca_system_score_gemma":0.0004122308,"threshold_uncertainty_score":0.48832825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025889364,0.00029524983,0.98913056,0.00082362146,0.003889558,0.0007641076,0.0000018040644,0.002051771,0.00045436888],"genre_scores_gemma":[0.7775416,0.0000065833274,0.22100198,0.0005402298,0.00020165129,0.00025630224,0.000021154923,0.00003517441,0.00039533296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977287,0.000075995624,0.00038305443,0.0010473066,0.0002600151,0.0005049104],"domain_scores_gemma":[0.99758255,0.0003865867,0.0002118667,0.0014427691,0.00026319773,0.00011304909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003713794,0.00035935966,0.00041295862,0.00013122975,0.00011776795,0.00058079924,0.0020247512,0.00034490894,0.00001530872],"category_scores_gemma":[0.00020016346,0.00035522605,0.0003158839,0.00022534103,0.000035386358,0.0002328433,0.0031775713,0.000764882,0.0000023907157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014714596,0.00020058696,0.00032058242,0.00043001227,0.00016084874,0.00006886037,0.0016412863,0.8384889,0.00007691692,0.0088756075,0.013982267,0.13573943],"study_design_scores_gemma":[0.00008534601,0.000048687874,0.00011155949,0.00016938227,0.00001672358,0.000012865551,0.000018454602,0.9936381,0.00012549623,0.0053457883,0.000017414874,0.00041019983],"about_ca_topic_score_codex":0.00012592204,"about_ca_topic_score_gemma":0.00013515961,"teacher_disagreement_score":0.77495265,"about_ca_system_score_codex":0.00008874758,"about_ca_system_score_gemma":0.00015067132,"threshold_uncertainty_score":0.99988997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025889364,0.00029524983,0.98913056,0.00082362146,0.003889558,0.0007641076,0.0000018040644,0.002051771,0.00045436888],"genre_scores_gemma":[0.7775416,0.0000065833274,0.22100198,0.0005402298,0.00020165129,0.00025630224,0.000021154923,0.00003517441,0.00039533296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977287,0.000075995624,0.00038305443,0.0010473066,0.0002600151,0.0005049104],"domain_scores_gemma":[0.99758255,0.0003865867,0.0002118667,0.0014427691,0.00026319773,0.00011304909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003713794,0.00035935966,0.00041295862,0.00013122975,0.00011776795,0.00058079924,0.0020247512,0.00034490894,0.00001530872],"category_scores_gemma":[0.00020016346,0.00035522605,0.0003158839,0.00022534103,0.000035386358,0.0002328433,0.0031775713,0.000764882,0.0000023907157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014714596,0.00020058696,0.00032058242,0.00043001227,0.00016084874,0.00006886037,0.0016412863,0.8384889,0.00007691692,0.0088756075,0.013982267,0.13573943],"study_design_scores_gemma":[0.00008534601,0.000048687874,0.00011155949,0.00016938227,0.00001672358,0.000012865551,0.000018454602,0.9936381,0.00012549623,0.0053457883,0.000017414874,0.00041019983],"about_ca_topic_score_codex":0.00012592204,"about_ca_topic_score_gemma":0.00013515961,"teacher_disagreement_score":0.77495265,"about_ca_system_score_codex":0.00008874758,"about_ca_system_score_gemma":0.00015067132,"threshold_uncertainty_score":0.99988997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07122749,0.0005620647,0.6874752,0.0017308635,0.00053013203,0.0013210372,0.00041580066,0.0004998534,0.23623756],"genre_scores_gemma":[0.87515336,0.000040031584,0.08288952,0.00011135517,0.0000104100145,1.9532804e-7,0.000022142973,0.000019632052,0.04175334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968654,0.00057327154,0.00039482882,0.0007476551,0.00097058184,0.00044826473],"domain_scores_gemma":[0.99674064,0.00027998682,0.0009819176,0.0011912571,0.0006043533,0.00020185426],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00087705505,0.00031758915,0.0008301314,0.00040397796,0.0007861072,0.0000189629,0.004444187,0.00013492139,0.03815543],"category_scores_gemma":[0.00003890515,0.00047866043,0.00039325637,0.001291839,0.0007715349,0.00095737615,0.0032065904,0.0004854821,0.00071062567],"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.0007750075,0.0010932395,0.000067807574,0.00016197076,0.00048621238,0.0005835574,0.024474362,0.0016813327,0.0060527553,0.01075021,0.94384706,0.010026488],"study_design_scores_gemma":[0.004602041,0.0033332573,0.005288908,0.000288629,0.00040009545,0.00008497109,0.04923939,0.03302873,0.027494146,0.0007574598,0.87378734,0.0016950092],"about_ca_topic_score_codex":0.0033723684,"about_ca_topic_score_gemma":0.0005242554,"teacher_disagreement_score":0.8039259,"about_ca_system_score_codex":0.0003363516,"about_ca_system_score_gemma":0.00057080074,"threshold_uncertainty_score":0.9997665},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016956909,0.8983881,0.09422311,0.0000124705775,0.00040520326,0.0019222794,0.000032925538,0.0012122722,0.0038019791],"genre_scores_gemma":[0.00001581739,0.9628705,0.035829417,0.00038077548,0.00003752864,0.0006142064,0.00020676015,0.000029270937,0.000015718848],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99565995,0.00058455305,0.0021464755,0.0004086142,0.00078393414,0.0004164596],"domain_scores_gemma":[0.99466646,0.00038988647,0.002672927,0.0015161746,0.00065649435,0.00009805529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001452038,0.0006008376,0.0021605412,0.000630219,0.00028798805,0.00016939334,0.002062344,0.0003310682,0.00006505197],"category_scores_gemma":[0.00075335155,0.000566629,0.0006751884,0.0016570201,0.00016301445,0.0025385688,0.0013355903,0.0008269534,0.000041119198],"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.0000010127922,0.000020062635,0.0000015740809,0.22507194,0.000039689676,0.0000034243674,0.00040263927,2.1243483e-7,3.1261365e-7,0.0006909678,0.0015801594,0.772188],"study_design_scores_gemma":[0.000036154164,0.00009615525,0.0000036803017,0.099384785,0.00011443045,0.00024878426,0.000027493019,0.00014622013,0.00009504233,0.0007533204,0.89858735,0.0005065697],"about_ca_topic_score_codex":0.00010182036,"about_ca_topic_score_gemma":0.0000024011001,"teacher_disagreement_score":0.8970072,"about_ca_system_score_codex":0.0009083958,"about_ca_system_score_gemma":0.0006920789,"threshold_uncertainty_score":0.9996785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011142706,0.0001402675,0.97445345,0.013364036,0.00011963784,0.00039682243,0.00001236412,0.00022402093,0.00014671261],"genre_scores_gemma":[0.56070167,0.000037783862,0.43809727,0.0008331558,0.000006249705,0.00027903152,0.00001930342,0.000009460906,0.00001604763],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990831,0.00018241355,0.00026332212,0.00021059158,0.00014018248,0.000120399935],"domain_scores_gemma":[0.99745667,0.0004508771,0.00021372575,0.0017427199,0.00010960914,0.000026418984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062367,0.00008359219,0.000116941184,0.00016768831,0.00047598965,0.000042342755,0.0016208052,0.000023272376,0.000003863849],"category_scores_gemma":[0.000064464264,0.00009984531,0.0000418482,0.0003425702,0.000095534044,0.0002206079,0.00051647634,0.00013942472,5.5922914e-7],"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.000068951216,0.00090747577,0.0048309406,0.00015840464,0.00018588369,0.0000012285968,0.013673129,0.3579666,0.37776357,0.1013532,0.07892436,0.06416628],"study_design_scores_gemma":[0.00031348644,0.00009374412,0.0004075101,0.000016557946,0.000020244064,0.000015293086,0.00015571383,0.9795033,0.008264763,0.0013031164,0.009666629,0.00023966114],"about_ca_topic_score_codex":0.000037857684,"about_ca_topic_score_gemma":0.000012780566,"teacher_disagreement_score":0.6215367,"about_ca_system_score_codex":0.00006948016,"about_ca_system_score_gemma":0.00002894826,"threshold_uncertainty_score":0.40715736},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.1075202e-7,0.00034632522,0.27186286,0.00011973413,0.0005714792,0.0001484786,4.641811e-7,0.0038454516,0.7231051],"genre_scores_gemma":[0.000029589615,0.000025879772,0.28064367,0.00021782833,0.00007470918,0.000012877751,6.8912215e-7,0.00013234389,0.7188624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902517,0.000044827037,0.00009789955,0.0004746267,0.00017113323,0.0001863449],"domain_scores_gemma":[0.9987583,0.000015621907,0.00009050058,0.0010766053,0.000021899355,0.000037077254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014671411,0.00017828963,0.00017927283,0.00019310632,0.000019213156,0.000064719534,0.00095197617,0.00010364437,0.0006808156],"category_scores_gemma":[0.000044230415,0.00015231657,0.00004421001,0.0002257824,0.000021700784,0.0000482213,0.0001444896,0.00014683836,0.00040800968],"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":[7.387849e-8,0.000010440023,0.000015246866,0.000010889762,0.000006058748,0.0000037657592,0.00001214914,3.3427757e-8,0.000014115889,0.018689295,0.9736938,0.007544147],"study_design_scores_gemma":[0.000020374444,0.000020335601,0.0000020125312,0.000050929088,0.0000022830575,0.000015162168,8.42818e-7,0.000054198736,0.0021209412,0.0009610952,0.9965297,0.00022215581],"about_ca_topic_score_codex":0.00013659922,"about_ca_topic_score_gemma":0.00014920143,"teacher_disagreement_score":0.022835884,"about_ca_system_score_codex":0.000021574317,"about_ca_system_score_gemma":0.000053499607,"threshold_uncertainty_score":0.7454453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005196646,0.00009869184,0.98643595,0.00006392843,0.0007232064,0.0005055503,0.000008604125,0.00016834398,0.0067991074],"genre_scores_gemma":[0.11313776,0.000016593869,0.8864838,0.000023731003,0.000022753717,0.000017985025,0.000008691089,0.000019944895,0.0002687286],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984599,0.00017527437,0.00053509494,0.0002824325,0.00036910616,0.00017821416],"domain_scores_gemma":[0.99790865,0.0001047547,0.0005347917,0.0010899445,0.0003401618,0.000021667543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868773,0.00020389888,0.00031937702,0.00017662141,0.0001987028,0.000029956347,0.0019460409,0.00009615681,0.000013393683],"category_scores_gemma":[0.000043518015,0.00012205587,0.00028065726,0.0008278857,0.00013690225,0.0002461716,0.0001074595,0.0003457996,5.092308e-7],"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.00003117074,0.00041022885,0.00019006916,0.001188967,0.0004151622,0.0000018377227,0.07250542,0.00026106052,0.049915206,0.18629836,0.00042714592,0.6883554],"study_design_scores_gemma":[0.00009999086,0.000050304385,0.0021003874,0.0004075826,0.00011583643,0.000035190653,0.0008227928,0.051127996,0.8854084,0.05939193,0.00008793757,0.00035165105],"about_ca_topic_score_codex":0.0025140143,"about_ca_topic_score_gemma":0.00097201654,"teacher_disagreement_score":0.8354932,"about_ca_system_score_codex":0.000024263443,"about_ca_system_score_gemma":0.0001511023,"threshold_uncertainty_score":0.4977294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29411066,0.0009242354,0.6687881,0.0001772424,0.0013838116,0.0007721273,0.0000056331833,0.0009583129,0.032879926],"genre_scores_gemma":[0.850355,0.00019317759,0.14484105,0.000084177875,0.00003103658,0.000058190133,0.00013578989,0.000023159277,0.0042783786],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987992,0.000027845124,0.000353508,0.0004503625,0.0002300259,0.00013907177],"domain_scores_gemma":[0.9987492,0.000100157195,0.0003119445,0.0005353876,0.0002605778,0.000042739328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025531865,0.00016329247,0.00024413744,0.00015306112,0.00005563214,0.0000919871,0.00044131483,0.00014776667,0.000015922471],"category_scores_gemma":[0.00010194589,0.00016551548,0.00005517663,0.00023348912,0.0000103429165,0.00016218118,0.00010236034,0.0001490654,0.0000016698732],"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.000010898816,0.00010957855,0.00044047303,0.0007455604,0.00006629559,0.000005538219,0.0044822297,0.0000030669087,0.32360587,0.04804662,0.0015341886,0.6209497],"study_design_scores_gemma":[0.000120811135,0.00016025838,0.0013746355,0.00038626633,0.00002971833,0.0000055303954,0.0013745088,0.010741617,0.9819513,0.0031593638,0.00030720074,0.00038881353],"about_ca_topic_score_codex":0.0001256147,"about_ca_topic_score_gemma":0.000453447,"teacher_disagreement_score":0.6583454,"about_ca_system_score_codex":0.00004489342,"about_ca_system_score_gemma":0.0001202265,"threshold_uncertainty_score":0.67495257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03018794,0.00002357022,0.81805605,0.00014733015,0.00014050343,0.00008093592,5.209679e-8,0.00039619443,0.15096745],"genre_scores_gemma":[0.7663308,0.0000017195974,0.23304558,0.00027749588,0.0000040379705,0.000007540022,7.146943e-8,0.0000028459003,0.00032990982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931324,0.000079336125,0.00012650993,0.0002230936,0.0000882952,0.00016955413],"domain_scores_gemma":[0.9995516,0.000093970724,0.000027618114,0.00026676702,0.000029851182,0.000030218585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033254013,0.00006955955,0.00008115841,0.00013521446,0.000035216883,0.00006999669,0.0003235074,0.000030214545,0.000027017984],"category_scores_gemma":[0.00014372438,0.000063145366,0.000021752187,0.0004668214,0.000009611837,0.00031870513,0.000044551096,0.00010228683,0.000025478019],"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.0000011449581,0.00006467779,0.046894874,0.000004677227,0.0000045898373,0.000055287503,0.0029089719,0.00004243092,0.002995424,0.9175378,0.001971296,0.027518814],"study_design_scores_gemma":[0.0009307452,0.00038278766,0.015877642,0.00018385393,0.0000045825122,0.00018756099,0.00047042008,0.18077295,0.5917175,0.19584167,0.012204753,0.001425539],"about_ca_topic_score_codex":0.00003824103,"about_ca_topic_score_gemma":0.00016764572,"teacher_disagreement_score":0.7361429,"about_ca_system_score_codex":0.000049849565,"about_ca_system_score_gemma":0.00002917333,"threshold_uncertainty_score":0.25749934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017780477,0.0005508845,0.9795623,0.000033324937,0.00034675203,0.0005721836,0.0000034300097,0.0002530042,0.0008976803],"genre_scores_gemma":[0.108319424,0.0008264692,0.88851833,0.000053759188,0.00003198217,0.00005596039,0.000056216268,0.00003054265,0.0021072906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988229,0.00007548456,0.00029841223,0.0004108731,0.00023011897,0.00016217491],"domain_scores_gemma":[0.9992003,0.00011130645,0.00025100965,0.00021959942,0.00016727737,0.000050548908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025510706,0.00018923821,0.00023405111,0.00020929384,0.00007991534,0.000050617837,0.00028715955,0.00014128043,0.000012488058],"category_scores_gemma":[0.000018155988,0.00018876937,0.000024540537,0.00018489923,0.0000117066675,0.00030740746,0.00007054677,0.000116221214,0.0000017279898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010647146,0.00004134849,0.000081459104,0.00015690814,0.00005258232,0.000020307923,0.0077085607,0.00000221019,0.0065019643,0.0013539846,0.0021593466,0.9819107],"study_design_scores_gemma":[0.0007905835,0.00073126063,0.019588044,0.000266096,0.00006660355,0.00017720195,0.0014684343,0.06464598,0.9076618,0.0034426937,0.00017468867,0.0009866343],"about_ca_topic_score_codex":0.00022062942,"about_ca_topic_score_gemma":0.00007346261,"teacher_disagreement_score":0.98092407,"about_ca_system_score_codex":0.000020731643,"about_ca_system_score_gemma":0.000112174996,"threshold_uncertainty_score":0.7697791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3183896e-8,0.000032829645,0.4905135,0.000047874586,0.00031777957,0.000037246427,6.943578e-8,0.0033079274,0.5057427],"genre_scores_gemma":[0.000097476564,0.0000072926205,0.3599312,0.0002478926,0.00011201124,0.0000048865486,3.24046e-7,0.000111467496,0.63948745],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933994,0.000023448969,0.000080466765,0.00029050242,0.00012076149,0.00014490659],"domain_scores_gemma":[0.99911845,0.000033157627,0.00008303166,0.0007203383,0.000009691146,0.00003530891],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012920985,0.00012551773,0.00013854631,0.00019501046,0.000015994714,0.0000610016,0.0010298876,0.00013730452,0.0005956714],"category_scores_gemma":[0.000028340613,0.00011101842,0.00004230446,0.00011110637,0.000009691319,0.000032216245,0.00025439353,0.000111156776,0.00087787036],"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":[2.4062814e-8,0.0000021842532,0.000013352587,0.000006564239,0.0000028193306,0.000001473037,0.0000078563535,3.176813e-8,0.0000065122886,0.033977836,0.9400924,0.025888948],"study_design_scores_gemma":[0.000019180578,0.00001142152,0.000002218143,0.000074198986,0.0000014011445,0.0000059947997,4.2175395e-7,0.0025346116,0.0002427925,0.0011799199,0.995755,0.00017282217],"about_ca_topic_score_codex":0.000101087775,"about_ca_topic_score_gemma":0.00011340349,"teacher_disagreement_score":0.13374473,"about_ca_system_score_codex":0.000015924936,"about_ca_system_score_gemma":0.000016879929,"threshold_uncertainty_score":0.99990004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5058664,0.00003353346,0.4934344,0.000008197963,0.00006144745,0.00028201978,0.0000010353617,0.000048893296,0.00026403458],"genre_scores_gemma":[0.9193201,0.000031736803,0.08048648,0.000016867734,0.00000405366,0.000022181039,0.00002410458,0.0000068148192,0.00008765641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827844,0.00018322485,0.0005446051,0.00037439686,0.00043629776,0.00018303914],"domain_scores_gemma":[0.99775994,0.0008304138,0.0005363215,0.00060597307,0.00024052645,0.000026815163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362259,0.00019767713,0.00048358284,0.00074625836,0.000063599895,0.00004206979,0.0008551423,0.00018098348,0.0000018053394],"category_scores_gemma":[0.0003521068,0.00015688277,0.00008191393,0.0014652223,0.000068274494,0.00023906876,0.00006899024,0.00024025484,4.6364107e-7],"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.0020443837,0.0031836124,0.12640354,0.015637072,0.0024263537,0.0001712218,0.27316672,0.13228087,0.014776204,0.016401593,0.0007428254,0.41276562],"study_design_scores_gemma":[0.000048312708,0.00012398847,0.12799278,0.0002099952,0.00014790932,0.0000029170508,0.00027634366,0.8492761,0.02132932,0.00045188793,1.5195258e-7,0.00014025206],"about_ca_topic_score_codex":0.00035832406,"about_ca_topic_score_gemma":0.0012137437,"teacher_disagreement_score":0.7169953,"about_ca_system_score_codex":0.000026847882,"about_ca_system_score_gemma":0.00008349256,"threshold_uncertainty_score":0.6397494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061783884,0.0012622376,0.91961116,0.00002151401,0.0010837897,0.0012933885,0.0000073916826,0.0008237502,0.0141129065],"genre_scores_gemma":[0.90921926,0.000039826697,0.08737524,0.000010809498,0.000026446593,0.0001827797,0.0003192122,0.00003248546,0.0027939284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817204,0.00010522937,0.0007837441,0.00036543282,0.00033982986,0.00023373918],"domain_scores_gemma":[0.9964714,0.00061638793,0.0009157987,0.0011625802,0.00078850356,0.000045331657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009094405,0.00024381673,0.0006707673,0.0003209353,0.00012360536,0.00012056754,0.0019080293,0.0003567088,0.0000016631718],"category_scores_gemma":[0.00006208834,0.00024187085,0.0001258683,0.00036824544,0.00002853915,0.00018555226,0.00008555474,0.000271149,0.0000029839364],"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.00026499428,0.0009042909,0.0026748176,0.004421107,0.00025666633,0.000002223502,0.019522507,0.00034624108,0.016877415,0.7759359,0.01980185,0.15899198],"study_design_scores_gemma":[0.0005330044,0.00043610862,0.00084683613,0.0023798477,0.000089020534,0.0000069542307,0.0076557505,0.5065662,0.47550532,0.0021830571,0.002684656,0.0011132252],"about_ca_topic_score_codex":0.0005424431,"about_ca_topic_score_gemma":0.001228204,"teacher_disagreement_score":0.8474354,"about_ca_system_score_codex":0.00008208775,"about_ca_system_score_gemma":0.00012647355,"threshold_uncertainty_score":0.9863207},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022288639,0.00006284993,0.52294207,0.00016653398,0.0022315441,0.00006670785,3.8855782e-7,0.00056906743,0.47395864],"genre_scores_gemma":[0.011114995,0.000039094906,0.09811413,0.0015075254,0.0004477101,0.00003414138,0.000008521293,0.00003516802,0.8886987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986471,0.00006736075,0.0002095321,0.00053567335,0.00026923238,0.00027109255],"domain_scores_gemma":[0.9983104,0.000097328346,0.00014180077,0.0012950622,0.000087365515,0.000068072986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024321194,0.00023512726,0.00027948184,0.00020570199,0.000054113603,0.00018751647,0.0023335067,0.0003227226,0.0008881245],"category_scores_gemma":[0.000033563967,0.00020772999,0.000095150564,0.00024853292,0.000021901527,0.00013428205,0.0006731485,0.00044942898,0.02543733],"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":[2.360738e-7,0.000006107964,0.000008020922,0.0000147217615,0.0000047737244,0.0000012557961,0.000023184271,0.000005312827,0.000009093995,0.004312232,0.9816758,0.013939257],"study_design_scores_gemma":[0.000038256607,0.000043666558,0.000015689697,0.000057734855,0.0000017565391,0.000013933528,8.3943854e-7,0.009383062,0.0010764669,0.0012728755,0.98775345,0.00034227577],"about_ca_topic_score_codex":0.000097432356,"about_ca_topic_score_gemma":0.000026561213,"teacher_disagreement_score":0.4248279,"about_ca_system_score_codex":0.000053918393,"about_ca_system_score_gemma":0.00010671698,"threshold_uncertainty_score":0.9753215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074036317,0.00003637396,0.9134388,0.000029200184,0.0013160832,0.0002620685,0.000006506485,0.0035480026,0.07395933],"genre_scores_gemma":[0.7627434,0.00003174308,0.18781967,0.00027010954,0.00021259392,0.00011191165,0.001179369,0.000118883036,0.047512334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981962,0.000063919506,0.00035978734,0.0006731611,0.0003267024,0.00038022752],"domain_scores_gemma":[0.99831903,0.00007634178,0.0003020029,0.000989667,0.00020884594,0.000104131104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025925093,0.0003385007,0.00033624202,0.0001886913,0.00018177147,0.00018163897,0.001908376,0.0003009973,0.00013304967],"category_scores_gemma":[0.00011132177,0.00033379768,0.00015141029,0.00040551665,0.00002961005,0.00028676225,0.00020122639,0.00049000577,0.00014689715],"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.000091738875,0.0006798504,0.0009625834,0.0011515724,0.00016075643,0.00009645657,0.011792089,0.00000832417,0.006526359,0.5366293,0.056464676,0.38543624],"study_design_scores_gemma":[0.0008785779,0.0005519844,0.018401867,0.0023035964,0.0001609935,0.00010775278,0.0014094773,0.039507125,0.7451668,0.16274446,0.02242568,0.006341692],"about_ca_topic_score_codex":0.0005279716,"about_ca_topic_score_gemma":0.00072759285,"teacher_disagreement_score":0.75533974,"about_ca_system_score_codex":0.00008190655,"about_ca_system_score_gemma":0.00010672541,"threshold_uncertainty_score":0.9999114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016106099,0.00009385439,0.9891322,0.000019772222,0.0002589171,0.00027168717,3.2263347e-7,0.0006235577,0.00798906],"genre_scores_gemma":[0.075877115,0.000032740492,0.9231026,0.000037258375,0.000011444253,0.000010805806,0.00005688538,0.00001760732,0.0008535504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989049,0.00005995467,0.00033694674,0.00031710733,0.00024374435,0.0001373578],"domain_scores_gemma":[0.9989296,0.0001518837,0.0003389816,0.00031119824,0.00022978589,0.000038532824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284983,0.00016308874,0.0002052584,0.0004349668,0.000050186118,0.000061439394,0.00036223707,0.00023527314,0.000014606256],"category_scores_gemma":[0.00009756115,0.00016441022,0.000036237176,0.00036097903,0.000016373677,0.0003097556,0.00003398595,0.00012326855,0.0000022509296],"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.0002043354,0.00036797157,0.0013053872,0.0013894659,0.00027602998,0.000030106296,0.024599558,0.3221602,0.0069635403,0.044056978,0.010192295,0.5884541],"study_design_scores_gemma":[0.0000825301,0.00009157198,0.00059808715,0.00010777681,0.000018141613,0.000004803862,0.00011907664,0.9734521,0.024269644,0.0010308578,0.0000107351825,0.00021466806],"about_ca_topic_score_codex":0.00011147458,"about_ca_topic_score_gemma":0.00012766173,"teacher_disagreement_score":0.6512919,"about_ca_system_score_codex":0.000042589756,"about_ca_system_score_gemma":0.000120310906,"threshold_uncertainty_score":0.67044544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6913437,0.000038820195,0.24953698,0.000016658856,0.0005629048,0.00026918112,0.0000031381103,0.0005898104,0.05763877],"genre_scores_gemma":[0.6495887,0.0000175583,0.34415537,0.00002766309,0.000025046533,0.000036206085,0.00009330616,0.000019595358,0.0060365293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985557,0.000031959127,0.00032998025,0.0004927302,0.00039637063,0.00019324866],"domain_scores_gemma":[0.9982377,0.000105875384,0.0004344747,0.00074011384,0.00043394254,0.00004785176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028322364,0.0002494392,0.0004978602,0.0009754813,0.00008959905,0.0000815598,0.0009571075,0.00021202114,0.000047596226],"category_scores_gemma":[0.000028729606,0.00019611554,0.00014283085,0.001759031,0.000025303185,0.0004065469,0.000060100083,0.00045162925,0.0000036787185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013340123,0.00031805926,0.018074451,0.00059310696,0.0046610753,0.00004164245,0.050376836,0.00094740017,0.017589295,0.0044845603,0.0005715348,0.9022086],"study_design_scores_gemma":[0.00013859199,0.00030757178,0.018724209,0.00025551868,0.00078440574,0.000006691371,0.0005437699,0.71822965,0.2602094,0.00006139045,0.000049725113,0.00068906933],"about_ca_topic_score_codex":0.00013149682,"about_ca_topic_score_gemma":0.0020544657,"teacher_disagreement_score":0.9015196,"about_ca_system_score_codex":0.0000350752,"about_ca_system_score_gemma":0.00012746389,"threshold_uncertainty_score":0.79973596},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8459552e-8,0.000019689594,0.49098447,0.0005973409,0.00081999326,0.000038679795,4.290543e-8,0.0032056547,0.5043341],"genre_scores_gemma":[0.000020756126,0.0000066406196,0.21613386,0.00015079392,0.0014279197,0.000005909914,0.0000010378747,0.000097693104,0.7821554],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993672,0.000026622729,0.00006959885,0.00032078088,0.00011225072,0.00010353965],"domain_scores_gemma":[0.9990831,0.000009748126,0.00007680745,0.0007942464,0.000013195117,0.000022920272],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011803647,0.0001053289,0.00011116254,0.00018008596,0.000011805124,0.00004227786,0.0006268162,0.00012290159,0.00124527],"category_scores_gemma":[0.000027377562,0.000092990325,0.000030266929,0.000121999976,0.000010947365,0.000036283298,0.00013961477,0.00010851214,0.0013961232],"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":[4.2447134e-8,0.0000029704186,0.0000024062283,0.000005095182,0.0000024370966,3.2457012e-7,0.0000048489665,6.4855335e-8,0.000009787904,0.034129735,0.9486324,0.017209845],"study_design_scores_gemma":[0.000013026949,0.00001527393,0.0000021674211,0.00001338549,0.0000012836621,0.0000066645584,2.4007394e-7,0.00054791145,0.00029005122,0.0007812939,0.9982123,0.000116412695],"about_ca_topic_score_codex":0.00008063814,"about_ca_topic_score_gemma":0.00005324747,"teacher_disagreement_score":0.2778213,"about_ca_system_score_codex":0.000016617392,"about_ca_system_score_gemma":0.000012114333,"threshold_uncertainty_score":0.9996677},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.329848e-7,0.00016745279,0.19972666,0.00030078358,0.0005101045,0.000110068475,0.0000028406448,0.0014912067,0.7976906],"genre_scores_gemma":[0.00097351597,0.000057614736,0.0916285,0.00027297088,0.00013349255,0.0000036454517,0.0000027920196,0.000033741613,0.90689373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880344,0.000007964139,0.0001869854,0.00051235827,0.00028660832,0.00020262614],"domain_scores_gemma":[0.9973258,0.00006090018,0.00024781554,0.0021844083,0.00010641223,0.00007468544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022435762,0.0002727793,0.00029054165,0.00014358312,0.00018158225,0.0002953657,0.002713219,0.00029215158,0.00014074642],"category_scores_gemma":[0.000041758114,0.0002500547,0.00014234854,0.000006201153,0.000068934074,0.00027015194,0.00080062536,0.00038993417,0.0006136711],"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":[4.1906537e-7,0.0000026896494,0.0000071882914,0.000007750547,0.000013716977,0.00003281247,0.000037905116,4.6698357e-8,0.000019362049,0.94025093,0.026870377,0.03275678],"study_design_scores_gemma":[0.000034889013,0.00005251354,0.000011589392,0.00014051366,0.000008755058,0.000041294792,3.782589e-7,0.00032997623,0.000600588,0.26265472,0.7357034,0.00042136718],"about_ca_topic_score_codex":0.00009386895,"about_ca_topic_score_gemma":0.00011670956,"teacher_disagreement_score":0.70883304,"about_ca_system_score_codex":0.000054780652,"about_ca_system_score_gemma":0.00009223084,"threshold_uncertainty_score":0.9999952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18441749,0.0001407482,0.7754854,0.00031282342,0.00096139236,0.0010395322,0.000005465018,0.0032553875,0.03438177],"genre_scores_gemma":[0.5625193,0.00013585012,0.4107065,0.000443014,0.0003046826,0.00011101858,0.00037830992,0.0001593252,0.025241973],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996689,0.00017903725,0.0005503708,0.0012543133,0.00070364575,0.0006236117],"domain_scores_gemma":[0.99763846,0.00015408138,0.00040224896,0.0011253953,0.00045548572,0.00022433673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061675237,0.00070965715,0.0007468689,0.00037083737,0.00031821776,0.00052420725,0.0014738624,0.0004995826,0.00018435591],"category_scores_gemma":[0.000038085713,0.00058981363,0.00019715178,0.0006786406,0.00005225227,0.0010142319,0.00009897623,0.0009021098,0.00007749988],"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.0038724355,0.0077053485,0.005908682,0.009221703,0.0014363291,0.0017738063,0.067006536,0.0071372166,0.40414092,0.039986458,0.20789737,0.2439132],"study_design_scores_gemma":[0.0011444566,0.0005845454,0.009309994,0.0021794704,0.00013193121,0.00005699677,0.00046098608,0.12688464,0.85301673,0.0016328081,0.001841183,0.0027562673],"about_ca_topic_score_codex":0.0008141841,"about_ca_topic_score_gemma":0.002582233,"teacher_disagreement_score":0.4488758,"about_ca_system_score_codex":0.000161841,"about_ca_system_score_gemma":0.00030162666,"threshold_uncertainty_score":0.9996553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009595707,0.00009120181,0.9712946,0.00017507513,0.00184828,0.0010199369,0.000014439532,0.0015451382,0.023051795],"genre_scores_gemma":[0.0778391,0.00004084628,0.8557643,0.00023768946,0.00024730022,0.00065840984,0.0001656038,0.0000943319,0.064952396],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818945,0.000065880886,0.00036629968,0.0006981439,0.0003123491,0.00036787833],"domain_scores_gemma":[0.99840754,0.00029017215,0.00027931394,0.0007318722,0.00021527162,0.000075820455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049889204,0.0003099295,0.00029132908,0.00021173683,0.00017930409,0.00015479639,0.0014510902,0.00015265204,0.000039624498],"category_scores_gemma":[0.00015752864,0.00025720478,0.00015367656,0.00011974827,0.00001517555,0.0003412257,0.0000928051,0.00016214317,0.00006269599],"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.0002886483,0.00025471882,0.00007421865,0.0004409956,0.00019186297,0.000039846054,0.0015994656,0.0000032942064,0.08565721,0.067979075,0.4228784,0.42059225],"study_design_scores_gemma":[0.00038353677,0.00039456403,0.000058758178,0.00045889622,0.000027863734,0.000023150862,0.000053118216,0.0036160084,0.94655013,0.04030312,0.0073366417,0.0007941847],"about_ca_topic_score_codex":0.000044650602,"about_ca_topic_score_gemma":0.00009535975,"teacher_disagreement_score":0.86089295,"about_ca_system_score_codex":0.00015656697,"about_ca_system_score_gemma":0.0002432644,"threshold_uncertainty_score":0.999988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002859116,0.000088125016,0.9729933,0.00005396982,0.00268231,0.00077288644,0.0000047237677,0.0015048184,0.019040734],"genre_scores_gemma":[0.027074778,0.000028922956,0.9301305,0.00019657226,0.00025448075,0.0001252768,0.00016411241,0.00006450177,0.041960873],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99768275,0.00008810024,0.0005104982,0.00096883223,0.00029459587,0.0004552175],"domain_scores_gemma":[0.9977456,0.00036968675,0.00040947043,0.0007927049,0.0005112795,0.00017125515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057133345,0.00047914387,0.00057597476,0.00027989995,0.0002351203,0.00033572028,0.0015712096,0.0004331687,0.000055350432],"category_scores_gemma":[0.00033353246,0.0004660224,0.00027227012,0.0002762433,0.000019227367,0.00055430067,0.00021565655,0.0005165532,0.000046585465],"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.00017139602,0.00023565014,0.00039928666,0.00055632036,0.000306122,0.00003526933,0.027372755,0.0000021558144,0.0030147692,0.12500635,0.07464122,0.7682587],"study_design_scores_gemma":[0.0007553361,0.0006915928,0.0011024226,0.0015925231,0.00014399676,0.000038891154,0.0015513555,0.06045489,0.8153978,0.11284271,0.0028064423,0.0026220311],"about_ca_topic_score_codex":0.0012936862,"about_ca_topic_score_gemma":0.0056241886,"teacher_disagreement_score":0.81238306,"about_ca_system_score_codex":0.00013066454,"about_ca_system_score_gemma":0.00036124865,"threshold_uncertainty_score":0.99977916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024541472,0.0002346722,0.9964442,0.0003066066,0.000167161,0.00020623342,0.000020146328,0.00004847444,0.00011835997],"genre_scores_gemma":[0.97882205,0.0000044694543,0.020601826,0.0003128514,0.00018961362,0.00004528385,0.0000021879266,0.0000084715875,0.000013221933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.00008274584,0.00026046427,0.00016748143,0.00024391193,0.0001087904],"domain_scores_gemma":[0.9986559,0.0007432465,0.00025962424,0.00011008459,0.00017160871,0.00005952093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011366566,0.00008268144,0.00012138584,0.00016763069,0.00027963452,0.00011465544,0.00065222924,0.000018201781,0.0000041064745],"category_scores_gemma":[0.00005124763,0.00008175647,0.000055968536,0.00009222446,0.00009079436,0.00015355407,0.00021665025,0.00025248184,2.0559968e-7],"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.000013702481,0.000036835572,0.000009120309,0.0000029418015,0.000040967985,0.000004230641,0.00093432755,0.0007733549,0.0012795463,0.5562295,0.000031411233,0.4406441],"study_design_scores_gemma":[0.00048909424,0.00012214773,0.000080459795,0.000030352761,0.000020883726,0.0016298069,0.0006247433,0.02309721,0.0004789418,0.97148246,0.0018120481,0.00013185383],"about_ca_topic_score_codex":0.0000019693364,"about_ca_topic_score_gemma":7.996207e-7,"teacher_disagreement_score":0.97636795,"about_ca_system_score_codex":0.00005582682,"about_ca_system_score_gemma":0.00004627777,"threshold_uncertainty_score":0.33339322},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006482707,0.000030149899,0.9787057,0.00070083485,0.00069606665,0.0001227181,5.48124e-7,0.0015553749,0.017540323],"genre_scores_gemma":[0.113107115,0.0000016303918,0.88555163,0.00059905427,0.00002254017,0.00004010035,0.000002850738,0.000011677146,0.0006634212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986231,0.00034106278,0.00021144858,0.00036040478,0.00024937862,0.00021460252],"domain_scores_gemma":[0.9990397,0.00024168752,0.00010133207,0.00051373395,0.000054753964,0.00004876925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132187,0.00010267983,0.00011687649,0.00018391828,0.00033216225,0.000111863614,0.00092935085,0.000027596132,0.00023285464],"category_scores_gemma":[0.00014596633,0.00010918515,0.00005354141,0.00069494516,0.000013247574,0.00033472184,0.0010103626,0.00018105625,0.0000056883564],"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.000012766037,0.0003365583,0.00059063983,0.000015840631,0.000028021794,0.000029452587,0.002929273,0.10845462,0.028345665,0.06533854,0.023983493,0.76993513],"study_design_scores_gemma":[0.00007146132,0.00012536974,0.000009486444,0.000003146876,0.000002964074,0.00004357128,0.000086576554,0.9688645,0.0218697,0.0021996745,0.0065567815,0.0001667527],"about_ca_topic_score_codex":0.00002316572,"about_ca_topic_score_gemma":0.000003271347,"teacher_disagreement_score":0.8604099,"about_ca_system_score_codex":0.00015538544,"about_ca_system_score_gemma":0.0000412453,"threshold_uncertainty_score":0.44524413},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15447076,0.000081496124,0.84043634,0.0004605439,0.00007087149,0.00077808317,0.0000098618375,0.0011908225,0.0025012072],"genre_scores_gemma":[0.92402345,0.000001990629,0.07477333,0.00037243412,0.000009825164,0.00065376516,0.00000308917,0.000015460006,0.00014668473],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985389,0.00009348224,0.00015689785,0.00051127316,0.00038309177,0.0003163596],"domain_scores_gemma":[0.99916196,0.00008664964,0.0000537123,0.00057065894,0.000051663683,0.00007535581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042228104,0.00016234246,0.0001681738,0.00013749216,0.000386401,0.00012597586,0.0007418885,0.000024059169,0.00002127372],"category_scores_gemma":[0.000011505508,0.0001360809,0.000036148987,0.0005920954,0.00007310921,0.00020601413,0.00040155268,0.00020566594,7.3750533e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021799353,0.0010770417,0.83154523,0.00017834082,0.000071085575,0.00020857262,0.0024256064,0.00018847823,0.0035245724,0.11587191,0.0053611696,0.03932998],"study_design_scores_gemma":[0.003701361,0.0054213116,0.0997118,0.00038476882,0.00008123605,0.0004199103,0.0029219005,0.65534955,0.10091392,0.0136278495,0.11284886,0.004617535],"about_ca_topic_score_codex":0.00005079374,"about_ca_topic_score_gemma":0.00029970138,"teacher_disagreement_score":0.76955265,"about_ca_system_score_codex":0.000036904996,"about_ca_system_score_gemma":0.00006275382,"threshold_uncertainty_score":0.5549218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016618244,0.000052204276,0.97964084,0.0018793726,0.0003632493,0.0005117848,0.0000410905,0.0007490027,0.0001442122],"genre_scores_gemma":[0.8464078,0.000038393744,0.15256429,0.0001353739,0.0000071588493,0.00057375716,0.000016320395,0.000027063239,0.0002298733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987274,0.00024727092,0.0002773253,0.00034293236,0.00020444863,0.00020064322],"domain_scores_gemma":[0.9977195,0.0003824587,0.00014057165,0.0015932574,0.00010680959,0.000057349815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003975669,0.00015521444,0.00014860777,0.00022978794,0.002940448,0.00018239138,0.0011832108,0.0000625337,0.0000051907386],"category_scores_gemma":[0.000010040251,0.00019383094,0.00008953617,0.0006796235,0.000110112225,0.00036188596,0.00004830762,0.0004901491,0.0000015905185],"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.000051013754,0.00052521005,0.000037140217,0.000029907567,0.000056065746,8.3519296e-7,0.002669324,0.047049426,0.0074516702,0.024903566,0.00004849252,0.9171774],"study_design_scores_gemma":[0.00023226367,0.0001751448,0.000044061624,0.000013242615,0.000022993196,0.000042527463,0.00012188751,0.9920695,0.0054707713,0.0011473795,0.00046211432,0.00019810845],"about_ca_topic_score_codex":0.000111126275,"about_ca_topic_score_gemma":0.0004505663,"teacher_disagreement_score":0.9450201,"about_ca_system_score_codex":0.00028453945,"about_ca_system_score_gemma":0.0000696283,"threshold_uncertainty_score":0.9983576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023830952,0.000042317588,0.970544,0.0004215055,0.0012424763,0.0015821408,0.000027879621,0.0017310474,0.00057772273],"genre_scores_gemma":[0.84842145,0.00011036784,0.15004683,0.00015905406,0.0001513842,0.000020525511,0.000046694266,0.000046195604,0.0009975286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997214,0.00020131617,0.00030923414,0.0017377966,0.00012769061,0.00040995536],"domain_scores_gemma":[0.9973013,0.00022023356,0.0005990467,0.001181341,0.0005344926,0.00016357731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039298716,0.00043719774,0.00044248538,0.00038492144,0.0002672748,0.00017699534,0.0017762629,0.00046974566,0.000005771513],"category_scores_gemma":[0.00034835757,0.00054138445,0.00032617527,0.00072804414,0.00009245124,0.00054599246,0.0014633277,0.0007278963,0.00004174966],"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.001533529,0.0019777992,0.013059092,0.0026639383,0.0015167594,0.0011212474,0.017465334,0.22253816,0.003858384,0.6433671,0.04052099,0.050377674],"study_design_scores_gemma":[0.00064706296,0.0002206818,0.0002871332,0.0002598472,0.00011121482,0.000008604833,0.00015785742,0.92952627,0.0045409054,0.062441804,0.001081434,0.0007171651],"about_ca_topic_score_codex":0.00027140128,"about_ca_topic_score_gemma":0.00027542692,"teacher_disagreement_score":0.82459044,"about_ca_system_score_codex":0.00049682154,"about_ca_system_score_gemma":0.00030940078,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337368,0.0019006969,0.60870564,0.040333953,0.0031969491,0.00023729567,0.0000027806275,0.0018679874,0.0063866857],"genre_scores_gemma":[0.8876899,0.000019195679,0.11166859,0.00033266755,0.00005129591,0.000008769053,1.0603853e-7,0.000010867959,0.00021859899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865377,0.00008896657,0.00044155068,0.00018070382,0.0003893962,0.00024559913],"domain_scores_gemma":[0.998654,0.00008458307,0.00051269896,0.00051114237,0.0001908884,0.00004668811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730804,0.00011197301,0.00026954495,0.0010293572,0.00020068996,0.000031546766,0.0021848395,0.000081823084,0.0000626001],"category_scores_gemma":[0.00014768142,0.0001007055,0.00011159493,0.0010560324,0.000064514104,0.00023222205,0.000967588,0.0008386368,0.000009363763],"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.00006412606,0.00072149985,0.01490246,0.000021673262,0.00020906454,0.0023719582,0.001912783,0.00019088713,0.12342179,0.6318605,0.0839235,0.14039974],"study_design_scores_gemma":[0.000952917,0.004276257,0.0007429757,0.00005653801,0.00003946339,0.021696726,0.0007605936,0.0025644735,0.24364813,0.2967077,0.42789364,0.0006606043],"about_ca_topic_score_codex":0.0000026885534,"about_ca_topic_score_gemma":0.0000019072247,"teacher_disagreement_score":0.55032194,"about_ca_system_score_codex":0.00016756466,"about_ca_system_score_gemma":0.00012548568,"threshold_uncertainty_score":0.41066512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6162701,0.000007152285,0.28768092,0.0015054247,0.004310805,0.00073865836,0.00018232809,0.00065028545,0.0886543],"genre_scores_gemma":[0.9965596,0.000013937052,0.0012916105,0.0015058684,0.000045113462,0.0001525039,0.000079840334,0.000014151737,0.00033732684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731237,0.0002982288,0.0007716444,0.00026349231,0.0011308608,0.0002234287],"domain_scores_gemma":[0.99766713,0.0010545063,0.00054855004,0.0004958498,0.00018300828,0.000050926858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015600298,0.00021153587,0.00022659915,0.0004918316,0.00018110745,0.00012506163,0.0015859114,0.00006459892,0.00078019203],"category_scores_gemma":[0.0002481339,0.0002261733,0.00011889415,0.0004515561,0.000044369233,0.0011672806,0.00037948746,0.00046938471,0.00016265102],"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.00050700107,0.00035274425,0.001630587,0.000025775904,0.00006425279,0.000015816177,0.0064549027,0.27275878,0.0014917343,0.70935726,0.0014216712,0.005919477],"study_design_scores_gemma":[0.0019608098,0.00075066165,0.0020231092,0.00016450333,0.000011162913,0.00006853875,0.00050302444,0.84797317,0.02579239,0.11558661,0.0043748203,0.00079118996],"about_ca_topic_score_codex":0.00010891312,"about_ca_topic_score_gemma":0.000015848109,"teacher_disagreement_score":0.5937707,"about_ca_system_score_codex":0.00048735228,"about_ca_system_score_gemma":0.00008753584,"threshold_uncertainty_score":0.92230797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037843868,0.000008946991,0.9554986,0.0020300623,0.0014589649,0.000734615,0.00030223108,0.00031198707,0.0018107303],"genre_scores_gemma":[0.98626983,0.000010279082,0.00987175,0.0017504098,0.00007053731,0.0006404351,0.00012989958,0.000022073922,0.0012347688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774534,0.00017002814,0.00065492943,0.00024941127,0.0009417691,0.00023851189],"domain_scores_gemma":[0.99795705,0.00043555602,0.0006901054,0.0005359219,0.00033107577,0.00005031353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019276405,0.00021236601,0.00019254218,0.00031912496,0.00042121715,0.00013701105,0.0016002562,0.000050898692,0.000060439135],"category_scores_gemma":[0.00017948923,0.00018695167,0.0001654024,0.00035399638,0.000056744015,0.0015584902,0.00038822574,0.00031352215,0.000026486308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021128241,0.00006755042,0.000006934455,0.000024957208,0.000050896313,4.722293e-7,0.007765037,0.88804543,0.000876602,0.09667407,0.0037247934,0.0025519673],"study_design_scores_gemma":[0.00041970675,0.00018393049,0.000030449799,0.000026241625,0.000010899192,0.000013956431,0.00025093052,0.9527013,0.011851137,0.03320913,0.0011093616,0.00019299153],"about_ca_topic_score_codex":0.000037748872,"about_ca_topic_score_gemma":0.000005311743,"teacher_disagreement_score":0.948426,"about_ca_system_score_codex":0.00035264646,"about_ca_system_score_gemma":0.000118836775,"threshold_uncertainty_score":0.7623668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46021026,0.00021212341,0.5316285,0.00049803517,0.0007433096,0.0051919776,0.00016697764,0.00047126645,0.0008775513],"genre_scores_gemma":[0.99754566,0.00092239253,0.0006380209,0.00012894915,0.0001044656,0.00010767888,0.00007233663,0.00009008905,0.00039043094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907515,0.0026857734,0.0013125746,0.003273804,0.0006846386,0.0012917233],"domain_scores_gemma":[0.9857726,0.0045576617,0.0030234074,0.0051776166,0.0009748843,0.00049381156],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.004483132,0.001540324,0.0022643607,0.0008975915,0.002171503,0.0006793936,0.005314451,0.0010234467,0.000048412403],"category_scores_gemma":[0.0017166992,0.0013643496,0.0016540341,0.0015295526,0.0025483323,0.000793208,0.0021032395,0.0021207575,0.000025320478],"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.13536769,0.01167127,0.08584162,0.0051520797,0.005824732,0.0022767084,0.007475486,0.23746836,0.010337392,0.46419287,0.0077758194,0.026615966],"study_design_scores_gemma":[0.06155525,0.0019764707,0.0042212736,0.0046377187,0.0018046923,0.000054140397,0.00038046512,0.7140563,0.037099347,0.16905378,0.0013964878,0.0037640722],"about_ca_topic_score_codex":0.0012528194,"about_ca_topic_score_gemma":0.00047701603,"teacher_disagreement_score":0.5373354,"about_ca_system_score_codex":0.00031034005,"about_ca_system_score_gemma":0.0006507246,"threshold_uncertainty_score":0.9997345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62353563,0.000027772574,0.3720526,0.000074607975,0.0020301812,0.0010674188,0.000043233533,0.00019838297,0.0009701865],"genre_scores_gemma":[0.9953667,0.0006321727,0.0026797953,0.00005578507,0.00007363185,0.000008483289,0.000025858513,0.000047198824,0.0011104064],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966063,0.0001882093,0.0005537429,0.0018494551,0.00019510837,0.00060721656],"domain_scores_gemma":[0.9951794,0.00042839962,0.0016901614,0.0019137667,0.0005859706,0.00020228396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010195358,0.00060690375,0.00065659353,0.0006498109,0.0009586678,0.000223153,0.0019646485,0.00044879926,0.000025964573],"category_scores_gemma":[0.00017647014,0.00078747596,0.00031829334,0.00036348516,0.00034369572,0.001115407,0.0007903984,0.0006986245,0.000008953694],"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.0031316325,0.0012476792,0.3871764,0.0048313993,0.0012755488,0.0001300178,0.014806653,0.23498477,0.0023478211,0.1154691,0.008208961,0.22639002],"study_design_scores_gemma":[0.0014555177,0.0015267391,0.017324172,0.00071363966,0.0002420423,0.000017032744,0.00060151913,0.95013934,0.015163602,0.011293189,0.0005113751,0.001011836],"about_ca_topic_score_codex":0.001734049,"about_ca_topic_score_gemma":0.001510698,"teacher_disagreement_score":0.7151546,"about_ca_system_score_codex":0.00049382076,"about_ca_system_score_gemma":0.0003961804,"threshold_uncertainty_score":0.9994576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4438505,0.000087845074,0.5499042,0.00012847371,0.001008299,0.0010511883,0.000019734736,0.0009726376,0.0029770904],"genre_scores_gemma":[0.96135116,0.00020944525,0.03609083,0.00018483175,0.00026257386,0.000009403769,0.000045721572,0.00012402238,0.0017220372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99146307,0.00092191977,0.0009415771,0.004364779,0.0006131852,0.0016954741],"domain_scores_gemma":[0.99109954,0.00069232914,0.0016241707,0.0036774087,0.0018393752,0.001067179],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0019917828,0.0016724812,0.0016754317,0.0010043158,0.0008069679,0.00091660646,0.0053863972,0.00082973763,0.00013616188],"category_scores_gemma":[0.00025688266,0.0018195569,0.00053486734,0.0021980652,0.0007494576,0.0016235634,0.0054985336,0.0023318091,0.00026927172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022317178,0.001984286,0.036949605,0.0008133697,0.0021549219,0.008047516,0.021517528,0.57797503,0.0019336897,0.33780986,0.0011831294,0.007399362],"study_design_scores_gemma":[0.0016096856,0.000873773,0.0011548236,0.0012655827,0.00040733424,0.00009511318,0.00040313278,0.96205544,0.0022260016,0.027189352,0.00037837474,0.0023413603],"about_ca_topic_score_codex":0.001866513,"about_ca_topic_score_gemma":0.0013738816,"teacher_disagreement_score":0.51750064,"about_ca_system_score_codex":0.0020847893,"about_ca_system_score_gemma":0.0018389851,"threshold_uncertainty_score":0.99999493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5402192,0.000009810501,0.45765096,0.000028368755,0.0005172935,0.00066599075,0.000051580555,0.00016835278,0.0006884749],"genre_scores_gemma":[0.99055743,0.00026702275,0.008451304,0.00008962595,0.00004287913,0.0000035417052,0.00009333377,0.000047334823,0.0004475172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957174,0.0005808097,0.0009984629,0.001771057,0.00032847727,0.00060378714],"domain_scores_gemma":[0.99417937,0.0003461904,0.0021618016,0.0023069545,0.00080620346,0.0001995116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092696724,0.0007019789,0.0010743517,0.0009326007,0.00020023546,0.000075254255,0.0029214665,0.0005540245,0.00026107463],"category_scores_gemma":[0.00008804913,0.000898831,0.00038845759,0.0016219992,0.0003525627,0.00088494556,0.0019119477,0.00080321636,0.000026006734],"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.0004603212,0.002114713,0.010849771,0.0026334587,0.0012510745,0.00014161272,0.004057242,0.105888896,0.32989344,0.5321509,0.00027438224,0.010284162],"study_design_scores_gemma":[0.0009897186,0.0008880341,0.006442833,0.0028813665,0.00040604285,0.000009210812,0.0002106668,0.8070687,0.12710427,0.052567225,0.00011572525,0.0013162043],"about_ca_topic_score_codex":0.0007685734,"about_ca_topic_score_gemma":0.0000136572835,"teacher_disagreement_score":0.7011798,"about_ca_system_score_codex":0.0003551778,"about_ca_system_score_gemma":0.0003906683,"threshold_uncertainty_score":0.99934626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023525389,0.0055090566,0.9684541,0.0006481781,0.0005984885,0.0003860469,0.0000016951649,0.00043107485,0.00044597266],"genre_scores_gemma":[0.99002117,0.000110555375,0.009159838,0.00015765366,0.00003216889,0.000096301985,7.812775e-7,0.000018022245,0.00040353855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998263,0.00028775606,0.00021980135,0.0002860347,0.00047672828,0.00046669232],"domain_scores_gemma":[0.99860674,0.0004331083,0.00016398016,0.0006968703,0.00006650743,0.0000327656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014893559,0.00012134604,0.0001377264,0.00007355875,0.0005131124,0.00006655633,0.0015367386,0.000028742304,0.000011942597],"category_scores_gemma":[0.00008589827,0.00010047576,0.00006949971,0.00059169944,0.000049535196,0.000057414516,0.000574232,0.0003829992,0.000004091452],"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.00014190559,0.0006412449,0.00021084632,0.000031439045,0.00014494159,0.000031565014,0.0061434614,0.26426566,0.050610747,0.55450165,0.031094553,0.09218198],"study_design_scores_gemma":[0.00026051002,0.0011962762,0.00006146864,0.000012216296,0.000012160796,0.000058970378,0.00006767295,0.7858029,0.13219713,0.023263328,0.056724295,0.00034307566],"about_ca_topic_score_codex":0.000011023676,"about_ca_topic_score_gemma":0.0000052363052,"teacher_disagreement_score":0.96649575,"about_ca_system_score_codex":0.00025838186,"about_ca_system_score_gemma":0.00027171246,"threshold_uncertainty_score":0.40972826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84601635,0.0029694086,0.14709799,0.00070469215,0.0005551629,0.0005476403,0.0000036194212,0.000822873,0.0012822899],"genre_scores_gemma":[0.9890937,0.00011174893,0.010409308,0.00011011087,0.000027261614,0.000054752032,0.0000025335573,0.000013412881,0.00017714582],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998626,0.00004967516,0.00022734504,0.00032970725,0.00037702854,0.00039023272],"domain_scores_gemma":[0.9991026,0.000032262098,0.00016690101,0.00060129084,0.00006763472,0.000029308801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073159277,0.000115306415,0.00015011033,0.00010719807,0.00025589787,0.000022387825,0.0009985953,0.000016219657,0.000014298992],"category_scores_gemma":[0.000023853869,0.00012545048,0.000048744372,0.000490544,0.000022805774,0.00019785666,0.00055950374,0.0003585349,0.0000025705972],"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.000026643485,0.00024782022,0.004613255,0.000090962676,0.000047563542,0.0000047085405,0.001521358,0.00065058196,0.64998055,0.015728982,0.0015270932,0.32556048],"study_design_scores_gemma":[0.0001828686,0.0017992953,0.00041308402,0.000012039519,0.000008705284,0.000051492792,0.000028992981,0.09312185,0.8828828,0.0019228287,0.019267092,0.00030897965],"about_ca_topic_score_codex":0.000019834431,"about_ca_topic_score_gemma":0.000012169427,"teacher_disagreement_score":0.3252515,"about_ca_system_score_codex":0.00031553546,"about_ca_system_score_gemma":0.00019310466,"threshold_uncertainty_score":0.5115722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002020927,0.00008077755,0.98503,0.0060624774,0.00026228407,0.00040012284,0.000049255617,0.0012217768,0.004872375],"genre_scores_gemma":[0.8726299,0.00006119256,0.12528113,0.00039991844,0.000007506599,0.0009439672,0.000010214503,0.00002957247,0.00063662365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998127,0.00042602632,0.00032290246,0.0004113442,0.00042045096,0.00029227277],"domain_scores_gemma":[0.9954909,0.0010201,0.00017751835,0.0030113943,0.00020188814,0.000098214194],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003652791,0.0002038879,0.00019342525,0.00041426957,0.0032576423,0.00015974685,0.0032192396,0.000045786663,0.0001074934],"category_scores_gemma":[0.000016153284,0.00021502521,0.000106309606,0.0013987541,0.00017091227,0.0004979598,0.00006369162,0.0009373993,0.00003131869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027797767,0.0073137325,0.00082857336,0.000073681076,0.00091701216,0.00008436903,0.043882567,0.41802877,0.009768658,0.30379108,0.0081645595,0.20686902],"study_design_scores_gemma":[0.0017051231,0.0015747907,0.0004148209,0.00019169365,0.00022058561,0.00050684763,0.0048450194,0.9332067,0.019114029,0.008362643,0.027948774,0.0019089711],"about_ca_topic_score_codex":0.00022643193,"about_ca_topic_score_gemma":0.0010552647,"teacher_disagreement_score":0.870609,"about_ca_system_score_codex":0.0002913418,"about_ca_system_score_gemma":0.00020807738,"threshold_uncertainty_score":0.99803996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006290268,0.000085757645,0.97372246,0.017497856,0.00029428196,0.00074545556,0.00000987042,0.0012329997,0.00012105928],"genre_scores_gemma":[0.50656825,0.0000035488688,0.48922065,0.003225919,0.0000065938775,0.0008959707,0.000020793314,0.000023610346,0.00003463781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983017,0.0004643695,0.00027280903,0.0003857671,0.0002841294,0.00029126005],"domain_scores_gemma":[0.9957143,0.0010603584,0.00023157377,0.0028308562,0.00011096478,0.000051939915],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009195641,0.00018049426,0.0001789735,0.00030316832,0.0013675174,0.00012906583,0.0030998786,0.00003522963,0.000009190886],"category_scores_gemma":[0.000048894177,0.00019349008,0.00008304136,0.00063987577,0.000121181496,0.00028162566,0.00039977007,0.00039213183,0.000006804472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000592479,0.001271272,0.0020720651,0.00010083227,0.00039529835,0.000026148855,0.004476388,0.433275,0.29405415,0.019519534,0.19088075,0.05333607],"study_design_scores_gemma":[0.0005101675,0.00030677044,0.00017811122,0.000032538625,0.00003300208,0.0000209814,0.00005868443,0.9867093,0.0023966176,0.00067739136,0.008752208,0.00032424048],"about_ca_topic_score_codex":0.00005621231,"about_ca_topic_score_gemma":0.0000668699,"teacher_disagreement_score":0.55343425,"about_ca_system_score_codex":0.00040067674,"about_ca_system_score_gemma":0.00012931111,"threshold_uncertainty_score":0.9999326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004299567,0.00038396145,0.99132496,0.00041768397,0.00090180215,0.0008258126,0.000053747048,0.0015453483,0.00024713305],"genre_scores_gemma":[0.96143967,0.0000034378768,0.036685713,0.00030581973,0.00007452794,0.00090692926,0.0000037937496,0.000069070644,0.0005110588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972487,0.00015945618,0.0005238303,0.0008249476,0.00065177074,0.00059127546],"domain_scores_gemma":[0.99848765,0.00033039314,0.00026914856,0.0005442363,0.00022331456,0.00014528378],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006746768,0.00034575546,0.0003670457,0.00031331726,0.0020601912,0.00044144195,0.001166238,0.00011067873,0.00006119959],"category_scores_gemma":[0.0000083957175,0.00037579355,0.00021854395,0.00096824975,0.000055341734,0.00078129454,0.0000152042285,0.0006186847,0.000011380671],"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.00064149906,0.0018585359,0.00012523645,0.0015537112,0.00032253182,0.00013080159,0.013166628,0.41862935,0.038377266,0.0014620642,0.0057090507,0.5180233],"study_design_scores_gemma":[0.0009460905,0.0007003939,0.000012986376,0.00033708414,0.00008017162,0.00037088373,0.0009734924,0.94981956,0.04106017,0.000854353,0.0040021003,0.00084269966],"about_ca_topic_score_codex":0.00033192334,"about_ca_topic_score_gemma":0.00015400615,"teacher_disagreement_score":0.9571401,"about_ca_system_score_codex":0.00041910505,"about_ca_system_score_gemma":0.0003470889,"threshold_uncertainty_score":0.9998694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3612193,0.00011032447,0.6363218,0.00019162778,0.0007131193,0.00015333312,0.0000014467909,0.0012525537,0.000036539597],"genre_scores_gemma":[0.8407273,0.0000052960527,0.15834631,0.00022285832,0.00048886816,0.00002090647,0.0000059290696,0.000025722704,0.00015679961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986388,0.0000816142,0.00021242816,0.0003788199,0.00019090556,0.0004973993],"domain_scores_gemma":[0.99913114,0.00021347929,0.00011705445,0.00040240723,0.000065057124,0.00007087856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029856726,0.00015979569,0.00019110684,0.00012860079,0.00033035496,0.00030454143,0.00070597493,0.00006878324,0.0000032449136],"category_scores_gemma":[0.000056498906,0.00015600317,0.000105792584,0.0004432644,0.000049671642,0.00029224332,0.0003278643,0.00015359039,0.0000064188725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777075,0.000120850826,0.03424396,0.00010135859,0.000108168715,0.00012607836,0.0033125754,0.7538871,0.06378046,0.054841843,0.022992766,0.06641703],"study_design_scores_gemma":[0.00016137963,0.00004210824,0.00069199974,0.000027659768,0.0000070344895,0.00001561457,0.000016519309,0.99098307,0.005100148,0.0018432579,0.00092962105,0.00018160735],"about_ca_topic_score_codex":0.00006045616,"about_ca_topic_score_gemma":0.0000070620335,"teacher_disagreement_score":0.47950804,"about_ca_system_score_codex":0.000039527684,"about_ca_system_score_gemma":0.000022355507,"threshold_uncertainty_score":0.63616246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24660638,0.005532062,0.7077297,0.01268776,0.0037889115,0.005578565,0.0016390263,0.0024155758,0.014022032],"genre_scores_gemma":[0.89509475,0.0008321473,0.10164281,0.00020413514,0.000049707272,0.0012546881,0.00039094366,0.000048031096,0.0004828054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952848,0.0011726427,0.0012555793,0.0008735898,0.00078418053,0.0006292119],"domain_scores_gemma":[0.9918894,0.0013660847,0.00054728246,0.005429178,0.0006043952,0.00016365206],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020240024,0.0004579868,0.0006441431,0.00070644554,0.002468555,0.00007682285,0.0067756465,0.00013271131,0.00036388438],"category_scores_gemma":[0.00020358308,0.0005438337,0.0003069549,0.0017946593,0.00047647348,0.00076427084,0.0024966188,0.00095769804,0.000016032602],"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.00055224804,0.0051465034,0.03713805,0.0011057822,0.001003345,0.0000135061155,0.057783466,0.025349095,0.18726303,0.45047647,0.05197552,0.18219298],"study_design_scores_gemma":[0.0012922449,0.0011175004,0.009119399,0.00014075576,0.00013584885,0.000066983805,0.0025480904,0.9420563,0.00548934,0.011506863,0.025292419,0.0012342694],"about_ca_topic_score_codex":0.0009029798,"about_ca_topic_score_gemma":0.00063685304,"teacher_disagreement_score":0.9167072,"about_ca_system_score_codex":0.00039964574,"about_ca_system_score_gemma":0.00070300174,"threshold_uncertainty_score":0.9997013},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06357816,0.000014485169,0.9354598,0.00022624801,0.00007767715,0.0001683325,0.0000031838551,0.00041277232,0.000059342114],"genre_scores_gemma":[0.42373422,0.0000057266407,0.5760401,0.000042730062,0.00002824473,0.000025334686,0.000015732625,0.0000071850295,0.000100710466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992431,0.000027930111,0.00016050742,0.00024947707,0.00016485005,0.00015414399],"domain_scores_gemma":[0.9993632,0.00013159573,0.000104721024,0.00029178735,0.00007778651,0.000030932733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003240627,0.000081504244,0.00016352955,0.00039760058,0.00007127362,0.000062508996,0.0002410417,0.000043077383,0.000004330499],"category_scores_gemma":[0.000044227767,0.00007907742,0.00008283739,0.0010766841,0.000016111366,0.000100537894,0.00007521338,0.000049935497,0.0000016569771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010686373,0.000073758194,0.026310848,0.00008354604,0.00014861321,0.000004970727,0.0005116669,0.91944623,0.018628769,0.03139053,0.0006551931,0.0026389896],"study_design_scores_gemma":[0.00030767848,0.00007270437,0.00037709062,0.00001855828,0.00003261957,2.640146e-7,0.0000042138017,0.96479535,0.033941075,0.00032547984,0.000047148853,0.000077787234],"about_ca_topic_score_codex":0.000037844104,"about_ca_topic_score_gemma":0.0000064915926,"teacher_disagreement_score":0.36015606,"about_ca_system_score_codex":0.000025135952,"about_ca_system_score_gemma":0.000024252251,"threshold_uncertainty_score":0.32246834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077787235,0.00003250081,0.9142493,0.000066954366,0.0044867946,0.0005704961,0.000104424566,0.002625929,0.00007638906],"genre_scores_gemma":[0.989187,0.000007545294,0.009678327,0.00006704214,0.00010699528,0.000257249,0.00003700321,0.00006554108,0.00059332413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633414,0.0004366127,0.0007558534,0.0010496153,0.0007430588,0.0006807108],"domain_scores_gemma":[0.99748695,0.00022108092,0.00024975062,0.0015165954,0.000289873,0.0002357535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009071883,0.00045698753,0.0004354518,0.0008957123,0.0006730759,0.0004656367,0.0011122434,0.00025895203,0.000019080171],"category_scores_gemma":[0.000020054777,0.0004366207,0.00020664395,0.0015283411,0.00006426016,0.0009552384,0.000016214084,0.0004899685,0.00017827532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004833497,0.0004665064,0.000005564572,0.000025069912,0.00003650912,0.00001767339,0.00215981,0.95297366,0.039659645,0.00064143486,0.0004066583,0.0035591035],"study_design_scores_gemma":[0.00042739828,0.00026152632,0.000018886465,0.00029917536,0.000025883184,0.000049838378,0.0011175895,0.9784692,0.01866558,0.00003701528,0.00017625181,0.00045163953],"about_ca_topic_score_codex":0.0005368705,"about_ca_topic_score_gemma":0.00040993706,"teacher_disagreement_score":0.9113997,"about_ca_system_score_codex":0.00040278377,"about_ca_system_score_gemma":0.00013182033,"threshold_uncertainty_score":0.99980855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19662783,0.0012218792,0.77934927,0.013916568,0.0019874354,0.0012516178,0.000010219012,0.0025669725,0.0030682315],"genre_scores_gemma":[0.95809793,0.001969635,0.03922539,0.0003374979,0.00018108122,0.00010141363,0.000011468886,0.00003622591,0.000039361214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981339,0.0004572075,0.0004702274,0.00028963393,0.0002721829,0.00037686026],"domain_scores_gemma":[0.99503326,0.0015880945,0.00038106157,0.0026393605,0.00022599653,0.000132225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015060223,0.00020882775,0.00021951203,0.0004368208,0.0020631985,0.0004544097,0.002691873,0.000107853506,0.000001228055],"category_scores_gemma":[0.00007435055,0.00020791592,0.0001319331,0.0010323843,0.00012919992,0.00032542826,0.00067748065,0.00088325114,0.000014497097],"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.00008257107,0.00046448762,0.0044636494,0.000040274936,0.00008380786,0.000012712553,0.0012427442,0.0010667667,0.008285055,0.020873372,0.0010228367,0.9623617],"study_design_scores_gemma":[0.00045981875,0.00039549757,0.002903712,0.0005694993,0.000013428902,0.000036460286,0.000027430915,0.98366016,0.0005744326,0.002645887,0.008426664,0.000287032],"about_ca_topic_score_codex":0.000014190765,"about_ca_topic_score_gemma":0.00004119502,"teacher_disagreement_score":0.98259336,"about_ca_system_score_codex":0.00011533119,"about_ca_system_score_gemma":0.00007300472,"threshold_uncertainty_score":0.999236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028716786,0.00011003256,0.96417046,0.0036948794,0.0006403365,0.00053024676,0.000017908778,0.0018248825,0.00029449712],"genre_scores_gemma":[0.9894998,0.000025151192,0.009205877,0.00054934015,0.00009781355,0.00021618998,0.000015612963,0.000023674824,0.00036650445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988825,0.00003994098,0.00013152733,0.00032479412,0.0002658718,0.00035540282],"domain_scores_gemma":[0.9983218,0.00089687586,0.00007643598,0.00057944,0.00007517981,0.00005029237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030327958,0.0001490389,0.00013079528,0.00023388476,0.0002539783,0.00012619453,0.0008293298,0.000049538463,0.000002740001],"category_scores_gemma":[0.00021350959,0.00009311353,0.00006500467,0.0015165046,0.00004284022,0.00014898278,0.0001721303,0.0001761712,0.000060130307],"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.00030182043,0.00028028619,0.0010537241,0.00007899844,0.00020975452,0.00011388239,0.0026031698,0.0062177614,0.00084315054,0.7314512,0.23768191,0.019164313],"study_design_scores_gemma":[0.0010158062,0.0017650286,0.009104248,0.000117099764,0.000037850034,0.000029532835,0.00018374294,0.9040126,0.012211951,0.058699768,0.01221585,0.0006065071],"about_ca_topic_score_codex":0.000025145266,"about_ca_topic_score_gemma":0.0000073244005,"teacher_disagreement_score":0.96078306,"about_ca_system_score_codex":0.000056532597,"about_ca_system_score_gemma":0.000047058937,"threshold_uncertainty_score":0.37970594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06849601,0.000007563269,0.9266274,0.0017180049,0.0002492653,0.000284592,0.0000062841386,0.0010897783,0.0015211222],"genre_scores_gemma":[0.9875709,0.00000636004,0.011901712,0.00014435424,0.000018887382,0.00007027152,0.0000075890075,0.0000068573836,0.0002730575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991158,0.000050455954,0.00019216927,0.0002160229,0.00020203431,0.00022351924],"domain_scores_gemma":[0.9976554,0.0016979869,0.00009389188,0.0004202224,0.00010434178,0.000028191456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009888135,0.00008436203,0.00011709809,0.00012811903,0.00014486564,0.000051065355,0.00059699395,0.000042204145,0.000004584421],"category_scores_gemma":[0.00090583996,0.000058235386,0.00007573675,0.0012414427,0.000025970086,0.00010216953,0.00015292458,0.00007018078,0.000028077317],"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.0000044917424,0.000023406934,0.00016990404,0.00000998501,0.000007709052,0.0000011093043,0.0001070186,0.00014747416,0.0021301825,0.9474019,0.030363083,0.019633777],"study_design_scores_gemma":[0.00012757936,0.0002176419,0.0014441963,0.00003859917,0.0000065139375,0.000002846876,0.000028076916,0.65431243,0.25579643,0.086489,0.0013959405,0.00014071092],"about_ca_topic_score_codex":0.000034188583,"about_ca_topic_score_gemma":0.000018138539,"teacher_disagreement_score":0.9190749,"about_ca_system_score_codex":0.000042085663,"about_ca_system_score_gemma":0.00003510079,"threshold_uncertainty_score":0.23747702},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22708884,0.000031050135,0.7614906,0.0007717843,0.00063887215,0.0005569147,0.000007490436,0.005072172,0.004342296],"genre_scores_gemma":[0.93076056,0.000034619356,0.06432359,0.00042249492,0.00007149325,0.00012791733,0.000016003938,0.00003415187,0.004209149],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848074,0.00005880494,0.00027989715,0.0005329043,0.00017391292,0.0004737348],"domain_scores_gemma":[0.9986694,0.0004160363,0.00008693896,0.00053967745,0.00018539198,0.00010255588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073336286,0.00020194985,0.00024254828,0.00015005475,0.00025523728,0.00036250261,0.00094463053,0.000059702477,0.000032685184],"category_scores_gemma":[0.00019122733,0.00017861817,0.00010583869,0.00069771596,0.000036076104,0.00045465847,0.00025710365,0.00012193829,0.000114808165],"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.00015989135,0.00022870874,0.003933751,0.0003318871,0.00014808723,0.00019515518,0.0016717422,0.0005127713,0.05600013,0.04071474,0.72013205,0.17597109],"study_design_scores_gemma":[0.001371607,0.00028654232,0.0011090365,0.00011960784,0.000018019897,0.000037345817,0.000052050353,0.41028446,0.51999193,0.05247039,0.013430785,0.00082824484],"about_ca_topic_score_codex":0.00004395946,"about_ca_topic_score_gemma":0.00012622535,"teacher_disagreement_score":0.7067013,"about_ca_system_score_codex":0.000033141274,"about_ca_system_score_gemma":0.00006687934,"threshold_uncertainty_score":0.7283837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534498,0.0004708393,0.027907351,0.013587924,0.0009823218,0.00023954135,0.000004047071,0.0024792685,0.00087894476],"genre_scores_gemma":[0.9718005,0.00033139443,0.027352206,0.00020260605,0.000085807995,0.0000082806055,0.0000012830646,0.00003145169,0.00018648793],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974253,0.00011539042,0.0009018175,0.0004761246,0.0004404134,0.0006409319],"domain_scores_gemma":[0.99763465,0.00022258793,0.00071390846,0.00073600543,0.0005314163,0.00016142888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010706806,0.00031616955,0.00067320757,0.0016932215,0.00022155323,0.00012040087,0.0018360774,0.00044318798,0.000019092746],"category_scores_gemma":[0.000500786,0.0002652576,0.00014298449,0.0023383305,0.00044886593,0.0005334062,0.0008334725,0.0009707696,0.0000753456],"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.00013760387,0.00075242197,0.034919713,0.00034248526,0.00040077785,0.0044722273,0.0026301167,0.00003971292,0.5903846,0.2178394,0.028573425,0.11950752],"study_design_scores_gemma":[0.0020124123,0.0024013284,0.014852155,0.0008199347,0.00007707419,0.006455063,0.0005430962,0.013956749,0.6823595,0.26952094,0.00578518,0.001216555],"about_ca_topic_score_codex":0.000019417648,"about_ca_topic_score_gemma":0.000023209115,"teacher_disagreement_score":0.11829096,"about_ca_system_score_codex":0.00012881414,"about_ca_system_score_gemma":0.00018705564,"threshold_uncertainty_score":0.99998},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047148083,0.0000744208,0.6995869,0.0015555602,0.001104224,0.001365748,0.00005863589,0.0049035717,0.29134616],"genre_scores_gemma":[0.00035594657,0.000054120286,0.18652365,0.00039792072,0.00021824053,0.00016781222,0.000054038064,0.00015583039,0.81207246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718434,0.000031591513,0.00051776954,0.0013139877,0.00047832803,0.00047396673],"domain_scores_gemma":[0.9966858,0.0006845822,0.0002472836,0.0018565536,0.00038276069,0.00014302133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006661705,0.0005693827,0.0006501691,0.0003644066,0.00020909996,0.00018182433,0.001781435,0.00057097623,0.00004583548],"category_scores_gemma":[0.00033069518,0.0004903472,0.00047506456,0.00014629531,0.000094423696,0.00013529342,0.00062942965,0.0006695381,0.00011494791],"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.00008679806,0.00004755687,0.00002436284,0.0006964038,0.00014393756,0.00005009689,0.0008013746,0.00007762958,0.000070879,0.60061324,0.19924511,0.19814263],"study_design_scores_gemma":[0.00033569025,0.00021142792,0.000011910466,0.00027028055,0.000027503616,0.000019737665,0.0000018782674,0.0012019195,0.0004149597,0.59385043,0.40294564,0.0007086594],"about_ca_topic_score_codex":0.000048265156,"about_ca_topic_score_gemma":0.00048444074,"teacher_disagreement_score":0.52072626,"about_ca_system_score_codex":0.00008348052,"about_ca_system_score_gemma":0.00016740726,"threshold_uncertainty_score":0.99975485},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.036508e-7,0.00010496941,0.68922967,0.0010436538,0.00089298584,0.00087953836,0.00003810027,0.0034467017,0.3043637],"genre_scores_gemma":[0.000048382157,0.00005553792,0.2559563,0.00058642356,0.00024091425,0.00011588038,0.000034479053,0.0001409931,0.7428211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975164,0.000021500187,0.00042245706,0.0010782784,0.00047427107,0.0004870987],"domain_scores_gemma":[0.9977212,0.0004857622,0.00021428427,0.0011136465,0.0003374352,0.00012770116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042079965,0.00057899463,0.00058325176,0.0004342151,0.0001974538,0.0002309062,0.0017653208,0.00052132306,0.00007336424],"category_scores_gemma":[0.00013516753,0.0004988186,0.0003869009,0.00015354995,0.0000710434,0.00012504327,0.0006327513,0.0006484242,0.00014812981],"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.000048816866,0.000018769677,0.0000051628076,0.00031940677,0.00016075913,0.00005629196,0.0005238224,0.000017163868,0.00006494996,0.3742609,0.29374164,0.33078232],"study_design_scores_gemma":[0.00038045656,0.00019467986,0.0000055172386,0.00036634592,0.00004324322,0.000048263784,0.000002727624,0.0012786326,0.0003962442,0.34959283,0.6468116,0.0008794834],"about_ca_topic_score_codex":0.000028223423,"about_ca_topic_score_gemma":0.00027861938,"teacher_disagreement_score":0.4384574,"about_ca_system_score_codex":0.000058839196,"about_ca_system_score_gemma":0.0001233978,"threshold_uncertainty_score":0.9997463},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018137163,0.00005684248,0.7769979,0.0008770882,0.0003274573,0.00092718913,0.00003049408,0.0021989678,0.21858221],"genre_scores_gemma":[0.00034808094,0.000044303233,0.14461607,0.00038097228,0.00015991567,0.00018840925,0.000037326547,0.00013514321,0.8540898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981437,0.000009355527,0.00026103534,0.00079636934,0.00045111348,0.00033845776],"domain_scores_gemma":[0.9984296,0.00023326755,0.00016981357,0.0009477271,0.00012038091,0.00009918752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023842699,0.00043978723,0.00043975384,0.00024786146,0.00013909106,0.0001508775,0.0010099784,0.0002393101,0.000027238737],"category_scores_gemma":[0.000017892917,0.000317148,0.00021626928,0.00006208631,0.000058887355,0.000083636405,0.0002815756,0.0003751513,0.0000667049],"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.00017458295,0.000031498927,0.000020047783,0.00036400376,0.000329285,0.00014694974,0.0015701929,0.00008292697,0.000044217533,0.6663331,0.09609297,0.23481025],"study_design_scores_gemma":[0.00086042064,0.0007360272,0.0000119101405,0.0006624518,0.00006640695,0.00008017224,0.0000023569883,0.00043359792,0.0008249649,0.217254,0.778067,0.0010007106],"about_ca_topic_score_codex":0.00002550869,"about_ca_topic_score_gemma":0.0004871266,"teacher_disagreement_score":0.681974,"about_ca_system_score_codex":0.000059337133,"about_ca_system_score_gemma":0.00008282642,"threshold_uncertainty_score":0.99992806},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.5260732e-7,0.00007428237,0.58903605,0.00090444996,0.0008119468,0.0005606863,0.00003032991,0.0031859938,0.4053959],"genre_scores_gemma":[0.000102187565,0.000040173534,0.119285524,0.00046741235,0.00027522768,0.00008589626,0.000036481502,0.00011734861,0.87958974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811834,0.000012081266,0.0003260964,0.0008358856,0.00035244878,0.0003551653],"domain_scores_gemma":[0.9980469,0.0003734966,0.00017283282,0.0011225248,0.0001778054,0.000106460735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030422246,0.0004337783,0.00045501423,0.00033840747,0.00016726274,0.0002132908,0.0015618185,0.00040085812,0.000045614433],"category_scores_gemma":[0.000081194376,0.00037924433,0.00039336673,0.00007869836,0.000059132883,0.000091373964,0.0004730539,0.0005046063,0.00011655386],"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.000013611156,0.0000068431077,0.0000029997773,0.00013931344,0.00005723931,0.000033339846,0.0002849226,0.0000058375495,0.000023909346,0.77854896,0.13117631,0.08970671],"study_design_scores_gemma":[0.00017323045,0.00012126525,0.0000021075414,0.0002235183,0.000021009193,0.000024327657,0.0000012448845,0.00054683164,0.00025525838,0.43788737,0.5602671,0.00047671798],"about_ca_topic_score_codex":0.000030085464,"about_ca_topic_score_gemma":0.00066701084,"teacher_disagreement_score":0.47419387,"about_ca_system_score_codex":0.000047899834,"about_ca_system_score_gemma":0.0000847624,"threshold_uncertainty_score":0.99986595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030060248,0.0007518959,0.96512324,0.002780214,0.00015257942,0.00040675214,0.000017089737,0.00057436706,0.00013358823],"genre_scores_gemma":[0.71089435,0.0010923789,0.28762242,0.00020899986,0.000011173851,0.00010507742,0.0000055202204,0.000012047788,0.000048010435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982086,0.00012186157,0.0004308539,0.00047809246,0.00029423853,0.00046638589],"domain_scores_gemma":[0.9976266,0.0008408186,0.00020992894,0.0011023656,0.00013316933,0.000087125474],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011789246,0.00019989797,0.0002702606,0.00053550577,0.0013659872,0.00027631826,0.0020812107,0.00006956233,0.0000023645878],"category_scores_gemma":[0.000015585956,0.00020128998,0.00013999318,0.0012727807,0.00037256375,0.0005389103,0.00016501614,0.0002549376,0.000005521194],"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.000051056522,0.0015188633,0.00049150176,0.00021737206,0.00038855104,0.0000015297625,0.007986752,0.012672822,0.03238732,0.23871309,0.0017818995,0.70378923],"study_design_scores_gemma":[0.00029700465,0.0011073117,0.00009601748,0.0001165521,0.000016851509,0.000019820864,0.00030173562,0.96879697,0.018220326,0.0084954705,0.0022377963,0.00029412837],"about_ca_topic_score_codex":0.00008713784,"about_ca_topic_score_gemma":0.00014963064,"teacher_disagreement_score":0.9561242,"about_ca_system_score_codex":0.00008866706,"about_ca_system_score_gemma":0.0001595615,"threshold_uncertainty_score":0.9999341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07115214,0.0000015851476,0.92400855,0.0002721831,0.00024401206,0.00013297008,0.000004736956,0.0028182722,0.0013655353],"genre_scores_gemma":[0.68474543,0.000004282227,0.31441522,0.00013355412,0.000025810677,0.00002805841,0.0000043450523,0.0000132872165,0.0006300496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879146,0.00004042041,0.00017617088,0.00036846052,0.00026532562,0.00035816908],"domain_scores_gemma":[0.9991121,0.00016491188,0.000070237635,0.0004877433,0.00009018962,0.00007481244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021141309,0.00013222818,0.00013237234,0.00012243858,0.00011018882,0.0001238865,0.00058169843,0.00003897059,0.00004851663],"category_scores_gemma":[0.000074933625,0.00010883604,0.000020601192,0.0005917122,0.00002051039,0.00023150285,0.00023854239,0.000116708405,0.00015554194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009875049,0.00024177895,0.02873028,0.00023505316,0.00018031383,0.0008202373,0.011726364,0.0015552796,0.04387253,0.21659741,0.066598244,0.62934375],"study_design_scores_gemma":[0.0008749602,0.0007735698,0.011080195,0.0001729556,0.000020685902,0.00004653391,0.000364547,0.5865902,0.38437042,0.012737461,0.001772217,0.0011963089],"about_ca_topic_score_codex":0.00009577039,"about_ca_topic_score_gemma":0.00042523514,"teacher_disagreement_score":0.6281474,"about_ca_system_score_codex":0.00003090628,"about_ca_system_score_gemma":0.000059092014,"threshold_uncertainty_score":0.44382048},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21724676,0.0000142189365,0.7739119,0.00036116128,0.00037854048,0.00013183948,0.0000023487269,0.0045901597,0.00336306],"genre_scores_gemma":[0.78796434,0.0000035687026,0.21145585,0.00021900587,0.00003862065,0.0000029905866,0.0000033834006,0.000011737383,0.00030053096],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987388,0.00009296629,0.00018777596,0.00036137638,0.00029347185,0.0003255932],"domain_scores_gemma":[0.99901146,0.00012139589,0.000068829286,0.00063795724,0.00008036941,0.00008001257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611633,0.00013230705,0.00016077209,0.00017887473,0.00023889975,0.00014170528,0.0009201676,0.00006150175,0.000026812122],"category_scores_gemma":[0.000052838906,0.00011842675,0.00005785227,0.00082478585,0.00006986766,0.0003767204,0.00076137076,0.00015650399,0.00016276618],"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.00003051807,0.00052083516,0.044213798,0.00032055622,0.00005902978,0.0003278989,0.003964657,0.0022019118,0.5009186,0.29028198,0.0712845,0.085875675],"study_design_scores_gemma":[0.0001269377,0.000046663066,0.005953234,0.00010624983,0.0000030166107,0.000030812236,0.00004219352,0.86139584,0.11174375,0.019503433,0.00075024326,0.00029762974],"about_ca_topic_score_codex":0.00046120482,"about_ca_topic_score_gemma":0.00005734127,"teacher_disagreement_score":0.8591939,"about_ca_system_score_codex":0.00005310068,"about_ca_system_score_gemma":0.000039327486,"threshold_uncertainty_score":0.48293027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027108999,0.000013652198,0.9641819,0.0009239138,0.00024163038,0.0005622468,0.000004986854,0.005831201,0.0011314404],"genre_scores_gemma":[0.47040772,0.0000013322186,0.52844226,0.00022366008,0.000035421184,0.000114963696,0.0000064519454,0.000019969148,0.0007481813],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998693,0.00001734212,0.0002260667,0.00047226783,0.00019746103,0.00039386022],"domain_scores_gemma":[0.998896,0.00025344928,0.00006514888,0.00054923963,0.00016889829,0.00006727125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005670841,0.00014481327,0.00016532319,0.0001926837,0.00015152663,0.00013953999,0.0008349545,0.00007547736,0.0000054866573],"category_scores_gemma":[0.0005297439,0.00013556304,0.00007721226,0.0009327251,0.000028702985,0.00029188965,0.00034645095,0.00010555924,0.000050571794],"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.000021656151,0.00026477096,0.0012709426,0.0003128574,0.00008406641,0.000015316211,0.0019187294,0.00093065907,0.5899886,0.3528139,0.018715328,0.0336632],"study_design_scores_gemma":[0.00019563582,0.00008386009,0.00090521853,0.000054240925,0.0000036857075,0.000012421221,0.000019970214,0.96942806,0.012647357,0.015530355,0.0008833172,0.00023586767],"about_ca_topic_score_codex":0.00011516723,"about_ca_topic_score_gemma":0.00004874001,"teacher_disagreement_score":0.9684974,"about_ca_system_score_codex":0.00006160321,"about_ca_system_score_gemma":0.00006616681,"threshold_uncertainty_score":0.55281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047260173,0.016134199,0.85037625,0.040051576,0.013757074,0.0023755848,0.0005311422,0.0068350937,0.022678927],"genre_scores_gemma":[0.61552006,0.0057308767,0.29681844,0.0008207747,0.0011313396,0.00022646252,0.00007897215,0.00034832774,0.07932479],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99489236,0.00070692325,0.0016130677,0.0007173149,0.00072756776,0.0013427924],"domain_scores_gemma":[0.99211675,0.0029710464,0.0011836414,0.0021770874,0.0010813773,0.00047010725],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025054498,0.000591641,0.00085754105,0.00058291946,0.0018282704,0.003966975,0.0037019171,0.00029042584,0.00009027533],"category_scores_gemma":[0.002808153,0.00061477604,0.00050459267,0.0019772043,0.00061916414,0.0035660367,0.00069125113,0.001032091,0.0009807909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023868715,0.00023754919,0.0009567804,0.0005084904,0.00028634636,0.00026036994,0.0040122997,0.0005285752,0.00053806946,0.028483607,0.2461682,0.7179958],"study_design_scores_gemma":[0.0018393435,0.0016006839,0.039132785,0.005796759,0.00026225246,0.0073802113,0.00059010705,0.3398199,0.0025115989,0.25005475,0.34920695,0.0018046737],"about_ca_topic_score_codex":0.00024393263,"about_ca_topic_score_gemma":0.00014795618,"teacher_disagreement_score":0.7161912,"about_ca_system_score_codex":0.0006989412,"about_ca_system_score_gemma":0.0007019295,"threshold_uncertainty_score":0.99979705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08773649,0.00006161008,0.90078336,0.002410603,0.0014495953,0.0015046692,0.00004750801,0.0020280671,0.003978097],"genre_scores_gemma":[0.9961927,0.000029730221,0.0015780425,0.00095063174,0.00008809926,0.0002256044,0.000022209142,0.000015152169,0.00089782616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986687,0.00012163692,0.000383073,0.00019930645,0.00027156033,0.00035577203],"domain_scores_gemma":[0.99837023,0.0008163067,0.00020345167,0.00044036086,0.00010704766,0.00006259107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023101396,0.00018812217,0.00016993697,0.00024230538,0.00039863816,0.00027050934,0.0005867306,0.00006296311,0.0000073580973],"category_scores_gemma":[0.00028356948,0.00014813291,0.00006447923,0.00046563346,0.00012042954,0.002183864,0.00018145381,0.00013234527,0.00008408604],"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.00022061857,0.000101401165,0.00028582898,0.0005565257,0.00013611789,0.0000040943264,0.049120978,0.0005629826,0.009514492,0.7645172,0.044210516,0.13076928],"study_design_scores_gemma":[0.0029687078,0.0009108655,0.0033584235,0.0003179139,0.000062603984,0.00018455047,0.0051834686,0.54925644,0.049874753,0.31735894,0.06908165,0.0014416674],"about_ca_topic_score_codex":0.0000063659863,"about_ca_topic_score_gemma":0.000010556299,"teacher_disagreement_score":0.9084562,"about_ca_system_score_codex":0.00009002403,"about_ca_system_score_gemma":0.000048358033,"threshold_uncertainty_score":0.60406846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013717793,0.000020775398,0.97953856,0.0022076615,0.00033031873,0.00043469504,0.000011807771,0.0024311838,0.0013072313],"genre_scores_gemma":[0.7112314,0.000011955194,0.28432783,0.0016263163,0.000039162813,0.00009633953,0.000016505603,0.000026775948,0.0026236954],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884295,0.000045710025,0.00018254026,0.0004268825,0.00018969808,0.00031218812],"domain_scores_gemma":[0.9985482,0.00077083573,0.000056154742,0.0004597175,0.0000859665,0.00007909434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565044,0.0001517897,0.0001858514,0.00026670328,0.00016660812,0.00013540716,0.00046814015,0.000068852634,0.000013492357],"category_scores_gemma":[0.00033006683,0.00013129979,0.000061444356,0.00047733187,0.000032917353,0.00016871694,0.00012910327,0.00007970946,0.000022817601],"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.0006374557,0.0004271696,0.023652658,0.00045914005,0.00013577075,0.000067390196,0.0028439937,0.0050188224,0.026015248,0.19061038,0.5505898,0.19954215],"study_design_scores_gemma":[0.0006938871,0.00022128962,0.00036177685,0.00003661536,0.000005975002,0.000001933921,0.000066200664,0.9685389,0.02097905,0.0054461155,0.0034318739,0.00021639357],"about_ca_topic_score_codex":0.00019158902,"about_ca_topic_score_gemma":0.00027929022,"teacher_disagreement_score":0.96352005,"about_ca_system_score_codex":0.000027164933,"about_ca_system_score_gemma":0.000067156965,"threshold_uncertainty_score":0.535425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6437121,0.000052594645,0.34269893,0.0008468951,0.0006431797,0.00019632008,0.00000177632,0.010107599,0.0017406017],"genre_scores_gemma":[0.95343065,0.000011133168,0.04412101,0.00047129023,0.00005456619,0.000006555576,0.0000053551557,0.000024725416,0.001874701],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837774,0.00006504303,0.00026836083,0.0005035837,0.00028971708,0.00049556716],"domain_scores_gemma":[0.9987341,0.00020664216,0.000070666145,0.00074696075,0.00013644758,0.00010518005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137408,0.00016890801,0.00016301256,0.0002879745,0.00023653154,0.000298827,0.0010156075,0.00010306889,0.000044231252],"category_scores_gemma":[0.00016977622,0.00015662912,0.00008968825,0.0014950011,0.000038167032,0.0005735012,0.0006350039,0.0002019029,0.0005391033],"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.00011833684,0.0005454039,0.47191572,0.00022351454,0.0002922928,0.0025176336,0.010023918,0.108614236,0.12965296,0.08301038,0.12524255,0.067843035],"study_design_scores_gemma":[0.00022448355,0.00009759223,0.012192111,0.000028090626,0.0000032888931,0.000018892822,0.000025012474,0.963121,0.017531035,0.0046371673,0.0018151882,0.0003061272],"about_ca_topic_score_codex":0.00021936055,"about_ca_topic_score_gemma":0.000013833832,"teacher_disagreement_score":0.8545068,"about_ca_system_score_codex":0.000057143287,"about_ca_system_score_gemma":0.00005454887,"threshold_uncertainty_score":0.6929262},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049991425,0.00003816701,0.9456634,0.0017712509,0.000066259985,0.00042080114,0.0000075709654,0.0017699946,0.0002711341],"genre_scores_gemma":[0.8919511,0.000019129242,0.10770222,0.00010324564,0.0000104565715,0.00006572932,0.000049542068,0.0000071603163,0.00009140651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929565,0.000063111875,0.00015532314,0.00021193169,0.00009618092,0.00017778887],"domain_scores_gemma":[0.99906033,0.0003444671,0.00006741262,0.00041729625,0.0000721879,0.000038287646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086187804,0.00007012032,0.000088455155,0.000050996226,0.00026161436,0.00012269351,0.00039310358,0.0000364174,6.477833e-7],"category_scores_gemma":[0.00019232294,0.00006797153,0.000020758613,0.00028993824,0.000022140472,0.0002804419,0.0002894449,0.00008331682,0.0000050370077],"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.000008907557,0.0000397791,0.0010625772,0.00022270546,0.000011129856,0.0000010123517,0.0030900906,0.00009801367,0.0026376403,0.9210604,0.005290841,0.066476926],"study_design_scores_gemma":[0.00031185304,0.00013791729,0.009669822,0.00017209805,0.000008744477,0.000015161059,0.00028796794,0.6906731,0.002004738,0.29470944,0.0016930038,0.0003161223],"about_ca_topic_score_codex":0.00019617242,"about_ca_topic_score_gemma":0.00011042739,"teacher_disagreement_score":0.8419597,"about_ca_system_score_codex":0.000064562926,"about_ca_system_score_gemma":0.00002842008,"threshold_uncertainty_score":0.27717984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42666876,0.000058567293,0.56951654,0.000107696236,0.00076157163,0.0006040165,0.000010442223,0.0021063718,0.00016601179],"genre_scores_gemma":[0.9000919,0.00009907556,0.09735988,0.00009235179,0.00015313383,0.000005981838,0.000029556546,0.00010271146,0.0020654034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573267,0.0003280585,0.0003867566,0.0024549703,0.0003264865,0.0007710923],"domain_scores_gemma":[0.9955534,0.00015756332,0.000568061,0.0029419912,0.0005476546,0.00023136969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070452754,0.0007366439,0.00081066025,0.0006488132,0.000373451,0.00031727628,0.00326106,0.0003714276,0.000017250873],"category_scores_gemma":[0.00009286071,0.00076587725,0.00027618857,0.0014069785,0.00027892494,0.000540568,0.0034401056,0.0009081332,0.0000521517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003159074,0.00038337975,0.027950881,0.0005744811,0.0009101517,0.0030605893,0.0015290948,0.9031692,0.0068202694,0.052666847,0.001294111,0.0013250567],"study_design_scores_gemma":[0.0006606704,0.00011698284,0.0014687311,0.00043805118,0.00024426111,0.000039801733,0.000047763624,0.9778325,0.0037568978,0.013903363,0.00020134675,0.0012896499],"about_ca_topic_score_codex":0.003257172,"about_ca_topic_score_gemma":0.0017453375,"teacher_disagreement_score":0.47342315,"about_ca_system_score_codex":0.00048534054,"about_ca_system_score_gemma":0.0006452271,"threshold_uncertainty_score":0.99947923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11472877,0.000018044531,0.8623096,0.00037110722,0.00012056483,0.000098516364,9.106132e-7,0.0024633443,0.019889178],"genre_scores_gemma":[0.82441336,0.0000053688427,0.17467934,0.00009049346,0.0000095384485,0.000004970643,5.798304e-7,0.0000070356423,0.00078932283],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993163,0.00002744576,0.00012212203,0.00018945069,0.00017937338,0.00016534465],"domain_scores_gemma":[0.99918854,0.00025615,0.00005681148,0.0004026564,0.00006312079,0.00003269614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033362527,0.00007157461,0.00010899897,0.00017307633,0.00004751319,0.00002977414,0.0005328519,0.000026818267,0.000010251743],"category_scores_gemma":[0.00007924698,0.0000559974,0.000026610474,0.0007660389,0.00002812107,0.00020620089,0.0002052084,0.00006999504,0.000038413666],"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.00007190015,0.00030428072,0.16721885,0.00043244107,0.00023076682,0.0004291019,0.018832166,0.0040207338,0.10640358,0.29659733,0.04877897,0.35667986],"study_design_scores_gemma":[0.0004297162,0.00056445145,0.010375704,0.00022583816,0.000011707306,0.000048676557,0.00054362527,0.4103463,0.56560904,0.009885644,0.0013139644,0.0006453473],"about_ca_topic_score_codex":0.00010457005,"about_ca_topic_score_gemma":0.00007297643,"teacher_disagreement_score":0.7096846,"about_ca_system_score_codex":0.00001214056,"about_ca_system_score_gemma":0.000035932873,"threshold_uncertainty_score":0.22835077},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008778122,0.9738508,0.022801545,0.000016629801,0.00014896259,0.0021315538,0.000042446012,0.0004783026,0.00044199565],"genre_scores_gemma":[0.00032398888,0.97747755,0.021096777,0.00007447162,0.000019363139,0.00031050033,0.00066523417,0.000026663802,0.0000054662546],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.996255,0.00072439987,0.0016673706,0.0003553289,0.00073044124,0.00026745576],"domain_scores_gemma":[0.99404204,0.00054150313,0.0018968816,0.0024880967,0.0009719342,0.00005954609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00405973,0.000388858,0.0012559636,0.0006165634,0.00024376748,0.00019935468,0.0022134527,0.00021785677,0.0000051974894],"category_scores_gemma":[0.0011024376,0.00034720148,0.00011489761,0.001127049,0.00014074147,0.0023682301,0.0017632138,0.00042587623,0.000035325596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3498885e-7,0.0000047776302,0.0000018728408,0.09118973,0.00006118217,1.07926276e-7,0.0009313211,0.000018376535,2.8478001e-7,0.000096286916,0.00027542608,0.90742],"study_design_scores_gemma":[0.00048436958,0.00023059578,0.00019275107,0.46326882,0.0039364826,0.00050679623,0.00027408774,0.13053517,0.00007214202,0.0036819826,0.3950051,0.0018116923],"about_ca_topic_score_codex":0.000061607636,"about_ca_topic_score_gemma":0.000026578133,"teacher_disagreement_score":0.9056083,"about_ca_system_score_codex":0.00029832806,"about_ca_system_score_gemma":0.000533882,"threshold_uncertainty_score":0.999898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0405854,0.00043030878,0.95635897,0.00030925413,0.001770339,0.0004423217,0.00000413026,0.000095399315,0.0000038543017],"genre_scores_gemma":[0.9880656,0.00002271319,0.011418948,0.000068650785,0.00037093626,0.000011166028,7.555619e-7,0.00001779971,0.000023446128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987844,0.000079515514,0.0004143205,0.00020328726,0.00028881457,0.00022961816],"domain_scores_gemma":[0.99833846,0.00073834043,0.0004411383,0.00019894603,0.00018451607,0.000098620505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079054147,0.00015177699,0.00028129263,0.0002597986,0.00023305306,0.00032016332,0.00037531965,0.00006635876,9.539589e-8],"category_scores_gemma":[0.000045824734,0.000105049156,0.000080941434,0.0003373473,0.00004174055,0.00022551243,0.00010340963,0.00022144159,3.725314e-7],"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.000008799289,0.000026634341,0.00020043658,0.00011311377,0.00011291676,0.00004017865,0.0047748843,0.20877054,0.00054964004,0.0007085945,0.0008920384,0.7838022],"study_design_scores_gemma":[0.00038394646,0.00014143315,0.0008367931,0.00052246655,0.000029723662,0.0014761226,0.00019315214,0.99548006,0.000026764967,0.00047380634,0.00030774658,0.00012796008],"about_ca_topic_score_codex":0.00004655177,"about_ca_topic_score_gemma":0.0000035387363,"teacher_disagreement_score":0.9474802,"about_ca_system_score_codex":0.000043984965,"about_ca_system_score_gemma":0.00006607955,"threshold_uncertainty_score":0.42837802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013504433,0.00047532577,0.9914793,0.00027090465,0.004935513,0.0015312396,0.00008343795,0.0010606936,0.000028535975],"genre_scores_gemma":[0.90675884,0.000008269789,0.09229043,0.000059306156,0.00016156318,0.00032803323,0.0000032935598,0.000042437456,0.00034784648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977904,0.0002714773,0.0005782171,0.0005486438,0.0004510676,0.00036017408],"domain_scores_gemma":[0.9971468,0.0017523344,0.00014775363,0.0006360773,0.00025085817,0.000066200104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252988,0.00028958992,0.00032066507,0.0003836996,0.00039130147,0.00033620186,0.0007343711,0.00015473361,0.0000042973224],"category_scores_gemma":[0.000022719063,0.0002094089,0.00025258042,0.00075207977,0.000062616054,0.00032954683,0.0000053339927,0.00050927495,0.000017643993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051398823,0.00024166628,3.1692295e-7,0.00024003055,0.00020795126,0.000006704605,0.009027112,0.64670485,0.0101232035,0.0016282317,0.00093488244,0.33083364],"study_design_scores_gemma":[0.00019089767,0.00027826874,7.577366e-7,0.00063916744,0.000054239074,0.00007899047,0.0004449316,0.9733298,0.024079302,0.00039062486,0.00030685303,0.0002061976],"about_ca_topic_score_codex":0.00008972326,"about_ca_topic_score_gemma":0.00005814166,"teacher_disagreement_score":0.9066238,"about_ca_system_score_codex":0.00015098815,"about_ca_system_score_gemma":0.00014449756,"threshold_uncertainty_score":0.85394466},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019759611,0.00007405846,0.9542588,0.000045271594,0.0003799984,0.000557467,0.0000040219447,0.0029655704,0.04169503],"genre_scores_gemma":[0.02721781,0.000039358252,0.2450308,0.00017349025,0.00021642796,0.0000537879,0.00007559585,0.00030253935,0.7268902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821365,0.000042799602,0.00033887653,0.0008032923,0.00024419403,0.0003571948],"domain_scores_gemma":[0.9973675,0.0015954212,0.0002669884,0.00047277551,0.00020388252,0.00009341747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013149547,0.0003537785,0.00043785057,0.0002629391,0.00021036269,0.0002190019,0.0007125849,0.00025532336,0.000004627679],"category_scores_gemma":[0.00039703576,0.00035367665,0.00009818933,0.00007759981,0.00005811651,0.0000983694,0.000863331,0.00047524826,0.0000327749],"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.000020152394,0.000016429718,0.00018578487,0.00031266228,0.00012799432,0.000020781994,0.0011269677,0.0011191495,0.000014952839,0.8509352,0.0020190813,0.14410082],"study_design_scores_gemma":[0.00017287415,0.00022646588,0.0002100592,0.00023616353,0.000018890922,0.000030950632,0.000009035589,0.9392459,0.000013522971,0.058084555,0.0010866756,0.000664914],"about_ca_topic_score_codex":0.000055475324,"about_ca_topic_score_gemma":0.00017912313,"teacher_disagreement_score":0.93812674,"about_ca_system_score_codex":0.00004584572,"about_ca_system_score_gemma":0.000044919972,"threshold_uncertainty_score":0.9998915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017951712,0.0011987055,0.92663854,0.047854178,0.0007705395,0.00018526553,0.000003836112,0.0033450054,0.0020521856],"genre_scores_gemma":[0.76673657,0.000121042845,0.22919719,0.0037216516,0.000039867922,0.000052986863,0.0000069474468,0.000025295314,0.00009844134],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856824,0.00021317734,0.000297681,0.00038377577,0.00022694284,0.00031021162],"domain_scores_gemma":[0.995995,0.00060585036,0.00005949343,0.0032015722,0.00006227893,0.000075833406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005463687,0.00017988123,0.0001652465,0.0003244065,0.00038500465,0.00048225012,0.0034378732,0.000072413284,0.000006326067],"category_scores_gemma":[0.00003574637,0.00018995855,0.000111937494,0.0007476323,0.00014387435,0.00063320796,0.00059437536,0.00046233018,0.0001437948],"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.0000027720448,0.00013447597,0.0005615018,0.000055000037,0.00017581772,0.000059298723,0.003381504,0.0005040138,0.60383517,0.22135133,0.10124833,0.068690784],"study_design_scores_gemma":[0.00027404516,0.00008836876,0.0012355158,0.00071885757,0.00009840075,0.0003847666,0.00016323852,0.80475014,0.07636124,0.023941243,0.09049987,0.0014842938],"about_ca_topic_score_codex":0.00015328224,"about_ca_topic_score_gemma":0.00013577298,"teacher_disagreement_score":0.8042461,"about_ca_system_score_codex":0.00019900408,"about_ca_system_score_gemma":0.00008372394,"threshold_uncertainty_score":0.7746285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012188658,0.0004550608,0.970038,0.0044397735,0.0007222409,0.00038346744,0.00004134646,0.0023329833,0.009398471],"genre_scores_gemma":[0.9395825,0.00080599857,0.059075616,0.000081860184,0.000010437011,0.00011590399,0.000007000426,0.000026401183,0.00029427145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842274,0.00019967477,0.00049609394,0.0003502542,0.00026956273,0.00026166494],"domain_scores_gemma":[0.9966069,0.0005480565,0.000092082424,0.002567117,0.000105810264,0.00008004931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039778833,0.00020822902,0.0002487847,0.0004450428,0.00046077208,0.00011319734,0.0025518234,0.000115920884,0.000038712325],"category_scores_gemma":[0.000008597671,0.0002066418,0.00017091045,0.0013435871,0.0003367229,0.0005743553,0.000022477965,0.00068490015,0.000075533],"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.00006430848,0.0031983445,0.00036505322,0.0007212522,0.0007845441,0.0000178163,0.020508155,0.004052307,0.06808386,0.16451329,0.0046547437,0.73303634],"study_design_scores_gemma":[0.00029046793,0.00042128787,0.0010252538,0.0005633578,0.00009400823,0.00008926928,0.00011680558,0.84381247,0.14119734,0.005801021,0.006040257,0.0005484629],"about_ca_topic_score_codex":0.00014876894,"about_ca_topic_score_gemma":0.00012953782,"teacher_disagreement_score":0.92739385,"about_ca_system_score_codex":0.00012378354,"about_ca_system_score_gemma":0.00015079141,"threshold_uncertainty_score":0.8426608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001469407,0.009929545,0.9708924,0.0051510595,0.00021321127,0.00056011457,0.000004601796,0.0003340162,0.011445632],"genre_scores_gemma":[0.6085568,0.0016976625,0.38945276,0.000047064877,0.000006096469,0.00020036458,0.0000010362725,0.000008799378,0.000029408406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992997,0.000056158988,0.0002835561,0.00012819507,0.00011819551,0.00011419411],"domain_scores_gemma":[0.9937805,0.0044779233,0.00009296486,0.0015713434,0.00006460937,0.000012671666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079932174,0.00008013456,0.000120476456,0.00030429577,0.00011403353,0.000059852668,0.0021287892,0.000027373853,8.9891915e-7],"category_scores_gemma":[0.0005810906,0.000060406313,0.000058691203,0.00088828936,0.00006810025,0.00037525923,0.00040119936,0.00015694133,0.000004381504],"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":[6.4251134e-7,0.00008429749,0.0000034747238,0.00013500343,0.0000039787474,2.3816551e-7,0.0017084826,0.00006883447,0.0001976362,0.9807554,0.000110146735,0.016931858],"study_design_scores_gemma":[0.000025043068,0.000057282898,0.0000060261623,0.00059530913,0.0000036560853,0.0000027605686,0.00015616485,0.5159657,0.0011138687,0.47936907,0.0026435666,0.00006155518],"about_ca_topic_score_codex":0.000002186301,"about_ca_topic_score_gemma":0.000011977476,"teacher_disagreement_score":0.6070874,"about_ca_system_score_codex":0.000039679224,"about_ca_system_score_gemma":0.000024310137,"threshold_uncertainty_score":0.39558557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155362105,0.0000048608113,0.9769019,0.00012205766,0.00015672504,0.00020529535,2.2245187e-7,0.0036673632,0.0034053607],"genre_scores_gemma":[0.6370653,0.0000028472473,0.36287197,0.0000123149275,0.000009014107,0.000007490222,0.0000020342263,0.000005601458,0.000023425904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901897,0.00008415635,0.00034445128,0.00022995421,0.00017155094,0.00015094595],"domain_scores_gemma":[0.9993055,0.0001157267,0.00013183191,0.00031863025,0.000109750814,0.00001858711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080310635,0.000086580956,0.00014942147,0.0004821063,0.00003439698,0.000039482988,0.00044846325,0.00006417122,0.0000011058221],"category_scores_gemma":[0.00008843805,0.00008075542,0.000032137392,0.0014817034,0.000014762648,0.00027438506,0.00018892596,0.00009479576,0.000006148617],"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.0000109484645,0.000118398406,0.0037059225,0.00034058132,0.00001216043,0.000033677738,0.0052262754,0.043310307,0.06499821,0.7526787,0.0024263687,0.1271385],"study_design_scores_gemma":[0.000033337292,0.00004084776,0.00042057395,0.00021868397,7.451184e-7,0.000004574333,0.00022244842,0.91743004,0.08118308,0.00036040327,0.000008550973,0.00007672497],"about_ca_topic_score_codex":0.0002502458,"about_ca_topic_score_gemma":0.000026033395,"teacher_disagreement_score":0.8741197,"about_ca_system_score_codex":0.00008196114,"about_ca_system_score_gemma":0.000026557875,"threshold_uncertainty_score":0.32931104},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002524913,0.0002994531,0.17796968,0.000044655688,0.00038743802,0.00050609803,0.00009181765,0.0009953207,0.8196803],"genre_scores_gemma":[0.0015624054,0.00008984823,0.012429248,0.00006539039,0.000100701975,0.0000029224436,0.000008836988,0.000048234946,0.98569244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986161,0.000019044695,0.00015836906,0.0007372185,0.00020054393,0.00026871022],"domain_scores_gemma":[0.9987876,0.00024557058,0.00013589472,0.0005676161,0.0001521412,0.00011122134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022385734,0.00034178275,0.00035255196,0.00027145364,0.00021826038,0.00022542386,0.00087448215,0.00028563297,3.0845237e-7],"category_scores_gemma":[0.000018014458,0.00040185841,0.00016404375,0.000011089913,0.00014580661,0.00015421367,0.0009334945,0.00038902683,0.0000033193091],"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.000014405651,0.0000020225948,9.673912e-7,0.0001845363,0.00006821833,0.00010297958,0.000089655645,3.4786657e-7,0.000108651046,0.9759769,0.020606382,0.002844926],"study_design_scores_gemma":[0.00021804105,0.00010852697,0.0000027090641,0.0005513282,0.00014349152,0.00005091717,0.000015295365,0.004070467,0.001325636,0.0020048413,0.990921,0.00058772916],"about_ca_topic_score_codex":0.00007872958,"about_ca_topic_score_gemma":0.0000072082867,"teacher_disagreement_score":0.9739721,"about_ca_system_score_codex":0.00017707194,"about_ca_system_score_gemma":0.00008258117,"threshold_uncertainty_score":0.9998433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03491468,0.00044646199,0.92732626,0.0011179232,0.0002707151,0.0001585964,0.0000015422529,0.005637422,0.030126385],"genre_scores_gemma":[0.51244944,0.000012474383,0.48475763,0.00056743895,0.00005022339,0.00002746701,0.0000013927054,0.000019496389,0.0021144077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884903,0.000046872243,0.00014835082,0.0004523742,0.0002474193,0.0002559446],"domain_scores_gemma":[0.999155,0.000109205546,0.000022288177,0.0005800146,0.000050294253,0.00008322315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002353539,0.00015584323,0.00013464282,0.000172246,0.00006896964,0.0003587997,0.00061966974,0.000047962338,0.000052653602],"category_scores_gemma":[0.000014269699,0.00010935112,0.000051911415,0.00060204096,0.000040075665,0.00052710506,0.00018178436,0.00018559268,0.000084179366],"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.000018120985,0.000070685,0.00081648957,0.00009500226,0.00007304573,0.0014826512,0.0009365434,0.000026314436,0.004337511,0.85189176,0.03911318,0.10113869],"study_design_scores_gemma":[0.0008000638,0.0012515207,0.00085796806,0.0006498991,0.000064431144,0.0020596543,0.0001247122,0.5493646,0.26304036,0.101845585,0.077931166,0.0020099774],"about_ca_topic_score_codex":0.00022257025,"about_ca_topic_score_gemma":0.00016779831,"teacher_disagreement_score":0.7500462,"about_ca_system_score_codex":0.000044070308,"about_ca_system_score_gemma":0.0001398653,"threshold_uncertainty_score":0.4459209},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005692979,0.0033191051,0.5115282,0.0014975643,0.0033751554,0.0044294777,0.00092375587,0.003512664,0.47084478],"genre_scores_gemma":[0.9656714,0.00010790673,0.0029365101,0.00019798263,0.00028022632,0.00006359385,0.000038596638,0.0000546452,0.030649109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973329,0.000077701814,0.0010011217,0.00069744105,0.00048839994,0.00040247524],"domain_scores_gemma":[0.99763715,0.00054525834,0.000666277,0.0006665723,0.00030513192,0.00017960486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009374087,0.00054380955,0.0008302097,0.0003433768,0.00018351084,0.0010367048,0.00051392993,0.0004354329,0.000005668818],"category_scores_gemma":[0.00010237598,0.00049309636,0.00010623622,0.000057777623,0.00029840946,0.0009480772,0.00020503673,0.000552058,0.00006703255],"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.000113212176,0.0000023702155,0.000010018672,0.0004676342,0.0002887112,0.000075827884,0.001087894,0.00021800742,0.00070709595,0.9898977,0.0007788839,0.0063526304],"study_design_scores_gemma":[0.0075544044,0.00088433304,0.00019576242,0.0062847543,0.00052368594,0.0029968591,0.00030892255,0.9285179,0.000036235244,0.027568098,0.022344766,0.0027842827],"about_ca_topic_score_codex":0.00016164625,"about_ca_topic_score_gemma":0.000007870831,"teacher_disagreement_score":0.96510214,"about_ca_system_score_codex":0.00018197295,"about_ca_system_score_gemma":0.00014176265,"threshold_uncertainty_score":0.99975204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06775355,0.0009600544,0.9282564,0.0011178363,0.00041269144,0.000176381,0.000004506044,0.0003994349,0.0009191793],"genre_scores_gemma":[0.6697678,0.00022067066,0.32992345,0.000037945156,0.000022532307,0.000004725611,0.0000028661032,0.000013239087,0.000006755597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982503,0.0005047646,0.00059201685,0.00018961076,0.00025178381,0.0002114972],"domain_scores_gemma":[0.9974538,0.0009298045,0.00023430087,0.0009617844,0.0003525923,0.000067685665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082501635,0.0001451567,0.00021363581,0.0008560632,0.00027626433,0.00023765363,0.0016138465,0.00008487669,0.0000077074355],"category_scores_gemma":[0.00036076576,0.00014354098,0.00007232316,0.0023110015,0.00008772978,0.0006050236,0.00014722768,0.00078749395,0.0000024908209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060385493,0.0015797992,0.009882859,0.00021229059,0.00037295793,0.0001875181,0.010202685,0.68412066,0.17361188,0.075839475,0.0015163444,0.042413168],"study_design_scores_gemma":[0.000111009605,0.000109141576,0.00019142013,0.00090298156,0.000014394334,0.00033000793,0.000065990964,0.9924325,0.003581173,0.00205933,0.000051022816,0.00015104623],"about_ca_topic_score_codex":0.00005046805,"about_ca_topic_score_gemma":0.00007045636,"teacher_disagreement_score":0.60201424,"about_ca_system_score_codex":0.00031120822,"about_ca_system_score_gemma":0.0005112264,"threshold_uncertainty_score":0.5853431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08592279,0.00023050826,0.9081319,0.000092043534,0.0000906044,0.00020895628,8.632762e-7,0.0004181599,0.004904186],"genre_scores_gemma":[0.8427207,0.000021816486,0.15625623,0.00003776198,0.000010296041,0.000014240154,0.0000013228157,0.000008764127,0.0009288597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894726,0.000048615864,0.0003465172,0.00028825572,0.00018977036,0.00017959731],"domain_scores_gemma":[0.9985759,0.00090473884,0.0001209199,0.00025800243,0.000101136706,0.000039248414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010088427,0.00011626314,0.0002164302,0.0001108136,0.000091427384,0.00011032321,0.00031969335,0.00005404758,0.000012597692],"category_scores_gemma":[0.00022874,0.00010308134,0.000075501666,0.00021843765,0.0000970429,0.00024438594,0.00029711815,0.00013009182,8.9004766e-7],"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.00029059034,0.00024542582,0.025237914,0.009578763,0.00061664166,0.000041992444,0.055262227,0.14716977,0.091940925,0.3126739,0.0117163835,0.34522548],"study_design_scores_gemma":[0.00010918463,0.00029820364,0.00013188284,0.00024875946,0.000014176569,0.00000657852,0.00014171886,0.9273817,0.0691593,0.0015020771,0.0008676342,0.0001388233],"about_ca_topic_score_codex":0.00014571044,"about_ca_topic_score_gemma":0.000006944934,"teacher_disagreement_score":0.78021187,"about_ca_system_score_codex":0.00002193352,"about_ca_system_score_gemma":0.00005632077,"threshold_uncertainty_score":0.42035347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000683832,0.0002812749,0.9831151,0.0076029417,0.0012073591,0.000878146,0.000053456406,0.0028550562,0.0033228784],"genre_scores_gemma":[0.6977246,0.0001770456,0.29975876,0.00015233348,0.000043234002,0.0009290501,0.000014012426,0.000034073426,0.0011669111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983487,0.00018902528,0.00042032532,0.00052426534,0.00023609833,0.00028156475],"domain_scores_gemma":[0.99598545,0.0009619484,0.000088227236,0.0025944256,0.00028699508,0.00008292557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005510018,0.00022515462,0.00019042811,0.00045288625,0.0010860678,0.00043581286,0.0017819495,0.00013421412,0.000025913982],"category_scores_gemma":[0.000039662475,0.00023644736,0.00022311525,0.0010390081,0.00019576211,0.0007773646,0.000019524676,0.0005499967,0.00007027227],"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.00007596643,0.0017737527,0.00002594693,0.00028815804,0.00041726363,0.000004059412,0.008159273,0.0015568972,0.017152619,0.28229544,0.019996043,0.66825455],"study_design_scores_gemma":[0.00029814267,0.00029353698,0.000068189656,0.0004039144,0.000091907554,0.00008024676,0.00013365332,0.8320456,0.07050015,0.04326902,0.05218341,0.000632217],"about_ca_topic_score_codex":0.00025565588,"about_ca_topic_score_gemma":0.0012014211,"teacher_disagreement_score":0.83048874,"about_ca_system_score_codex":0.00026212042,"about_ca_system_score_gemma":0.00021475235,"threshold_uncertainty_score":0.9642043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050290186,0.00004128245,0.94548935,0.00027449089,0.00050175795,0.00025608187,0.0000048587494,0.00050405547,0.0026379377],"genre_scores_gemma":[0.7973971,0.0000014256609,0.20214488,0.000084954816,0.000036893904,0.000013636854,0.0000023514033,0.000009087524,0.0003096814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889416,0.000046109937,0.00037789755,0.0003118884,0.00019257862,0.00017735093],"domain_scores_gemma":[0.9989298,0.00043990227,0.00010480904,0.00035878186,0.00013113716,0.000035564055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076216605,0.00011692141,0.00024182118,0.00019782237,0.0000191167,0.00006856574,0.0008313474,0.000099886274,0.000031099145],"category_scores_gemma":[0.00019049502,0.00009951078,0.00012600994,0.000360105,0.00009241821,0.0003941118,0.00028411407,0.00015210103,0.0000029978441],"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.00005312296,0.00014209372,0.0017932242,0.00037203723,0.00008858473,0.00000593153,0.0036637767,0.000011410284,0.008551149,0.86182076,0.024310805,0.09918711],"study_design_scores_gemma":[0.0003186093,0.00050807436,0.00017546488,0.00041954982,0.000022158243,0.0000127432,0.000077858036,0.38587144,0.48522758,0.12561505,0.0014854535,0.00026603235],"about_ca_topic_score_codex":0.0006592563,"about_ca_topic_score_gemma":0.00010123297,"teacher_disagreement_score":0.7471069,"about_ca_system_score_codex":0.000045203764,"about_ca_system_score_gemma":0.00010390256,"threshold_uncertainty_score":0.40579316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046654228,0.00009562728,0.93280756,0.0019071631,0.00039297531,0.00017276373,4.7656138e-7,0.0033338857,0.01463532],"genre_scores_gemma":[0.749702,0.00000826624,0.24752733,0.00036275128,0.000033526765,0.000022235079,0.0000018126498,0.000018298213,0.0023237877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987541,0.000033038683,0.0001531467,0.00052679225,0.00027730598,0.00025562788],"domain_scores_gemma":[0.9992454,0.000104391074,0.000027211969,0.0005130464,0.00005690844,0.00005305433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024765634,0.00015853629,0.00010855757,0.00022246344,0.00011093217,0.0006335931,0.00047831915,0.00006123741,0.00005676119],"category_scores_gemma":[0.000017901732,0.00011789007,0.000039935134,0.00056679395,0.000019645668,0.00072704075,0.00012658603,0.00024972903,0.00021491993],"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.00006214471,0.0004590592,0.0012379187,0.00037937757,0.00021518269,0.00046498748,0.0032668372,0.019103134,0.04993891,0.37962222,0.017206682,0.52804357],"study_design_scores_gemma":[0.00008277933,0.00024785398,0.00010467278,0.00022825837,0.0000067049123,0.000048747443,0.000020137863,0.9477634,0.04694453,0.002997759,0.0013181142,0.00023706575],"about_ca_topic_score_codex":0.00004112349,"about_ca_topic_score_gemma":0.000075662596,"teacher_disagreement_score":0.9286603,"about_ca_system_score_codex":0.0000924366,"about_ca_system_score_gemma":0.00008989103,"threshold_uncertainty_score":0.61097527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011104689,0.00042671507,0.98571247,0.00039850108,0.00010475279,0.00019691279,0.0000077282775,0.00053315243,0.0015150645],"genre_scores_gemma":[0.9489643,0.00016227135,0.050775778,0.000029264214,0.000004043884,0.000013746581,0.000023403885,0.0000052637956,0.000021945498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984568,0.00004470526,0.0007792755,0.00015190012,0.00041367262,0.00015364903],"domain_scores_gemma":[0.99903953,0.00012866975,0.00023359038,0.0003579794,0.00018058768,0.00005961492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068357814,0.00012880817,0.00029034767,0.001136921,0.000047687896,0.00008708353,0.000553606,0.00008582322,0.000023518722],"category_scores_gemma":[0.00003370332,0.000106186766,0.0002120597,0.0022226572,0.000036598467,0.0019655765,0.00004827822,0.0001374215,0.000009236247],"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.000027223507,0.00018404462,0.0015571078,0.0032292656,0.0005554007,0.0000013644188,0.029693175,0.011478604,0.021170901,0.12665689,0.0009632794,0.80448276],"study_design_scores_gemma":[0.00009227545,0.00015923652,0.0008543127,0.00050769997,0.00010948108,0.0000024888802,0.000049064627,0.9279329,0.06072985,0.004125237,0.005295152,0.0001422555],"about_ca_topic_score_codex":0.00013591319,"about_ca_topic_score_gemma":0.0000052348455,"teacher_disagreement_score":0.9378596,"about_ca_system_score_codex":0.000027232854,"about_ca_system_score_gemma":0.000076448516,"threshold_uncertainty_score":0.43301708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009639141,0.00019480824,0.9774782,0.0034682904,0.0006004425,0.0005668558,0.000017160199,0.00045290726,0.007582188],"genre_scores_gemma":[0.99304694,0.0000023132084,0.0067131245,0.00006001331,0.000010214371,0.000091597096,0.000014124195,0.000005121592,0.00005656845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985452,0.00039125248,0.00025746436,0.00017475446,0.0005404015,0.0000908731],"domain_scores_gemma":[0.9971023,0.0009880993,0.00008235798,0.0014329359,0.00037164535,0.000022623313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028999425,0.0000723156,0.00009520914,0.00009759379,0.000069145906,0.000071548064,0.0010677038,0.000036874808,0.000018455845],"category_scores_gemma":[0.00038979572,0.00005065013,0.000051968535,0.0005179264,0.000046753114,0.00009678208,0.00016682409,0.00011596202,0.000028655515],"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.0000031235613,0.00009385607,0.000049825514,0.000050919716,0.000023890667,2.6440907e-7,0.0010170236,0.0020630774,0.0044129356,0.9494611,0.009234429,0.033589523],"study_design_scores_gemma":[0.00004255773,0.00010387105,0.0001575925,0.00022981796,0.000020915082,7.297239e-7,0.00006430928,0.96350336,0.030722553,0.0037924568,0.0012939243,0.0000679167],"about_ca_topic_score_codex":0.00019856505,"about_ca_topic_score_gemma":0.00006218407,"teacher_disagreement_score":0.9834078,"about_ca_system_score_codex":0.00013081243,"about_ca_system_score_gemma":0.00017665619,"threshold_uncertainty_score":0.20654525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006244543,0.0005715898,0.9608774,0.0027502435,0.00047207123,0.0009814657,0.000017292978,0.00020588441,0.033499558],"genre_scores_gemma":[0.07260813,0.0009672547,0.9253593,0.00052115746,0.000024784613,0.000049910104,0.00002679353,0.000010460004,0.00043221426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847203,0.000020012572,0.00066951115,0.000323436,0.00034402625,0.00017100856],"domain_scores_gemma":[0.997829,0.00017548297,0.0002388946,0.0012829495,0.00038650987,0.00008712643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001115931,0.00017163726,0.00020632218,0.0010975209,0.00021493406,0.0002521544,0.001379237,0.00007253218,0.000004205798],"category_scores_gemma":[0.00003990787,0.00017375984,0.000026727996,0.00042721312,0.00032053993,0.0029819852,0.0029880935,0.00029543947,0.000017945322],"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.0000019804943,0.000007165849,0.00005761932,0.00003748123,0.000005533636,2.3551732e-7,0.004169161,0.00039966073,0.000057495705,0.67262536,0.00036265203,0.32227564],"study_design_scores_gemma":[0.0004607016,0.00021614876,0.0029495105,0.0010800401,0.00002215592,0.000092433045,0.00015952466,0.88705754,0.0006134199,0.03883427,0.06774429,0.00076993636],"about_ca_topic_score_codex":0.000044177756,"about_ca_topic_score_gemma":0.000034891138,"teacher_disagreement_score":0.8866579,"about_ca_system_score_codex":0.000114336835,"about_ca_system_score_gemma":0.00019448885,"threshold_uncertainty_score":0.7085721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010594617,0.001510603,0.9486652,0.03588114,0.00080251705,0.00042699627,0.000014186955,0.0013841515,0.0007205989],"genre_scores_gemma":[0.65359986,0.00010430153,0.3450563,0.0008866357,0.000057713678,0.00016738745,0.000019636616,0.000022679142,0.000085516986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987806,0.00013376231,0.00030612203,0.0003700146,0.00014793499,0.00026155665],"domain_scores_gemma":[0.9968545,0.0008471283,0.000107942404,0.0020008872,0.00013550866,0.00005405412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041088296,0.00015987303,0.00015099761,0.00024177827,0.00044468205,0.00044127423,0.0023498577,0.000067789064,0.0000032746868],"category_scores_gemma":[0.00009050971,0.00017019993,0.00010702296,0.0005527684,0.00010072638,0.0006991827,0.0002722319,0.00028642698,0.000014956951],"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.000015698171,0.00015137444,0.00043242882,0.00023480206,0.00021171436,0.000015709807,0.016118765,0.004532559,0.7682259,0.06393077,0.08339687,0.06273343],"study_design_scores_gemma":[0.0001974731,0.000053440093,0.00010567259,0.00045091528,0.00005043609,0.000023297678,0.0000797037,0.9044962,0.05911185,0.003163304,0.031667814,0.00059988303],"about_ca_topic_score_codex":0.0003214503,"about_ca_topic_score_gemma":0.000251028,"teacher_disagreement_score":0.8999637,"about_ca_system_score_codex":0.00020536977,"about_ca_system_score_gemma":0.00010144602,"threshold_uncertainty_score":0.69405514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8560325,0.000097109776,0.13922589,0.0025006682,0.00044758726,0.00033535677,0.000024996294,0.00024290936,0.0010929779],"genre_scores_gemma":[0.9295711,1.2299738e-7,0.069943875,0.00017459928,0.000046391815,0.000013361797,0.00000398226,0.00002163671,0.00022494183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699086,0.00017519275,0.00082573853,0.0007752065,0.00048585157,0.0007471349],"domain_scores_gemma":[0.9973253,0.00029818594,0.000638781,0.0015094097,0.00010133465,0.0001269998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067320955,0.00041353982,0.00080313714,0.00010978861,0.00021494803,0.000115743525,0.002845232,0.00020747214,0.000069643276],"category_scores_gemma":[0.000049551774,0.00033941193,0.0016580974,0.0011389591,0.0003209603,0.00021113148,0.0011999883,0.0005910227,0.000003636772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050157418,0.0001222959,0.040076118,0.000016946258,0.00038663932,1.7316262e-7,0.00019849841,0.95701015,0.00007715448,0.00047373355,0.0013595772,0.00022852715],"study_design_scores_gemma":[0.00030305004,0.0001341674,0.08871038,0.000045521418,0.00026286466,1.3535039e-8,0.000037135822,0.90836316,0.0015243506,0.00035207008,0.000018963,0.00024829924],"about_ca_topic_score_codex":0.0002688473,"about_ca_topic_score_gemma":0.00021625683,"teacher_disagreement_score":0.07353858,"about_ca_system_score_codex":0.00024973464,"about_ca_system_score_gemma":0.00019497842,"threshold_uncertainty_score":0.99990577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004993347,0.00024193029,0.9913322,0.0017550078,0.0006344341,0.00031011377,0.0000033011347,0.00020518826,0.00052447565],"genre_scores_gemma":[0.8485432,0.00001851848,0.15081799,0.00018482456,0.00003311577,0.00003421419,0.0000012324238,0.000005643437,0.00036125374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992294,0.000051131356,0.00019551265,0.00021253237,0.00014450232,0.00016696214],"domain_scores_gemma":[0.99856937,0.00071085425,0.00013782197,0.00044354456,0.00012334531,0.000015082964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041856966,0.00008576976,0.00012217608,0.00008817945,0.00017971807,0.00006930306,0.00072519097,0.00004162689,0.000006276256],"category_scores_gemma":[0.00029175583,0.00006668679,0.00006758696,0.00028682858,0.000029601657,0.00015222987,0.00014636292,0.00008305993,0.0000014518997],"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.000016280703,0.000016802123,0.00068985973,0.000023252653,0.000018820403,6.058245e-7,0.00035024775,0.00013153076,0.04276776,0.9438867,0.0025887166,0.009509437],"study_design_scores_gemma":[0.00024936962,0.000106036445,0.0005580361,0.00012497485,0.000022550581,0.0000012184825,0.00008961106,0.32752335,0.5128893,0.15318868,0.005095374,0.0001514831],"about_ca_topic_score_codex":0.00011457816,"about_ca_topic_score_gemma":0.00006791795,"teacher_disagreement_score":0.84354985,"about_ca_system_score_codex":0.0000565585,"about_ca_system_score_gemma":0.00006454613,"threshold_uncertainty_score":0.27194086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012736699,0.00025602337,0.9756679,0.0021775384,0.0007393569,0.00027011815,0.000002124552,0.0036415542,0.015971718],"genre_scores_gemma":[0.51917094,0.000006939754,0.4738895,0.0005098112,0.00007679847,0.00009154047,0.0000011057783,0.000018298764,0.006235067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897695,0.000022537231,0.00016869807,0.00042809264,0.00014723293,0.0002565133],"domain_scores_gemma":[0.9990517,0.0003196264,0.000020608808,0.00047469576,0.000078006364,0.000055401582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019452,0.00012204105,0.000121955265,0.00013053259,0.00007393473,0.0003159638,0.0006547506,0.000065317676,0.000040830513],"category_scores_gemma":[0.000084820116,0.00010061111,0.000098513476,0.00030749358,0.00001872757,0.00032699073,0.0001956281,0.000104613195,0.00010380997],"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.000011022403,0.000055494213,0.00016474555,0.00012001555,0.00005739162,0.000032081964,0.0013928496,0.000037089892,0.007550962,0.4985093,0.3413015,0.15076755],"study_design_scores_gemma":[0.00016443254,0.00018771202,0.0000894135,0.00012032303,0.000010190784,0.00005619983,0.000040494993,0.71389717,0.047170665,0.05844162,0.17941639,0.00040539663],"about_ca_topic_score_codex":0.00004365121,"about_ca_topic_score_gemma":0.00009141907,"teacher_disagreement_score":0.7138601,"about_ca_system_score_codex":0.000043351087,"about_ca_system_score_gemma":0.00006868155,"threshold_uncertainty_score":0.4102802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039249707,0.0017063152,0.95742494,0.0002734496,0.00074522366,0.000243488,0.0000018465613,0.00008116439,0.00027386827],"genre_scores_gemma":[0.90439487,0.000015592192,0.09513906,0.000055437566,0.00016181859,0.00000990705,4.891265e-7,0.0000119997185,0.00021082065],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980115,0.00013908224,0.0009951757,0.00021117322,0.00042215883,0.0002208656],"domain_scores_gemma":[0.99633324,0.00030998854,0.0016049666,0.00018601216,0.0015176077,0.000048169702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545851,0.00015631474,0.00047616722,0.00045936884,0.0001946875,0.00025317553,0.00077359506,0.00010455978,0.0000010189733],"category_scores_gemma":[0.0002112081,0.00013571078,0.00013969393,0.0005016965,0.00003164801,0.00072867353,0.000065961816,0.00018516692,2.694452e-7],"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.00031818225,0.00018479509,0.0025753416,0.0031269365,0.00022689404,0.000030126914,0.0025425972,0.006262705,0.70427245,0.21995826,0.0033776034,0.05712411],"study_design_scores_gemma":[0.0011289332,0.00044316513,0.000057309582,0.005303294,0.00008068102,0.00009192776,0.00034458423,0.7204256,0.23465934,0.0365606,0.00058268686,0.00032187894],"about_ca_topic_score_codex":0.000054749187,"about_ca_topic_score_gemma":0.00000606554,"teacher_disagreement_score":0.86514515,"about_ca_system_score_codex":0.00014987818,"about_ca_system_score_gemma":0.0004702437,"threshold_uncertainty_score":0.5534125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5151612,0.0013345849,0.48064333,0.00024434252,0.002234977,0.00023424406,0.0000049926066,0.000044958935,0.00009731038],"genre_scores_gemma":[0.9127442,0.00003320905,0.087021604,0.000044491728,0.00012584888,0.000009003262,3.0334832e-7,0.000010588591,0.000010730339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527425,0.00011785882,0.002055883,0.00044648105,0.001433345,0.00067216373],"domain_scores_gemma":[0.9954677,0.0017040394,0.0015999422,0.00032556558,0.0007075562,0.00019517544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00681362,0.00039983232,0.0012404957,0.006766721,0.00020102001,0.0004027703,0.0028780105,0.00010403685,0.000004359283],"category_scores_gemma":[0.00083436834,0.0003229331,0.00051601266,0.006745619,0.00023161017,0.0008829992,0.00014789081,0.0006387369,2.771478e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020161662,0.00006559528,0.0019281873,0.00008448744,0.00025765295,0.0000155038,0.0014400473,0.9831834,0.00963441,0.0020981256,0.00012445722,0.0011479676],"study_design_scores_gemma":[0.00091132167,0.0016394522,0.013938322,0.0015904885,0.0002685242,0.00019488185,0.0010354065,0.9429145,0.03636116,0.00046223676,0.00016744852,0.0005162613],"about_ca_topic_score_codex":0.00005586728,"about_ca_topic_score_gemma":0.000034334724,"teacher_disagreement_score":0.39758298,"about_ca_system_score_codex":0.00030966246,"about_ca_system_score_gemma":0.0006330668,"threshold_uncertainty_score":0.9999223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13638051,0.00021721718,0.8621644,0.0004516636,0.000056444176,0.00022418899,0.000014424928,0.00008300287,0.00040817016],"genre_scores_gemma":[0.87216836,0.000627804,0.12689999,0.00002495579,0.0000010278256,0.00010716832,0.0000026794944,0.0000035167975,0.00016451435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991924,0.00008882878,0.00034084055,0.00017402302,0.00010792683,0.00009593468],"domain_scores_gemma":[0.9975492,0.0006019773,0.00016543166,0.001476754,0.00018450408,0.00002213528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002706367,0.00009187073,0.00023299234,0.0005065066,0.0002945711,0.000016425673,0.0010080693,0.000047967,0.000003286127],"category_scores_gemma":[0.0000074471136,0.00009149086,0.000109435874,0.0010317428,0.00016903527,0.00014953509,0.0000254021,0.00012350011,3.5807975e-7],"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.00026161477,0.0053451224,0.011507601,0.0011790356,0.002882001,2.719359e-7,0.010248963,0.028515529,0.46616355,0.013991426,0.00057404523,0.45933086],"study_design_scores_gemma":[0.00021225552,0.0002125081,0.002758048,0.00022072882,0.000244158,4.5978257e-7,0.00009123105,0.4117402,0.5837856,0.00034970217,0.0002775681,0.0001075281],"about_ca_topic_score_codex":0.0000936622,"about_ca_topic_score_gemma":0.000109515946,"teacher_disagreement_score":0.7357878,"about_ca_system_score_codex":0.000026163687,"about_ca_system_score_gemma":0.000047364265,"threshold_uncertainty_score":0.3730889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017104509,0.000052913376,0.95621693,0.0014209913,0.0007826319,0.00022038518,6.7284384e-7,0.0015304539,0.038064577],"genre_scores_gemma":[0.4965463,0.0000029147068,0.4976132,0.00087049505,0.000022600449,0.000059558348,5.6885096e-7,0.0000058096875,0.0048785643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991259,0.000025863335,0.00017905529,0.0003336873,0.00009403233,0.0002414722],"domain_scores_gemma":[0.99892104,0.0004056715,0.00004088776,0.00047814316,0.000118219534,0.000036050118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038898605,0.00010859264,0.00013808967,0.00016193716,0.00012283366,0.00013487358,0.0008482671,0.000057999336,0.000009526986],"category_scores_gemma":[0.00025228973,0.00009686016,0.0000837004,0.0003327769,0.000018881363,0.00023049355,0.00027830512,0.00008853122,0.000015319634],"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.0000048716997,0.000032215794,0.0010940335,0.000029937983,0.000016552834,0.0000017035507,0.00014411921,0.000012692334,0.001923306,0.8139648,0.09008263,0.09269315],"study_design_scores_gemma":[0.0003353005,0.00012261045,0.00032211002,0.00017438202,0.000014716113,0.000009751217,0.00011263283,0.5203678,0.33210292,0.093988426,0.052033786,0.00041557933],"about_ca_topic_score_codex":0.000032898522,"about_ca_topic_score_gemma":0.00012078047,"teacher_disagreement_score":0.71997637,"about_ca_system_score_codex":0.00005539008,"about_ca_system_score_gemma":0.0000696543,"threshold_uncertainty_score":0.39498428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22240806,0.0018177673,0.77337223,0.00014152969,0.0006028036,0.00013852873,0.0000016782609,0.00006630145,0.0014511087],"genre_scores_gemma":[0.97271484,0.000010938227,0.02707745,0.000022799819,0.00010812937,0.0000018114316,3.6497687e-7,0.000012127635,0.000051512132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729145,0.00022278917,0.0013765583,0.00025184787,0.0006247949,0.00023254295],"domain_scores_gemma":[0.9953133,0.0005615628,0.002740481,0.00025297588,0.00106542,0.00006629603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020802203,0.0001896367,0.0006468259,0.00068690226,0.00021376461,0.00020321379,0.0009305976,0.0001014463,0.0000025532645],"category_scores_gemma":[0.00034282618,0.00017000409,0.00014473045,0.0008533172,0.00012896306,0.0007475695,0.00010878101,0.00036579015,3.2868888e-7],"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.00046777917,0.00060994056,0.027956089,0.0082619535,0.00033867394,0.00006715488,0.0075993934,0.04768048,0.6662772,0.06534105,0.0016277093,0.17377253],"study_design_scores_gemma":[0.0007487536,0.0006008093,0.0010162594,0.027556073,0.00007167731,0.00013001614,0.0005957094,0.7129534,0.2483503,0.007533689,0.000060667244,0.0003826646],"about_ca_topic_score_codex":0.00020563323,"about_ca_topic_score_gemma":0.000009997742,"teacher_disagreement_score":0.7503068,"about_ca_system_score_codex":0.00023737097,"about_ca_system_score_gemma":0.00044011776,"threshold_uncertainty_score":0.69325656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03299421,0.00051162415,0.94435847,0.001481248,0.0015028381,0.0010768085,0.00001558478,0.0007224525,0.017336752],"genre_scores_gemma":[0.8195163,0.000028320295,0.1747214,0.0006057899,0.000053388718,0.000049692626,0.0000014760062,0.000021172904,0.005002449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969201,0.00014115183,0.0009779402,0.0009111474,0.00034537475,0.0007042683],"domain_scores_gemma":[0.9963934,0.0010203413,0.0003849966,0.0014288796,0.0006630002,0.00010941295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012466785,0.00038062184,0.0006705833,0.00054001465,0.00032413425,0.0002422192,0.002052855,0.0002811307,0.000031542375],"category_scores_gemma":[0.00066532096,0.00040202736,0.00036255104,0.0012791052,0.00018056306,0.0004837091,0.0009480433,0.00031955002,0.000010080304],"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.0001510151,0.00046296086,0.015888613,0.000980753,0.00030677416,0.0000060644597,0.0037714434,0.000090602516,0.056401853,0.673485,0.0146439485,0.23381102],"study_design_scores_gemma":[0.0014802653,0.001370366,0.008899409,0.001708795,0.00017180806,0.000010771211,0.00038233987,0.27774897,0.61850685,0.073793784,0.0145946015,0.001332039],"about_ca_topic_score_codex":0.0007995803,"about_ca_topic_score_gemma":0.00013375179,"teacher_disagreement_score":0.7865221,"about_ca_system_score_codex":0.00012805953,"about_ca_system_score_gemma":0.0004436313,"threshold_uncertainty_score":0.9998432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071436516,0.00057307305,0.95364016,0.0030167054,0.0033979663,0.0031495555,0.00002529896,0.0050380393,0.024015555],"genre_scores_gemma":[0.7550623,0.000010776813,0.23242612,0.0019538093,0.00022611322,0.00068114244,0.000009103547,0.00009604275,0.009534579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99221385,0.0005069856,0.0019782055,0.002563555,0.00089429726,0.0018430831],"domain_scores_gemma":[0.9922358,0.0019497519,0.00058739656,0.003412826,0.0014150484,0.0003992114],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029784567,0.0010887805,0.0013047078,0.0010536899,0.0010437747,0.0013108245,0.0043501495,0.0007564571,0.00010282175],"category_scores_gemma":[0.0005747002,0.0011160037,0.0008116062,0.002424378,0.00023561293,0.00070727256,0.0011666429,0.00056122855,0.00016863407],"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.0008186312,0.0013564482,0.002626394,0.009102432,0.00072577235,0.00014395706,0.0038128542,0.025427083,0.001962497,0.5457686,0.14279783,0.26545745],"study_design_scores_gemma":[0.001668232,0.0004751483,0.00005492076,0.0020391725,0.00017223488,0.00002932166,0.0006694523,0.9638193,0.020496735,0.0012548007,0.008227229,0.0010934374],"about_ca_topic_score_codex":0.00039372037,"about_ca_topic_score_gemma":0.0002466448,"teacher_disagreement_score":0.9383922,"about_ca_system_score_codex":0.0011812808,"about_ca_system_score_gemma":0.0020743285,"threshold_uncertainty_score":0.99972594},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060994257,0.0002715952,0.0039240676,0.00013859867,0.00087293127,0.0013237023,0.00006901463,0.0033458173,0.98395485],"genre_scores_gemma":[0.9777845,0.0000555927,0.0014144438,0.000042278294,0.0003773022,1.3063318e-7,0.00020482887,0.0024154084,0.017705476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997388,0.00018586584,0.0005869049,0.0008392853,0.0006175268,0.0003823929],"domain_scores_gemma":[0.9978869,0.000068749476,0.0002894076,0.00096087874,0.000675592,0.00011850293],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012053055,0.00031568392,0.00039679479,0.00086297124,0.00044765128,0.0006506607,0.002495971,0.00016385716,0.0014749004],"category_scores_gemma":[0.0007938244,0.0003571346,0.00010107168,0.00038453037,0.00012956723,0.00018597621,0.0031030995,0.00091128284,0.0009633425],"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.00020256349,0.001085954,0.00004632937,0.0013451495,0.0005854806,0.002719471,0.27454212,0.00021624667,0.0007601848,0.4285939,0.10378493,0.18611765],"study_design_scores_gemma":[0.0011174227,0.0018606641,0.0002748132,0.0015205767,0.000089199486,0.00020201106,0.004166905,0.0045262515,0.00013817295,0.022816308,0.961857,0.0014306497],"about_ca_topic_score_codex":0.000090790476,"about_ca_topic_score_gemma":0.0000078018475,"teacher_disagreement_score":0.9716851,"about_ca_system_score_codex":0.00038919193,"about_ca_system_score_gemma":0.000013299952,"threshold_uncertainty_score":0.99988806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25005293,0.00041862755,0.700598,0.0025248437,0.012145682,0.01549205,0.00027576165,0.0019103745,0.016581744],"genre_scores_gemma":[0.9096687,0.00008639257,0.08913831,0.0001061872,0.0002632101,0.00022922496,0.00037802168,0.000018640552,0.00011130814],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99764675,0.000059545397,0.0007887632,0.00030013963,0.0009938207,0.00021097738],"domain_scores_gemma":[0.99723107,0.00031017928,0.00092084287,0.0007338761,0.00077639625,0.000027629545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010067559,0.00022066923,0.0003487847,0.00013595106,0.00011130907,0.0000955726,0.0009924275,0.00011942411,0.000030887983],"category_scores_gemma":[0.00033639884,0.0001780973,0.0001160124,0.00024743698,0.000025797259,0.00085185445,0.00010762433,0.0003149738,0.000002966997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001105538,0.00033068814,0.018914986,0.0018578992,0.00041182226,0.000007127093,0.010949029,0.000079967875,0.0010124599,0.0015787861,0.0082664,0.95648026],"study_design_scores_gemma":[0.0083000995,0.004178236,0.764209,0.02892791,0.0021811812,0.00006135671,0.001723664,0.038872458,0.024147598,0.08463832,0.03746738,0.005292831],"about_ca_topic_score_codex":0.0035865698,"about_ca_topic_score_gemma":0.0024452726,"teacher_disagreement_score":0.95118743,"about_ca_system_score_codex":0.00026185164,"about_ca_system_score_gemma":0.00042125676,"threshold_uncertainty_score":0.7262597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7946201,0.000062075436,0.19447842,0.00006199177,0.0028193896,0.0021051872,0.00069486204,0.0011091862,0.004048758],"genre_scores_gemma":[0.9767301,0.0000132389305,0.021875031,0.00012603487,0.000042018604,0.00020907997,0.00013976934,0.000103027916,0.0007617077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962599,0.00029161925,0.0009663133,0.001073032,0.00078677776,0.00062235165],"domain_scores_gemma":[0.99634355,0.00038174936,0.0012773899,0.0011772071,0.0006914008,0.00012869675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009902414,0.00057096395,0.00056472636,0.00030985082,0.0011282567,0.00009124847,0.001986979,0.00045032715,0.00000947977],"category_scores_gemma":[0.00037046903,0.00046806398,0.00047675456,0.00047337593,0.000048063597,0.0007973603,0.00042049304,0.0005488434,0.000005242023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062895255,0.00011495481,0.00006775723,0.00027956942,0.00009461654,9.4311883e-7,0.0001259389,0.0009066744,0.06308329,0.17769769,0.000013231046,0.75755244],"study_design_scores_gemma":[0.002489535,0.00056442723,0.008442056,0.0026126176,0.00049114623,0.000039894498,0.00074452214,0.34839717,0.26362646,0.36897612,0.0006280793,0.0029879997],"about_ca_topic_score_codex":0.0006290304,"about_ca_topic_score_gemma":0.0051691947,"teacher_disagreement_score":0.75456446,"about_ca_system_score_codex":0.00073146244,"about_ca_system_score_gemma":0.0001459366,"threshold_uncertainty_score":0.9997771},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02015705,0.010659826,0.911662,0.016700782,0.0019380716,0.0044622067,0.001681478,0.0008193881,0.031919215],"genre_scores_gemma":[0.98648953,0.00035712568,0.0097086625,0.00016993028,0.00054068555,0.00013311872,0.0002485943,0.000045993092,0.0023063524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966954,0.000084052546,0.00044972615,0.00062945485,0.0014889146,0.0006524333],"domain_scores_gemma":[0.9969877,0.00066229334,0.00022945555,0.00041397588,0.0014187047,0.0002878798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016458122,0.0002723821,0.00030032895,0.0028167232,0.00046048113,0.00072628155,0.00072217773,0.00020407244,0.00003938535],"category_scores_gemma":[0.0013422102,0.00027245458,0.00008206393,0.0035848755,0.00064912986,0.0076594017,0.0008791509,0.00030525587,0.000016684608],"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.00011738817,0.00067415053,0.0005842259,0.0003576455,0.00013333533,0.00000770841,0.0024081757,0.0003851109,0.003219092,0.7850136,0.18348168,0.02361786],"study_design_scores_gemma":[0.0022689481,0.0009836708,0.002118659,0.00078628113,0.00003723954,0.00024170429,0.00045994774,0.060298484,0.020675695,0.041836064,0.8688064,0.0014869007],"about_ca_topic_score_codex":0.000047226276,"about_ca_topic_score_gemma":0.000028912613,"teacher_disagreement_score":0.9663325,"about_ca_system_score_codex":0.00019229193,"about_ca_system_score_gemma":0.00030064417,"threshold_uncertainty_score":0.99997276},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524905,0.001461309,0.011261195,0.00030990434,0.0041167894,0.0056243804,0.0050536813,0.003076171,0.016606087],"genre_scores_gemma":[0.82722336,0.000395549,0.16855343,0.00043326273,0.000059128775,0.0008415267,0.00043126033,0.00024228929,0.0018201779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958185,0.00022437685,0.0008298846,0.0016385644,0.0006187321,0.0008699743],"domain_scores_gemma":[0.9967752,0.00086209166,0.00060922967,0.0008851244,0.0004855537,0.00038281133],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012817042,0.0007540359,0.00066124176,0.0006392944,0.0017521104,0.0002843308,0.0010365461,0.0005123717,0.000016640672],"category_scores_gemma":[0.00063969055,0.0007367723,0.00022155489,0.0004301826,0.00009989579,0.00060090603,0.00032053093,0.0006306273,0.000015554479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202568,0.00018605264,0.00010432686,0.00056166115,0.0003083539,0.000026373667,0.00024401183,0.00002047516,0.034125775,0.169136,0.000059090926,0.79512584],"study_design_scores_gemma":[0.011031852,0.0033332575,0.0039474415,0.0046003084,0.0014816358,0.0005438152,0.0054399082,0.034464538,0.44488898,0.38844404,0.08967116,0.01215307],"about_ca_topic_score_codex":0.00038237235,"about_ca_topic_score_gemma":0.0014933355,"teacher_disagreement_score":0.7829728,"about_ca_system_score_codex":0.00043533935,"about_ca_system_score_gemma":0.00010015963,"threshold_uncertainty_score":0.9995475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08476337,0.00016065505,0.90716076,0.001661083,0.00024759411,0.0029753058,0.00035606892,0.00044319264,0.002231955],"genre_scores_gemma":[0.85480404,0.0000663793,0.14403844,0.00007893727,0.00015617242,0.00040169156,0.0001487473,0.000043470187,0.0002621058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955405,0.00007232572,0.000563476,0.0011983367,0.0015326061,0.0010927527],"domain_scores_gemma":[0.9950885,0.0016936398,0.00020058358,0.0007930188,0.001845178,0.00037904282],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004329197,0.0003457666,0.0003734317,0.0037284528,0.00090260874,0.003045837,0.0012996023,0.00029761196,0.0000042316706],"category_scores_gemma":[0.0038251262,0.00036423805,0.00016632292,0.0077384883,0.00072006404,0.0041990494,0.0008858992,0.00058284093,0.000021705499],"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.00029287732,0.0009311492,0.0036649327,0.00020722605,0.000045524976,0.000020379151,0.00045571406,0.00046083538,0.0027602431,0.9597856,0.0058723185,0.02550324],"study_design_scores_gemma":[0.0033262544,0.0010007543,0.028563926,0.0004720667,0.000025732146,0.00016782289,0.00041353135,0.11730067,0.031901307,0.14134216,0.6734489,0.0020368542],"about_ca_topic_score_codex":0.0001412249,"about_ca_topic_score_gemma":0.0026578193,"teacher_disagreement_score":0.8184434,"about_ca_system_score_codex":0.00038474257,"about_ca_system_score_gemma":0.00060308306,"threshold_uncertainty_score":0.99988097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94128746,0.0002228822,0.0016151238,0.00002184161,0.003438058,0.0005716852,0.0001307167,0.00203243,0.050679825],"genre_scores_gemma":[0.97622377,0.000086746295,0.021030724,0.00019714034,0.000052371674,0.00008457801,0.00016651634,0.0001580617,0.002000115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9934848,0.0007092095,0.0014604183,0.0018859764,0.0014614761,0.0009981001],"domain_scores_gemma":[0.9939636,0.0006881491,0.0015735554,0.0023131324,0.0010785887,0.00038294692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002343367,0.0010123968,0.0013575708,0.0008258176,0.001025495,0.00019058539,0.003190849,0.001077783,0.00002990455],"category_scores_gemma":[0.001252166,0.0011258458,0.00062272727,0.001135374,0.00009713584,0.0006022984,0.0007515782,0.0016750778,0.000077385615],"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.00013165268,0.0006756085,0.00014339131,0.0010960673,0.0002398091,0.00009415838,0.00006300441,0.00028035976,0.10341737,0.5880368,0.000056237153,0.30576557],"study_design_scores_gemma":[0.0005135832,0.00026253227,0.0007641896,0.0017009153,0.00013579577,0.000048257963,0.00008734325,0.009061673,0.94162387,0.037777293,0.0061780014,0.0018465255],"about_ca_topic_score_codex":0.000922207,"about_ca_topic_score_gemma":0.0025892523,"teacher_disagreement_score":0.8382065,"about_ca_system_score_codex":0.0006809251,"about_ca_system_score_gemma":0.00012552275,"threshold_uncertainty_score":0.99911916},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024755289,0.00012968673,0.5542792,0.000041091796,0.0004355664,0.00035433294,0.0000037789146,0.0012577119,0.44347388],"genre_scores_gemma":[0.0013058118,0.000011479025,0.30780387,0.00016875322,0.00014192173,0.000048602513,0.000016155755,0.00015906332,0.69034433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844664,0.0000449383,0.00022425248,0.0006527354,0.00021126494,0.0004201619],"domain_scores_gemma":[0.9987438,0.00027196735,0.00020805652,0.00057477615,0.00012564292,0.0000757672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025310283,0.0003081086,0.0004224217,0.00026133034,0.000053992786,0.00013100037,0.0007926934,0.00026449474,0.000406338],"category_scores_gemma":[0.00021495519,0.00031290788,0.00016187534,0.00027835055,0.000030476032,0.000054928958,0.00022144023,0.0003803185,0.000013697452],"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.0000034647965,0.00003759871,0.00062742893,0.00007854019,0.00011243022,0.000018756748,0.00094056333,0.000001260419,0.00009601,0.0123037025,0.97402316,0.011757088],"study_design_scores_gemma":[0.00050424284,0.00023452913,0.00013624303,0.0008349917,0.00004651029,0.000034043915,0.00020275213,0.004652988,0.008867876,0.0007776287,0.9825208,0.001187347],"about_ca_topic_score_codex":0.012119716,"about_ca_topic_score_gemma":0.07003648,"teacher_disagreement_score":0.24687047,"about_ca_system_score_codex":0.00024273351,"about_ca_system_score_gemma":0.00039954952,"threshold_uncertainty_score":0.9999323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506864,0.0019573309,0.012599183,0.026726471,0.0012962595,0.002231027,0.000026727485,0.00022097364,0.004255631],"genre_scores_gemma":[0.9919851,0.0013891305,0.002464875,0.003244632,0.00008200155,0.000075764896,0.000002144319,0.000052820764,0.00070354826],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9934983,0.0014238075,0.0014042611,0.0016944541,0.00086376,0.0011153853],"domain_scores_gemma":[0.99558157,0.0013351868,0.0007832765,0.0018188218,0.00025492563,0.00022621316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026629611,0.0009244281,0.0010505858,0.0004564839,0.000839331,0.00031176014,0.0026141438,0.0005427454,0.000015729613],"category_scores_gemma":[0.00054242107,0.0006233624,0.00033913107,0.002104009,0.001022263,0.00084133464,0.000998852,0.0016259023,0.0000071560476],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002355951,0.00058647984,0.9312431,0.00042591174,0.00018312289,0.00002950793,0.01295502,0.00007311883,0.0010432473,0.033455294,0.0013551177,0.018414436],"study_design_scores_gemma":[0.0031059717,0.0009954504,0.8627647,0.0048630117,0.0004018239,0.0001538751,0.001525424,0.041900583,0.045794424,0.02923949,0.0075768386,0.0016784177],"about_ca_topic_score_codex":0.0015127171,"about_ca_topic_score_gemma":0.003673834,"teacher_disagreement_score":0.06847846,"about_ca_system_score_codex":0.0002768921,"about_ca_system_score_gemma":0.0010278708,"threshold_uncertainty_score":0.99962175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018496866,0.000099478995,0.944065,0.008066508,0.007961585,0.0017765907,0.000038295693,0.0015316491,0.034611233],"genre_scores_gemma":[0.65469223,0.000009991888,0.33861688,0.002819352,0.0001839094,0.00022206933,0.0000059610047,0.000025743504,0.0034238542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962076,0.00023967562,0.00086339086,0.0014063306,0.00045099645,0.00083202985],"domain_scores_gemma":[0.99474996,0.002676113,0.0003797506,0.0013459226,0.0006639485,0.0001842817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013165413,0.0006045301,0.00067813374,0.00084072177,0.0006920813,0.00075932825,0.0015667705,0.00036248215,0.00020308416],"category_scores_gemma":[0.0008559074,0.0006014509,0.0003891608,0.0014265719,0.0005542528,0.00047260566,0.00024689813,0.0004066426,0.000030151794],"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.00038242651,0.0006629584,0.0021025154,0.0006972785,0.00025776678,0.000012161128,0.0006457646,0.0021166303,0.0016421396,0.6439879,0.02187469,0.3256178],"study_design_scores_gemma":[0.0015235713,0.00091330305,0.00006577909,0.00094251643,0.000094519506,0.000008818465,0.00028218783,0.89161694,0.07727044,0.019851567,0.0067048334,0.00072552345],"about_ca_topic_score_codex":0.00009359968,"about_ca_topic_score_gemma":0.00005956855,"teacher_disagreement_score":0.8895003,"about_ca_system_score_codex":0.00021645511,"about_ca_system_score_gemma":0.0011553505,"threshold_uncertainty_score":0.9996437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061904797,0.00020015746,0.94756496,0.0065508625,0.00073443697,0.0012619194,0.0000020936907,0.0019592864,0.035535812],"genre_scores_gemma":[0.70908594,0.00000786745,0.28356266,0.0023075258,0.000069271926,0.00014140912,0.000006227438,0.00002568186,0.004793374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962878,0.00026680416,0.0007356275,0.0013159306,0.0006693032,0.00072453887],"domain_scores_gemma":[0.9970071,0.0002546741,0.0003715353,0.0014760952,0.0007568328,0.00013381215],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00080203946,0.00053590996,0.00045426752,0.00045125492,0.00075187697,0.0011376456,0.0016030377,0.00024320996,0.00008855368],"category_scores_gemma":[0.00023352588,0.00046187147,0.00012784726,0.0019512863,0.00014388705,0.0009578271,0.0004965307,0.00065434596,0.000046017598],"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.00026525004,0.0012430991,0.017557133,0.0012028328,0.0002665056,0.00017611247,0.0041912757,0.009954884,0.0108023295,0.1593876,0.027545447,0.76740754],"study_design_scores_gemma":[0.0009767791,0.00073506904,0.0017855292,0.0016411078,0.000064316315,0.000013025102,0.00011002732,0.8906347,0.09829812,0.0014187016,0.0034766041,0.00084603],"about_ca_topic_score_codex":0.00030842316,"about_ca_topic_score_gemma":0.00031418834,"teacher_disagreement_score":0.8806798,"about_ca_system_score_codex":0.0002679496,"about_ca_system_score_gemma":0.0012958029,"threshold_uncertainty_score":0.99989927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04321431,0.0011774702,0.92253345,0.002995385,0.011560283,0.005045142,0.000017051705,0.006195666,0.0072612264],"genre_scores_gemma":[0.17049703,0.0003069573,0.46955183,0.00053331704,0.0023067137,0.0014359489,0.0009457375,0.0009314895,0.35349098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99290955,0.00021553149,0.0013570812,0.0022670906,0.0009745038,0.002276226],"domain_scores_gemma":[0.9940769,0.0012377608,0.0015718269,0.0019029782,0.00073653937,0.0004740163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021633096,0.0011072966,0.0011311609,0.0008917535,0.001178689,0.0010306379,0.0027883262,0.00072404515,0.00015717668],"category_scores_gemma":[0.0012591742,0.0013183466,0.00078487507,0.0021958353,0.000048461698,0.0004980694,0.00040246898,0.00091707066,0.00024410899],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028612345,0.00024399308,0.0007705559,0.0018588288,0.0006578843,0.00008477118,0.12999058,0.00012193063,0.018919542,0.0045342087,0.18172097,0.66081065],"study_design_scores_gemma":[0.008339871,0.00356407,0.022222988,0.009990716,0.00201284,0.00031073607,0.051271096,0.35098752,0.25157008,0.019151991,0.26759616,0.0129819475],"about_ca_topic_score_codex":0.0044274405,"about_ca_topic_score_gemma":0.0074102567,"teacher_disagreement_score":0.6478287,"about_ca_system_score_codex":0.00048520524,"about_ca_system_score_gemma":0.0016903336,"threshold_uncertainty_score":0.99892664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07856784,0.017281884,0.8972461,0.0016699882,0.001068354,0.0025712317,0.000045933393,0.00086237176,0.00068628346],"genre_scores_gemma":[0.88637394,0.0024183812,0.1047806,0.00014778081,0.00020863324,0.00071738363,0.0008656137,0.0001380157,0.004349661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692076,0.000563016,0.00058983645,0.0011283114,0.00032093818,0.0004771543],"domain_scores_gemma":[0.9958783,0.0021456326,0.00050480687,0.0009614741,0.0003461704,0.00016364781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038994602,0.00051631895,0.00054725184,0.00016244019,0.0009131544,0.0009807121,0.0007577424,0.0003576262,0.0000055797427],"category_scores_gemma":[0.0007024982,0.00055104116,0.00010241649,0.0004056301,0.00018581575,0.0003944838,0.00054347655,0.00084331754,0.0000048873612],"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.00015790007,0.00008838421,0.000028425378,0.006688764,0.000116397496,0.0000064776955,0.16651826,0.00002780473,0.0004357011,0.5612267,0.0006130422,0.2640921],"study_design_scores_gemma":[0.00068675785,0.0008148068,0.0016843196,0.011493135,0.00057179254,0.00019251347,0.036284227,0.2483204,0.0011226985,0.69392455,0.0029420755,0.0019627577],"about_ca_topic_score_codex":0.00038037344,"about_ca_topic_score_gemma":0.00024887844,"teacher_disagreement_score":0.8078061,"about_ca_system_score_codex":0.00026303247,"about_ca_system_score_gemma":0.00027996732,"threshold_uncertainty_score":0.9996941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005883112,0.00096975686,0.95924646,0.0033844924,0.0033142804,0.0014834787,0.000031368698,0.0010095827,0.024677495],"genre_scores_gemma":[0.8537317,0.00010924593,0.124237895,0.00138037,0.00014941758,0.00017602315,0.000011834107,0.00002961874,0.020173931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963948,0.00024876764,0.00088474056,0.0012895733,0.00037917178,0.00080293044],"domain_scores_gemma":[0.99519485,0.0018658426,0.0004912697,0.0012069052,0.0011020238,0.00013910906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012321742,0.000493956,0.00057160115,0.0004893557,0.00072955654,0.00079610536,0.0016563018,0.00033553093,0.000115978524],"category_scores_gemma":[0.0013724832,0.0005108591,0.0002776297,0.0015499649,0.00016208681,0.00087545183,0.00055301585,0.00034713207,0.000021635758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028176184,0.00051786937,0.006518273,0.0009881268,0.0003542415,0.000009630273,0.006262131,0.0013636567,0.03971909,0.2157478,0.07596358,0.65227383],"study_design_scores_gemma":[0.0005761529,0.00021510887,0.00034488385,0.0005784887,0.00007393218,0.0000019456077,0.00019097142,0.5569201,0.41844082,0.0142877875,0.007726384,0.00064339436],"about_ca_topic_score_codex":0.0024746072,"about_ca_topic_score_gemma":0.0064124237,"teacher_disagreement_score":0.84784853,"about_ca_system_score_codex":0.00044943567,"about_ca_system_score_gemma":0.00090129004,"threshold_uncertainty_score":0.9997343},"labels":[],"label_agreement":null}]}