{"id":"W2295167940","doi":"10.1515/jmc-2018-0012","title":"Multi-prover proof of retrievability","year":2018,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Gas meter prover; Cryptography; Theoretical computer science; Retrievability; Scheme (mathematics); Protocol (science); Confidentiality; Discrete mathematics; Algorithm; Computer security; Mathematics; Mathematical proof; Computer network; Information retrieval","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.002218481,0.0002845469,0.001221164,0.0003003533,0.00004147548,0.00006134636,0.002399079,0.000560845,0.00008890754],"category_scores_gemma":[0.002082991,0.0002142476,0.0005862454,0.0002818546,0.0003371816,0.0002627667,0.001813072,0.001130874,0.00001376258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681165,"about_ca_system_score_gemma":0.0003437487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002041493,"about_ca_topic_score_gemma":0.000002393072,"domain_scores_codex":[0.9966505,0.0003296739,0.00169938,0.0004065701,0.000595681,0.0003182379],"domain_scores_gemma":[0.9953213,0.0004169358,0.00185385,0.001304517,0.0009062568,0.0001971888],"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.0005498419,0.007449652,0.002626715,0.006988311,0.001025322,0.0002481323,0.004860306,0.00003206728,0.001765041,0.9519231,0.01404936,0.008482195],"study_design_scores_gemma":[0.0006808641,0.0006042341,0.001164671,0.0003432503,0.00009192085,0.0003178118,0.00005209745,0.006556402,0.004820596,0.9846854,0.0004262706,0.0002565037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06008916,0.0002705938,0.9370512,0.0008966445,0.001031286,0.0002807088,0.00002484573,0.00002288526,0.0003326875],"genre_scores_gemma":[0.2986345,0.00001663289,0.7010592,0.00006316578,0.0002080904,0.000004129603,0.00000175888,0.00001058661,0.000001905491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2385453,"threshold_uncertainty_score":0.8736763,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03915340734756542,"score_gpt":0.3104437271759212,"score_spread":0.2712903198283558,"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."}}