{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005975667,0.0002787762,0.0002492243,0.0005519394,0.0009139593,0.0009390072,0.0005358349,0.00009091325,0.0001684773],"category_scores_gemma":[0.0003833211,0.0002899271,0.0001670981,0.001954539,0.000127645,0.0009998037,0.0001322151,0.0002154065,0.0001244293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009336784,"about_ca_system_score_gemma":0.0004773674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009184228,"about_ca_topic_score_gemma":0.000002591333,"domain_scores_codex":[0.9974768,0.0001742811,0.000457674,0.0006656387,0.0007654236,0.0004602002],"domain_scores_gemma":[0.9985214,0.0003700686,0.0001790363,0.0003463884,0.0002693629,0.0003136832],"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.000007909456,0.00004048799,0.003216609,0.00001578466,0.00005824954,0.00002130101,0.0007123445,0.6235582,0.0003231119,0.3543273,0.0009140207,0.01680473],"study_design_scores_gemma":[0.00164864,0.0001893532,0.0599091,0.00007892124,0.00003233816,0.0002184503,0.0004190359,0.7696875,0.00230455,0.1296678,0.03457154,0.001272718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058416,0.0004957007,0.8875955,0.0003941489,0.0006874995,0.0001442791,0.000009256581,0.0002188716,0.004613203],"genre_scores_gemma":[0.8173866,0.000003265362,0.1813533,0.0006656082,0.0001143635,0.00001331085,0.00006470708,0.00001713293,0.0003818076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.711545,"threshold_uncertainty_score":0.9999553,"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."}}