{"id":"W2063687001","doi":"10.1007/s10878-012-9526-3","title":"Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Approximation algorithm; Disjoint sets; Mathematics; Convexity; Theory of computation; Combinatorics; Function (biology); Range (aeronautics); Relaxation (psychology); Algorithm; Discrete mathematics","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.001929381,0.0001127928,0.0001701574,0.00008984826,0.0004052556,0.0002733305,0.0003380741,0.00005646912,0.000002348138],"category_scores_gemma":[0.0001652192,0.00006437478,0.0001077662,0.0002933278,0.00009752237,0.001403704,0.00007676137,0.0001580041,2.94493e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005910395,"about_ca_system_score_gemma":0.00004167806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001037645,"about_ca_topic_score_gemma":3.357073e-7,"domain_scores_codex":[0.9988495,0.0001392774,0.0004457969,0.0001052103,0.0002888029,0.0001713799],"domain_scores_gemma":[0.9983867,0.0004100862,0.000620672,0.0001842284,0.0003407177,0.00005761631],"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.0006503747,0.0006235522,0.0002394258,0.0001255523,0.0003148888,4.410362e-7,0.009448821,0.1553814,0.0006732627,0.7077362,0.0007781679,0.1240279],"study_design_scores_gemma":[0.003492536,0.0001668547,0.0001680632,0.00001801419,0.00006279912,0.00004512494,0.000125204,0.9580563,0.0005636581,0.03681099,0.0003939619,0.00009647484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004377576,0.0005070755,0.9909008,0.001710667,0.005686138,0.0007069656,0.000001718648,0.00002082875,0.00002803661],"genre_scores_gemma":[0.4906478,0.0004746628,0.5063072,0.000176704,0.002188456,0.0001343809,0.00001852807,0.00002301159,0.00002930106],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8026749,"threshold_uncertainty_score":0.3116939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02017153551588397,"score_gpt":0.250768736552305,"score_spread":0.230597201036421,"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."}}