{"id":"W1948783854","doi":"10.48550/arxiv.1004.3320","title":"Approximation Algorithms for Dominating Set in Disk Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Euclidean geometry; Set (abstract data type); Graph; Upper and lower bounds; Approximation algorithm; Unit disk graph; Unit disk; Running time; Discrete mathematics; Algorithm; Computer science; Vertex (graph theory); Geometry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009007184,0.0002784374,0.0003176639,0.000713436,0.0001710824,0.0001258486,0.002172265,0.0003446171,0.000006321085],"category_scores_gemma":[0.000163984,0.0003267876,0.0002055461,0.0009737778,0.0001594242,0.0006140723,0.001688968,0.001041705,0.00001230404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001502239,"about_ca_system_score_gemma":0.0001264934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004844611,"about_ca_topic_score_gemma":0.00007007528,"domain_scores_codex":[0.9977933,0.0001690817,0.0002339854,0.001176072,0.0001259061,0.0005016165],"domain_scores_gemma":[0.9978589,0.0004021345,0.0002395357,0.001157971,0.0002064495,0.000135024],"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.00004792932,0.00008845494,0.001176833,0.0001506384,0.00002937725,0.00007159701,0.0005019495,0.045126,0.0002838249,0.9426922,0.00002355578,0.009807662],"study_design_scores_gemma":[0.0004347349,0.00002438231,0.0002647742,0.00003901824,0.000006428679,0.000001356281,0.00005425787,0.5081722,0.0003479035,0.4903899,0.00004866162,0.0002163848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2010935,0.00001817811,0.7971925,0.00005833151,0.0003494327,0.0007487207,0.0000296017,0.0001308243,0.0003789355],"genre_scores_gemma":[0.9458593,0.00003624836,0.05365255,0.0000213703,0.00003927424,0.0000137846,0.00003777954,0.00002193471,0.0003177488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7447658,"threshold_uncertainty_score":0.9999184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09476514679204252,"score_gpt":0.2512652688231497,"score_spread":0.1565001220311072,"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."}}