{"id":"W2535290256","doi":"10.1109/tit.2018.2823326","title":"Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond; University of Toronto","keywords":"Finite field; Secret sharing; Mathematics; Algebraic number; Algebraic geometry; Construct (python library); Computer science; Discrete mathematics; Field (mathematics); Theoretical computer science; Topology (electrical circuits); Cryptography; Algorithm; Geometry; Combinatorics; Computer network; Pure mathematics","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.0008956881,0.0001567153,0.0001142851,0.000540826,0.0006234345,0.0002544004,0.0005396031,0.00008236689,0.0001052625],"category_scores_gemma":[0.00001434604,0.0001492282,0.00007387182,0.0005685231,0.0001914251,0.0008856257,0.000008784802,0.0002475781,0.00009538396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003857692,"about_ca_system_score_gemma":0.00003005463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002512649,"about_ca_topic_score_gemma":0.000001997921,"domain_scores_codex":[0.9989889,0.000129441,0.000264902,0.0001777259,0.0002476446,0.0001913961],"domain_scores_gemma":[0.9986648,0.0003035585,0.0001185758,0.0007181684,0.000114152,0.00008075334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002573702,0.0001742266,0.00002396297,0.00005173934,0.00004935776,2.712459e-7,0.004231348,0.0284935,0.0001090605,0.8560883,0.00006326522,0.1104575],"study_design_scores_gemma":[0.001362438,0.000701443,0.0004735628,0.0002683622,0.00003544063,0.000009667768,0.0007877651,0.9320263,0.02550009,0.03588315,0.002427936,0.0005238656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09072758,0.000017645,0.9055628,0.0001455764,0.0002156629,0.0001645328,0.00001657689,0.000246669,0.002903026],"genre_scores_gemma":[0.9949676,0.000008661603,0.004282829,0.0006587469,0.00001559262,0.00003081698,0.000007473086,0.000006608412,0.000021632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9042401,"threshold_uncertainty_score":0.6085351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008154257861510495,"score_gpt":0.2242574001546431,"score_spread":0.2161031422931326,"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."}}