{"id":"W3000465536","doi":"10.1109/tit.2020.2967048","title":"On the Commitment Capacity of Unfair Noisy Channels","year":2020,"lang":"","type":"article","venue":"University of Washington Tacoma Digital Commons (University of Washington Tacoma)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Channel (broadcasting); Cryptography; Binary symmetric channel; Binary number; Adversary; Cryptographic primitive; Channel capacity; Computer security; Point (geometry); Theoretical computer science; Noise (video); Cryptographic protocol; Computer network; Mathematics; Artificial intelligence; Arithmetic","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007447788,0.0009950672,0.001944858,0.0007421212,0.001017209,0.0001744992,0.006748178,0.0007151656,0.0004789149],"category_scores_gemma":[0.000303304,0.001274016,0.001266532,0.001768565,0.002401992,0.002141392,0.002982301,0.001992092,0.00007755127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005452165,"about_ca_system_score_gemma":0.0002039902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001695715,"about_ca_topic_score_gemma":0.0003696283,"domain_scores_codex":[0.9951282,0.0006539235,0.0009673628,0.0009187596,0.001440187,0.0008915576],"domain_scores_gemma":[0.9925107,0.001785228,0.001775179,0.002562473,0.0007103728,0.0006559942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.006342455,0.01073814,0.01423412,0.007826529,0.009395376,0.0005393893,0.2322408,0.02868563,0.04247622,0.4678922,0.1588641,0.02076497],"study_design_scores_gemma":[0.0223753,0.01282177,0.01712786,0.0117035,0.00393563,0.00007886578,0.2706237,0.2032146,0.1224095,0.01574809,0.3087177,0.01124351],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489446,0.0002651342,0.008057766,0.01270809,0.0002517327,0.001658789,0.002211176,0.0006135519,0.02528911],"genre_scores_gemma":[0.996756,0.0004068428,0.002098673,0.000148792,0.00004122516,3.987213e-7,0.0001586345,0.0001075653,0.0002818397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4521441,"threshold_uncertainty_score":0.998971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02639158041173163,"score_gpt":0.189650103942081,"score_spread":0.1632585235303493,"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."}}