{"id":"W1536568986","doi":"10.1109/icc.2015.7248647","title":"A completely distributed algorithm for user association in HetSNets","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Association (psychology); Computational complexity theory; Quality of service; Time complexity; Distributed algorithm; Approximation algorithm; Algorithm; Information exchange; Order (exchange); Channel (broadcasting); Distributed computing; Computer network","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.0005407035,0.00005959074,0.00009792101,0.00004488325,0.00005213879,0.00009913398,0.0004334196,0.00003388136,0.00000878028],"category_scores_gemma":[0.0001323544,0.00005588406,0.0000250811,0.0003323956,0.000005682877,0.0002426689,0.0001719846,0.00006473783,0.00002247746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002083576,"about_ca_system_score_gemma":0.00004956444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001085908,"about_ca_topic_score_gemma":0.0001449089,"domain_scores_codex":[0.9993293,0.00008745381,0.0001525939,0.0001420381,0.0001282419,0.0001603975],"domain_scores_gemma":[0.9992406,0.0001674158,0.00005402773,0.0002593064,0.0002168339,0.00006186622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007580391,0.0002305462,0.008702504,0.000003281464,0.00002791998,0.000002406475,0.001256377,0.0004694371,0.00009105739,0.1633794,0.1607078,0.6651217],"study_design_scores_gemma":[0.0008060913,0.00003896583,0.004977561,0.000005986404,0.000001002001,7.718781e-7,0.00001985658,0.8205082,0.0001096506,0.001313868,0.1721149,0.0001031675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008150365,0.00008048675,0.9944203,0.003014054,0.0001318467,0.0001775344,0.000006338041,0.00008829636,0.001266045],"genre_scores_gemma":[0.6141909,0.00006788589,0.3813868,0.001700641,0.00008576919,0.0001941614,0.00009540454,0.00001039645,0.002268023],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8200388,"threshold_uncertainty_score":0.2278886,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08816987449417873,"score_gpt":0.3116664673804475,"score_spread":0.2234965928862688,"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."}}