{"id":"W1493404814","doi":"10.1007/11600930_69","title":"Packing Trees in Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McMaster University; University of Toronto","funders":"","keywords":"Linear programming relaxation; Integer programming; Steiner tree problem; Approximation algorithm; Solver; Relaxation (psychology); Spanning tree; Combinatorics; Linear programming; Time complexity; Block (permutation group theory); Set packing; Tree (set theory); Computer science; Multicast; Mathematics; Independent set; Graph; Set (abstract data type); Mathematical optimization","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001856013,0.0004520188,0.0004869374,0.001375779,0.0002587995,0.000481484,0.006169976,0.0003305572,0.00002000853],"category_scores_gemma":[0.0001126855,0.0004414035,0.0001060996,0.001264692,0.0009886033,0.001052573,0.002500079,0.001661389,0.0000276456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000485512,"about_ca_system_score_gemma":0.0002801867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002019146,"about_ca_topic_score_gemma":0.0008388483,"domain_scores_codex":[0.9961975,0.0001215125,0.0005637784,0.001324241,0.0009186648,0.0008743536],"domain_scores_gemma":[0.9958708,0.001056413,0.0002450535,0.002494622,0.0001812252,0.0001518894],"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.000004816478,0.00001808704,0.0001192986,0.000004837365,0.000002991831,0.00003052878,0.0003759217,0.2942733,0.00002118191,0.06821102,0.000004521402,0.6369335],"study_design_scores_gemma":[0.0002065961,0.00005377638,0.0003467935,0.0003632608,0.000001342759,0.00002418543,1.777791e-7,0.6600742,0.0001060511,0.3376151,0.0007975263,0.0004108939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00006453347,0.002030969,0.9921197,0.0008973775,0.000385045,0.0003792089,0.000001108465,0.0001370985,0.003984929],"genre_scores_gemma":[0.5847639,0.0005348427,0.4129192,0.001021577,0.0003515221,0.00002091805,0.000006838675,0.0000509165,0.0003303193],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6365227,"threshold_uncertainty_score":0.9998038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02363825283242386,"score_gpt":0.2889289885727813,"score_spread":0.2652907357403574,"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."}}