{"id":"W2975679388","doi":"10.1109/isit.2019.8849528","title":"Private Information Retrieval from Locally Repairable Databases with Colluding Servers","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Code (set theory); Dimension (graph theory); Code rate; Field size; Private information retrieval; Computer science; Discrete mathematics; Locality; Combinatorics; Algorithm; Database; Theoretical computer science; Physics; Mathematics; Computer network; Decoding methods; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001374235,0.0001188823,0.0001317011,0.00009664917,0.0000675199,0.0001295999,0.0008744646,0.00003894287,0.00004604952],"category_scores_gemma":[0.0001207326,0.00009243008,0.0000161881,0.0005652903,0.00004114013,0.007247593,0.0007075412,0.0001195801,0.0003742164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008010195,"about_ca_system_score_gemma":0.0000602765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009490629,"about_ca_topic_score_gemma":0.00002034639,"domain_scores_codex":[0.9990055,0.00001270039,0.000187895,0.0002776022,0.0002981938,0.0002181025],"domain_scores_gemma":[0.9984608,0.00008714695,0.000126031,0.001220191,0.00006924622,0.00003663789],"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.0005287814,0.0001229746,0.04022052,0.0001599623,0.0001900308,0.0001046701,0.0009401325,0.01400318,0.01537468,0.8743103,0.01523378,0.03881104],"study_design_scores_gemma":[0.004685747,0.001202873,0.007449851,0.0004717221,0.00003236225,0.000059219,0.001958759,0.4568103,0.2857124,0.01314694,0.2263664,0.00210346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1683223,0.00001386992,0.8281443,0.000217149,0.0001097209,0.0002096568,0.00002961829,0.001264601,0.001688817],"genre_scores_gemma":[0.3369575,0.00001273225,0.6623438,0.0003877519,0.000007248475,0.000003451104,0.00008720893,0.000005747991,0.0001945639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8611633,"threshold_uncertainty_score":0.5254329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01509435698918285,"score_gpt":0.2270212789978661,"score_spread":0.2119269220086833,"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."}}