{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001499853,0.0008582764,0.001638163,0.0007758278,0.0009502912,0.001306048,0.001315317,0.001192093,0.002466401],"category_scores_gemma":[0.00407938,0.0004943322,0.0008274777,0.001813133,0.0007858775,0.001898124,0.002957308,0.00114395,0.000678164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009426528,"about_ca_system_score_gemma":0.001166281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009091114,"about_ca_topic_score_gemma":0.001253623,"domain_scores_codex":[0.9986334,0.0006150873,0.00005362597,0.0001741845,0.0003253503,0.0001982867],"domain_scores_gemma":[0.998539,0.0008954597,0.0001385952,0.0002047566,0.0001242678,0.00009804204],"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.0003035152,0.0001660148,0.0008460259,0.000206987,0.00005715053,0.0004248148,0.0003261402,0.8336452,0.008284969,0.0830028,0.003987658,0.06874882],"study_design_scores_gemma":[0.0000256821,0.00007739547,0.00007215551,0.00001000874,0.00001146193,0.00013195,0.00005617226,0.9818571,0.001446701,0.01403373,0.002264725,0.00001289669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01301208,0.0002691144,0.9823141,0.0001437747,0.00003539215,0.00005736779,0.00004638689,0.0001218305,0.003999929],"genre_scores_gemma":[0.7459332,0.000528553,0.2490823,0.0001371042,0.00005548159,0.0002353527,0.0001393933,0.00004843558,0.003840182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002466401,"threshold_uncertainty_score":0.008250952,"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."}}