{"id":"W1998920351","doi":"10.1142/s0218195912500094","title":"ON THE DISCRETE UNIT DISK COVER PROBLEM","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Unit disk; Mathematics; Cardinality (data modeling); Combinatorics; Set cover problem; Constant (computer programming); Unit (ring theory); Set (abstract data type); Unit disk graph; Plane (geometry); Approximation algorithm; Point (geometry); Discrete mathematics; Geometry; Computer science","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.0009096075,0.001209984,0.001851511,0.001242116,0.001260474,0.002478444,0.002113784,0.001842708,0.01152842],"category_scores_gemma":[0.007221956,0.0005593352,0.001057678,0.003384833,0.001372895,0.005225021,0.00202345,0.001766101,0.001674696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002165252,"about_ca_system_score_gemma":0.001312305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004335213,"about_ca_topic_score_gemma":0.002505448,"domain_scores_codex":[0.998193,0.000410887,0.00008152577,0.0005116699,0.0005020837,0.0003009605],"domain_scores_gemma":[0.9963341,0.00255997,0.0002164315,0.000491959,0.000243128,0.0001543985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001501977,0.0005285149,0.002150955,0.001058466,0.0001484766,0.0006343806,0.0004542995,0.4899912,0.00428238,0.1399253,0.05711415,0.3022099],"study_design_scores_gemma":[0.0001701076,0.0001176802,0.0006892995,0.00009373562,0.00005764391,0.0005482773,0.0002352384,0.7942967,0.003271159,0.1824549,0.01801961,0.00004564342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213115,0.005645375,0.7165974,0.004818183,0.0004751045,0.000623082,0.003222296,0.002527446,0.05297602],"genre_scores_gemma":[0.6329287,0.003807293,0.3384714,0.0007805792,0.0006053121,0.0005489879,0.005722307,0.0005581871,0.01657728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01152842,"threshold_uncertainty_score":0.03856647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01808876524586595,"score_gpt":0.2930174984656583,"score_spread":0.2749287332197923,"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."}}