{"id":"W4214918574","doi":"10.1109/isit.1998.708599","title":"Low density MDS codes and factors of complete graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Tanner graph; Combinatorics; Discrete mathematics; Decoding methods; Code (set theory); Equivalence (formal languages); Factorization; Equivalence relation; Computer science; Block code; Linear code; Algorithm","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.0006899649,0.0005048888,0.0004970005,0.0008652634,0.0009478773,0.001537593,0.0004673138,0.0006931372,0.002344004],"category_scores_gemma":[0.004324696,0.0004300954,0.0005196295,0.000621945,0.002537441,0.002664205,0.001296327,0.001233296,0.0003810225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114557,"about_ca_system_score_gemma":0.0006177329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377899,"about_ca_topic_score_gemma":0.001153396,"domain_scores_codex":[0.9992466,0.0001901932,0.00003378375,0.0001971796,0.0001837172,0.0001485302],"domain_scores_gemma":[0.9969147,0.001523868,0.0004666083,0.000549102,0.0002595398,0.0002861679],"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.000132957,0.00002307709,0.0007953275,0.00007060074,0.000009022625,0.00007904223,0.0002970481,0.02836398,0.003835358,0.9477692,0.00151073,0.01711354],"study_design_scores_gemma":[0.00003037134,0.00006123594,0.0003250313,0.00003303046,0.000007459088,0.0002166504,0.0001305587,0.05400523,0.004163467,0.9334677,0.007530001,0.00002919029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.382076,0.001168456,0.59379,0.001136763,0.00007247102,0.0001072502,0.0004646449,0.0003802465,0.02080422],"genre_scores_gemma":[0.8879017,0.0007423829,0.1036575,0.0002238001,0.00009302102,0.0001149994,0.000370016,0.00009075386,0.006805901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002344004,"threshold_uncertainty_score":0.008311749,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07521329272523344,"score_gpt":0.2583643489041538,"score_spread":0.1831510561789204,"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."}}