{"id":"W2901842115","doi":"10.22215/etd/2017-11859","title":"Optimal Bichromatic Plane Spanning Trees For Special Point Sets","year":2017,"lang":"en","type":"dissertation","venue":"","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; Point (geometry); Plane (geometry); Minimum spanning tree; Set (abstract data type); Mathematics; Line (geometry); Enhanced Data Rates for GSM Evolution; Tree (set theory); Algorithm; Computer science; Geometry; Artificial intelligence","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.0006536501,0.0005798306,0.001136247,0.001177288,0.000623574,0.0009957872,0.0009732358,0.0008750165,0.002415598],"category_scores_gemma":[0.003284934,0.0005494878,0.0006820224,0.001667112,0.0004057844,0.00165834,0.001335468,0.0008306571,0.0007097458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007091667,"about_ca_system_score_gemma":0.0005260672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001762386,"about_ca_topic_score_gemma":0.003228733,"domain_scores_codex":[0.9994666,0.0001165105,0.00004382812,0.0001124884,0.000178993,0.00008164434],"domain_scores_gemma":[0.9991049,0.0003516,0.000121437,0.0001567347,0.0001792158,0.00008596491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004243662,0.000210019,0.001925537,0.0005508533,0.00009850135,0.0003379112,0.0006256253,0.5080135,0.02607922,0.08288089,0.01177691,0.3670767],"study_design_scores_gemma":[0.00005035856,0.00008585597,0.0005633113,0.00003759981,0.00001762345,0.0001950255,0.0001397292,0.9341452,0.003334379,0.0578544,0.003562786,0.0000137269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1443488,0.0006294367,0.8478428,0.0002189932,0.00004480737,0.0001653855,0.0004451599,0.0007212168,0.005583421],"genre_scores_gemma":[0.3051533,0.0004888707,0.6904517,0.00006288456,0.00002782269,0.0001563072,0.001385992,0.0002261249,0.002047009],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.002415598,"threshold_uncertainty_score":0.008080959,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02278550420069726,"score_gpt":0.299134174677794,"score_spread":0.2763486704770967,"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."}}