{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001910577,0.0001376406,0.0001582938,0.00008662635,0.0002003861,0.0001565658,0.0009164997,0.00006264389,0.00001848915],"category_scores_gemma":[0.00003989336,0.0001325892,0.0001379447,0.000427454,0.00005044705,0.0004335165,0.0002565842,0.0001131695,0.0001180355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005830787,"about_ca_system_score_gemma":0.00006375906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001888247,"about_ca_topic_score_gemma":0.000002699866,"domain_scores_codex":[0.9989642,0.00002568582,0.0001867406,0.0003633951,0.0001404478,0.000319552],"domain_scores_gemma":[0.9989486,0.000132605,0.00005576239,0.000597063,0.0001245128,0.0001414347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003183151,0.0004058325,0.00007849118,0.00001178038,0.000008954991,8.823453e-7,0.0002179097,6.800619e-7,0.00001902961,0.8588641,0.08033184,0.06005727],"study_design_scores_gemma":[0.0006984135,0.0001562189,0.0002216537,0.000008554207,0.000005997793,0.000002861619,0.000002607202,0.003817602,0.0004450464,0.09472553,0.8997259,0.0001896419],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003520944,0.002982742,0.9790034,0.001031469,0.004191888,0.000315695,0.00001970709,0.0003366264,0.008597568],"genre_scores_gemma":[0.9924207,0.000037772,0.007054144,0.0001866681,0.0001200945,0.00005193335,0.00001033641,0.000008376401,0.0001100177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9888997,"threshold_uncertainty_score":0.5406831,"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."}}