{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439188,0.00009058498,0.0001551822,0.0001644282,0.00006274851,0.00009835425,0.0003851848,0.00003740278,0.00000307923],"category_scores_gemma":[0.00007370979,0.00007323915,0.0001124687,0.0002222397,0.00001863921,0.0007784843,0.00004738144,0.00009280223,0.000005779681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006254288,"about_ca_system_score_gemma":0.0002268065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007240997,"about_ca_topic_score_gemma":0.00001150914,"domain_scores_codex":[0.9990504,0.0000329208,0.0002748475,0.0001246939,0.0003702725,0.0001467984],"domain_scores_gemma":[0.9989436,0.00009342667,0.0002382569,0.0001325255,0.0004087745,0.0001834035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005481049,0.0004734846,0.001170527,0.00005273854,0.0006680196,0.0004162371,0.004867114,0.09708811,0.002287758,0.1789442,0.1668379,0.5466458],"study_design_scores_gemma":[0.003760137,0.002152194,0.003212864,0.00005990648,0.00005810522,0.0005647021,0.0003641617,0.7760848,0.001899351,0.1785043,0.03294464,0.0003948714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006637776,0.0003522932,0.9886947,0.003008825,0.0009035089,0.00008676933,0.000009793687,0.00001701478,0.0002893776],"genre_scores_gemma":[0.321449,0.00001879044,0.6770896,0.0002867059,0.0008819538,0.000002563496,0.00001398811,0.00001152372,0.000245854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6789967,"threshold_uncertainty_score":0.2986606,"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."}}