{"id":"W2573846703","doi":"10.3390/cryptography1020011","title":"Simple, Near-Optimal Quantum Protocols for Die-Rolling","year":2017,"lang":"en","type":"preprint","venue":"Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre for Quantum Technologies; Ministry of Education, India; National University of Singapore; National Research Foundation","keywords":"Oblivious transfer; Cryptographic protocol; Computer science; Coin flipping; Commit; Generalization; Simple (philosophy); Cryptography; Quantum; Cryptographic primitive; Task (project management); Integer (computer science); Theoretical computer science; Commitment scheme; Protocol (science); State (computer science); Algorithm; Mathematics; Physics; Quantum mechanics; Engineering; Philosophy","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007052585,0.0006728562,0.0007944123,0.0003377315,0.001323507,0.002836409,0.004476761,0.0004477976,0.00000434965],"category_scores_gemma":[0.0001179496,0.0006136327,0.001064539,0.0002068007,0.000266594,0.0001951717,0.002649604,0.001089536,0.00001161478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002182362,"about_ca_system_score_gemma":0.0003242436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004331487,"about_ca_topic_score_gemma":0.000003958943,"domain_scores_codex":[0.9963549,0.00009590182,0.0005913867,0.001533186,0.0004916635,0.0009329655],"domain_scores_gemma":[0.9956241,0.0002304232,0.0007459329,0.002854073,0.000280097,0.0002653691],"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.0003831154,0.001025279,0.003147252,0.004139616,0.001227208,0.0002187168,0.005600305,0.2686748,0.0003800213,0.117744,0.01633394,0.5811257],"study_design_scores_gemma":[0.0005738764,0.0002934214,0.0007641106,0.0004227442,0.00002309416,0.000006495194,0.000005022575,0.7942193,0.0001637666,0.1367337,0.06606502,0.0007295095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01653495,0.0004047579,0.9669902,0.0005572503,0.001288733,0.01318014,0.0000798504,0.0007307176,0.0002333346],"genre_scores_gemma":[0.07433328,0.00003160198,0.9067453,0.0003194684,0.001584524,0.01675328,0.00008054532,0.0001269822,0.00002504189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5803962,"threshold_uncertainty_score":0.9999766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03229937241974729,"score_gpt":0.315525455761036,"score_spread":0.2832260833412887,"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."}}