{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845974,0.0001143674,0.0001233201,0.00005905022,0.0002364913,0.000116484,0.0005605064,0.00003474539,0.00001436464],"category_scores_gemma":[0.00004510851,0.00009859673,0.00006173288,0.0002892845,0.0000459889,0.000121832,0.0001334769,0.00009312545,0.00001789378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002767343,"about_ca_system_score_gemma":0.00002047369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000157387,"about_ca_topic_score_gemma":0.00007515189,"domain_scores_codex":[0.9992058,0.00008969496,0.0001128661,0.000264213,0.0001109473,0.0002164348],"domain_scores_gemma":[0.9988427,0.0003477987,0.00006689935,0.0006193529,0.00008624968,0.00003706637],"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.000007656961,0.00008853691,0.00004351951,0.000008590886,0.000005679429,4.028328e-7,0.0006245399,0.0008013604,0.002154111,0.9793787,0.007074653,0.009812243],"study_design_scores_gemma":[0.00205114,0.000489621,0.001481682,0.0001454463,0.00001288068,0.00001044856,0.0001198599,0.4341261,0.01821275,0.4430473,0.09942613,0.0008766002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02362086,0.0003185901,0.9432718,0.004057722,0.0001592714,0.0004938247,0.000001183655,0.0002424224,0.02783439],"genre_scores_gemma":[0.9855098,0.00004127971,0.01191883,0.0003915545,0.00005141275,0.0001033515,0.000004756065,0.0000103505,0.001968738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618888,"threshold_uncertainty_score":0.4020658,"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."}}