{"id":"W2953197276","doi":"10.48550/arxiv.cs/0309033","title":"Lower bounds for predecessor searching in the cell probe model","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique; National Science Foundation","keywords":"Computer science; Combinatorics; Mathematics","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.00965576,0.002164606,0.003564502,0.003116335,0.00349436,0.007637102,0.008444285,0.003598238,0.0173654],"category_scores_gemma":[0.04828367,0.001697451,0.00418287,0.00475597,0.005525677,0.03196924,0.009710548,0.01043816,0.003234531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007123257,"about_ca_system_score_gemma":0.004914518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00362904,"about_ca_topic_score_gemma":0.002844319,"domain_scores_codex":[0.9859758,0.003205681,0.0005804715,0.002583335,0.00451534,0.003139375],"domain_scores_gemma":[0.9180128,0.05881677,0.003536953,0.01419401,0.003580559,0.001858919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001460955,0.0004475591,0.001973128,0.0007561092,0.000171545,0.0002732394,0.0009604475,0.1306714,0.0112061,0.7790496,0.01789519,0.0551348],"study_design_scores_gemma":[0.0001157876,0.0002073362,0.000573542,0.0001007701,0.0001825013,0.0002776898,0.0001893365,0.4952928,0.0108774,0.4818092,0.01026582,0.0001078137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08399081,0.004465211,0.8536122,0.009409283,0.0002784833,0.0004179761,0.001731092,0.002107489,0.04398752],"genre_scores_gemma":[0.7160289,0.004769375,0.2429615,0.003239618,0.0008540562,0.001418314,0.002507801,0.001835464,0.02638492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0173654,"threshold_uncertainty_score":0.05809301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04996953184438188,"score_gpt":0.3045535340682103,"score_spread":0.2545840022238285,"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."}}