{"id":"W1164874588","doi":"10.1007/s00453-017-0302-8","title":"Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Combinatorics; Rounding; Vertex (graph theory); Complement (music); Physics; Mathematics; Graph; 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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005800306,0.0002303076,0.0002246991,0.00006898515,0.001973598,0.001359314,0.002029702,0.00009184014,0.000004959017],"category_scores_gemma":[0.000184178,0.0001663855,0.0001110964,0.0001050795,0.0003605854,0.001018693,0.0006526838,0.0001821275,0.000006893516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002009571,"about_ca_system_score_gemma":0.00005063148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001478718,"about_ca_topic_score_gemma":0.00002313673,"domain_scores_codex":[0.9984504,0.00003391535,0.0002731406,0.0005716364,0.000236327,0.0004345929],"domain_scores_gemma":[0.9977467,0.0004175418,0.0002519451,0.001332017,0.0001455881,0.0001061797],"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.000006588366,0.00005238052,0.00004553801,0.00004453513,0.00005937238,0.000001343349,0.0004662616,0.000007391089,0.000348951,0.02378487,0.0003942179,0.9747885],"study_design_scores_gemma":[0.0006589872,0.0001530378,0.001706319,0.00003605643,0.00003150251,0.00003276343,0.00006244333,0.8880647,0.001885311,0.08727427,0.01979349,0.0003010874],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006469978,0.0006878808,0.9893015,0.006872405,0.001018996,0.000907505,0.00002051966,0.0001660522,0.0003781695],"genre_scores_gemma":[0.2038458,0.0003023456,0.7928737,0.0005930957,0.0009863781,0.0007428692,0.00001287315,0.00004901431,0.0005939657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9744875,"threshold_uncertainty_score":0.9996774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04806380619590854,"score_gpt":0.2791472537857054,"score_spread":0.2310834475897968,"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."}}