{"id":"W2090891537","doi":"10.1016/j.jda.2014.12.005","title":"Universal point sets for planar three-trees","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Planar graph; Cardinality (data modeling); Planar; Mathematics; Plane (geometry); Embedding; Class (philosophy); Point (geometry); Upper and lower bounds; Set (abstract data type); Tree (set theory); Discrete mathematics; Computer science; Graph; Geometry; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008054264,0.0005102081,0.00158026,0.002967337,0.00186232,0.002829288,0.002235932,0.001264567,0.006434449],"category_scores_gemma":[0.006707116,0.0008024402,0.001253769,0.002306664,0.002731206,0.003228106,0.006434873,0.002584329,0.0007815001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297566,"about_ca_system_score_gemma":0.0005834589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002098172,"about_ca_topic_score_gemma":0.002138046,"domain_scores_codex":[0.9988416,0.0001438216,0.00009295498,0.0002020372,0.0005487397,0.0001707331],"domain_scores_gemma":[0.9976783,0.001114107,0.0002063388,0.0003917649,0.0003757679,0.0002336226],"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.0000613513,0.00003510174,0.0005875747,0.0001015032,0.00001891744,0.00007745966,0.0004470258,0.0236641,0.001080977,0.9359411,0.001511083,0.03647382],"study_design_scores_gemma":[0.00002060513,0.00002388029,0.0002589466,0.00005154395,0.00001626618,0.0001229053,0.0002378341,0.08479358,0.001156857,0.9084165,0.004883855,0.00001712727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818816,0.0006014575,0.7935611,0.0003727955,0.00007970438,0.000113745,0.0005488405,0.0005254467,0.02231529],"genre_scores_gemma":[0.7969049,0.00069235,0.1893471,0.0001855272,0.0000592533,0.0002536626,0.001244821,0.0003305894,0.01098183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006434449,"threshold_uncertainty_score":0.02152532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03579581875465403,"score_gpt":0.2878591626578711,"score_spread":0.2520633439032171,"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."}}