{"id":"W2422676813","doi":"10.1109/icde.2016.7498281","title":"Finding the minimum spatial keyword cover","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cover (algebra); Pruning; Scalability; Computer science; Approximation algorithm; Set cover problem; Set (abstract data type); Function (biology); Efficient algorithm; Focus (optics); Time complexity; Theoretical computer science; Algorithm; Database","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001608295,0.00005370441,0.00004087384,0.00002547726,0.00007585358,0.0001624515,0.0009205223,0.00001134247,0.0003012237],"category_scores_gemma":[0.00001614561,0.00002257805,0.00002466101,0.0001010172,0.0000237674,0.0005344684,0.000475811,0.00002154238,0.001173897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008466482,"about_ca_system_score_gemma":0.000007833029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002216638,"about_ca_topic_score_gemma":0.000007209028,"domain_scores_codex":[0.9994425,0.00001614826,0.00007223521,0.0001670343,0.0001488229,0.0001532585],"domain_scores_gemma":[0.9994392,0.00007969605,0.00002370498,0.0004235568,0.00001015168,0.00002364063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001338556,0.00001366712,0.0005085516,0.000001293009,0.00001079516,0.000006230791,0.00005941168,7.045751e-7,0.0002171381,0.1240884,0.106315,0.7687775],"study_design_scores_gemma":[0.0007294621,0.0000668512,0.006902833,0.00002262154,0.000007314132,0.000003483432,0.00002276644,0.03189174,0.002720442,0.007125304,0.9502088,0.0002984078],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001277867,0.00000532522,0.9468284,0.008042731,0.0004815515,0.00006140202,0.000001579963,0.00008429929,0.0432168],"genre_scores_gemma":[0.8758429,0.00001810878,0.01621571,0.001964333,0.0003295411,0.000009629868,0.00000155609,0.000006617162,0.1056116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9306127,"threshold_uncertainty_score":0.9996038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01951525577737219,"score_gpt":0.2339620363138004,"score_spread":0.2144467805364282,"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."}}