{"id":"W2886588140","doi":"10.1109/icc.2018.8422115","title":"Efficient Interference-Aware D2D Pairing for Collaborative Data Dissemination","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Pairing; Exploit; Cache; Interference (communication); Lagrangian relaxation; Mobile device; Enhanced Data Rates for GSM Evolution; Key (lock); Distributed computing; Upper and lower bounds; Computer network; Focus (optics); Scheme (mathematics); Mathematical optimization; Channel (broadcasting); Telecommunications; Mathematics","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.0002720594,0.00007660044,0.0000783422,0.0000550153,0.0001479122,0.0001713476,0.000928568,0.00002443077,0.00001147925],"category_scores_gemma":[0.00005619615,0.0000628058,0.00001922148,0.00021953,0.00003417347,0.000204601,0.0004848361,0.00003868917,0.00003385463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002725285,"about_ca_system_score_gemma":0.00004296007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001618157,"about_ca_topic_score_gemma":0.00004206528,"domain_scores_codex":[0.9992231,0.00002468699,0.0001211429,0.0003634944,0.0001191432,0.0001484971],"domain_scores_gemma":[0.998852,0.0001439071,0.0000444489,0.0006414187,0.0002771852,0.00004100116],"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.0001120407,0.0003925008,0.0008161356,0.00006160719,0.000101962,0.000007685223,0.009678813,0.0001808379,0.01291324,0.0805535,0.130383,0.7647986],"study_design_scores_gemma":[0.0001290992,0.0001304788,0.0001178881,0.0000431115,0.000003946277,0.000001467946,0.0003990144,0.9957627,0.001952144,0.0001452886,0.001209803,0.0001050733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0308786,0.00002570342,0.9659345,0.0006372581,0.0004708983,0.0001709027,0.00002657538,0.0001420804,0.001713461],"genre_scores_gemma":[0.9923556,0.000001278154,0.006587515,0.0001141992,0.000101707,0.0000130182,0.00002201597,0.000003850663,0.0008007423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9955819,"threshold_uncertainty_score":0.2561146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05914446560441326,"score_gpt":0.3129038478038159,"score_spread":0.2537593821994026,"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."}}