{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006073195,0.0007368697,0.0009915025,0.0004775677,0.0007292698,0.001636595,0.001967068,0.001170212,0.01220172],"category_scores_gemma":[0.003503154,0.0003543125,0.0005644769,0.001505513,0.0006098008,0.004788729,0.00146697,0.001470102,0.002121692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008702186,"about_ca_system_score_gemma":0.001272056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008654221,"about_ca_topic_score_gemma":0.00205514,"domain_scores_codex":[0.9993406,0.000148065,0.0000395872,0.0001868825,0.0001433976,0.0001415118],"domain_scores_gemma":[0.9987776,0.0005695621,0.00008013929,0.000434553,0.00009356812,0.00004461649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008746897,0.0003885412,0.0009111913,0.0008173541,0.0001460747,0.0002761199,0.0002506492,0.189212,0.02937075,0.1689281,0.02725874,0.5815657],"study_design_scores_gemma":[0.0001720854,0.0003147012,0.0004163726,0.00005050137,0.00009857653,0.0004282578,0.0001691962,0.822936,0.01398845,0.1500891,0.01130672,0.00002997019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1228614,0.001139407,0.8520929,0.001391943,0.0002025132,0.0002037451,0.0002804206,0.002527591,0.01929991],"genre_scores_gemma":[0.448299,0.0006328891,0.5379589,0.0002775234,0.0002105753,0.0002688621,0.0006531732,0.0002353759,0.01146378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01220172,"threshold_uncertainty_score":0.04081887,"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."}}