{"id":"W2951228294","doi":"10.48550/arxiv.1611.01661","title":"Spanning Trees in Multipartite Geometric Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Bipartite graph; Multipartite; Disjoint sets; Euclidean minimum spanning tree; k-minimum spanning tree; Connected dominating set; Tree (set theory); Distributed minimum spanning tree; Graph; Shortest-path tree; Discrete mathematics; K-ary tree; Tree structure; Binary tree; Physics","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.0002986195,0.0002282451,0.0002415159,0.001585228,0.00009437469,0.0001035905,0.00101091,0.0001808613,0.00001941182],"category_scores_gemma":[0.00006868636,0.0002392491,0.0001490948,0.002258443,0.00004493111,0.0004768792,0.001038575,0.0002956137,0.00008378564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000156443,"about_ca_system_score_gemma":0.0001396483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005789782,"about_ca_topic_score_gemma":0.00006609561,"domain_scores_codex":[0.9983423,0.0001191695,0.0002133484,0.0009027431,0.0001123629,0.0003100131],"domain_scores_gemma":[0.9987648,0.0001897167,0.0001820608,0.0006207784,0.0001251831,0.0001174532],"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.00001712805,0.00009686053,0.01356976,0.00002258345,0.00003822156,0.0002009083,0.0001397593,0.7651615,0.00016073,0.2112119,0.0002310324,0.009149627],"study_design_scores_gemma":[0.0008338356,0.00004488877,0.04535818,0.0001409724,0.00001865451,0.000004131786,0.00001502758,0.7925686,0.000461101,0.1591535,0.0008660297,0.0005351278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3599733,0.0001140152,0.6381468,0.00009097201,0.000487224,0.000136697,0.000005543711,0.0001051913,0.0009402607],"genre_scores_gemma":[0.9959264,0.0001051388,0.002682063,0.00005832026,0.00007103449,0.000001408299,0.00001319234,0.000009070071,0.001133414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6359531,"threshold_uncertainty_score":0.9756294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07213391808977292,"score_gpt":0.1959906541781428,"score_spread":0.1238567360883699,"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."}}