{"id":"W2768566391","doi":"10.1145/3210377.3210409","title":"On the Distributed Complexity of Large-Scale Graph Computations","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Università degli Studi di Padova; European Commission; City University of Hong Kong; National Science Foundation","keywords":"Omega; Combinatorics; Upper and lower bounds; Computation; PageRank; Enumeration; Graph; Discrete mathematics; Distributed algorithm; Mathematics; Computer science; Theoretical computer science; Algorithm","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.00619843,0.001365237,0.002053342,0.001316076,0.002018304,0.005000581,0.003744616,0.002247319,0.004559285],"category_scores_gemma":[0.03652252,0.0009155915,0.001701572,0.002151228,0.005064999,0.01133743,0.004613597,0.005752908,0.0008323055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004929068,"about_ca_system_score_gemma":0.003267352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00336987,"about_ca_topic_score_gemma":0.00295023,"domain_scores_codex":[0.993176,0.00224021,0.0002968883,0.001477551,0.001892802,0.000916542],"domain_scores_gemma":[0.9371027,0.05085431,0.002553037,0.006803615,0.001658975,0.001027301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004319539,0.0001520225,0.001319775,0.0002938716,0.00009801876,0.000143732,0.0003024937,0.6796585,0.005417619,0.285688,0.00318646,0.02330744],"study_design_scores_gemma":[0.00004343915,0.00002609646,0.0002765977,0.00001138141,0.00001490145,0.00002884098,0.0000383407,0.8284949,0.00117604,0.1691393,0.0007368781,0.00001335344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08712292,0.001381412,0.8917114,0.004955588,0.0001698575,0.0002151002,0.000334184,0.000978944,0.01313059],"genre_scores_gemma":[0.8106436,0.001493838,0.1794847,0.0006610196,0.0004450706,0.0006661942,0.0005935972,0.000527099,0.005484871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00619843,"threshold_uncertainty_score":0.03576303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07313345500778567,"score_gpt":0.3110115282781553,"score_spread":0.2378780732703696,"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."}}