{"id":"W2528405545","doi":"10.48550/arxiv.cs/0601081","title":"An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture","year":2006,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Computer science; Computation; Parallel computing; Theoretical computer science; Algorithm; Arithmetic; Mathematics","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.0002612909,0.0001595074,0.0001296517,0.00007454083,0.0003115282,0.00014357,0.00111028,0.00005802084,0.000021537],"category_scores_gemma":[0.00001398464,0.0001010733,0.0000525455,0.0003116889,0.00003108912,0.0002989249,0.0003025598,0.0001860528,0.0002491099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003920228,"about_ca_system_score_gemma":0.00004065787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003673092,"about_ca_topic_score_gemma":0.0002055017,"domain_scores_codex":[0.9985695,0.0001173875,0.0001909542,0.0004820907,0.0003147949,0.0003251999],"domain_scores_gemma":[0.9986923,0.00004240176,0.00007038238,0.001053052,0.00004654708,0.00009529109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003162533,0.001568137,0.02318375,0.00005354278,0.00005260248,0.00009584003,0.004303399,0.02520158,0.05375665,0.03482572,0.1611753,0.6954673],"study_design_scores_gemma":[0.001764258,0.001114225,0.4589176,0.0001874973,0.00002490505,0.00004610189,0.00004782709,0.04239003,0.02185461,0.01069371,0.4618731,0.001086162],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3831246,0.0000787646,0.6058076,0.005721055,0.0005793066,0.0005763213,0.00001420211,0.0002993291,0.003798776],"genre_scores_gemma":[0.9447701,0.00000423461,0.05102227,0.00167977,0.001366163,0.00006485397,0.0000357362,0.00002116099,0.001035702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6943811,"threshold_uncertainty_score":0.412165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02050823403574376,"score_gpt":0.2497156969849931,"score_spread":0.2292074629492493,"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."}}