{"id":"W3039186344","doi":"10.1145/3401027","title":"Efficient Authorization of Graph-database Queries in an Attribute-supporting ReBAC Model","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Privacy and Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Canada Research Chairs","keywords":"Computer science; Access control; Backtracking; Graph database; Authorization; Graph; Scheme (mathematics); Query language; Database query; Database; Information retrieval; Theoretical computer science; Programming language; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003925334,0.00008807241,0.0001627742,0.0000709429,0.0003598487,0.00003528233,0.000224092,0.000078292,0.00004753007],"category_scores_gemma":[0.000260995,0.00008876537,0.00004567466,0.0003891355,0.000139457,0.0003021222,0.00001173639,0.0001886785,0.00000106136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736775,"about_ca_system_score_gemma":0.00008381805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000566181,"about_ca_topic_score_gemma":0.0008764133,"domain_scores_codex":[0.9989629,0.0001339725,0.0002641787,0.0002373053,0.000212144,0.000189454],"domain_scores_gemma":[0.9994376,0.00008960119,0.00008906645,0.0001786816,0.00006445362,0.0001405817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001248069,0.00268452,0.0436032,0.000473611,0.0001123577,0.00003140528,0.5236353,0.1155574,0.003834606,0.2378136,0.00005997878,0.07094592],"study_design_scores_gemma":[0.004024261,0.0006882949,0.01283997,0.0001641331,0.0002057958,0.000001607621,0.03118175,0.8712831,0.005706486,0.07157683,0.001225607,0.001102248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7949843,0.00004327794,0.2006258,0.003811411,0.00004472677,0.0002007756,0.00008831107,0.00005085693,0.0001505843],"genre_scores_gemma":[0.9988216,0.00008346559,0.0008897689,0.0001448089,0.00002326622,0.00001178107,0.00001406828,0.00000558832,0.000005612312],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7557256,"threshold_uncertainty_score":0.3619747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05008541743357738,"score_gpt":0.3308639138421479,"score_spread":0.2807784964085705,"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."}}