{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458252,0.0004186394,0.0004383545,0.0006264906,0.0005638218,0.000725495,0.0006273303,0.0006853042,0.0009882372],"category_scores_gemma":[0.0094105,0.0001585806,0.0001635849,0.0006957265,0.001334318,0.001093498,0.001028937,0.000562719,0.0001846255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001942708,"about_ca_system_score_gemma":0.001270995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002527574,"about_ca_topic_score_gemma":0.001643058,"domain_scores_codex":[0.998825,0.0004491025,0.0000297336,0.0001101579,0.0003151088,0.0002709102],"domain_scores_gemma":[0.9930561,0.004996843,0.0004654586,0.0006108196,0.0007411398,0.0001295263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007039824,0.00006585387,0.001509305,0.00008241757,0.00003511292,0.0001527169,0.0002093916,0.8533178,0.01976237,0.09232859,0.001466015,0.03036644],"study_design_scores_gemma":[0.00002583114,0.0001155916,0.0004403176,0.0000168613,0.00001676782,0.00008509465,0.00003537516,0.9575365,0.01601366,0.02505922,0.0006315643,0.00002318602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6480983,0.001235557,0.3223928,0.0009509103,0.00009552946,0.00009033901,0.0002690153,0.001002081,0.02586561],"genre_scores_gemma":[0.9925914,0.0001106343,0.006404783,0.00003588207,0.000009064243,0.00002466287,0.00005613689,0.00001856031,0.0007488057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002527574,"threshold_uncertainty_score":0.01409543,"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."}}