{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850479,0.00004553326,0.00007930801,0.00004078185,0.0001041593,0.0001408825,0.002416717,0.00002222186,0.00001529786],"category_scores_gemma":[0.0002310825,0.00002670994,0.000143985,0.0001340913,0.00004369194,0.0004632437,0.0003901916,0.0001051922,0.000009693603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002324587,"about_ca_system_score_gemma":0.00003496651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003684891,"about_ca_topic_score_gemma":7.6553e-7,"domain_scores_codex":[0.9994519,0.00002403491,0.0001800106,0.00005601812,0.0001874216,0.0001006491],"domain_scores_gemma":[0.9989246,0.00009993529,0.0001760208,0.0006011853,0.0001628373,0.00003549481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003311623,0.0003915295,0.0003923899,0.00004758805,0.0001190761,0.000004773889,0.001222748,0.001323964,0.001954206,0.123182,0.3059138,0.5654148],"study_design_scores_gemma":[0.0003541678,0.0001559969,0.002641995,0.00003197163,0.000007673641,0.00009968295,0.00003024348,0.1125162,0.001253611,0.8653391,0.01749446,0.00007492598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01967457,0.00007551608,0.9667267,0.01181682,0.001390851,0.0001027689,3.646991e-7,0.000008946987,0.0002034502],"genre_scores_gemma":[0.6416588,0.00000649621,0.3568637,0.0008604471,0.0003402389,0.000005502561,8.997006e-8,0.000004791195,0.0002599148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.742157,"threshold_uncertainty_score":0.4490901,"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."}}