{"id":"W2950918794","doi":"","title":"An \\Omega(n log n) lower bound for computing the sum of even-ranked elements","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Omega; Rank (graph theory); Combinatorics; Computation; Order (exchange); Upper and lower bounds; Sequence (biology); Binary logarithm; Algebraic number; Mathematics; Tree (set theory); Real number; Discrete mathematics; Algorithm; Physics; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004105681,0.003031221,0.00261465,0.001972039,0.002497585,0.007474516,0.005690168,0.003190033,0.03052917],"category_scores_gemma":[0.02557926,0.001192581,0.00313491,0.003569497,0.002976987,0.02287842,0.00662161,0.007522701,0.008456979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004432391,"about_ca_system_score_gemma":0.00493937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003460339,"about_ca_topic_score_gemma":0.01000691,"domain_scores_codex":[0.9936576,0.001325675,0.0004749022,0.001464762,0.001938663,0.001138456],"domain_scores_gemma":[0.9724036,0.02010519,0.001112539,0.004390781,0.001133161,0.0008547563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005354426,0.001544449,0.01000649,0.003234645,0.0007065015,0.000590695,0.001059989,0.1105925,0.02280921,0.3393709,0.154888,0.3498423],"study_design_scores_gemma":[0.0004517022,0.0003315092,0.001829761,0.0001769512,0.0003284481,0.0006581254,0.0003081593,0.3654903,0.00854334,0.5989225,0.0228506,0.0001085286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1531986,0.006389216,0.6824458,0.03058496,0.002093808,0.000589934,0.008076668,0.009153691,0.1074673],"genre_scores_gemma":[0.5199435,0.002728418,0.4097211,0.004638072,0.002415276,0.001128367,0.011468,0.002773489,0.04518385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03052917,"threshold_uncertainty_score":0.1021302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06434977933723116,"score_gpt":0.2253335261437328,"score_spread":0.1609837468065016,"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."}}