{"id":"W2011560054","doi":"10.1109/isit.2007.4557081","title":"On the Capacity Bounds of Undirected Networks","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Linear network coding; Coding (social sciences); Upper and lower bounds; Computer science; Routing (electronic design automation); Throughput; Undirected graph; Computer network; Combinatorics; Mathematics; Theoretical computer science; Graph; Telecommunications","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.003657995,0.001996407,0.001168968,0.002898407,0.001649125,0.003800677,0.002656394,0.001712827,0.01361248],"category_scores_gemma":[0.0229275,0.0007764117,0.000820833,0.003370312,0.002787814,0.007403098,0.004030856,0.005962496,0.002576896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004694619,"about_ca_system_score_gemma":0.001548456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004189499,"about_ca_topic_score_gemma":0.002611299,"domain_scores_codex":[0.9970848,0.0008755808,0.00007633854,0.0004382957,0.0009151146,0.0006098969],"domain_scores_gemma":[0.9829938,0.01254394,0.0006557726,0.001353616,0.001763413,0.0006894574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001620712,0.00004598692,0.0003957119,0.0002521718,0.00005504464,0.0001229259,0.0001937165,0.09120685,0.002104146,0.8377977,0.02898584,0.03867782],"study_design_scores_gemma":[0.00002030393,0.00002273633,0.0003036298,0.0001660862,0.00003635876,0.0000838025,0.00005852573,0.1529042,0.001338245,0.8243375,0.02069939,0.00002919047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05647942,0.02776734,0.6115558,0.01429944,0.00177678,0.0001976147,0.002435467,0.0008833356,0.2846049],"genre_scores_gemma":[0.8454391,0.02413341,0.08128507,0.00326743,0.002766727,0.0009586233,0.002538197,0.0008585517,0.03875292],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01361248,"threshold_uncertainty_score":0.04553831,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08223840861993871,"score_gpt":0.2909392029363034,"score_spread":0.2087007943163647,"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."}}