{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008061921,0.0003608804,0.0003925007,0.0001922247,0.0005103932,0.0003239562,0.001404063,0.0003478433,0.000008826009],"category_scores_gemma":[0.00001259402,0.0003869166,0.0001390261,0.000978629,0.000137874,0.0004882888,0.00004674761,0.001141937,0.000003946035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009859345,"about_ca_system_score_gemma":0.00005551565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008023615,"about_ca_topic_score_gemma":0.003634492,"domain_scores_codex":[0.9974727,0.0001623714,0.0006025954,0.0007437164,0.0002574937,0.0007611213],"domain_scores_gemma":[0.996886,0.0009401953,0.0002122425,0.001668499,0.0001001247,0.0001929462],"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.00001439604,0.0001506561,0.0001822948,0.0000129376,0.00003177421,0.000004167952,0.0002477297,0.1195509,0.00008253327,0.0003098326,0.0002712411,0.8791415],"study_design_scores_gemma":[0.00110013,0.0001240596,0.0005719676,0.0001919548,0.0000299418,0.00003593049,0.00002034636,0.9815105,0.0001280002,0.002670016,0.01320439,0.000412778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002159877,0.0004684297,0.9933939,0.0006592891,0.00176083,0.001158798,0.00001686058,0.0002612841,0.0001207469],"genre_scores_gemma":[0.8460347,0.0004870478,0.151798,0.0001976837,0.000442131,0.0008153904,0.00004596333,0.00005660085,0.0001224832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8787287,"threshold_uncertainty_score":0.9998583,"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."}}