{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006776536,0.003077059,0.005326301,0.005194723,0.003900328,0.008227144,0.01022955,0.005946042,0.02626658],"category_scores_gemma":[0.04561326,0.001810809,0.002885761,0.005782573,0.005003756,0.0160474,0.006973953,0.009122525,0.003337867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005798754,"about_ca_system_score_gemma":0.004898971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003481291,"about_ca_topic_score_gemma":0.005659304,"domain_scores_codex":[0.9958979,0.001284562,0.0001363207,0.0005270324,0.001061924,0.001092206],"domain_scores_gemma":[0.94327,0.04578346,0.001750304,0.004719265,0.002118344,0.002358551],"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.0005897181,0.0002862106,0.0007430368,0.0005416121,0.000100469,0.0001386747,0.0002557075,0.1545108,0.001675808,0.7991844,0.01737057,0.02460299],"study_design_scores_gemma":[0.00004632118,0.00005113146,0.0001408166,0.0000804882,0.00005993515,0.00008275634,0.00005480449,0.4471425,0.0006650705,0.5500683,0.001564303,0.00004353344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0997939,0.008720635,0.740916,0.009567958,0.0006640206,0.0002957113,0.001849213,0.002103498,0.1360891],"genre_scores_gemma":[0.7692504,0.007304149,0.1760605,0.002454527,0.001152455,0.0008464142,0.002816407,0.002162161,0.037953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02626658,"threshold_uncertainty_score":0.08787042,"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."}}