{"id":"W2244188037","doi":"10.14778/2824032.2824046","title":"A scalable distributed graph partitioner","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry","keywords":"Graph partition; Scalability; Partition (number theory); Computer science; Bounded function; Graph; Parallel computing; Space partitioning; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Database","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004047796,0.0000876929,0.0001255334,0.00004068688,0.00008190871,0.0001044742,0.0006217014,0.00003265668,0.000005982477],"category_scores_gemma":[0.00004512872,0.0000555196,0.00008411182,0.0004100514,0.00003594556,0.0002932831,0.0002414647,0.00007179143,0.00001702561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006105705,"about_ca_system_score_gemma":0.00002220749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000498287,"about_ca_topic_score_gemma":0.000002460454,"domain_scores_codex":[0.9990664,0.000008179639,0.0002294385,0.000183941,0.0003197903,0.0001922333],"domain_scores_gemma":[0.999288,0.00001133451,0.000155792,0.0001458225,0.0003131435,0.00008588656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002789882,0.0002487058,0.007963274,0.00006293903,0.00008734906,8.543616e-7,0.001835675,0.0007738147,0.005795185,0.6938289,0.2881189,0.001256478],"study_design_scores_gemma":[0.004771709,0.00094538,0.005099528,0.0007873184,0.00009126105,0.0002583454,0.002466784,0.111512,0.3137736,0.2776375,0.2814145,0.001242135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.562266,0.001009178,0.2519546,0.0262218,0.01092432,0.002927046,0.00004463627,0.001058555,0.1435939],"genre_scores_gemma":[0.9981429,0.000003749161,0.001020926,0.0001431497,0.00008459441,0.00004716466,6.425704e-7,0.000004391708,0.0005524893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4358769,"threshold_uncertainty_score":0.2264023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02429343342382261,"score_gpt":0.2216525087113379,"score_spread":0.1973590752875153,"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."}}