{"id":"W3116201698","doi":"10.1007/978-3-030-68211-8_19","title":"Upward Point Set Embeddings of Paths and Trees","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Path (computing); General position; Tree (set theory); Regular polygon; Point (geometry); Upper and lower bounds; Graph; Discrete mathematics; Computer science; Geometry","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.0004394058,0.0008166038,0.0006516168,0.002077165,0.0008272688,0.002744962,0.001266461,0.00118201,0.01067758],"category_scores_gemma":[0.004571258,0.000743458,0.0008446882,0.001596864,0.001414618,0.00475093,0.004204685,0.003836423,0.001738037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008350107,"about_ca_system_score_gemma":0.0003291163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001088026,"about_ca_topic_score_gemma":0.001087268,"domain_scores_codex":[0.9992844,0.0001227636,0.00004801848,0.0001717584,0.0002710082,0.0001020335],"domain_scores_gemma":[0.9981444,0.0007951501,0.0001894495,0.0003333636,0.0002987996,0.0002388753],"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.0001019476,0.00005152915,0.0007065808,0.0001104356,0.00001352275,0.0001945309,0.0006087449,0.009181339,0.003414134,0.9379867,0.002846688,0.04478386],"study_design_scores_gemma":[0.00001897155,0.00005699817,0.0005164224,0.00004926152,0.00001943829,0.0002806932,0.0003782593,0.03905296,0.002380606,0.9414509,0.01577752,0.00001806062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2314639,0.0008301273,0.7199703,0.0008453428,0.0002622677,0.00009140898,0.001138031,0.0007582455,0.04464029],"genre_scores_gemma":[0.6859789,0.001561789,0.2701973,0.0002545062,0.0002057151,0.0001783582,0.002508741,0.0009715239,0.03814319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01067758,"threshold_uncertainty_score":0.03572005,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01621143534357818,"score_gpt":0.2699194693150359,"score_spread":0.2537080339714577,"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."}}