{"id":"W259623631","doi":"10.1007/978-3-319-13075-0_28","title":"An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiset; Partition (number theory); Combinatorics; Partition problem; Integer (computer science); Cardinality (data modeling); Approximation algorithm; Mathematics; Discrete mathematics; Algorithm; Computer science","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.0006832454,0.0002769858,0.0002111534,0.0001091491,0.0001719497,0.0001456099,0.0007336242,0.000264285,0.000006487196],"category_scores_gemma":[0.00001942496,0.0002072877,0.00009213223,0.00007521917,0.0003199963,0.00001033357,0.0001829957,0.0002055735,0.000004236669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005161053,"about_ca_system_score_gemma":0.0001089553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008113172,"about_ca_topic_score_gemma":0.00005743226,"domain_scores_codex":[0.9984352,0.00002490347,0.0002736745,0.0007101412,0.0002360724,0.0003199978],"domain_scores_gemma":[0.9988236,0.00006428396,0.0001850791,0.0006837461,0.0001802547,0.00006302113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001047153,0.00001978907,0.000006611815,0.00003013305,0.00001772195,4.234364e-7,0.00009560739,0.003051599,0.01753928,0.0001504551,0.00003463086,0.9790433],"study_design_scores_gemma":[0.0004055273,0.0007460457,0.00002539598,0.00006188642,0.00002783186,0.00001080566,6.461948e-7,0.9561447,0.01934941,0.01345871,0.009361576,0.0004074706],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001584795,0.0002562948,0.9976141,0.0002479017,0.0004636079,0.001007593,0.00001810021,0.00001907012,0.0002148771],"genre_scores_gemma":[0.1906372,0.0001132469,0.8027294,0.001546772,0.003004136,0.0002916669,0.0006946726,0.0001181869,0.0008646514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9786358,"threshold_uncertainty_score":0.8452948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01097486296806836,"score_gpt":0.244663940399945,"score_spread":0.2336890774318766,"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."}}