{"id":"W2057259762","doi":"10.1007/s00454-001-0042-y","title":"Every Set of Disjoint Line Segments Admits a Binary Tree","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; K-ary tree; Disjoint sets; Tree (set theory); Interval tree; Binary tree; Vertex (graph theory); Segment tree; Line segment; Range tree; Line (geometry); Plane (geometry); Discrete mathematics; Tree structure; Graph; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0002688202,0.0005674606,0.00112326,0.002152488,0.001613286,0.002899135,0.0015672,0.001685223,0.009095741],"category_scores_gemma":[0.002293439,0.001036996,0.0007336896,0.002986033,0.001246745,0.004220589,0.002286961,0.002036218,0.00247661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005793295,"about_ca_system_score_gemma":0.0003142782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005872899,"about_ca_topic_score_gemma":0.0006071812,"domain_scores_codex":[0.9992361,0.00007001617,0.00005688395,0.0002163912,0.00028425,0.0001363668],"domain_scores_gemma":[0.9982084,0.0007438895,0.0002757014,0.0002680899,0.0003130703,0.0001907893],"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.0004317618,0.0003305373,0.004270244,0.0006099736,0.0000964897,0.0008095639,0.001226505,0.01620902,0.02507126,0.795115,0.01150676,0.1443228],"study_design_scores_gemma":[0.00009855653,0.0001740598,0.00362828,0.0001423259,0.00007288335,0.002084572,0.0007979206,0.07583192,0.0104357,0.8703303,0.03634975,0.00005371848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3367584,0.0005586912,0.6151515,0.001092997,0.0001225115,0.0002028748,0.00218115,0.000833847,0.04309797],"genre_scores_gemma":[0.6616988,0.0007279977,0.3084255,0.0003256734,0.0001191792,0.0002996867,0.004840888,0.0003134872,0.02324882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009095741,"threshold_uncertainty_score":0.03042823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02535542343954046,"score_gpt":0.2833968965844862,"score_spread":0.2580414731449457,"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."}}