{"id":"W2146448055","doi":"10.1007/s00454-003-2853-5","title":"Spanning Trees Crossing Few Barriers","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of British Columbia; National Science Foundation","keywords":"Spanning tree; Combinatorics; Disjoint sets; Mathematics; Multiplicative function; Minimum spanning tree; Tree (set theory); Shortest-path tree; Minimum degree spanning tree; Line segment; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003786798,0.0004332627,0.0008897404,0.0009400657,0.001254344,0.001422153,0.001235207,0.0018041,0.009854568],"category_scores_gemma":[0.005400257,0.0005583186,0.000512708,0.0009265473,0.0007047931,0.002383422,0.002527867,0.002073759,0.001631685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004375538,"about_ca_system_score_gemma":0.0004435236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004808139,"about_ca_topic_score_gemma":0.000787254,"domain_scores_codex":[0.999551,0.00009084027,0.0000254851,0.0001100368,0.0001099466,0.0001125755],"domain_scores_gemma":[0.9975926,0.001168027,0.0002321479,0.0003994344,0.0002363787,0.0003712951],"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.0004349608,0.000205646,0.001308259,0.0004093064,0.00008945126,0.0007354696,0.0006270509,0.08250406,0.02163889,0.7943898,0.01302608,0.08463103],"study_design_scores_gemma":[0.0000686058,0.0001194675,0.0008389433,0.00007058661,0.00004765932,0.000790766,0.0002870798,0.2327512,0.004357689,0.7475283,0.01311179,0.00002785572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3826603,0.001302067,0.5607984,0.001398657,0.0003032598,0.0001477076,0.0005430995,0.0008487541,0.05199772],"genre_scores_gemma":[0.8341951,0.0008387071,0.1316873,0.000397727,0.0001132409,0.000193711,0.0009376915,0.0004296271,0.03120688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009854568,"threshold_uncertainty_score":0.03296679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01382052840447016,"score_gpt":0.2664859686400916,"score_spread":0.2526654402356214,"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."}}