{"id":"W2765269579","doi":"10.1145/3125644","title":"Communication Steps for Parallel Query Processing","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Alberta Innovates - Technology Futures; Wisconsin Alumni Research Foundation; National Science Foundation","keywords":"Computer science; Skew; Joins; Upper and lower bounds; Parallel computing; Matching (statistics); Binary logarithm; Communication complexity; Simple (philosophy); Graph; Algorithm; Theoretical computer science; Combinatorics; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970946,0.001363899,0.001381751,0.0009434355,0.002432597,0.003272889,0.00300795,0.001602061,0.007194223],"category_scores_gemma":[0.01783284,0.0009085615,0.001470283,0.002670432,0.001979321,0.008635825,0.003964625,0.003019598,0.001801415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002015316,"about_ca_system_score_gemma":0.002238621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342472,"about_ca_topic_score_gemma":0.003134675,"domain_scores_codex":[0.9948691,0.001214203,0.0003459483,0.001044318,0.00180995,0.0007164894],"domain_scores_gemma":[0.9880492,0.007940753,0.0006061398,0.002041994,0.001032667,0.0003292821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001455495,0.00055772,0.002395129,0.0007964535,0.0001942546,0.0003951969,0.001170417,0.4906895,0.01572586,0.2880273,0.01648192,0.1821108],"study_design_scores_gemma":[0.00009140948,0.000108259,0.0001842722,0.00001629071,0.00003735415,0.00009255246,0.0001664736,0.8066121,0.005283442,0.1826584,0.004727656,0.00002175203],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07550786,0.0009315846,0.9056692,0.00248205,0.0001720119,0.0003861458,0.00030698,0.002016405,0.01252782],"genre_scores_gemma":[0.4846696,0.0006254312,0.5028993,0.0007303961,0.0002463975,0.0008380392,0.0007648863,0.0006209838,0.008604835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007194223,"threshold_uncertainty_score":0.02406704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03760960977898024,"score_gpt":0.3058304111590551,"score_spread":0.2682208013800749,"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."}}