{"id":"W2096297385","doi":"10.1109/isit.2010.5513405","title":"On the achievable rates in decentralized networks with Randomized Masking","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Computer science; Channel (broadcasting); Entropy power inequality; Interference (communication); Transmission (telecommunications); Upper and lower bounds; Information theory; Masking (illustration); Topology (electrical circuits); Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications; Combinatorics; Entropy rate; Statistics; Principle of maximum entropy; Artificial intelligence","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.000608799,0.0001073337,0.0002083605,0.00005144356,0.00004237913,0.00005519587,0.0002928537,0.0000670119,0.0002426509],"category_scores_gemma":[0.0000707682,0.00006115834,0.00003355452,0.0001676534,0.00006629156,0.00006711086,0.00002788073,0.0004871785,0.000007741095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001414468,"about_ca_system_score_gemma":0.000005489207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005187982,"about_ca_topic_score_gemma":0.0006347504,"domain_scores_codex":[0.9993993,0.00009579348,0.0001701947,0.00007667322,0.00008414654,0.0001738737],"domain_scores_gemma":[0.9985605,0.0009248398,0.00002272359,0.0004494815,0.00001759619,0.00002478503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006931789,0.000119468,0.001421811,0.00002490361,0.0001338482,0.000005671854,0.001067075,0.1409143,0.004749529,0.8378089,0.00380323,0.003019442],"study_design_scores_gemma":[0.02732114,0.00001305036,0.0002578225,0.00007793112,0.00001061696,0.000003676357,0.00005806511,0.9493183,0.01502122,0.005209768,0.002441457,0.0002669701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8017713,0.0002518753,0.1342203,0.001628354,0.0001435017,0.001336487,6.687212e-7,0.001509834,0.05913769],"genre_scores_gemma":[0.9930872,0.0002221165,0.00631112,0.0001676405,0.000009795632,0.0001372957,0.000002846378,0.00002348316,0.00003844065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8325991,"threshold_uncertainty_score":0.2656857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005880159251118996,"score_gpt":0.2184026374757798,"score_spread":0.2125224782246608,"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."}}