{"id":"W2533310758","doi":"10.1109/icspc.2007.4728546","title":"Recursive and Non-Recursive Network Coding: Performance and Complexity","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Computational complexity theory; Coding (social sciences); Network packet; Theoretical computer science; Encoding (memory); Throughput; Computer network; Algorithm; Mathematics; Artificial intelligence","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.002952274,0.0006361445,0.0007786857,0.0009007333,0.0004788216,0.001580945,0.001222367,0.001073119,0.001737603],"category_scores_gemma":[0.01717013,0.0002269378,0.0003417764,0.001052557,0.001462667,0.0029535,0.001362301,0.0007880296,0.0002785552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001605437,"about_ca_system_score_gemma":0.001687282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003285874,"about_ca_topic_score_gemma":0.003922887,"domain_scores_codex":[0.997951,0.0006285839,0.00008247432,0.0001713407,0.0007454715,0.0004213105],"domain_scores_gemma":[0.9802102,0.01482431,0.001016707,0.001974547,0.001769927,0.0002042012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001845943,0.0002451664,0.003906971,0.0004180252,0.00009873485,0.0002313218,0.0004116594,0.7100723,0.03358883,0.137587,0.001874901,0.1097191],"study_design_scores_gemma":[0.00005833307,0.0003815002,0.001614484,0.00004133985,0.00004034588,0.0002157489,0.00008871113,0.9430644,0.02236323,0.03110442,0.0009717186,0.00005578249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6606597,0.004033597,0.3102176,0.0007785115,0.00008376894,0.0002010425,0.0003961241,0.0008488399,0.02278065],"genre_scores_gemma":[0.963293,0.0007793223,0.03380358,0.00005034019,0.00002690472,0.00007854028,0.000211254,0.00006747185,0.001689643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003285874,"threshold_uncertainty_score":0.01561332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05396336199440613,"score_gpt":0.2841623879853306,"score_spread":0.2301990259909244,"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."}}