{"id":"W2950512683","doi":"","title":"Common Randomness and Secret Key Capacities of Two-way Channels.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Channel (broadcasting); Computer science; Channel capacity; Coding (social sciences); Binary number; Key (lock); Theoretical computer science; Cryptography; Channel code; Binary erasure channel; Key generation; Information theory; Binary symmetric channel; Information-theoretic security; Discrete mathematics; Algorithm; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","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.004398784,0.001128271,0.0009733031,0.002135533,0.001628094,0.00423079,0.002172608,0.001743044,0.006452051],"category_scores_gemma":[0.02415022,0.000779917,0.001030409,0.001968134,0.005528837,0.007317227,0.004622205,0.003412777,0.0007152147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003574216,"about_ca_system_score_gemma":0.001811213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001402013,"about_ca_topic_score_gemma":0.0007911194,"domain_scores_codex":[0.994885,0.00176282,0.0001668785,0.000505644,0.001502149,0.001177458],"domain_scores_gemma":[0.9597914,0.03223351,0.002150847,0.003052876,0.00172278,0.001048674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001482501,0.0000428585,0.0002243078,0.00009534654,0.00002363492,0.0001201188,0.0002062264,0.06523127,0.002020892,0.9257765,0.001508442,0.004602291],"study_design_scores_gemma":[0.0000479474,0.00005271046,0.0002283469,0.00007613071,0.00002733055,0.0002308327,0.00009414794,0.3241542,0.003164839,0.6692805,0.00259121,0.00005172882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2178816,0.002410102,0.7037318,0.002991053,0.0002182631,0.0002476876,0.001175882,0.0003586712,0.07098487],"genre_scores_gemma":[0.976508,0.0007523854,0.01802726,0.0001720447,0.0001071198,0.0003622355,0.0002154961,0.00006907276,0.00378646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006452051,"threshold_uncertainty_score":0.02593291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02376182375468645,"score_gpt":0.2554894605825143,"score_spread":0.2317276368278279,"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."}}