{"id":"W2068568045","doi":"10.1016/j.tcs.2009.05.031","title":"Size-constrained tree partitioning: Approximating the multicast<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Tree (set theory); Routing (electronic design automation); Computer science; Node (physics); Algorithm; Steiner tree problem; Mathematics; Discrete mathematics; Combinatorics; 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.001025279,0.0003291054,0.0002269667,0.000066507,0.0007083894,0.000418963,0.001132809,0.0002342593,0.0000132416],"category_scores_gemma":[0.0008508868,0.000297521,0.0001752562,0.0006517411,0.002617217,0.0004780477,0.0005909522,0.0006909459,0.0001166206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002915114,"about_ca_system_score_gemma":0.00007043084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000289938,"about_ca_topic_score_gemma":0.000004217653,"domain_scores_codex":[0.9970679,0.00004679422,0.0005905342,0.0006084443,0.0006666047,0.001019755],"domain_scores_gemma":[0.9977585,0.001037942,0.0001585303,0.0007741753,0.00006401092,0.0002068169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002341631,0.00004703525,0.00000424748,0.0000377991,0.00002175962,0.00003863369,0.0003361174,0.03456525,0.00135964,0.9426261,0.00001663474,0.02092336],"study_design_scores_gemma":[0.0002904022,0.0002363759,0.00007731434,0.0002283942,0.00003664383,0.00009724084,0.0001221627,0.9566831,0.003805411,0.0380905,0.00002660405,0.0003058686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7071076,0.00004203714,0.287045,0.0005105564,0.0002266061,0.00009118861,0.000005074946,0.0007164202,0.004255461],"genre_scores_gemma":[0.7806793,0.00001139659,0.2187593,0.0002432916,0.0002161411,0.00004383031,0.000004908852,0.00003884226,0.000002993439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9221178,"threshold_uncertainty_score":0.9999477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01088862861760366,"score_gpt":0.2280924622756602,"score_spread":0.2172038336580565,"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."}}