{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777862,0.00009759191,0.0001641234,0.00008181418,0.0003782286,0.0000824106,0.001176125,0.00004688507,0.00000235196],"category_scores_gemma":[0.00007550864,0.0001058423,0.00004516748,0.0003665039,0.0001228515,0.0001381032,0.0007984791,0.0001074141,0.000007663543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006256806,"about_ca_system_score_gemma":0.0000737204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006858966,"about_ca_topic_score_gemma":0.00001082648,"domain_scores_codex":[0.9990152,0.0002413055,0.0002972614,0.0001618272,0.0001266627,0.0001577194],"domain_scores_gemma":[0.9975139,0.0005144111,0.000167948,0.001312423,0.0003987338,0.00009251969],"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.00005683445,0.001144373,0.000605332,0.00003264854,0.0001409183,5.042726e-7,0.007783941,0.01196618,0.004548561,0.4585181,0.03270428,0.4824983],"study_design_scores_gemma":[0.000729067,0.0000948603,0.0008453719,0.0000403999,0.00001169905,0.000003655313,0.00003377841,0.9910662,0.0002312429,0.00127732,0.00554395,0.000122479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004936607,0.001766756,0.9862809,0.004421761,0.0001496185,0.0004833782,0.00001126364,0.0001189506,0.001830828],"genre_scores_gemma":[0.6762172,0.0002516163,0.3232192,0.0001149233,0.00003331176,0.00005857358,0.00004403591,0.000007987183,0.00005310412],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9791,"threshold_uncertainty_score":0.4316124,"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."}}