{"id":"W2296549964","doi":"10.4230/lipics.socg.2015.719","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic algorithm; Computational geometry; Algorithm; Voronoi diagram; Combinatorics; Mathematics; Time complexity; Regular polygon; Dynamic programming; Randomized algorithm; Linear programming; Approximation algorithm; Mathematical optimization; 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.0007036448,0.0002676818,0.0002887842,0.0002161552,0.000285698,0.0005624779,0.0005863475,0.0001281323,0.000002735272],"category_scores_gemma":[0.0002049535,0.0002546605,0.0001214234,0.0002428014,0.0000659807,0.001452064,0.0002821252,0.0001410475,0.00002803221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007144189,"about_ca_system_score_gemma":0.0001471937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003655903,"about_ca_topic_score_gemma":0.000003132231,"domain_scores_codex":[0.9981561,0.000020375,0.0006725714,0.0002906423,0.0003748045,0.0004855536],"domain_scores_gemma":[0.9984033,0.0002090319,0.0002641533,0.000353792,0.0004682312,0.0003015337],"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.0006958336,0.001313462,0.003974726,0.002257844,0.0006315017,0.00003091862,0.06215008,0.02555556,0.0003281454,0.2030422,0.05064772,0.649372],"study_design_scores_gemma":[0.002630462,0.0005302196,0.0002321778,0.00003886743,0.0000235991,0.0001078753,0.0002804642,0.9046012,0.0003886062,0.003197197,0.08759765,0.0003716686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07658213,0.00005867529,0.9204596,0.0004806486,0.00076912,0.0008403888,0.0001176364,0.0001408081,0.0005510504],"genre_scores_gemma":[0.3077899,0.0000104591,0.6892532,0.001428498,0.0003607586,0.0002262092,0.0003741936,0.00002904435,0.0005277282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8790457,"threshold_uncertainty_score":0.9999906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04233832791099378,"score_gpt":0.2922397059483311,"score_spread":0.2499013780373373,"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."}}