{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","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.001098375,0.0009024892,0.001295595,0.001134575,0.0009891631,0.001372909,0.002183771,0.001208058,0.01050391],"category_scores_gemma":[0.005861625,0.0006640418,0.001091342,0.001411494,0.001124074,0.003676987,0.00308703,0.00169062,0.002704907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387749,"about_ca_system_score_gemma":0.00244402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002530303,"about_ca_topic_score_gemma":0.004918119,"domain_scores_codex":[0.9980977,0.0003930273,0.0001403875,0.0004971093,0.0005779173,0.0002938393],"domain_scores_gemma":[0.9982442,0.0005949091,0.0001963987,0.0005207813,0.0003149905,0.000128803],"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.001701006,0.0003020338,0.001885584,0.0003939364,0.0001085732,0.000117171,0.0002878233,0.1292579,0.04301792,0.1082081,0.01522908,0.6994908],"study_design_scores_gemma":[0.0004964494,0.0005137196,0.0008105342,0.00004280892,0.00004943807,0.0002501805,0.0001527888,0.8244243,0.03122215,0.1293303,0.01259836,0.0001089178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015646,0.0001339465,0.9858969,0.0001761782,0.00006013162,0.0000922865,0.0001508473,0.00167913,0.001654131],"genre_scores_gemma":[0.0896927,0.0000870134,0.9074702,0.0001156722,0.00004996426,0.0001745833,0.0003781576,0.0002727879,0.001758925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050391,"threshold_uncertainty_score":0.03513908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01177073521394966,"score_gpt":0.2737123337367909,"score_spread":0.2619415985228413,"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."}}