{"id":"W2767434137","doi":"10.1103/physreva.97.042302","title":"Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Ontario Ministry of Research, Innovation and Science; Government of Canada","keywords":"Generality; Probabilistic logic; Generalization; Impossibility; Alice (programming language); Cheating; Computer science; Bit (key); Cone (formal languages); Simple (philosophy); Task (project management); Set (abstract data type); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence; Computer security; Law; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.005824942,0.000988766,0.001275336,0.001072002,0.001854678,0.00335346,0.002300526,0.002242073,0.008773699],"category_scores_gemma":[0.01479152,0.0006957501,0.002055878,0.001125566,0.007568229,0.007973155,0.004235831,0.009255412,0.0009613177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001639287,"about_ca_system_score_gemma":0.00257456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009507363,"about_ca_topic_score_gemma":0.0005372733,"domain_scores_codex":[0.9964536,0.001209074,0.0002124853,0.0005486524,0.001164046,0.0004121088],"domain_scores_gemma":[0.9885159,0.007901797,0.0006608567,0.001403692,0.001061954,0.0004557778],"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.000003650215,0.00001138862,0.00003092343,0.00003679179,0.000005445608,0.00004529007,0.00003975554,0.001944893,0.0001271658,0.9955095,0.0007325904,0.001512508],"study_design_scores_gemma":[0.000008809592,0.000008183963,0.0000550567,0.00003386967,0.000003570528,0.00003812655,0.00001395767,0.01178535,0.0001283138,0.9861222,0.00179307,0.000009537821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03494432,0.002169559,0.8209202,0.01084859,0.0007123125,0.0002389065,0.0005402933,0.0002157264,0.1294101],"genre_scores_gemma":[0.8043482,0.004670858,0.171148,0.003455426,0.001206068,0.0009083751,0.0004731538,0.0002005316,0.01358945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008773699,"threshold_uncertainty_score":0.03080559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0286548191949493,"score_gpt":0.3799231115420044,"score_spread":0.3512682923470551,"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."}}