{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594886,0.002571038,0.003080806,0.002702789,0.002126425,0.005014834,0.009212186,0.003590693,0.01491852],"category_scores_gemma":[0.0236156,0.001430593,0.003107868,0.004800005,0.002226478,0.01116567,0.005181814,0.007416489,0.002442936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004487986,"about_ca_system_score_gemma":0.003563244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004229603,"about_ca_topic_score_gemma":0.008498042,"domain_scores_codex":[0.9954166,0.001557073,0.0001913783,0.0009230977,0.001119111,0.0007926996],"domain_scores_gemma":[0.9849417,0.009893049,0.0009024788,0.002657625,0.0008869239,0.0007182128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002174564,0.001290259,0.003086908,0.0009347199,0.0003316243,0.000197135,0.0006924469,0.3374281,0.003529025,0.2948451,0.05024175,0.3052483],"study_design_scores_gemma":[0.0002986966,0.000102603,0.0005735984,0.00006091217,0.0001323002,0.0001301669,0.0001589966,0.7186112,0.001246669,0.2727467,0.00590211,0.00003594431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05548769,0.002744415,0.9143106,0.003396078,0.0005939865,0.0002685371,0.0008388812,0.001521728,0.02083799],"genre_scores_gemma":[0.2714564,0.001528817,0.7082384,0.0009131804,0.0009323065,0.0005944782,0.00239921,0.0008917552,0.01304555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01491852,"threshold_uncertainty_score":0.04990745,"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."}}