{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007919903,0.00005536344,0.0001017306,0.00004327264,0.00009715294,0.00003565683,0.0003154996,0.00001270584,0.00007218179],"category_scores_gemma":[0.00001430336,0.00004459454,0.00002333716,0.0001893611,0.00006249562,0.0001226604,0.0002298802,0.00004853958,0.000005318064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004356925,"about_ca_system_score_gemma":0.00000256258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008452551,"about_ca_topic_score_gemma":0.00004976054,"domain_scores_codex":[0.9995783,0.00005403654,0.0001056052,0.0001108345,0.00007334588,0.0000778716],"domain_scores_gemma":[0.9994324,0.0001047443,0.00003369197,0.0003262668,0.00006189985,0.00004097697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002264749,0.0001853151,0.08124828,0.00002264988,0.00004131125,0.000002522737,0.003901061,0.00002621449,0.01382294,0.8151017,0.005019962,0.08062579],"study_design_scores_gemma":[0.0006477794,0.0001692218,0.2202404,0.00005912874,0.000008121256,0.00001375074,0.000119957,0.7404941,0.02789611,0.003738159,0.006143794,0.0004695486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8339387,0.0004251057,0.1588597,0.0005675277,0.00006173379,0.00007529808,0.000001187086,0.00009007121,0.005980609],"genre_scores_gemma":[0.9940128,0.0005183042,0.005142769,0.0001543237,0.000002481263,5.948195e-7,5.823814e-7,0.000001535879,0.0001665461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8113635,"threshold_uncertainty_score":0.1818512,"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."}}