{"id":"W2038255135","doi":"10.1016/j.jcss.2007.06.016","title":"Lower bounds for predecessor searching in the cell probe model","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Upper and lower bounds; Computer science; Quantum; Query optimization; Mathematics; Theoretical computer science; Discrete mathematics; Information retrieval","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":[],"consensus_categories":[],"category_scores_codex":[0.006647279,0.0001081866,0.0002061873,0.0002399499,0.0003497059,0.0006274997,0.001303193,0.00003221509,7.598717e-8],"category_scores_gemma":[0.000009447032,0.00005852637,0.00008696586,0.0003960332,0.00009161047,0.0003637416,0.0001320169,0.0001930019,2.272933e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002519675,"about_ca_system_score_gemma":0.0001745168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004772888,"about_ca_topic_score_gemma":0.000003344685,"domain_scores_codex":[0.9983827,0.00009823414,0.0004586228,0.0002115423,0.0005269074,0.0003219986],"domain_scores_gemma":[0.9989523,0.0004699526,0.0002548271,0.0001463712,0.0001004591,0.00007613495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001053681,0.0005333217,0.002764792,0.000762564,0.00004203426,0.0002910354,0.05977379,0.5681447,0.000895001,0.09637497,0.001502623,0.2688099],"study_design_scores_gemma":[0.0003024471,0.0004539709,0.0008467063,0.0001404802,0.000002695207,0.0003665144,0.0002348266,0.9947737,0.00006952453,0.002525191,0.0001992246,0.00008469381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.234615,0.0002513304,0.7637489,0.0005007949,0.000457601,0.0001287293,3.776794e-7,0.00001089536,0.0002863804],"genre_scores_gemma":[0.7739232,0.000001999368,0.2256756,0.0001367363,0.0002473988,8.97155e-7,2.966095e-8,0.00000238995,0.00001169752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5393082,"threshold_uncertainty_score":0.6050993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01952030531597196,"score_gpt":0.2743330171327307,"score_spread":0.2548127118167587,"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."}}