{"id":"W3028617919","doi":"","title":"Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures.","year":2009,"lang":"en","type":"preprint","venue":"BIROn (Birkbeck, University of London)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Overhead (engineering); Computer science; Access structure; Scheme (mathematics); Adversary; Monotone polygon; Transmission (telecommunications); Decoding methods; Connection (principal bundle); Set (abstract data type); Theoretical computer science; Computer network; Mathematics; Computer security; Algorithm; Cryptography; Telecommunications","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.0003906795,0.0004826239,0.000696574,0.0003903185,0.0004647517,0.0001697867,0.001999672,0.0006272789,0.00008958772],"category_scores_gemma":[0.00001183313,0.0005706264,0.0003913051,0.0002624668,0.0001965826,0.0007931393,0.001427073,0.0007276728,0.000002052893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001114968,"about_ca_system_score_gemma":0.0002727225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009577181,"about_ca_topic_score_gemma":0.0004575158,"domain_scores_codex":[0.9972867,0.000109217,0.0003166103,0.001330315,0.0004411667,0.0005159642],"domain_scores_gemma":[0.9980212,0.0000825505,0.0003554541,0.001098563,0.0001259281,0.0003163465],"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.003887312,0.002053488,0.01379226,0.01066981,0.001908133,0.000642031,0.02756118,0.006202586,0.01053349,0.7383138,0.01746005,0.1669758],"study_design_scores_gemma":[0.01759633,0.002134637,0.09100902,0.002130653,0.001542248,0.0001335438,0.001634171,0.2327072,0.004533172,0.4709983,0.1694663,0.006114372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4269196,0.002448017,0.5669308,0.0006087145,0.0003189277,0.001007971,0.0005310863,0.0002678146,0.0009670467],"genre_scores_gemma":[0.5677475,0.002620631,0.4278783,0.0002272445,0.0002082482,0.000002987628,0.0009162495,0.00005794698,0.000340943],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2673155,"threshold_uncertainty_score":0.9996745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202141040254749,"score_gpt":0.2328595851750756,"score_spread":0.2108381747725281,"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."}}