{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001016713,0.0003289055,0.0004627979,0.0002569601,0.0003224251,0.0003784203,0.0007339581,0.0001203943,0.00001123436],"category_scores_gemma":[0.00004714889,0.0002864459,0.0003058336,0.0004553773,0.00009251535,0.0008593638,0.00009456021,0.0001509559,0.00005675669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106983,"about_ca_system_score_gemma":0.0001868132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616938,"about_ca_topic_score_gemma":0.000003375875,"domain_scores_codex":[0.9975237,0.0001826716,0.0004643488,0.0008142947,0.000521707,0.0004932464],"domain_scores_gemma":[0.9984729,0.0002632545,0.0001613856,0.0006256927,0.0002117171,0.0002650411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002537957,0.0005535025,0.000001649452,0.00002593074,0.0001874518,0.00003609341,0.001169953,0.3387401,0.002652328,0.1133443,0.000370774,0.5403799],"study_design_scores_gemma":[0.04569648,0.0006866664,0.0000236734,0.00002376771,0.00003462098,0.00003330891,0.00002444792,0.9060016,0.01518344,0.03037797,0.001439736,0.000474337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00108825,0.0001315955,0.9926645,0.002429705,0.001153694,0.001064812,0.00003810847,0.0003008523,0.001128533],"genre_scores_gemma":[0.07526518,0.00004748116,0.922106,0.0008488852,0.000771932,0.0003843209,0.0002251058,0.00003844121,0.000312606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5672614,"threshold_uncertainty_score":0.9999588,"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."}}