{"id":"W4411973470","doi":"10.1007/s10878-025-01332-0","title":"Algorithms for 2-balanced connected k-partition problem in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Partition (number theory); Combinatorics; Computer science; Mathematics; Partition problem; Discrete mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274255,0.0001001625,0.0002462125,0.0006255501,0.00008125606,0.00009804025,0.0004973267,0.00008362045,0.000003498566],"category_scores_gemma":[0.0005621436,0.00009577785,0.00009111399,0.001374839,0.00003481171,0.0008383534,0.0000549048,0.0001875571,4.571551e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000118979,"about_ca_system_score_gemma":0.0002514615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001405324,"about_ca_topic_score_gemma":3.098232e-7,"domain_scores_codex":[0.9986557,0.0001510788,0.0005377022,0.0001637214,0.0002774073,0.0002144278],"domain_scores_gemma":[0.9983056,0.0002917666,0.0003199907,0.0001787805,0.0008326981,0.00007112752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002408298,0.0001779434,0.0002337145,0.000026719,0.00002469029,0.000004734162,0.00009666218,0.2275231,0.0004836478,0.7677519,0.0004748047,0.002961177],"study_design_scores_gemma":[0.003742891,0.0003258642,0.0001033754,0.00009900418,0.000007162712,0.000004659187,0.00001429853,0.2722268,0.001999261,0.7210463,0.0003398624,0.00009050487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001281702,0.00008953414,0.9947805,0.0009810281,0.002092675,0.0004060008,0.000001313795,0.00002901374,0.0003382232],"genre_scores_gemma":[0.266935,0.00008596399,0.732615,0.0001205691,0.000114172,0.00004669594,0.000007066843,0.00001305296,0.00006253277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2656533,"threshold_uncertainty_score":0.3905707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01353589621227777,"score_gpt":0.3004663665176037,"score_spread":0.286930470305326,"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."}}