{"id":"W2141852597","doi":"10.1109/cwit.2007.375708","title":"Throughput Performance of Generation-Based Network Coding","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Throughput; Decoding methods; Multicast; Computer network; Network packet; Network topology; Scalability; Coding (social sciences); Maximum throughput scheduling; Distributed computing; Algorithm; Wireless; Telecommunications; Quality of service; Mathematics; Dynamic priority scheduling","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.0007176743,0.00007057226,0.00009498838,0.00004344255,0.0001838259,0.00003674019,0.0005404909,0.00002733598,0.00005260585],"category_scores_gemma":[0.00001609552,0.00006290885,0.00003205589,0.000483826,0.00003168409,0.0002147518,0.000128235,0.00007384052,0.00001275831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002263386,"about_ca_system_score_gemma":0.0000467639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001397782,"about_ca_topic_score_gemma":0.00003943302,"domain_scores_codex":[0.999264,0.00003774874,0.0002363195,0.0001420592,0.0001385209,0.0001813571],"domain_scores_gemma":[0.999121,0.0001371405,0.00007369925,0.0004924504,0.0001358417,0.00003988663],"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.00001153358,0.00008435839,0.01639995,0.00001647307,0.00001868101,0.000001624976,0.0003646327,0.03821345,0.01185982,0.5355153,0.007282243,0.3902319],"study_design_scores_gemma":[0.0001670865,0.00004822649,0.004376157,0.00001989136,0.000001363339,9.429702e-7,0.000003807528,0.9634903,0.02573988,0.0000262049,0.006024698,0.0001014496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03801569,0.0002087448,0.9359498,0.0003272153,0.0002024481,0.00007128114,7.806258e-8,0.00008017131,0.02514456],"genre_scores_gemma":[0.8960847,0.0001207063,0.1026399,0.0007182258,0.0001143415,0.00000209977,0.000001983629,0.000003343634,0.0003146366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9252768,"threshold_uncertainty_score":0.2565348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05714584415339539,"score_gpt":0.2875512391432168,"score_spread":0.2304053949898215,"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."}}