{"id":"W1595525475","doi":"10.1007/978-3-642-10631-6_97","title":"Lower Bounds on Fast Searching","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Time complexity; Graph; Combinatorics; Quadratic equation; Jump; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008064609,0.0005817034,0.000489097,0.0008691864,0.0004679648,0.001210916,0.004698886,0.0002978166,0.00003139691],"category_scores_gemma":[0.00005494496,0.000485943,0.0001461823,0.0005178993,0.0004405206,0.0008712703,0.001875379,0.001310422,0.0001458857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002894087,"about_ca_system_score_gemma":0.000450847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779645,"about_ca_topic_score_gemma":0.00001568769,"domain_scores_codex":[0.9952835,0.00003809884,0.0004392339,0.001861547,0.001553808,0.0008237995],"domain_scores_gemma":[0.9969036,0.0003488339,0.0002113721,0.002119965,0.0001574774,0.0002587739],"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.000006286622,0.00003799139,0.000003381587,0.00000832218,0.000003741621,0.0001619912,0.0002022734,0.009946528,0.00004709645,0.01759739,0.0001037498,0.9718813],"study_design_scores_gemma":[0.0003522824,0.0007450566,0.0002002243,0.0009680614,0.000004790285,0.00009406233,7.984296e-8,0.7504653,0.0005535315,0.2215938,0.02394697,0.001075877],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003857684,0.0002065439,0.9809669,0.0008609501,0.002124583,0.0002519423,0.000007628114,0.0002069399,0.01533596],"genre_scores_gemma":[0.06815494,0.0001094582,0.918257,0.008121923,0.002098337,0.000008806405,0.0000245648,0.0000821586,0.00314279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9708053,"threshold_uncertainty_score":0.9998259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01611362933346579,"score_gpt":0.2583661912551287,"score_spread":0.2422525619216629,"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."}}