{"id":"W2106544745","doi":"10.1109/tnet.2009.2038998","title":"A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Tree (set theory); Algorithm; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Computer network","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.002319138,0.001428591,0.001665962,0.000989322,0.001123617,0.001895054,0.003170474,0.002132147,0.005532913],"category_scores_gemma":[0.00599315,0.0007132949,0.00107809,0.001925331,0.001173606,0.003570182,0.002773634,0.002246059,0.00101871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001607471,"about_ca_system_score_gemma":0.002048382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00200945,"about_ca_topic_score_gemma":0.002588453,"domain_scores_codex":[0.9985833,0.0004856508,0.00006656681,0.000375469,0.0003333372,0.0001556718],"domain_scores_gemma":[0.9980882,0.001287592,0.0001226792,0.0002201183,0.0001776134,0.0001037242],"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.0003176819,0.0002337372,0.0005228438,0.0003574143,0.000110938,0.0001312649,0.000268092,0.5679957,0.002381195,0.1517959,0.01435814,0.261527],"study_design_scores_gemma":[0.00009503445,0.00008008553,0.00006964078,0.00001966762,0.00002022004,0.00007472484,0.0000478962,0.8929486,0.0007487929,0.1005858,0.005295671,0.00001398762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002497848,0.0003475522,0.9942185,0.0003148889,0.00007626513,0.00007904074,0.00004718483,0.0003204648,0.002098322],"genre_scores_gemma":[0.1062299,0.0005407404,0.8874887,0.0002996244,0.0001611577,0.0004902278,0.0002676553,0.0001863161,0.004335631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005532913,"threshold_uncertainty_score":0.01850945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01620982405271422,"score_gpt":0.2436728881079923,"score_spread":0.227463064055278,"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."}}