{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009122998,0.0009123572,0.001799312,0.001535025,0.001150938,0.002212839,0.001787794,0.001948765,0.005083924],"category_scores_gemma":[0.0090313,0.0006573748,0.000971846,0.003175508,0.0009766198,0.005685659,0.002213142,0.0008280488,0.001240892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220765,"about_ca_system_score_gemma":0.0016336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002679165,"about_ca_topic_score_gemma":0.002769077,"domain_scores_codex":[0.9985141,0.0002864188,0.0001128165,0.0004220153,0.0004133696,0.0002512436],"domain_scores_gemma":[0.9956352,0.002857709,0.0003756263,0.0005291493,0.0003798369,0.0002224578],"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.001693683,0.0003988151,0.01050696,0.002152089,0.0002193454,0.0009510763,0.001633769,0.6202844,0.03028075,0.0529186,0.02713234,0.251828],"study_design_scores_gemma":[0.00007641174,0.000179239,0.001282218,0.00006422013,0.00006314285,0.0008412095,0.0008105158,0.9025849,0.01136658,0.07540119,0.007298915,0.00003155118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3265763,0.00234659,0.6508728,0.001488,0.00007378836,0.0003020583,0.003861092,0.002300689,0.01217864],"genre_scores_gemma":[0.6759465,0.000947056,0.3150069,0.0002213411,0.00007808386,0.0002274663,0.003763502,0.0004156224,0.003393518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005083924,"threshold_uncertainty_score":0.01700741,"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."}}