{"id":"W2044603066","doi":"10.1007/s00493-005-0014-6","title":"Lower Bounds For Concurrent Zero Knowledge*","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Asynchronous communication; Zero (linguistics); Argument (complex analysis); Mathematics; Class (philosophy); Discrete mathematics; Theoretical computer science; Computer science; Artificial intelligence; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01237048,0.004706194,0.004825367,0.006148186,0.007520476,0.01923754,0.01227305,0.006022232,0.0328567],"category_scores_gemma":[0.08067451,0.003119605,0.004129402,0.008626539,0.0108964,0.04559422,0.01880712,0.02043669,0.006614635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01017773,"about_ca_system_score_gemma":0.00842835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003066727,"about_ca_topic_score_gemma":0.003965853,"domain_scores_codex":[0.9819759,0.003578008,0.0007621195,0.003063287,0.005470686,0.005150022],"domain_scores_gemma":[0.831974,0.1320806,0.004758535,0.01872306,0.006853611,0.005610171],"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.0006643879,0.0002579353,0.0009255739,0.000533113,0.0000967931,0.0001347263,0.0005002694,0.01856111,0.001211735,0.9408731,0.01228995,0.02395134],"study_design_scores_gemma":[0.00005072951,0.00003411081,0.0001151736,0.00007993921,0.00007321488,0.00009790508,0.00005985691,0.03188118,0.0009846555,0.9634964,0.003095091,0.000031814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06164723,0.006772775,0.7192003,0.01979928,0.001303672,0.0004512148,0.002563807,0.002603916,0.1856577],"genre_scores_gemma":[0.8069646,0.006277134,0.1212122,0.004382572,0.003733218,0.001321465,0.002886054,0.002061362,0.05116141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0328567,"threshold_uncertainty_score":0.1099166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01841344362814925,"score_gpt":0.2793149578512453,"score_spread":0.260901514223096,"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."}}