{"id":"W3211971641","doi":"","title":"Verifiable Obtained Random Subsets for Improving SPHINCS","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Standardization; Theoretical computer science; Computation; Algorithm; Set (abstract data type); Computer security","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.000903939,0.0006642775,0.001128562,0.00038315,0.000392514,0.0005224798,0.002916218,0.0005436823,0.00006857435],"category_scores_gemma":[0.0005727446,0.0007000495,0.0008158262,0.0003063144,0.0003398617,0.0003692716,0.006196108,0.001374848,0.00003356042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007332618,"about_ca_system_score_gemma":0.0007181715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002073949,"about_ca_topic_score_gemma":0.000306001,"domain_scores_codex":[0.9953749,0.0004195003,0.0008007208,0.002074543,0.0002947872,0.001035617],"domain_scores_gemma":[0.995028,0.001166153,0.0005114463,0.002728906,0.0002636482,0.0003018015],"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.0002587332,0.0002221776,0.0005605733,0.0004617,0.0002381008,0.0001091952,0.002637966,0.0003631494,0.001915314,0.9822491,0.0008211154,0.01016281],"study_design_scores_gemma":[0.002704494,0.00009936118,0.001042788,0.0001064814,0.00009277122,0.00007679767,0.0001775624,0.04154816,0.003212738,0.9459559,0.004076868,0.0009060627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03559498,0.0006721964,0.9570428,0.0008074316,0.002623256,0.001383872,0.0003401324,0.0004157936,0.001119611],"genre_scores_gemma":[0.08586972,0.0001371387,0.9118758,0.0003673217,0.000281785,0.0006177434,0.000806624,0.00004296946,9.209666e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05027474,"threshold_uncertainty_score":0.999545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01530762856471051,"score_gpt":0.2551167513221477,"score_spread":0.2398091227574372,"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."}}