{"id":"W2952499149","doi":"10.48550/arxiv.1310.3486","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Asynchronous communication; Computation; Computer science; Latency (audio); Secure multi-party computation; Communication complexity; Binary logarithm; Theoretical computer science; Function (biology); Distributed computing; Algorithm; Computer network; Mathematics; Discrete mathematics","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.0002789636,0.0004880737,0.000457968,0.0003691374,0.0003245555,0.0003452868,0.002086993,0.0004408222,0.00006558132],"category_scores_gemma":[0.00002701866,0.0005462451,0.0003388827,0.0008205963,0.0002391279,0.0005251718,0.002795576,0.0007945169,0.0002947856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000222719,"about_ca_system_score_gemma":0.0002532821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009864762,"about_ca_topic_score_gemma":0.0001631214,"domain_scores_codex":[0.997098,0.000229056,0.0003246164,0.001594848,0.0001874239,0.0005660051],"domain_scores_gemma":[0.9973175,0.0001544853,0.0003894823,0.001556769,0.0002749807,0.0003068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002984089,0.0003833775,0.001432157,0.0001823832,0.0001336373,0.0001724041,0.00200787,0.4936948,0.00002806121,0.4977485,0.00223777,0.001949153],"study_design_scores_gemma":[0.0006170326,0.00007792179,0.002235712,0.00009910708,0.00005136646,0.000006952448,0.0002193327,0.9520002,0.00007061909,0.04249134,0.00139749,0.0007329251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3166808,0.0001316608,0.6805517,0.00006836418,0.0008092375,0.0004647436,0.00008375679,0.0004129351,0.0007967856],"genre_scores_gemma":[0.9890293,0.0001286438,0.01039649,0.0001153831,0.0000943258,0.000003560779,0.0001765836,0.00002079573,0.00003492805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6723484,"threshold_uncertainty_score":0.9996989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03998496174303398,"score_gpt":0.1858001795842355,"score_spread":0.1458152178412015,"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."}}