{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003084241,0.0002320113,0.0002687859,0.0006221012,0.0002209287,0.0004340941,0.003634991,0.00007389359,0.00003633712],"category_scores_gemma":[0.0003177175,0.0001945129,0.00006622672,0.002353601,0.002497015,0.0007751301,0.001495522,0.0004788257,0.00019651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001659279,"about_ca_system_score_gemma":0.0003677095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001754296,"about_ca_topic_score_gemma":0.000008539628,"domain_scores_codex":[0.9966947,0.0001826355,0.0003522448,0.0009006181,0.001109029,0.0007607724],"domain_scores_gemma":[0.9977831,0.0004166936,0.00006507597,0.001040933,0.0001609505,0.0005332048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008462273,0.0000772399,0.0001083328,0.000002695497,0.000001421281,0.00005557469,0.001403199,0.0002276091,0.00001736775,0.8977674,0.0001401806,0.1001906],"study_design_scores_gemma":[0.0003884953,0.0003349211,0.0008374221,0.00007747268,0.000001269711,0.00006657669,0.00003174299,0.5107821,0.0007558133,0.4861541,0.0002794803,0.0002905536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04897967,0.000021051,0.9169729,0.003565388,0.001931498,0.0001869934,0.000001258208,0.0002458572,0.02809544],"genre_scores_gemma":[0.8810693,0.000001833874,0.1173117,0.001397946,0.0001813629,0.000005547619,6.132748e-7,0.000007765221,0.00002387103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8320897,"threshold_uncertainty_score":0.9200356,"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."}}