{"id":"W2065074947","doi":"10.1016/j.dam.2005.02.013","title":"On uniform k-partition problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Partition (number theory); Cardinality (data modeling); Combinatorics; Partition problem; Discrete mathematics; Scheduling (production processes); Set (abstract data type); Mathematical optimization; Computer science; Data mining","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003545647,0.0001626119,0.000163978,0.000118237,0.0001341158,0.0001110834,0.0007402708,0.00005380146,0.00004496369],"category_scores_gemma":[0.00002993247,0.0001333456,0.00005346401,0.0003551355,0.00006673455,0.0002791056,0.0001843547,0.0001830204,0.0008641587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005698854,"about_ca_system_score_gemma":0.00002094184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.898786e-7,"about_ca_topic_score_gemma":0.000002224911,"domain_scores_codex":[0.9986137,0.00001140022,0.0002637879,0.000297683,0.0004401713,0.0003732462],"domain_scores_gemma":[0.9988136,0.0001563148,0.00009874914,0.0007850297,0.0000375745,0.0001087881],"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.000003642869,0.00008643488,6.566772e-7,0.0000385019,0.000007484198,9.578439e-7,0.0007242049,0.00176152,0.002155388,0.9861586,0.0002232359,0.008839386],"study_design_scores_gemma":[0.0002915277,0.00006196913,0.000007066459,0.00003281975,0.000003531196,0.000005152742,0.0000650658,0.06532605,0.01212453,0.9195334,0.0023414,0.0002075409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00862332,0.00001230741,0.896919,0.0004879867,0.00002992959,0.0004323741,0.000002917508,0.0002783971,0.09321379],"genre_scores_gemma":[0.6211552,0.00001081564,0.3778523,0.0002696514,0.00005584168,0.0001416747,0.000007153482,0.000026605,0.0004807325],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6125319,"threshold_uncertainty_score":0.9999138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02119347589676701,"score_gpt":0.2787988693872797,"score_spread":0.2576053934905127,"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."}}