{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002676258,0.0002527517,0.0002058333,0.0005424386,0.0008931226,0.0002745519,0.001427606,0.0001177096,0.0000899077],"category_scores_gemma":[0.0001404934,0.0002533412,0.0001873156,0.001838637,0.0001042545,0.0003721471,0.00003672136,0.0009291332,0.0001752159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005038094,"about_ca_system_score_gemma":0.00005977823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006379855,"about_ca_topic_score_gemma":0.00003453886,"domain_scores_codex":[0.9981273,0.00005700069,0.0003136286,0.0005903529,0.0004627022,0.0004489548],"domain_scores_gemma":[0.9973236,0.00103693,0.00009064242,0.001243805,0.0001128192,0.0001922362],"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.000003494106,0.0004110802,0.0000117466,0.000006049146,0.00003541625,0.00001546556,0.0001607348,0.002152817,0.0001605376,0.07713312,0.00005951312,0.9198501],"study_design_scores_gemma":[0.001743063,0.0007690585,0.007406932,0.0001001893,0.00005536721,0.0001682045,0.0001593521,0.7894169,0.009301541,0.1850619,0.004566499,0.001251027],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0130211,0.0000111632,0.9818127,0.001302686,0.001941838,0.0001835438,0.00006513024,0.0005058553,0.001156013],"genre_scores_gemma":[0.7140565,0.000006974004,0.2854233,0.0002605732,0.00008961293,0.00002844358,0.00001044823,0.00001615759,0.0001079411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.918599,"threshold_uncertainty_score":0.9999919,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02021759233371228,"score_gpt":0.2677943535910513,"score_spread":0.247576761257339,"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."}}