{"id":"W1965026568","doi":"10.1016/j.dam.2011.05.004","title":"Analysing local algorithms in location-aware quasi-unit-disk graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unit disk graph; Algorithm; Vertex (graph theory); Mathematics; Set (abstract data type); Matching (statistics); Graph; Approximation algorithm; Computer science; Combinatorics; Wireless network","routes":{"ca_aff":true,"ca_fund":true,"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.0004727727,0.0003033303,0.0004143746,0.0004052445,0.0001837597,0.0001248257,0.001288225,0.0001144206,0.00004714528],"category_scores_gemma":[0.00001935479,0.0002854848,0.0001268253,0.001837488,0.0002198036,0.0003184644,0.0003576957,0.000293172,0.00008013023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004191115,"about_ca_system_score_gemma":0.00006498164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009861812,"about_ca_topic_score_gemma":0.00009011343,"domain_scores_codex":[0.9978986,0.00003370789,0.0006073957,0.0005283405,0.0004461819,0.0004857673],"domain_scores_gemma":[0.9983631,0.0001313385,0.0002064713,0.001062047,0.00009177138,0.0001452523],"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.000004698758,0.0004050389,0.000140786,0.0001197989,0.00004668826,0.00002020325,0.008420207,0.0001639667,0.00005198531,0.9547199,0.000038644,0.03586806],"study_design_scores_gemma":[0.0004003433,0.00004932992,0.0007582864,0.00008953734,0.00002731849,0.00001395721,0.002511888,0.4599262,0.00101325,0.5346776,0.00006801158,0.0004643382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004445286,0.00005918959,0.9859689,0.00004913679,0.0001151012,0.0002889785,0.00000534086,0.0002184573,0.008849549],"genre_scores_gemma":[0.6257887,0.00001352008,0.3739821,0.00008760704,0.0000210946,0.00005069934,0.0000116216,0.00002085032,0.00002374041],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6213434,"threshold_uncertainty_score":0.9999597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04545922886075514,"score_gpt":0.2643196687415958,"score_spread":0.2188604398808406,"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."}}