{"id":"W3155426438","doi":"10.1007/s41019-021-00156-2","title":"A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores","year":2021,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Exploit; Workload; Graph traversal; Graph; Tree traversal; Latency (audio); Theoretical computer science; Distributed computing; Operating system; Algorithm","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.001006615,0.0009364255,0.0009493292,0.001314389,0.0007698287,0.001401992,0.003354953,0.0008396744,0.00334763],"category_scores_gemma":[0.00442267,0.0005565913,0.0005146963,0.001802963,0.0006040291,0.00314655,0.002470179,0.001160915,0.001060403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000862256,"about_ca_system_score_gemma":0.001017113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00320261,"about_ca_topic_score_gemma":0.00447458,"domain_scores_codex":[0.9990709,0.0001332429,0.00008250265,0.0002338648,0.0003977276,0.0000817609],"domain_scores_gemma":[0.9973978,0.0008003916,0.000167595,0.0009416493,0.0004383447,0.0002540985],"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.003047708,0.001009156,0.007400671,0.0007217916,0.0002110942,0.0006319341,0.001104453,0.123514,0.1542224,0.01387947,0.04524042,0.6490169],"study_design_scores_gemma":[0.000184609,0.0001649385,0.0007182073,0.00001491017,0.00002503303,0.0001696311,0.0001832045,0.9555231,0.03024663,0.005369839,0.007364026,0.00003589627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1266886,0.0006995634,0.8018268,0.0006557176,0.0001743505,0.0005235078,0.001864587,0.06511262,0.002454259],"genre_scores_gemma":[0.4443191,0.0002725469,0.5458831,0.0002485216,0.00009638041,0.0003803466,0.003669607,0.001781177,0.003349184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003354953,"threshold_uncertainty_score":0.01119894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02622165019799239,"score_gpt":0.2374815617922062,"score_spread":0.2112599115942138,"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."}}