{"id":"W2189549633","doi":"10.1016/j.tcs.2017.01.030","title":"The within-strip discrete unit disk cover problem","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"STRIPS; Cardinality (data modeling); Cover (algebra); Set cover problem; Approximation algorithm; Unit disk; Set (abstract data type); Mathematics; Unit (ring theory); Plane (geometry); Combinatorics; Unit disk graph; Discrete mathematics; Algorithm; Computer science; Geometry; Telecommunications","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":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002235634,0.0001735265,0.000137697,0.00008152647,0.003813645,0.003756899,0.005195406,0.00003960406,0.00001133962],"category_scores_gemma":[0.0002328744,0.000109352,0.00006526888,0.0004939716,0.003496599,0.001397679,0.001930611,0.0002134509,0.0001454071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003617063,"about_ca_system_score_gemma":0.0002381008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004319852,"about_ca_topic_score_gemma":0.000002049061,"domain_scores_codex":[0.9975968,0.0001040436,0.0002855763,0.0006258428,0.0008834344,0.0005043219],"domain_scores_gemma":[0.9973518,0.0003380897,0.0001926291,0.001593935,0.0002803653,0.0002432059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006267952,0.00001735641,0.00007760941,0.000002116203,0.000003994186,0.000004321418,0.000189841,0.001879,0.000159321,0.9618135,0.00009310587,0.03575355],"study_design_scores_gemma":[0.0001741842,0.0001030644,0.004233802,0.00001495562,0.000003361721,0.00002176411,0.000002618864,0.6572856,0.001897772,0.3339524,0.002140378,0.0001701589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550996,0.0000262,0.9704873,0.004663545,0.001246976,0.0002011944,0.00000176107,0.0001080851,0.007754968],"genre_scores_gemma":[0.9165431,0.000006663549,0.08268861,0.0003281249,0.0002275025,0.000009559756,0.000001048862,0.000005488946,0.0001899116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9010331,"threshold_uncertainty_score":0.9992153,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01477852363600524,"score_gpt":0.2749718475095962,"score_spread":0.260193323873591,"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."}}