{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283972,0.0003206365,0.001301429,0.00002070257,0.0001142808,0.00001501997,0.0005153549,0.00002032463,0.00004988972],"category_scores_gemma":[0.0001621742,0.0002021938,0.0006139643,0.0009171802,0.0004480076,0.00008977977,0.0002582021,0.0002454157,0.000008901298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005113422,"about_ca_system_score_gemma":0.0001534992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001476836,"about_ca_topic_score_gemma":0.000008856089,"domain_scores_codex":[0.9974638,0.0003639875,0.0009211305,0.0004663733,0.0004125038,0.0003722145],"domain_scores_gemma":[0.9976151,0.0002309472,0.0006987515,0.00103378,0.0003170414,0.0001044065],"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.00001702567,0.00276093,0.00243462,0.005606922,0.00008492448,1.584021e-7,0.0001495436,0.000005672674,0.03116921,0.930024,0.0001000351,0.02764702],"study_design_scores_gemma":[0.0004483499,0.000229634,0.0006787087,0.007360857,0.0004918062,4.282745e-7,0.0000210742,0.009694744,0.05618193,0.9206821,0.003850501,0.0003598477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.985346,0.005486419,0.00429898,0.0003426905,0.00004432126,0.004101571,0.00009337319,0.00001506138,0.0002715826],"genre_scores_gemma":[0.9982322,0.0005215792,0.0002685441,0.0001487738,0.0002360247,0.0005396846,0.00002289343,0.00002634141,0.000003934716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02728717,"threshold_uncertainty_score":0.8245224,"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."}}