{"id":"W2982581272","doi":"10.14778/3364324.3364332","title":"Secure multi-party functional dependency discovery","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Profiling (computer programming); Computation; Secure two-party computation; Cryptography; Dependency (UML); Functional dependency; Access control; Distributed computing; Secure multi-party computation; Cryptographic protocol; Semantics (computer science); Data anonymization; Theoretical computer science; Computer security; Data mining; Information privacy; Algorithm; Relational database; Programming language; Artificial intelligence","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.0002320507,0.0001410649,0.0001468314,0.00006909713,0.0000985036,0.0001423307,0.001077998,0.00004910537,0.00004185717],"category_scores_gemma":[0.00003647935,0.00009349541,0.0001701739,0.0003644288,0.00004554585,0.001216121,0.0007364225,0.0001685358,0.00003589195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004106265,"about_ca_system_score_gemma":0.00004186971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002719389,"about_ca_topic_score_gemma":0.000005476553,"domain_scores_codex":[0.9985757,0.000005622492,0.0002147404,0.0003665836,0.0006025831,0.0002347566],"domain_scores_gemma":[0.9993086,0.00002695515,0.0001698957,0.0002835661,0.0001564432,0.00005448033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003504395,0.0003991121,0.04581522,0.0001313767,0.00006742489,4.189937e-7,0.00106835,0.00001918685,0.03830579,0.9073943,0.005568607,0.001195194],"study_design_scores_gemma":[0.006896248,0.0006783251,0.2438067,0.0005192861,0.0001334265,0.0001376146,0.001864002,0.01283431,0.4556351,0.2308028,0.04493492,0.001757212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9462669,0.0007069625,0.0323743,0.001923496,0.002748663,0.001325933,0.0000747247,0.000234158,0.01434485],"genre_scores_gemma":[0.9916258,0.00002155686,0.007922166,0.0001743911,0.00004970656,0.00002164394,0.000001935879,0.000006051373,0.0001766983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6765915,"threshold_uncertainty_score":0.3812632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01156132119503426,"score_gpt":0.2036494168363956,"score_spread":0.1920880956413613,"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."}}