{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003179575,0.0008078296,0.001185589,0.0007659183,0.00151734,0.002535283,0.002110593,0.001202249,0.006023813],"category_scores_gemma":[0.01844064,0.0005402242,0.001035931,0.001402197,0.003065086,0.007721324,0.003639875,0.002227164,0.001173383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425964,"about_ca_system_score_gemma":0.002536896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936073,"about_ca_topic_score_gemma":0.001438818,"domain_scores_codex":[0.9964309,0.00106105,0.0002274271,0.000741948,0.001047718,0.000490984],"domain_scores_gemma":[0.9893876,0.005016707,0.000654683,0.003390065,0.001173026,0.0003778624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004708289,0.0001072242,0.001432108,0.0001530018,0.00003802632,0.0001241931,0.0002852721,0.1719889,0.004966989,0.7784947,0.003977944,0.0379609],"study_design_scores_gemma":[0.00007156713,0.00007873781,0.0001508387,0.00002299159,0.00001759422,0.00007664783,0.0000560821,0.5520679,0.003064918,0.4398777,0.004495849,0.0000190321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05217927,0.0002343318,0.9333778,0.001110467,0.000137277,0.000186724,0.0001893033,0.0009795272,0.01160531],"genre_scores_gemma":[0.7482094,0.0005464114,0.2385445,0.0006230081,0.0002935737,0.0004793844,0.0004873747,0.0003825309,0.01043405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006023813,"threshold_uncertainty_score":0.02015167,"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."}}