{"id":"W2183482302","doi":"","title":"Computing a planar widest empty -siphon in o(n 3 ) time","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Plane (geometry); Computational geometry; Euclidean geometry; Euclidean space; Time complexity; Mathematics; Set (abstract data type); Chain (unit); Binary logarithm; Property (philosophy); Algorithm; Geometry; Computer science; Physics; Computer graphics (images)","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.0003205943,0.001046514,0.001508332,0.0009636585,0.0007462394,0.001018314,0.001384878,0.001182084,0.02302838],"category_scores_gemma":[0.001642019,0.0006002935,0.0009532343,0.0009812621,0.0006478594,0.002287171,0.002254615,0.0005552684,0.002029157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005589227,"about_ca_system_score_gemma":0.001120349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002353282,"about_ca_topic_score_gemma":0.006249163,"domain_scores_codex":[0.9996299,0.00003353255,0.00002812103,0.0001229012,0.00009988501,0.00008566037],"domain_scores_gemma":[0.9995276,0.0002286894,0.00003791293,0.00008364578,0.00004912295,0.00007311192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001389023,0.0002658557,0.004272664,0.0007955022,0.0001437178,0.0006361912,0.0003857322,0.3190153,0.02317672,0.01798514,0.01815051,0.6137837],"study_design_scores_gemma":[0.0001620609,0.0004037884,0.001220549,0.0000447395,0.00004515167,0.0002445121,0.0006468471,0.9383372,0.009913944,0.04166869,0.007271966,0.0000405842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2733745,0.0002513587,0.6980007,0.0003143359,0.0001111516,0.0002426529,0.001241066,0.009512459,0.01695174],"genre_scores_gemma":[0.4661857,0.0001445448,0.5189266,0.0001432581,0.00003203982,0.0001656572,0.00399103,0.0007589841,0.009652076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02302838,"threshold_uncertainty_score":0.07703757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02081391544154621,"score_gpt":0.254161815478128,"score_spread":0.2333479000365818,"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."}}