{"id":"W2062135503","doi":"10.1145/2528405","title":"Lower bounds for local approximation","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Helsingin Yliopiston Tiedesäätiö; Suomen Kulttuurirahasto; Academy of Finland","keywords":"Mathematics; Combinatorics; Approximation algorithm; Dominating set; Upper and lower bounds; Discrete mathematics; Numbering; Bounded function; Independent set; Vertex (graph theory); Graph; Algorithm","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.009631013,0.003753762,0.004654894,0.002820285,0.003280357,0.007433627,0.007962259,0.004430557,0.0165603],"category_scores_gemma":[0.06049491,0.001318001,0.004973833,0.004655046,0.005019392,0.0196953,0.0097666,0.01230786,0.005399267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006936437,"about_ca_system_score_gemma":0.00349001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001881217,"about_ca_topic_score_gemma":0.002219224,"domain_scores_codex":[0.9828269,0.00401073,0.0009972241,0.004728192,0.004539538,0.002897426],"domain_scores_gemma":[0.9369403,0.04133091,0.002596165,0.01404684,0.003318045,0.001767827],"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.00225988,0.0006660101,0.00590822,0.002096498,0.0005190447,0.0004013643,0.00134855,0.3731632,0.01142225,0.4381051,0.02052538,0.1435847],"study_design_scores_gemma":[0.000137525,0.0003346574,0.0007394127,0.0002306384,0.0002316044,0.0004132229,0.0002155964,0.7171947,0.006006942,0.2629605,0.01146595,0.00006919706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278032,0.005446719,0.9196613,0.004315569,0.000412604,0.0002687158,0.0007601205,0.003085786,0.03326886],"genre_scores_gemma":[0.6422859,0.004161965,0.3275966,0.002750118,0.001344118,0.001685095,0.002108805,0.003251741,0.01481564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0165603,"threshold_uncertainty_score":0.05539966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02291329635721146,"score_gpt":0.2504942880361266,"score_spread":0.2275809916789152,"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."}}