{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899954,0.000214019,0.000247729,0.0001997879,0.000267317,0.000126666,0.001500858,0.0001374219,0.000006652913],"category_scores_gemma":[0.00002808643,0.0002091116,0.0001895637,0.0005097687,0.00006601836,0.0003007752,0.000491247,0.0002270892,0.000005988968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009351998,"about_ca_system_score_gemma":0.000210705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002606807,"about_ca_topic_score_gemma":0.0000228427,"domain_scores_codex":[0.9984788,0.0001437374,0.0002877536,0.0006966664,0.0001311733,0.0002619088],"domain_scores_gemma":[0.9982203,0.0001831128,0.0003705332,0.0008062143,0.0003359097,0.0000839631],"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.0000541195,0.000236516,0.0004404293,0.0000524709,0.0001067451,0.00001372964,0.000240333,0.8148168,0.0002451384,0.1774803,0.0003387685,0.005974635],"study_design_scores_gemma":[0.0005457399,0.0001897996,0.0028933,0.00004145273,0.00004923935,0.000001788038,0.00002594351,0.924463,0.000309012,0.07032346,0.0009062455,0.0002509838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3542511,0.00003652871,0.6444944,0.00009179659,0.0005139647,0.0003297067,0.00001182275,0.00005050864,0.0002201973],"genre_scores_gemma":[0.9888241,0.00001681266,0.01050405,0.0001787823,0.0001531818,7.358749e-7,0.00006154936,0.000008476003,0.0002523638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.634573,"threshold_uncertainty_score":0.8527324,"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."}}