{"id":"W2076838219","doi":"10.1109/isit.2005.1523645","title":"Improved bounds on the size of sparse parity check matrices","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004718944,0.002468809,0.001817588,0.002187364,0.001544607,0.003993169,0.003837969,0.0022663,0.01157369],"category_scores_gemma":[0.0415145,0.001287957,0.001506729,0.002167129,0.003658304,0.0101991,0.005304868,0.006334646,0.003769378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003756138,"about_ca_system_score_gemma":0.004020364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002609616,"about_ca_topic_score_gemma":0.003892664,"domain_scores_codex":[0.9935854,0.001522857,0.0001950813,0.0009893067,0.00231394,0.001393406],"domain_scores_gemma":[0.9491932,0.03735249,0.001964694,0.007158206,0.002868042,0.001463329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004011449,0.000766182,0.007103384,0.001315373,0.0002764062,0.001028037,0.0009670524,0.3033123,0.05060349,0.4228168,0.0803216,0.127478],"study_design_scores_gemma":[0.0002199403,0.0002980536,0.001698662,0.0002176485,0.0001145438,0.0004194876,0.0001752487,0.6108712,0.01561714,0.3599862,0.01026043,0.0001215049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2783204,0.009555265,0.5516316,0.0211085,0.001825462,0.0004758893,0.008396714,0.006068619,0.1226175],"genre_scores_gemma":[0.8681781,0.003797047,0.1041231,0.001914357,0.001867134,0.000800436,0.004312728,0.0009088181,0.01409815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01157369,"threshold_uncertainty_score":0.03871787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0426649201189785,"score_gpt":0.2793508502754104,"score_spread":0.2366859301564319,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}