{"id":"W1561988317","doi":"10.1007/11764298_13","title":"Faster Adaptive Set Intersections for Text Searching","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Computer science; Binary search algorithm; Set (abstract data type); Context (archaeology); Task (project management); Binary number; Search algorithm; Interpolation (computer graphics); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Arithmetic; Programming language","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.0006327953,0.0004845885,0.0004382434,0.0008097969,0.0004845268,0.0007137996,0.002933197,0.0002532544,0.00001488405],"category_scores_gemma":[0.00004306229,0.0004206332,0.0001780312,0.0003969502,0.0004395244,0.0009719293,0.002008947,0.0007736405,0.0000347905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002757264,"about_ca_system_score_gemma":0.0003536215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009072119,"about_ca_topic_score_gemma":0.0001297559,"domain_scores_codex":[0.996494,0.00003222629,0.0004552992,0.00157549,0.0007427187,0.00070028],"domain_scores_gemma":[0.9974982,0.0006013678,0.0002319297,0.001248364,0.0002640962,0.0001560689],"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.00001533659,0.00003711251,0.00001361672,0.00003631489,0.00001731965,0.00004023503,0.0009471917,0.04092916,0.0001091401,0.01788696,0.00118683,0.9387808],"study_design_scores_gemma":[0.0002812972,0.0002540466,0.00005467264,0.0003744533,0.000006654712,0.00005271241,4.763432e-7,0.8983258,0.0003404258,0.09138706,0.008366094,0.0005563322],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002062336,0.000159075,0.9932916,0.00038594,0.001940631,0.0005698241,0.00006319737,0.0001564558,0.00341262],"genre_scores_gemma":[0.0540164,0.00001172762,0.9420531,0.001024625,0.001156664,0.00004022873,0.00004818498,0.00005660223,0.00159245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9382244,"threshold_uncertainty_score":0.9998245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02964560611851291,"score_gpt":0.2730994116612955,"score_spread":0.2434538055427826,"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."}}