{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007938588,0.0000396688,0.00007815321,0.00002201037,0.0006218582,0.000265976,0.006975184,0.00001969772,6.353931e-7],"category_scores_gemma":[0.0006177463,0.0000231854,0.00009813718,0.00002832853,0.00005196342,0.0006864865,0.0007119059,0.0001164908,9.931789e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009407018,"about_ca_system_score_gemma":0.00004243071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001079619,"about_ca_topic_score_gemma":0.000001072978,"domain_scores_codex":[0.9995686,0.00005143645,0.0001486013,0.00004451535,0.0001102981,0.00007658151],"domain_scores_gemma":[0.9975039,0.00008132352,0.0005688457,0.001699593,0.0001209433,0.0000254302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000192721,0.0004294167,0.007045619,0.0001263917,0.0001827221,0.00001351335,0.006832731,0.001071745,0.005712233,0.2213235,0.02037051,0.7366989],"study_design_scores_gemma":[0.0006117736,0.00006597264,0.01820145,0.0001762754,0.00001649484,0.00009024875,0.00006617589,0.008426005,0.00182635,0.9653071,0.005127762,0.00008443273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180173,0.001353339,0.8148931,0.06307626,0.001345788,0.0002376535,0.000001310479,0.00001927539,0.00105597],"genre_scores_gemma":[0.8377529,0.00001994161,0.161764,0.0002040291,0.00008343023,0.000001486471,3.533226e-8,0.000002751656,0.0001714866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7439836,"threshold_uncertainty_score":0.9983975,"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."}}