{"id":"W2462178547","doi":"","title":"On approximate min-max theorems for graph connectivity problems","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Disjoint sets; Vertex (graph theory); Spanning tree; Conjecture; Discrete mathematics; Hypergraph; Graph","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.0132705,0.004892688,0.003943018,0.005318215,0.002964235,0.006282208,0.007027331,0.003542754,0.0131083],"category_scores_gemma":[0.05723235,0.001960039,0.004414774,0.007667758,0.005765282,0.02338375,0.00658921,0.01264735,0.002583123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007756006,"about_ca_system_score_gemma":0.003305711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004438552,"about_ca_topic_score_gemma":0.005019078,"domain_scores_codex":[0.9923627,0.003146177,0.000344894,0.001409974,0.001790053,0.0009461169],"domain_scores_gemma":[0.9441316,0.04867654,0.001731984,0.002829376,0.001800065,0.0008304162],"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.0005076707,0.0002453227,0.001319361,0.0008634329,0.000166935,0.0002065064,0.000508384,0.1608892,0.001231598,0.7597411,0.01578747,0.05853305],"study_design_scores_gemma":[0.00005457958,0.00007188589,0.0002274793,0.0001101213,0.00005661016,0.0001142157,0.00008984502,0.3217703,0.0006609791,0.6721034,0.004710734,0.00002984503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01697752,0.004947448,0.9375928,0.0035235,0.0003595559,0.0002960149,0.001102854,0.001129758,0.03407052],"genre_scores_gemma":[0.3645789,0.009178066,0.5951515,0.003767728,0.002212679,0.002152837,0.003595864,0.002009684,0.0173528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0132705,"threshold_uncertainty_score":0.07018197,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03518498636823825,"score_gpt":0.3031521481228538,"score_spread":0.2679671617546155,"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."}}