{"id":"W1976939532","doi":"10.1016/j.tcs.2015.03.042","title":"Finding median in read-only memory on integer input","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Integer (computer science); Logarithm; Algorithm; Binary number; Mathematics; Combinatorics; Selection (genetic algorithm); Simple (philosophy); Upper and lower bounds; Space (punctuation); Time complexity; Binary logarithm; Computer science; Discrete mathematics; Arithmetic; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047151,0.001863357,0.002164569,0.001260547,0.001353176,0.004314831,0.002580391,0.001949646,0.02273649],"category_scores_gemma":[0.008125463,0.0008355865,0.001163457,0.003286032,0.0009840572,0.01043332,0.002519389,0.001708837,0.005041535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002070403,"about_ca_system_score_gemma":0.003468409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002327395,"about_ca_topic_score_gemma":0.006435861,"domain_scores_codex":[0.9978718,0.0003316622,0.0001829462,0.0007350682,0.0003404469,0.0005381515],"domain_scores_gemma":[0.9918255,0.0048854,0.0006779347,0.00186206,0.000479764,0.000269284],"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.01006183,0.001258697,0.01005027,0.002727758,0.0004850041,0.0008648706,0.001018129,0.1216483,0.0588413,0.03667917,0.09280462,0.66356],"study_design_scores_gemma":[0.001433556,0.001181114,0.003466579,0.0003456851,0.0005038258,0.000830727,0.001866932,0.5195646,0.09289171,0.357021,0.02073311,0.0001611247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5410644,0.003748547,0.3473351,0.006854683,0.0007032679,0.0005051153,0.01158733,0.02677654,0.06142498],"genre_scores_gemma":[0.7526166,0.0006072658,0.2228649,0.0009182982,0.0003229275,0.0002885608,0.005642498,0.001738598,0.01500042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02273649,"threshold_uncertainty_score":0.07606113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03588596367149385,"score_gpt":0.2864995203129722,"score_spread":0.2506135566414784,"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."}}