{"id":"W2049678150","doi":"10.1007/s10878-008-9149-x","title":"A quadratic lower bound for colourful simplicial depth","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Convex hull; Mathematics; Theory of computation; Regular polygon; Quadratic equation; Point (geometry); Set (abstract data type); Graph; Computer science; Geometry; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0003993564,0.0001077269,0.0002147991,0.0002011015,0.0002484442,0.0001146515,0.0003275133,0.00007643115,0.000009272611],"category_scores_gemma":[0.0003007072,0.0001025449,0.0001309763,0.0004482974,0.00002499673,0.0008187303,0.00003501975,0.00009859021,0.000002661122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001044368,"about_ca_system_score_gemma":0.0004177395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001465854,"about_ca_topic_score_gemma":4.230918e-7,"domain_scores_codex":[0.9987454,0.00006963381,0.0005023698,0.0001343061,0.000398492,0.0001498389],"domain_scores_gemma":[0.998161,0.0002127929,0.0004682419,0.0001293676,0.0009340295,0.0000946205],"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.000195659,0.0003094765,0.00007421105,0.00001001429,0.00004087919,0.00001732939,0.0003786016,0.9217218,0.0002856231,0.07049213,0.004941869,0.001532384],"study_design_scores_gemma":[0.004339165,0.001949727,0.0004957393,0.00002617036,0.00003967734,0.0003049896,0.00001213035,0.9436017,0.001678586,0.0388031,0.008464387,0.0002846499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02794366,0.00006559028,0.9644783,0.0004921526,0.0065855,0.000201857,9.39795e-7,0.00002247529,0.0002095394],"genre_scores_gemma":[0.746017,0.00002738837,0.2525013,0.0001753385,0.001191558,0.000006353187,0.000006570057,0.00001002539,0.00006452875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7180733,"threshold_uncertainty_score":0.4181661,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01859173484208591,"score_gpt":0.2602583741801576,"score_spread":0.2416666393380717,"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."}}