{"id":"W2135386172","doi":"10.1109/netcod.2009.5191397","title":"Sparse network coding with overlapping classes","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Disjoint sets; Coding (social sciences); Gaussian; Algorithm; Theoretical computer science; Network packet; Shannon–Fano coding; Tunstall coding; Variable-length code; Mathematics; Computer network; Discrete mathematics","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.0005582487,0.0003863871,0.0004864195,0.0008099496,0.0005114624,0.0008566349,0.001105094,0.0007026664,0.00171882],"category_scores_gemma":[0.003540235,0.0001859711,0.0002818462,0.0009828059,0.001009676,0.001773909,0.00153087,0.001134675,0.0003157869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001273869,"about_ca_system_score_gemma":0.0006529092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002599641,"about_ca_topic_score_gemma":0.002544715,"domain_scores_codex":[0.9993755,0.0001645579,0.00001542075,0.00008660262,0.0002319371,0.0001260246],"domain_scores_gemma":[0.9984244,0.0008661557,0.0001356497,0.0003089738,0.0001944766,0.0000702703],"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.0002814097,0.00006764554,0.0005960502,0.00007417727,0.00002633878,0.0002070059,0.0002374292,0.3212412,0.008419548,0.51458,0.003712576,0.1505566],"study_design_scores_gemma":[0.00001903942,0.00002761915,0.0001348629,0.000009989571,0.00000625442,0.0000910166,0.00001928069,0.9001983,0.002039103,0.09434397,0.003099113,0.00001151246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05377682,0.0002984614,0.9349781,0.0004539869,0.00005724854,0.00005614366,0.0001013423,0.0002347947,0.0100431],"genre_scores_gemma":[0.8746194,0.000406971,0.1160487,0.0002601457,0.0001359424,0.0001811971,0.0001969249,0.00007297869,0.008077731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002599641,"threshold_uncertainty_score":0.009242594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05815886776890307,"score_gpt":0.2848231238879329,"score_spread":0.2266642561190298,"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."}}