{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219043,0.0007776894,0.001403264,0.00167388,0.001506194,0.00402493,0.004398429,0.002076359,0.005229712],"category_scores_gemma":[0.02711967,0.0007628338,0.0009002627,0.00247377,0.00274829,0.007620648,0.002794373,0.002114653,0.0005994016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003008413,"about_ca_system_score_gemma":0.001838788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004159867,"about_ca_topic_score_gemma":0.004397816,"domain_scores_codex":[0.9975534,0.0009311365,0.000104783,0.0005684925,0.0004589611,0.0003832561],"domain_scores_gemma":[0.9657122,0.02513876,0.003192359,0.002993026,0.00180307,0.001160611],"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.0006244604,0.0002975552,0.00586743,0.0004531296,0.0001166607,0.0002281589,0.0008816034,0.5449777,0.004677441,0.4068584,0.003674224,0.03134317],"study_design_scores_gemma":[0.0000567962,0.00006712176,0.001085054,0.00002434824,0.00004207228,0.00009059135,0.0003445963,0.7547467,0.001451121,0.2411242,0.000946101,0.00002130574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4843719,0.0009047455,0.5029199,0.001414784,0.00004984885,0.000138295,0.0003136036,0.0006308897,0.009256123],"genre_scores_gemma":[0.9452705,0.0003129059,0.05015687,0.0001286989,0.00005622665,0.00008509254,0.0003404098,0.0002111823,0.003438178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005229712,"threshold_uncertainty_score":0.02182764,"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."}}