{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580654,0.0006031035,0.0007067483,0.001501757,0.00121415,0.001706391,0.001125993,0.001094031,0.004228053],"category_scores_gemma":[0.004141934,0.0008350521,0.0006902819,0.003023362,0.0009968613,0.002784829,0.00185688,0.001090287,0.0009506489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070495,"about_ca_system_score_gemma":0.0005034723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001906545,"about_ca_topic_score_gemma":0.00221171,"domain_scores_codex":[0.9989183,0.0003524955,0.00006706956,0.0002308888,0.0002777876,0.0001534801],"domain_scores_gemma":[0.9983124,0.0007583196,0.000282359,0.0003057187,0.0002134824,0.0001277219],"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.0001848332,0.0001132427,0.001785428,0.0007164378,0.00009922872,0.0005069309,0.0009062281,0.3240127,0.01050567,0.5016066,0.01529823,0.1442644],"study_design_scores_gemma":[0.0000421441,0.00004950308,0.001090896,0.00006175794,0.00003684318,0.000541342,0.0002918019,0.3710252,0.002372218,0.6065442,0.017919,0.00002511459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1564935,0.002091673,0.8229643,0.001042608,0.0001017084,0.0002728321,0.001346991,0.0009834832,0.01470287],"genre_scores_gemma":[0.5269746,0.001989509,0.45913,0.000381725,0.0001130918,0.0003871996,0.003107672,0.0002961389,0.007620123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004228053,"threshold_uncertainty_score":0.01414424,"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."}}