{"id":"W3213751516","doi":"10.1101/2021.11.10.468090","title":"Secure federated Boolean count queries using fully-homomorphic cryptography","year":2021,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Homomorphic encryption; Cryptography; Encryption; Set operations; Benchmarking; Theoretical computer science; Set (abstract data type); Computer security","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009338363,0.001164296,0.001118917,0.0007447039,0.000821658,0.003630236,0.00236127,0.001009272,0.00007520839],"category_scores_gemma":[0.000149789,0.001330856,0.0005827617,0.002706748,0.0003569525,0.001242626,0.002636373,0.001793818,0.0000320059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002402077,"about_ca_system_score_gemma":0.001657748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002896053,"about_ca_topic_score_gemma":0.00004093843,"domain_scores_codex":[0.9938995,0.0004308997,0.000981446,0.00247348,0.001037171,0.001177472],"domain_scores_gemma":[0.9938344,0.0001034255,0.0007523692,0.003367192,0.001349775,0.0005927737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001337116,0.001758851,0.02481319,0.002785539,0.002050662,0.002512123,0.0004681468,0.0006114028,0.7577018,0.2039004,0.00324668,0.00001756078],"study_design_scores_gemma":[0.005749646,0.0006693068,0.1523216,0.007939816,0.001415255,0.000003037163,0.0002231229,0.08249867,0.6562274,0.0007651616,0.0731658,0.01902123],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.584915,0.004455785,0.4043925,0.000266406,0.002935085,0.0007122818,0.0004188818,0.001893174,0.00001091772],"genre_scores_gemma":[0.8976998,0.000499342,0.1005354,0.0005567279,0.0004507207,0.00009668579,0.000002574144,0.0001584796,2.040709e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3127849,"threshold_uncertainty_score":0.9989141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01610011259928674,"score_gpt":0.2181251747493397,"score_spread":0.202025062150053,"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."}}