{"id":"W2949162070","doi":"10.48550/arxiv.quant-ph/0502030","title":"Oblivious transfer and quantum non-locality","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Communication source; Computer science; Theoretical computer science; Cryptography; Locality; Protocol (science); Realization (probability); Encryption; Simple (philosophy); Transfer (computing); Quantum; Mathematics; Algorithm; Computer security; Computer network; Physics; Parallel computing","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.000468492,0.0004955318,0.0005446495,0.0001526914,0.0002322618,0.0002639401,0.001481154,0.0003588673,0.00001120899],"category_scores_gemma":[0.00002727302,0.0004435107,0.0002085771,0.0002326081,0.0001458846,0.0001323803,0.001639138,0.001305792,0.00006453999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004529486,"about_ca_system_score_gemma":0.0001678715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000195725,"about_ca_topic_score_gemma":0.00002444904,"domain_scores_codex":[0.9971864,0.0001272821,0.000464438,0.001273161,0.000362385,0.0005862943],"domain_scores_gemma":[0.9981385,0.0001248187,0.00009352977,0.00130991,0.00008353533,0.000249666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006787245,0.001365565,0.2435016,0.00155194,0.0007048585,0.0007551794,0.01880195,0.05185541,0.001999428,0.01347591,0.003379659,0.6625407],"study_design_scores_gemma":[0.0004630592,0.000114314,0.2389271,0.0002484468,0.000031844,0.00006732657,0.0000130729,0.7513332,0.0005109108,0.004188193,0.003242688,0.0008598545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7002299,0.0005528827,0.2956688,0.001944942,0.0008855699,0.0002212471,0.000009945787,0.000300277,0.0001864606],"genre_scores_gemma":[0.9892398,0.0001398636,0.009024121,0.00077811,0.0006402989,0.00001858053,0.000008982914,0.00003355385,0.0001167139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6994778,"threshold_uncertainty_score":0.9998017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02266448604026933,"score_gpt":0.2504380698494494,"score_spread":0.2277735838091801,"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."}}