{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001516131,0.0002554342,0.0003799166,0.002608339,0.0001831066,0.0003228534,0.001637986,0.0001177643,0.0001214364],"category_scores_gemma":[0.0001735636,0.0002737015,0.0002325829,0.003307279,0.00006252796,0.001124726,0.000345953,0.000401066,0.0004037526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002807837,"about_ca_system_score_gemma":0.0004734841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006182428,"about_ca_topic_score_gemma":0.000006130676,"domain_scores_codex":[0.9962476,0.0001352731,0.001235077,0.0004494323,0.001527109,0.0004054556],"domain_scores_gemma":[0.9963073,0.0009552353,0.0007373043,0.0002790029,0.001516316,0.0002048209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001050034,0.0008820187,0.009737235,0.00006493258,0.0005122269,0.0002881945,0.001399156,0.5952825,0.0006339707,0.2994229,0.01453901,0.07713286],"study_design_scores_gemma":[0.005080267,0.0002178861,0.09034308,0.0001943895,0.00004321886,0.001038768,0.0005053817,0.4302961,0.0007522423,0.3104998,0.1600744,0.0009543614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06256045,0.0003267512,0.9300673,0.004848943,0.001001048,0.0004381608,0.0001237949,0.0001342439,0.0004993215],"genre_scores_gemma":[0.9639553,0.0001107037,0.03362601,0.001006266,0.0005689687,0.0001184663,0.0004091226,0.00002393541,0.000181242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9013948,"threshold_uncertainty_score":0.9999715,"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."}}