{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432089,0.001722911,0.002698072,0.002244296,0.003354247,0.005707046,0.004057901,0.003603935,0.02239583],"category_scores_gemma":[0.01751459,0.001323154,0.001433519,0.004701031,0.00530741,0.01238679,0.006482567,0.00701005,0.001856577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002683421,"about_ca_system_score_gemma":0.001040378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831722,"about_ca_topic_score_gemma":0.001619576,"domain_scores_codex":[0.9980926,0.0008506344,0.00007379206,0.0003352448,0.0003189597,0.0003287587],"domain_scores_gemma":[0.9898364,0.007619924,0.0006316443,0.0006544055,0.0004332239,0.0008245139],"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.0002551741,0.00007388704,0.0003842613,0.0001950217,0.00002911511,0.00008160365,0.0002982889,0.0150321,0.000401209,0.9631488,0.007998566,0.01210188],"study_design_scores_gemma":[0.00004742714,0.00001881788,0.0002337061,0.0000429715,0.0000138703,0.00005598653,0.0001246984,0.0251176,0.0001615092,0.9721605,0.002011544,0.00001147785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3680876,0.006894607,0.4086289,0.01505412,0.001110172,0.0002975851,0.001356367,0.0004696121,0.198101],"genre_scores_gemma":[0.860773,0.005404207,0.05978722,0.002118474,0.001473126,0.0006012399,0.002288257,0.0006535565,0.06690095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02239583,"threshold_uncertainty_score":0.07492149,"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."}}