{"id":"W2033123200","doi":"10.1007/s00454-007-9025-y","title":"Tight Bounds for Connecting Sites Across Barriers","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Spanning tree; Mathematics; Disjoint sets; Minimum spanning tree; Tree (set theory); Line segment; Steiner tree problem; Minimum degree spanning tree; K-ary tree; Upper and lower bounds; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Tree structure; Geometry; Binary tree; Mathematical analysis","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","sts"],"consensus_categories":[],"category_scores_codex":[0.0004684239,0.0002594582,0.0002677219,0.0002913728,0.001440394,0.0002761165,0.000616857,0.00009813013,0.000060763],"category_scores_gemma":[0.000404019,0.0002698209,0.0002142003,0.001282867,0.000103747,0.0008491399,0.0002186413,0.0001563195,0.00006101547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008388133,"about_ca_system_score_gemma":0.0002397011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000822156,"about_ca_topic_score_gemma":0.00000378189,"domain_scores_codex":[0.9977008,0.00006436838,0.00045854,0.000666651,0.0006011669,0.0005084475],"domain_scores_gemma":[0.997951,0.0008194202,0.0001958667,0.0002972413,0.0004730385,0.0002634871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008805376,0.0001380456,0.008243359,0.00009443256,0.0002425112,0.00004659787,0.004854275,0.7572523,0.001078715,0.1929356,0.009855681,0.02517044],"study_design_scores_gemma":[0.001597192,0.0002520151,0.02475823,0.00002312724,0.00001462803,0.0002676014,0.0002245719,0.909363,0.001296886,0.03561073,0.02583464,0.000757351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3177106,0.0002167189,0.6802745,0.0005221054,0.0004447209,0.0002180877,0.00006154738,0.0001872502,0.0003643637],"genre_scores_gemma":[0.8575761,0.000006235509,0.1404632,0.0007816296,0.0003126121,0.00004171463,0.0004100307,0.00002067158,0.0003878023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5398654,"threshold_uncertainty_score":0.9999754,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0264118285099958,"score_gpt":0.2983841775060861,"score_spread":0.2719723489960903,"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."}}