{"id":"W1980190601","doi":"10.1145/1721837.1721842","title":"Comparison-based time-space lower bounds for selection","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Combinatorics; Log-log plot; Streaming algorithm; Running time; Space (punctuation); Mathematical proof; Selection (genetic algorithm); Discrete mathematics; Randomized algorithm; Deterministic algorithm; Time complexity; Algorithm; Computer science","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.0003359487,0.0002718356,0.0002782694,0.000311233,0.0007672925,0.0002950901,0.001248558,0.0001814055,0.0002487203],"category_scores_gemma":[0.00005032304,0.000280786,0.0002790118,0.0008346831,0.000131661,0.0003937599,0.00001481994,0.0006371729,0.0001611311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005119653,"about_ca_system_score_gemma":0.0001626738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003826341,"about_ca_topic_score_gemma":0.000081834,"domain_scores_codex":[0.9981883,0.00004582762,0.0003120241,0.0006194249,0.000366293,0.0004681171],"domain_scores_gemma":[0.9979532,0.0005145979,0.0000983209,0.001051406,0.0002032968,0.0001791567],"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.000126845,0.002511971,0.00008712661,0.0000426292,0.0001579304,0.000006251524,0.0003984356,0.009338041,0.01029798,0.01134066,0.004323654,0.9613685],"study_design_scores_gemma":[0.000992511,0.0005905968,0.0002853469,0.00001501892,0.00002904302,0.00001684017,0.00001142639,0.9131518,0.02423098,0.008891125,0.05134397,0.0004413141],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001862073,0.00001207322,0.9911718,0.003164673,0.002433785,0.0004048179,0.00003497767,0.0005874535,0.0003282865],"genre_scores_gemma":[0.2198521,0.000002573919,0.7783786,0.0004657806,0.0001988255,0.000171721,0.000009618385,0.00003138978,0.0008894217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9609272,"threshold_uncertainty_score":0.9999644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02494796243462718,"score_gpt":0.2988886896203971,"score_spread":0.2739407271857699,"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."}}