{"id":"W3197202594","doi":"10.1142/s0218195922410035","title":"Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Convex hull; Cardinality (data modeling); Parameterized complexity; Convex set; Generalization; Time complexity; Discrete mathematics; Regular polygon; Convex analysis; Convex optimization; Computer science","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.002772394,0.002558677,0.003487681,0.002558409,0.001762036,0.002652274,0.00374749,0.002622547,0.006862631],"category_scores_gemma":[0.01160001,0.002086124,0.002888249,0.004825106,0.002442788,0.00771378,0.004567926,0.00263365,0.00184826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002030933,"about_ca_system_score_gemma":0.002026893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004402664,"about_ca_topic_score_gemma":0.003838685,"domain_scores_codex":[0.9979283,0.0005589406,0.000170006,0.000620425,0.0004474042,0.0002749813],"domain_scores_gemma":[0.9942954,0.004183918,0.0003537665,0.0006268349,0.0003296532,0.0002103881],"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.001422929,0.0004304729,0.003780348,0.001184299,0.0002848033,0.00051268,0.001123506,0.6005713,0.01043118,0.1041355,0.01875107,0.2573719],"study_design_scores_gemma":[0.0001779415,0.0001103952,0.0005560062,0.00007312662,0.00005032389,0.0001869168,0.0003070164,0.8494415,0.005709216,0.1395597,0.003782257,0.00004570643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04289745,0.0005492904,0.948486,0.0005906494,0.00003839761,0.0006863913,0.00106508,0.001099791,0.004587039],"genre_scores_gemma":[0.2045508,0.0004398261,0.7860616,0.0001955502,0.00008707996,0.00112806,0.003003252,0.0005276685,0.004006092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006862631,"threshold_uncertainty_score":0.0229578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02466758746448296,"score_gpt":0.3269574322328215,"score_spread":0.3022898447683385,"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."}}