{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","routes":{"ca_aff":true,"ca_fund":true,"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.00126221,0.0001915917,0.000592821,0.0001583431,0.00006299785,0.00008021621,0.001425856,0.0001793551,0.00003339847],"category_scores_gemma":[0.0008725004,0.0001190197,0.0002317443,0.0001657962,0.000243131,0.00008570003,0.0008118027,0.0007794233,0.00000747938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001295999,"about_ca_system_score_gemma":0.00008419184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.993816e-7,"about_ca_topic_score_gemma":9.911223e-8,"domain_scores_codex":[0.9982426,0.0002314086,0.0007325496,0.0002423084,0.000378238,0.0001729352],"domain_scores_gemma":[0.9970617,0.00122763,0.0008806216,0.0005295938,0.0001958147,0.0001046511],"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.00004111545,0.0001169289,0.00002001608,0.0002724208,0.00009292867,0.00001193095,0.0006653564,0.00005887638,0.0006338882,0.9969357,0.0005948814,0.0005559045],"study_design_scores_gemma":[0.0001461521,0.0002884971,0.00008478449,0.0004328543,0.00006666521,0.0001089579,0.00009373292,0.01053038,0.001243926,0.9868411,0.00005534572,0.0001075369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1200235,0.000359978,0.851594,0.02707407,0.000271391,0.000163316,0.000003103943,0.00002492753,0.000485716],"genre_scores_gemma":[0.9258237,0.00007026162,0.07355598,0.000463608,0.00006830873,0.0000054324,2.970128e-7,0.000008662437,0.00000376421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8058002,"threshold_uncertainty_score":0.4853483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06202159025001362,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"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."}}