{"id":"W2260858646","doi":"10.1049/iet-com.2015.0386","title":"Efficient combination of polynomial time algorithm and subtree decomposition for network coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Time complexity; Computer science; Multicast; Algorithm; Coding (social sciences); Computational complexity theory; Theoretical computer science; Mathematical optimization; Mathematics; Distributed computing","routes":{"ca_aff":true,"ca_fund":true,"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.0007390128,0.0007812548,0.0008520952,0.00113267,0.0006031636,0.0008268523,0.001320925,0.0006351828,0.002118644],"category_scores_gemma":[0.002771465,0.0002712433,0.0006846573,0.002203105,0.0007227913,0.001810487,0.001111043,0.001232751,0.0005369521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013751,"about_ca_system_score_gemma":0.002357653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005926339,"about_ca_topic_score_gemma":0.004027389,"domain_scores_codex":[0.9986041,0.0003377273,0.00006909262,0.0002446915,0.0005453651,0.0001990411],"domain_scores_gemma":[0.9985389,0.0006353269,0.00007825221,0.0003680079,0.0003219731,0.00005765028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003638255,0.0002229965,0.0008863647,0.0002150481,0.00006186799,0.0001416983,0.0002198303,0.2535522,0.03793168,0.1093953,0.008104498,0.5889046],"study_design_scores_gemma":[0.00003921887,0.00006674314,0.00009371832,0.000007082043,0.00001587353,0.0001023264,0.00001843007,0.9731588,0.006929679,0.01704718,0.002507364,0.00001362426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004699904,0.00008801652,0.9933143,0.00005949388,0.00002157252,0.00002926078,0.00001446987,0.0004417827,0.001331206],"genre_scores_gemma":[0.1772079,0.0002087057,0.8199821,0.00007475318,0.00005277465,0.000139212,0.0002088676,0.0001352414,0.001990391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005926339,"threshold_uncertainty_score":0.01178372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05057372867581421,"score_gpt":0.3162539849989059,"score_spread":0.2656802563230917,"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."}}