{"id":"W2951184112","doi":"10.22215/etd/2018-13352","title":"Implementation of Minimum Edge Constraints Sets for Proximity Graphs","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Computer science; Edge contraction; Enhanced Data Rates for GSM Evolution; Graph; Spanning tree; Constrained Delaunay triangulation; Line graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Voltage graph; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002705324,0.0001728735,0.0002085784,0.000194194,0.00006803492,0.0001083578,0.0007893285,0.00008233651,0.0001569759],"category_scores_gemma":[0.00001182336,0.0001606703,0.0001076914,0.0002022313,0.0000446605,0.0006211314,0.00007835713,0.00004603136,0.00001578154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001245851,"about_ca_system_score_gemma":0.00009603061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003694621,"about_ca_topic_score_gemma":0.000295264,"domain_scores_codex":[0.9987719,0.00001661365,0.0003509305,0.0004120413,0.0002377936,0.0002107297],"domain_scores_gemma":[0.9989859,0.0000322764,0.0003096857,0.0004089536,0.0002224533,0.00004070792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001540286,0.00008672448,0.0001574816,0.0005377072,0.0001372836,0.000001209506,0.0008937487,4.000806e-8,0.0002468261,0.153913,0.05913603,0.7848745],"study_design_scores_gemma":[0.01592797,0.004803398,0.06613784,0.001054433,0.001170001,0.00001147688,0.02889279,0.02959349,0.3394209,0.394909,0.1114757,0.006602948],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06270649,0.00007841467,0.8639541,0.0003076191,0.006835295,0.005664092,0.000829541,0.0004059577,0.05921853],"genre_scores_gemma":[0.192919,0.00007989317,0.7606704,0.0004152316,0.0003478224,0.0007108275,0.01990533,0.00008160908,0.02486984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7782716,"threshold_uncertainty_score":0.6551945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0256196682222631,"score_gpt":0.3309451819244595,"score_spread":0.3053255137021965,"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."}}