{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003758321,0.0004741126,0.001135127,0.0003838652,0.00007005644,0.00002648748,0.0009370983,0.0004163219,0.00008580088],"category_scores_gemma":[0.00004976609,0.0005203759,0.0001798661,0.00006780367,0.001189201,0.0000687738,0.00173771,0.001472541,0.00001357246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004336443,"about_ca_system_score_gemma":0.00003667428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003725075,"about_ca_topic_score_gemma":0.0003284915,"domain_scores_codex":[0.9979787,0.0003855025,0.0006996678,0.0004144851,0.0001523199,0.0003693294],"domain_scores_gemma":[0.9976764,0.0004701955,0.0002625932,0.00137982,0.00009454535,0.0001164777],"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.0001228864,0.00006837158,0.001810671,0.0009694133,0.0004196682,0.00001574983,0.03248942,0.001773461,0.002815797,0.9564265,0.0003505194,0.002737561],"study_design_scores_gemma":[0.0009416447,0.0000409388,0.001077371,0.0003952855,0.00007228833,0.0000485224,0.0004006814,0.005798879,0.03492603,0.9550754,0.0006433264,0.0005796672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6870448,0.00161129,0.2876022,0.000100894,0.0005560424,0.0007607712,0.0001698498,0.0008043058,0.02134988],"genre_scores_gemma":[0.9008906,0.002285351,0.09622746,0.00002757625,0.00006002021,0.0003111946,0.0001192093,0.00007736134,0.000001222724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2138458,"threshold_uncertainty_score":0.9997248,"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."}}