{"id":"W2921249631","doi":"10.1109/tifs.2019.2903651","title":"Secure Approximate String Matching for Privacy-Preserving Record Linkage","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Bloom filter; Computer science; Homomorphic encryption; Approximate string matching; Encryption; Matching (statistics); Theoretical computer science; String searching algorithm; String (physics); Protocol (science); Record linkage; Computer security; Cryptography; Data mining; Pattern matching; Computer network; Artificial intelligence; Mathematics","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.0003525428,0.0001915161,0.0002004385,0.0002185832,0.0003645195,0.0004403913,0.0004498115,0.000129874,0.00001944899],"category_scores_gemma":[0.000007051007,0.0001890259,0.0001327959,0.000310186,0.00002983134,0.00358433,0.00002144384,0.0003208371,0.00001805191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695304,"about_ca_system_score_gemma":0.00003179019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004886264,"about_ca_topic_score_gemma":0.00002681112,"domain_scores_codex":[0.9987995,0.00002545924,0.0003927612,0.0002493653,0.000241817,0.0002910857],"domain_scores_gemma":[0.998904,0.0001345673,0.0001550842,0.0005654804,0.0001288848,0.0001119621],"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.0001878981,0.0001622218,0.0001802259,0.001233335,0.0001345119,0.00000139236,0.02994233,0.003534168,0.0001834735,0.7263915,0.001048708,0.2370003],"study_design_scores_gemma":[0.002259498,0.0003760128,0.0002048371,0.0001850874,0.00003402986,0.00002247482,0.0009826501,0.616385,0.004333043,0.3405405,0.03388702,0.0007898035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1156753,0.00001414746,0.8820529,0.0001988435,0.0007201681,0.000530153,0.000174192,0.0001735172,0.0004607832],"genre_scores_gemma":[0.9483243,0.00007600379,0.05117591,0.0003044978,0.00002669769,0.00003890548,0.00004001834,0.000008218156,0.000005493559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8326489,"threshold_uncertainty_score":0.7708253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009779452813707932,"score_gpt":0.2227051968258481,"score_spread":0.2129257440121402,"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."}}