{"id":"W4230719382","doi":"10.1145/1109557.1109603","title":"Implicit dictionaries with <i>O</i>(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Constant (computer programming); Computer science; Set (abstract data type); Order (exchange); Combinatorics; Binary logarithm; Search cost; Search problem; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; 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.0003547194,0.0004289722,0.0003602336,0.0002394615,0.0006083705,0.0004440928,0.002316058,0.0001372245,0.000004068802],"category_scores_gemma":[0.00003565527,0.0002861091,0.000140067,0.000748042,0.0004344942,0.001440446,0.001229816,0.0004880834,0.0000103195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009358863,"about_ca_system_score_gemma":0.00007070493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001573789,"about_ca_topic_score_gemma":0.000004651166,"domain_scores_codex":[0.997116,0.00002889755,0.0004704751,0.0008372547,0.0009392752,0.0006080913],"domain_scores_gemma":[0.9981732,0.00006317734,0.0003486031,0.0005952749,0.0006711737,0.0001485417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003376545,0.00164973,0.01408771,0.0009196105,0.0005149129,0.00001580198,0.008803829,0.0003468297,0.05396241,0.8145075,0.03056314,0.07429087],"study_design_scores_gemma":[0.005246606,0.002936308,0.02686488,0.002255008,0.0005611288,0.001140613,0.005660557,0.04869679,0.644381,0.2231113,0.0340827,0.00506307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4124996,0.008468738,0.4144404,0.1368523,0.0008865905,0.007529718,0.002492151,0.005412511,0.01141803],"genre_scores_gemma":[0.7355933,0.0001028655,0.2620862,0.0003905298,0.0002139835,0.0001245714,0.00003605488,0.00006060369,0.001391885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5913962,"threshold_uncertainty_score":0.9999591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00571366836197134,"score_gpt":0.2340760520787537,"score_spread":0.2283623837167824,"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."}}