{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006762079,0.003427136,0.004426516,0.00516457,0.004353781,0.007470116,0.01121014,0.006344101,0.03354539],"category_scores_gemma":[0.07139934,0.003162021,0.002766,0.005945331,0.006167624,0.01800234,0.01340331,0.0121735,0.004519098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997796,"about_ca_system_score_gemma":0.002445099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211854,"about_ca_topic_score_gemma":0.005364517,"domain_scores_codex":[0.9940924,0.001462451,0.0002851858,0.001084938,0.001986352,0.001088636],"domain_scores_gemma":[0.9407156,0.04324909,0.002554055,0.007133643,0.002895421,0.00345223],"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.0005315543,0.0002620151,0.0009929122,0.0006038797,0.00007955052,0.0001528972,0.0005723005,0.1418266,0.003094455,0.799804,0.01456002,0.03751975],"study_design_scores_gemma":[0.00007265324,0.00009197764,0.0002957899,0.0001231075,0.00008070962,0.0001089167,0.0001755256,0.2282379,0.00163284,0.7639067,0.005233768,0.00004013705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0750067,0.002921746,0.8496522,0.003337757,0.0006896495,0.0003134802,0.001351668,0.001615081,0.0651117],"genre_scores_gemma":[0.5774311,0.003441779,0.3752348,0.001485054,0.0007548877,0.001167938,0.00308698,0.002819837,0.03457754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03354539,"threshold_uncertainty_score":0.1122205,"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."}}