{"id":"W3208101893","doi":"10.1007/978-3-030-90567-5_35","title":"Verifiable Obtained Random Subsets for Improving SPHINCS+","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Theoretical computer science; Standardization; 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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001303579,0.0005798565,0.0007136496,0.0006574016,0.0004660091,0.001124067,0.003596003,0.0003664941,0.00002868544],"category_scores_gemma":[0.000248406,0.0005551515,0.0003248272,0.000825851,0.0004854261,0.00097801,0.00158851,0.0006841191,0.00001237768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001693445,"about_ca_system_score_gemma":0.0008582867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004408445,"about_ca_topic_score_gemma":0.0001688221,"domain_scores_codex":[0.9957503,0.00003486309,0.0005717467,0.002029186,0.0007246871,0.000889206],"domain_scores_gemma":[0.9962426,0.0008559892,0.0002955768,0.001997966,0.0003791231,0.0002286737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000646233,0.00008338868,0.00003485365,0.0002824383,0.0000338894,0.0001385944,0.0007098444,0.004242129,0.0009387058,0.2427849,0.0001609356,0.7505257],"study_design_scores_gemma":[0.002217319,0.000241068,0.00003540409,0.0003731478,0.00002871974,0.00009329305,4.624984e-7,0.6089872,0.005431823,0.3683235,0.01286363,0.001404421],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006775076,0.00131695,0.9936215,0.0003962633,0.002496714,0.0006914241,0.00004923505,0.000192253,0.0011679],"genre_scores_gemma":[0.04457394,0.00006996911,0.9526991,0.001529432,0.0008112189,0.00004483823,0.00008366715,0.00005099594,0.0001368399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7491213,"threshold_uncertainty_score":0.9999129,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01312236478236734,"score_gpt":0.2334616501309755,"score_spread":0.2203392853486082,"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."}}