{"id":"W6910364688","doi":"10.4230/lipics.socg.2025.18","title":"Finding a Shortest Curve That Separates Few Objects from Many","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Disjoint sets; Polygon (computer graphics); Graph; Line segment; Polygonal chain; Monotone polygon; Set (abstract data type); Shortest path problem","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.0003750896,0.001695508,0.001840859,0.0007189959,0.0009778179,0.001847735,0.001813152,0.002067585,0.01128507],"category_scores_gemma":[0.002563631,0.000887426,0.001609259,0.001577189,0.001046953,0.003181892,0.001901683,0.001766412,0.003625874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001164639,"about_ca_system_score_gemma":0.001473415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004711146,"about_ca_topic_score_gemma":0.004634918,"domain_scores_codex":[0.9992028,0.00006613717,0.00004258693,0.0003500001,0.0002086762,0.000129775],"domain_scores_gemma":[0.9989169,0.0004875395,0.0001450361,0.000248829,0.0001113711,0.00009035431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006015218,0.0004197985,0.002094741,0.001060406,0.000145773,0.0006477983,0.0003533379,0.4990133,0.03158056,0.03250523,0.02490433,0.4066732],"study_design_scores_gemma":[0.0001421719,0.0002619485,0.0005857858,0.00006107012,0.00004689232,0.0004934111,0.0001960697,0.9094729,0.01219288,0.06360878,0.01288561,0.00005239475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09221049,0.0004805088,0.8904344,0.0007835003,0.00007103277,0.0002442582,0.001309191,0.003993849,0.01047272],"genre_scores_gemma":[0.2460986,0.0003132,0.7402407,0.0001789331,0.00004968067,0.0001848791,0.004717188,0.001035969,0.007180904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01128507,"threshold_uncertainty_score":0.03775233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02184987991549807,"score_gpt":0.2837568478144151,"score_spread":0.261906967898917,"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."}}