{"id":"W2215786255","doi":"10.1109/besc.2015.7365980","title":"Balanced Graph Partitioning: Optimizing graph cut based on Label Swapping","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Graph; Partition (number theory); Graph bandwidth; Strength of a graph; Algorithm; Theoretical computer science; Mathematics; Voltage graph; Line graph; Combinatorics","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.0006102825,0.0001727094,0.0001655784,0.0002381408,0.0001986587,0.0002049596,0.0006210335,0.0000587794,0.00002970957],"category_scores_gemma":[0.00004771697,0.0001508905,0.00008946493,0.0008301039,0.00006135354,0.0004593648,0.00008616476,0.000156665,0.0001106323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001951975,"about_ca_system_score_gemma":0.00005359252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010359,"about_ca_topic_score_gemma":0.000002724452,"domain_scores_codex":[0.9985546,0.0001107834,0.0002015034,0.0004189034,0.0003381421,0.0003760222],"domain_scores_gemma":[0.9989399,0.0001019218,0.00007120338,0.0005492312,0.0001023426,0.0002353443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005146706,0.0004660012,0.001172088,0.00002042896,0.00004864199,0.00007328692,0.0009647002,0.03950123,0.001074939,0.9416078,0.006468976,0.008550458],"study_design_scores_gemma":[0.002296615,0.0004034695,0.0002994277,0.0001101933,0.00001053132,0.00001201647,0.0001910618,0.7948231,0.01108708,0.1889171,0.001232228,0.0006172343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006207316,0.00003197338,0.9574071,0.00093148,0.0005577095,0.0001184451,0.000001466524,0.0005125711,0.03423196],"genre_scores_gemma":[0.8060868,0.000003222313,0.1910519,0.002388629,0.0000600115,0.00002787912,0.000005328196,0.00001228266,0.0003638434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7998796,"threshold_uncertainty_score":0.6153134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03737230654060093,"score_gpt":0.2544181551778223,"score_spread":0.2170458486372214,"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."}}