{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":619,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":619,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c1cc217785c5","filters":{"topic":"Access Control and Trust"}},"results":[{"id":"W2148952798","doi":"10.1145/354876.354878","title":"Configuring role-based access control to enforce mandatory and discretionary access control policies","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":574,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Role-based access control; Access control; Discretionary access control; Computer science; Mandatory access control; Computer access control; Control (management); Physical access; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01114039646682602,"gpt":0.2849402230639566,"spread":0.2737998265971306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000518841,0.0001916253,0.0002908772,0.0002380951,0.001306961,0.0009248476,0.0004424464,0.0001457307,0.0005132651],"category_scores_gemma":[0.00004087884,0.0001762897,0.00007361614,0.0002440562,0.0001586478,0.003241011,0.000007939715,0.0001822588,0.00006367969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009823068,"about_ca_system_score_gemma":0.0001160121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00334703,"about_ca_topic_score_gemma":0.0005222201,"domain_scores_codex":[0.9984377,0.0001828185,0.0004681604,0.0001817565,0.0004111087,0.0003184668],"domain_scores_gemma":[0.9989299,0.0002502445,0.000129307,0.0002522558,0.0001394654,0.0002988861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.007311223,0.0006403772,0.04235896,0.002264427,0.0009449524,0.00001849481,0.1270294,0.03740975,0.00006243352,0.1613772,0.001178146,0.6194046],"study_design_scores_gemma":[0.03769651,0.0008110008,0.1368069,0.001327162,0.0007809057,0.00006298831,0.06354286,0.1138987,0.0005365867,0.003672805,0.6373052,0.00355842],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6572819,0.0003741854,0.1984707,0.01846777,0.0007800587,0.004851189,0.001493753,0.001038924,0.1172415],"genre_scores_gemma":[0.9973233,0.00006887459,0.00001786167,0.002209226,0.0000813291,0.0001784939,0.00001595121,0.000007543011,0.00009738356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.636127,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160048449","doi":"10.1109/ptp.2003.1231515","title":"Trust and reputation model in peer-to-peer networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":478,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reputation; Computer science; Peer-to-peer; Bayesian network; Computational trust; Peer review; Internet privacy; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0189779091217112,"gpt":0.3121413842772814,"spread":0.2931634751555702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235518,0.00004464738,0.00006941348,0.00004163341,0.0001334578,0.00008281857,0.00007049876,0.00005922939,0.00003999824],"category_scores_gemma":[0.0001376746,0.00003925831,0.0000130174,0.0001781352,0.00004269644,0.0002318812,0.00001840099,0.00006049109,0.00001047976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004624954,"about_ca_system_score_gemma":0.00005348427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00523561,"about_ca_topic_score_gemma":0.01164641,"domain_scores_codex":[0.9993492,0.00001834327,0.00009430939,0.0001301528,0.0002414323,0.0001665862],"domain_scores_gemma":[0.9997503,0.00002122539,0.0000172874,0.00004998677,0.00008395585,0.0000773116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003059979,0.00005008922,0.01571413,0.000002075287,0.000005933118,0.000007143894,0.01473774,0.5639135,0.000007498952,0.3592899,0.0009792622,0.04526206],"study_design_scores_gemma":[0.003676779,0.00008626979,0.0992435,0.00003687089,0.00002613075,0.000001545375,0.0118607,0.6543704,0.00002500453,0.2122571,0.01775417,0.0006614688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5489816,0.00008396902,0.1405135,0.04637092,0.0001671576,0.0003648553,0.000001534168,0.0001054219,0.263411],"genre_scores_gemma":[0.9898442,0.00001226585,0.001406727,0.0007488697,0.00008737933,0.000009290065,0.000001584091,0.0000035911,0.007886106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4408626,"threshold_uncertainty_score":0.7914711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043226436","doi":"10.1145/1007568.1007631","title":"Extending query rewriting techniques for fine-grained access control","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":314,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Tuple; Access control; Rewriting; Inference; Set (abstract data type); Authorization; Database; Data access; Programming language; Information retrieval; Theoretical computer science; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03434197035077319,"gpt":0.3779902164163095,"spread":0.3436482460655363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585169,0.0001071583,0.0001915827,0.00008350568,0.0007428801,0.000306406,0.0004023517,0.00009958503,0.000128802],"category_scores_gemma":[0.0006246892,0.00009264192,0.0001116768,0.000194007,0.0001199031,0.0007187428,0.00003716865,0.00008235039,0.000007194426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009387569,"about_ca_system_score_gemma":0.0001423628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003062362,"about_ca_topic_score_gemma":0.003656632,"domain_scores_codex":[0.9988852,0.00004524041,0.0002214774,0.0002255889,0.0002084045,0.0004140714],"domain_scores_gemma":[0.9992702,0.0002821336,0.00009392363,0.0001148036,0.0001416369,0.00009728623],"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.00006499876,0.00006654384,0.00313162,0.00002317936,0.00003472859,0.000008611984,0.0007957175,0.0000197511,0.0007008283,0.8952627,0.0009133377,0.098978],"study_design_scores_gemma":[0.0144869,0.0004355386,0.008175966,0.0004788036,0.0002486087,0.000008857264,0.0118579,0.0007977051,0.0184715,0.564887,0.3777913,0.002359851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01174988,0.0002828504,0.5178674,0.02689472,0.0004165948,0.0022138,0.00002719827,0.001528328,0.4390192],"genre_scores_gemma":[0.9923189,0.00002089869,0.00461444,0.001030152,0.0007433107,0.0002053617,0.000003243463,0.00001399201,0.001049702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.980569,"threshold_uncertainty_score":0.5713708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110966887","doi":"10.1109/wi.2003.1241218","title":"Bayesian network-based trust model","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":304,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bayesian network; Context (archaeology); Computational trust; Bayesian probability; File sharing; Artificial intelligence; Machine learning; World Wide Web; Reputation; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.01860970290750255,"gpt":0.2866306777194931,"spread":0.2680209748119906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002145932,0.00006185225,0.00008483932,0.0000137499,0.0004203268,0.00007053724,0.0001884081,0.00006537735,0.0004189578],"category_scores_gemma":[0.00002626744,0.00005211784,0.00005305417,0.0001648046,0.0001038669,0.0001563121,0.00001184522,0.0000612932,0.00007154553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005365782,"about_ca_system_score_gemma":0.0002838034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002403214,"about_ca_topic_score_gemma":0.004647123,"domain_scores_codex":[0.9992453,0.00002437095,0.0000920304,0.0001287492,0.0002037503,0.0003057909],"domain_scores_gemma":[0.9996983,0.00002302977,0.00002560421,0.0001039687,0.00003369831,0.0001154331],"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.00001197062,0.00004389592,0.004274793,0.000001495267,0.000007007255,0.000003505149,0.0005145294,0.2668303,0.000005614015,0.7224807,0.001564428,0.004261761],"study_design_scores_gemma":[0.004331322,0.0000735936,0.005178612,0.00003324766,0.00005807212,4.472113e-7,0.001099805,0.3712172,0.00008222245,0.5577794,0.05931553,0.0008306113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00564982,0.00005067829,0.3289624,0.008429613,0.0001490729,0.0001462223,0.000001275023,0.0002065489,0.6564044],"genre_scores_gemma":[0.9891874,0.000005788862,0.004794019,0.001885931,0.0003289142,0.000009075795,0.000001328762,0.000006139429,0.003781389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9835376,"threshold_uncertainty_score":0.4587294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2566006170","doi":"10.1145/3007204","title":"Current Research and Open Problems in Attribute-Based Access Control","year":2017,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Access Control and Trust","field":"Social Sciences","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Access control; Role-based access control; Scalability; Computer security; Delegation; Control (management); Discretionary access control; Data science; World Wide Web; Database; Artificial intelligence; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.6736949052232728,"gpt":0.6033928804853208,"spread":0.070302024737952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.04043123,0.0003673449,0.002042401,0.0004067802,0.001916866,0.00377745,0.008151795,0.0003550759,0.0000294595],"category_scores_gemma":[0.006615037,0.0003106177,0.000156833,0.0007359028,0.0006677388,0.0005271535,0.003066225,0.001314577,0.00004083683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002632883,"about_ca_system_score_gemma":0.002060815,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02383066,"about_ca_topic_score_gemma":0.01442904,"domain_scores_codex":[0.9860593,0.01041182,0.0007827167,0.000908389,0.0007823926,0.0010554],"domain_scores_gemma":[0.9906959,0.006829202,0.0006872016,0.001110956,0.0004393573,0.000237364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002114373,0.00009078046,0.02457399,0.001815602,0.00003430414,0.000009819992,0.000115864,0.000004957157,1.906037e-9,0.0003305784,0.0003436693,0.9726783],"study_design_scores_gemma":[0.001009487,0.00003505224,0.01203774,0.01048011,0.00004944412,5.961804e-7,0.00001484817,0.00009002828,9.448717e-9,0.0009783092,0.9749059,0.000398483],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0000367234,0.9925932,0.0006003437,0.0003789713,0.0006863336,0.003393412,0.00006697766,0.00005501128,0.00218902],"genre_scores_gemma":[0.03419406,0.9647732,0.00003263178,0.00001860953,0.0005595317,0.0001562745,0.00008054951,0.00004312832,0.0001419759],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9745622,"threshold_uncertainty_score":0.9999346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170682668","doi":"10.1109/icdcsw.2007.16","title":"A Review on Trust and Reputation for Web Service Selection","year":2007,"lang":"en","type":"review","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":217,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Reputation; Computer science; Web service; Selection (genetic algorithm); Typology; Mechanism (biology); Service (business); World Wide Web; Resource (disambiguation); Knowledge management; Computational trust; Internet privacy; Business; Artificial intelligence; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.1187225088344778,"gpt":0.4526525301961525,"spread":0.3339300213616747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137576,0.0001711441,0.0006957739,0.00009285687,0.0003270792,0.00007580972,0.0001237679,0.0002219661,0.0001440661],"category_scores_gemma":[0.0002476677,0.0001255662,0.0001582269,0.0005509522,0.00002676889,0.0001335262,0.00001224292,0.0001289594,0.00004436385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009670846,"about_ca_system_score_gemma":0.0002917803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004129567,"about_ca_topic_score_gemma":0.002210098,"domain_scores_codex":[0.9988442,0.0001433442,0.0003381599,0.0002920483,0.0001744342,0.0002078105],"domain_scores_gemma":[0.9990715,0.0003533983,0.0002485862,0.00008601887,0.0001643533,0.00007610417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002300764,0.000008871409,6.84187e-7,0.02208987,0.00002026203,1.899027e-7,0.00003093834,1.934188e-8,3.883557e-9,0.006434072,0.00238045,0.9690323],"study_design_scores_gemma":[0.00008741206,0.00002603039,0.000001191474,0.01539683,0.0003972713,0.000001743769,0.0000253541,0.00001049383,1.053886e-8,0.0001419598,0.9837689,0.0001428466],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.310919e-7,0.9605098,0.0001452558,0.0005313593,0.0001406032,0.001846563,0.000008416619,0.0000750116,0.03674283],"genre_scores_gemma":[0.000001673332,0.9948287,0.0001755646,0.002137763,0.0004275342,0.0002063384,0.00003610672,0.0000166229,0.002169682],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9813884,"threshold_uncertainty_score":0.512044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914880889","doi":"10.1007/b104925","title":"Inconsistency Tolerance","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":175,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01353940602525862,"gpt":0.2776650288755247,"spread":0.2641256228502661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001076798,0.0002965443,0.0004251798,0.0003762275,0.0007071404,0.0004244088,0.001934444,0.0003605956,0.0001597488],"category_scores_gemma":[0.0002634564,0.0002748589,0.0001127437,0.000805431,0.001970501,0.0005132142,0.0003032235,0.0006724611,0.0001092301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000656136,"about_ca_system_score_gemma":0.003084957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003385799,"about_ca_topic_score_gemma":0.005526055,"domain_scores_codex":[0.996887,0.00008706006,0.0003557812,0.0008554108,0.00107024,0.0007445596],"domain_scores_gemma":[0.9983999,0.0004795238,0.0002005541,0.0005124787,0.0002203996,0.000187194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004219175,0.00001905786,0.0002336202,0.00001234855,0.000004411643,0.00002945048,0.002185816,0.002911064,0.000003069324,0.004335897,0.0003566583,0.9899044],"study_design_scores_gemma":[0.001013458,0.0001419914,0.002456056,0.0008799622,0.00004169113,0.00001948256,0.000004075034,0.02788559,0.0000870384,0.3381101,0.6272706,0.002090016],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001281526,0.002612363,0.7301378,0.003771834,0.003222831,0.0005508649,0.000007613248,0.0001894895,0.2593791],"genre_scores_gemma":[0.7958408,0.0007065734,0.1361011,0.01186176,0.01843627,0.00005761408,0.00001469925,0.00009264678,0.03688857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9878144,"threshold_uncertainty_score":0.9999704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553725291","doi":"10.1007/978-3-540-25840-7_3","title":"Bayesian Network Trust Model in Peer-to-Peer Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":150,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bayesian network; Peer-to-peer; Context (archaeology); Peer review; Computational trust; Bayesian probability; Artificial intelligence; World Wide Web; Reputation","retraction":null,"screen_n_in":null,"score":{"opus":0.01610661913925597,"gpt":0.2722836041111216,"spread":0.2561769849718656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002428454,0.0005118284,0.0006585627,0.0005419242,0.0006706294,0.000602443,0.00228826,0.0006764613,0.0001200123],"category_scores_gemma":[0.0002674854,0.0004895758,0.000150905,0.001077993,0.001059403,0.0004374536,0.000524723,0.001241925,0.00003508987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008108506,"about_ca_system_score_gemma":0.001351034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053277,"about_ca_topic_score_gemma":0.01091418,"domain_scores_codex":[0.9947622,0.00005882403,0.0005587295,0.001281364,0.001968434,0.001370455],"domain_scores_gemma":[0.9980257,0.0003162325,0.0002037589,0.0006399546,0.0004245878,0.0003897464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001220744,0.00001430595,0.0003853885,0.000004580062,0.00000470125,0.00004449129,0.001835054,0.806563,3.051398e-7,0.0412561,0.0001133593,0.1497665],"study_design_scores_gemma":[0.0003456315,0.00004734859,0.0003536501,0.0003080809,0.00001049617,0.000002317964,0.000001538237,0.6236413,0.000001116226,0.3696107,0.005035011,0.0006428317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005015891,0.0003218269,0.9449818,0.006731963,0.001789802,0.0006438805,0.000005371478,0.000103221,0.04537201],"genre_scores_gemma":[0.9392245,0.00005424098,0.04853893,0.004646474,0.003266489,0.00002298018,0.000008918099,0.00005738498,0.004180114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9391743,"threshold_uncertainty_score":0.9997556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1490117225","doi":"","title":"Smart cheaters do prosper: defeating trust and reputation systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Reputation; Computer security; Computer science; Reputation system; Deception; Internet privacy; Multitude; Key (lock); Perspective (graphical); Work (physics); Business; Engineering; Law; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0123667484557044,"gpt":0.2826428359941217,"spread":0.2702760875384173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453862,0.00005218395,0.00008655326,0.0000258193,0.0003500383,0.0002726867,0.00005700442,0.00004672765,0.00003673176],"category_scores_gemma":[0.00006782826,0.00004178649,0.00001724285,0.0001002471,0.00004896792,0.0002834851,0.000006254747,0.0000393497,0.00001052028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000283624,"about_ca_system_score_gemma":0.00002333792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001792595,"about_ca_topic_score_gemma":0.0001334573,"domain_scores_codex":[0.9993867,0.00004607237,0.0001151879,0.0001370624,0.0001570784,0.0001579329],"domain_scores_gemma":[0.999769,0.00002948232,0.00004185008,0.00005455591,0.00004153647,0.00006359757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002955738,0.00004670483,0.4890077,0.00002222453,0.00002170588,0.000008681717,0.01564142,0.00006803521,0.0002940023,0.3378222,0.0005933231,0.1564444],"study_design_scores_gemma":[0.002709669,0.0003559384,0.8906987,0.0001603031,0.0001003818,0.00001487048,0.04652374,0.01024221,0.0001953062,0.01187689,0.03612423,0.0009977106],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6984971,0.0003279127,0.0004587882,0.001736544,0.0001614808,0.000319316,6.651372e-7,0.0001302622,0.2983679],"genre_scores_gemma":[0.9970136,0.00002505955,0.0001684283,0.0001584856,0.0001339728,0.000007210703,0.000001017825,0.000002601786,0.002489677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.401691,"threshold_uncertainty_score":0.2709879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091348074","doi":"10.1145/3408292","title":"A Survey on Trust Evaluation Based on Machine Learning","year":2020,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Access Control and Trust","field":"Social Sciences","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; University of Alberta","funders":"National Postdoctoral Program for Innovative Talents; China Electronics Technology Group Corporation; Higher Education Discipline Innovation Project; National Natural Science Foundation of China; Academy of Finland; Foundation for Innovative Research Groups of the National Natural Science Foundation of China; China Postdoctoral Science Foundation","keywords":"Computer science; Process (computing); Machine learning; Artificial intelligence; Granularity; Automation; Data science; Knowledge management","retraction":null,"screen_n_in":null,"score":{"opus":0.1593665496030791,"gpt":0.4166764245528145,"spread":0.2573098749497353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.02868117,0.0005048228,0.001533682,0.0002417856,0.001071226,0.0003134214,0.001305838,0.0003750913,0.0002798884],"category_scores_gemma":[0.02576299,0.0004383579,0.00041914,0.001151048,0.0001089622,0.00006700565,0.0002002249,0.001197886,0.0004815065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003955056,"about_ca_system_score_gemma":0.001142382,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007874353,"about_ca_topic_score_gemma":0.002633304,"domain_scores_codex":[0.967075,0.02949738,0.0006576088,0.0008196605,0.001405393,0.0005448848],"domain_scores_gemma":[0.987747,0.01044724,0.0007372422,0.0005847753,0.000275872,0.0002078626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000693645,0.00005011322,0.002434652,0.0002768887,0.00005911576,0.000008488527,0.0001450088,0.0006452436,2.526721e-9,0.00008088276,0.0002598544,0.9960328],"study_design_scores_gemma":[0.0005539117,0.0001770784,0.01080159,0.002887664,0.000272121,2.986428e-7,0.00001631856,0.04726603,2.405146e-8,0.00004156538,0.9373388,0.0006446264],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00003142233,0.97858,0.00132293,0.0003198929,0.001392248,0.001654046,0.000124276,0.0004186395,0.01615657],"genre_scores_gemma":[0.07394464,0.9206663,0.0001609668,0.0004020843,0.001786393,0.00004780854,0.002327848,0.0001649669,0.0004990404],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9953882,"threshold_uncertainty_score":0.9998068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989003109","doi":"10.1007/s10922-007-9083-8","title":"Policy-based Management: A Historical Perspective","year":2007,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Access Control and Trust","field":"Social Sciences","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Perspective (graphical); Focus (optics); Management science; Data science; Software engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01821747554157112,"gpt":0.2987556917135049,"spread":0.2805382161719338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002607272,0.0001030799,0.0002529907,0.000263736,0.0003622205,0.0001254623,0.0002286733,0.00005258746,0.00001113516],"category_scores_gemma":[0.0000190311,0.00008471128,0.000102335,0.000419242,0.00005765267,0.00013947,0.00004434908,0.0001210392,0.000004037674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008515376,"about_ca_system_score_gemma":0.00003675793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007949006,"about_ca_topic_score_gemma":0.0001299098,"domain_scores_codex":[0.9983706,0.0001313485,0.0004281618,0.0001288647,0.0005663043,0.0003747206],"domain_scores_gemma":[0.9991068,0.00008322053,0.0003646787,0.0001000745,0.000153834,0.0001914206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000164791,0.00009421809,0.003360557,0.00007573966,0.0003370435,0.0005681119,0.001350267,0.00158385,2.656184e-7,0.9522541,0.01676888,0.02344222],"study_design_scores_gemma":[0.001697682,0.0001524875,0.01137467,0.0002803951,0.0002113079,0.00001316349,0.01778892,0.0003562639,1.218773e-7,0.009129179,0.9587699,0.0002259342],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004583851,0.01295182,0.08577238,0.009675612,0.004164605,0.000949752,0.000001119276,0.00006412205,0.8818368],"genre_scores_gemma":[0.9887339,0.000677708,0.0006092403,0.0002798673,0.002987793,0.000003862228,1.89969e-7,0.000008776241,0.006698624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9841501,"threshold_uncertainty_score":0.3454426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094079142","doi":"10.1145/990036.990046","title":"Specifying access control policies for XML documents with XPath","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"XPath; Computer science; Programming language; XML; Semantics (computer science); XML database; Syntax; Formal semantics (linguistics); XSLT; Database; Information retrieval; World Wide Web; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.03468592939144927,"gpt":0.3661040358899945,"spread":0.3314181064985452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002153438,0.00009757205,0.0001573119,0.00004902551,0.0005840186,0.0003925291,0.0003666628,0.00004831608,0.000170251],"category_scores_gemma":[0.00005465536,0.00006777076,0.0000519005,0.0001619427,0.0001456869,0.0007757876,0.00002548218,0.00004987308,0.00002838691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000899299,"about_ca_system_score_gemma":0.0001640368,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01075643,"about_ca_topic_score_gemma":0.009929391,"domain_scores_codex":[0.9990245,0.00002297533,0.0001251697,0.0001713879,0.0002727675,0.000383274],"domain_scores_gemma":[0.9995341,0.0000870794,0.00006703271,0.0001039948,0.0000988273,0.000108988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002798674,0.0001537694,0.06939626,0.00001983366,0.0001394888,0.000009259736,0.005957231,0.0004756342,0.00007516916,0.9140176,0.0009341884,0.008541761],"study_design_scores_gemma":[0.04449425,0.0008675813,0.1204218,0.0001938158,0.0003718924,0.000006433774,0.0231726,0.0001392073,0.001879922,0.2049015,0.6014724,0.002078662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1946912,0.0001985016,0.0946644,0.02383395,0.0004942642,0.002124039,0.00002895224,0.000398627,0.6835661],"genre_scores_gemma":[0.9951977,0.00002104314,0.0005124164,0.001366566,0.0004303337,0.0000718947,0.000001620271,0.00001006361,0.002388428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8005065,"threshold_uncertainty_score":0.995831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122031263","doi":"10.4067/s0718-18762010000200007","title":"The State of the Art in Trust and Reputation Systems: A Framework for Comparison","year":2010,"lang":"en","type":"article","venue":"Journal of theoretical and applied electronic commerce research","topic":"Access Control and Trust","field":"Social Sciences","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Reputation; State (computer science); Reputation management; Computer science; Business; Knowledge management; Sociology; Social science","retraction":null,"screen_n_in":null,"score":{"opus":0.02153782033445967,"gpt":0.3890153447249001,"spread":0.3674775243904405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006989204,0.00005584267,0.0001955767,0.00005265241,0.0005186452,0.0001435371,0.0003345148,0.00007096595,0.000008051824],"category_scores_gemma":[0.0009278212,0.00002881398,0.0000413619,0.0002316056,0.001568869,0.00004641606,0.00006798842,0.001187982,3.729747e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004117956,"about_ca_system_score_gemma":0.0002050422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004253587,"about_ca_topic_score_gemma":0.0002937146,"domain_scores_codex":[0.9983727,0.0003456367,0.0003306619,0.00008615778,0.0004642807,0.0004005905],"domain_scores_gemma":[0.9959782,0.003522245,0.0001505556,0.0001093024,0.0001601824,0.00007951965],"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.0003057465,0.0000370704,0.0008265396,0.00001250013,0.00001564029,1.565534e-7,0.001041549,0.00001225898,0.0002380306,0.9667354,0.000100051,0.03067502],"study_design_scores_gemma":[0.0005070217,0.0001583154,0.00287931,0.00004153193,0.00001312044,0.000004269585,0.003148359,0.001373873,0.0001745265,0.9792137,0.01243661,0.00004931656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9746232,0.001083156,0.002168418,0.01820604,0.00009757026,0.0005965043,0.00000180818,0.000002985231,0.003220318],"genre_scores_gemma":[0.999218,0.0004936655,0.00006692202,0.0000265641,0.0001063506,0.00001719762,1.172218e-7,0.000005015926,0.00006610376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0306257,"threshold_uncertainty_score":0.5780563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981058821","doi":"10.1145/1998441.1998450","title":"Relationship-based access control policies and their policy languages","year":2011,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":96,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Control (management); Access control; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06191767979187263,"gpt":0.3578958056273299,"spread":0.2959781258354572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002262892,0.00007483584,0.0001039955,0.0001049519,0.0004036262,0.000125265,0.0002229864,0.0000633536,0.0003607196],"category_scores_gemma":[0.0002986482,0.00005206087,0.00003330219,0.0002023695,0.0002484844,0.0003557413,0.00002515292,0.00006039153,0.00001744646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000186754,"about_ca_system_score_gemma":0.0001316029,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04819459,"about_ca_topic_score_gemma":0.008315433,"domain_scores_codex":[0.9993864,0.000103911,0.00009540831,0.0001095838,0.00009247904,0.0002122417],"domain_scores_gemma":[0.9994524,0.0002554991,0.00004472928,0.0001018064,0.0000477906,0.0000977672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001435339,0.00002297147,0.4694613,0.000002864893,0.000009547249,9.282905e-7,0.007444697,0.000001181343,0.000008443915,0.518961,0.0001923837,0.003880412],"study_design_scores_gemma":[0.0008464838,0.00002360148,0.9622056,0.00000519572,0.00001483664,3.99807e-7,0.007355247,0.00009426029,0.0001535122,0.02207888,0.007050079,0.0001718785],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1869667,0.0002808941,0.003257689,0.0107651,0.00005804687,0.0002672617,0.00001575301,0.0002266993,0.7981618],"genre_scores_gemma":[0.9963319,0.000009022071,0.00007228857,0.001853006,0.0002093169,0.00001443894,0.000001031625,0.000005781991,0.001503219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8093652,"threshold_uncertainty_score":0.9581435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140020370","doi":"10.1145/1151454.1151499","title":"An ontology of trust","year":2006,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Transitive relation; Computer science; Semantics (computer science); Computational trust; Web of trust; Trust anchor; Ontology; Trust management (information system); Express trust; Semantic Web; Knowledge management; World Wide Web; Epistemology; Reputation; Computer security; Mathematics; Sociology; Programming language; Public relations; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.0105582140721605,"gpt":0.3130439021268806,"spread":0.3024856880547201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001102662,0.00002173839,0.00006077681,0.00001687865,0.0000775971,0.000009598402,0.0001103161,0.0000362709,0.001023592],"category_scores_gemma":[0.0000114495,0.00001754698,0.0000174815,0.00005878901,0.0001189553,0.0001040976,0.000004037324,0.00001713449,0.0000153031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006271421,"about_ca_system_score_gemma":0.00003125593,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.04638838,"about_ca_topic_score_gemma":0.04813937,"domain_scores_codex":[0.9996622,0.00003796568,0.00006977401,0.00005499629,0.00007789662,0.00009717591],"domain_scores_gemma":[0.9998434,0.00002174008,0.00002428153,0.00005786897,0.00002980627,0.00002286795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000004120529,0.00004801217,0.08472139,6.442876e-7,0.000001867187,9.130143e-7,0.0003675679,0.000003923505,0.0001534772,0.9063629,0.000538466,0.007796749],"study_design_scores_gemma":[0.001011409,0.0001399563,0.6480289,0.000002984709,0.00002645249,7.548655e-7,0.006534674,0.0003825817,0.001156343,0.1184664,0.2239949,0.0002546143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3255254,0.00002811662,0.0004391818,0.0006135053,0.0000569352,0.00003047195,6.384602e-7,0.00002798667,0.6732778],"genre_scores_gemma":[0.9956861,0.000002089874,0.0002364619,0.00007731972,0.0001373917,0.000001365684,8.594593e-7,0.000001285555,0.003857125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7878965,"threshold_uncertainty_score":0.9998896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053034494","doi":"10.1016/j.comcom.2010.01.023","title":"Trust management in ubiquitous computing: A Bayesian approach","year":2010,"lang":"en","type":"article","venue":"Computer Communications","topic":"Access Control and Trust","field":"Social Sciences","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Computer science; Trust management (information system); Ubiquitous computing; Scheme (mathematics); Task (project management); Trustworthiness; Probabilistic logic; Human–computer interaction; Computer security; End-user computing; Distributed computing; Artificial intelligence; Utility computing; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0300447031888077,"gpt":0.324101192867546,"spread":0.2940564896787383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241144,0.00009592289,0.0001368811,0.0001362628,0.0008414292,0.0001737107,0.001670916,0.00008220031,0.00003109606],"category_scores_gemma":[0.00001277847,0.0001011348,0.00005323996,0.0004199037,0.000343713,0.0001536786,0.000671834,0.000408192,0.00002707744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531616,"about_ca_system_score_gemma":0.00004077619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109556,"about_ca_topic_score_gemma":0.003300467,"domain_scores_codex":[0.9989322,0.0002198443,0.0002307554,0.0001956823,0.0001486664,0.0002728779],"domain_scores_gemma":[0.9984295,0.0001542988,0.00006937548,0.00119765,0.00005299763,0.00009621025],"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.000002696306,0.0004484883,0.005315866,0.00001001849,0.00003409771,0.00002725669,0.00949617,0.000103666,0.000003520689,0.7447187,0.0007847335,0.2390548],"study_design_scores_gemma":[0.001811045,0.00003089141,0.03586138,0.00004483051,0.00005157791,0.00007815377,0.005966325,0.4881216,0.000002705494,0.01331141,0.4540134,0.0007066177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02891583,0.0001541505,0.2552443,0.00800118,0.000598001,0.001002896,0.000002985943,0.0003693306,0.7057113],"genre_scores_gemma":[0.8646148,0.00003721436,0.1346343,0.0002870782,0.0001847489,0.00003242496,0.000009257842,0.000008704133,0.000191384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.835699,"threshold_uncertainty_score":0.6471678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4286377586","doi":"10.1109/comst.2022.3192978","title":"A Survey on Trust Models in Heterogeneous Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Access Control and Trust","field":"Social Sciences","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Huawei Technologies; National Natural Science Foundation of China","keywords":"Heterogeneous network; Computer science; Exploit; Trust management (information system); Merge (version control); Reliability (semiconductor); Openness to experience; Computer security; Wireless network; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.1137661808345762,"gpt":0.3523608606094925,"spread":0.2385946797749163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01678451,0.0001690504,0.000375294,0.0001834629,0.002041719,0.0001489424,0.002504852,0.000111355,0.0002392811],"category_scores_gemma":[0.0006162956,0.0001913743,0.0001025333,0.0010239,0.0003239356,0.0002406329,0.0004201885,0.0005242366,0.00002774067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004156004,"about_ca_system_score_gemma":0.0003240676,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.06262829,"about_ca_topic_score_gemma":0.1065963,"domain_scores_codex":[0.9785627,0.01956629,0.0005427018,0.0003126956,0.0005471433,0.0004684647],"domain_scores_gemma":[0.994365,0.003428505,0.0002274644,0.001691532,0.0001674908,0.0001199815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0002732365,0.002419943,0.09153495,0.000005615395,0.000198891,0.00002518065,0.01440092,0.7598771,0.00004036149,0.07849459,0.008411447,0.04431769],"study_design_scores_gemma":[0.007817606,0.0007055957,0.3923205,0.00008655027,0.0001334865,0.000006545431,0.005127166,0.174695,0.00004105367,0.03518929,0.3803435,0.003533684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7234545,0.01197717,0.01564993,0.009260288,0.03258999,0.00729122,0.002535978,0.001423663,0.1958172],"genre_scores_gemma":[0.9975461,0.0005732871,0.00005206958,0.0002171091,0.0003753887,0.0003920844,0.0001620385,0.00002727534,0.0006547002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5851821,"threshold_uncertainty_score":0.9992575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125609769","doi":"10.1109/ipdps.2004.1302929","title":"A trust brokering system and its application to resource management in public-resource grids","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Honesty; Robustness (evolution); Grid; Resource management (computing); Resource (disambiguation); Grid computing; Knowledge management; Trust management (information system); Human resource management system; Distributed computing; Computer security; Human resource management; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01468272651523955,"gpt":0.2626032513351395,"spread":0.2479205248199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722922,0.00007889618,0.0001098469,0.0001310584,0.0002548978,0.0001503105,0.0002293534,0.0000520878,0.00001115947],"category_scores_gemma":[0.00002220388,0.00007386078,0.00001879532,0.0004445416,0.000027276,0.0001840095,0.0001027639,0.00005836384,0.00005192543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001956384,"about_ca_system_score_gemma":0.00001840525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001593011,"about_ca_topic_score_gemma":0.002326097,"domain_scores_codex":[0.999013,0.00004467101,0.0001619628,0.0002519724,0.0002482841,0.0002801123],"domain_scores_gemma":[0.9996467,0.00002079409,0.00003526705,0.0001250542,0.00002233185,0.0001498413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001328494,0.00003022124,0.001991577,0.00003753038,0.00001174311,0.000006888839,0.002549864,0.0002317646,0.00003059034,0.9568073,0.0000954697,0.03819382],"study_design_scores_gemma":[0.002377239,0.00004780335,0.03667167,0.0001234601,0.00002830933,0.000003519345,0.0577947,0.001268635,0.0001400738,0.001034002,0.8999822,0.0005284118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2084495,0.0001270374,0.007375925,0.009036938,0.00004099243,0.001129215,0.000001695889,0.000251468,0.7735873],"genre_scores_gemma":[0.9976066,0.000008045458,0.0002067228,0.0003399945,0.0001036642,0.0001338547,0.000001300508,0.000007470173,0.001592399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9557732,"threshold_uncertainty_score":0.3011955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022906038","doi":"10.1145/1321211.1321251","title":"A trust based approach for protecting user data in social networks","year":2007,"lang":"en","type":"article","venue":"Proceedings of CASCON","topic":"Access Control and Trust","field":"Social Sciences","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Object (grammar); Confidentiality; Key (lock); Reading (process); Computer security; Subject (documents); Access control; Process (computing); Social network (sociolinguistics); Control (management); Data modeling; Internet privacy; World Wide Web; Database; Artificial intelligence; Social media; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0594935199212231,"gpt":0.3417024052589057,"spread":0.2822088853376826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003794061,0.00009495079,0.0002093766,0.0001040113,0.0003875901,0.00008533745,0.000509218,0.0001544273,0.000009336538],"category_scores_gemma":[0.000685425,0.000093845,0.00004742723,0.0003906412,0.0001277941,0.000544673,0.00007267803,0.0001920927,2.789243e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005315658,"about_ca_system_score_gemma":0.00007231832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006903508,"about_ca_topic_score_gemma":0.0003055748,"domain_scores_codex":[0.9987419,0.000008628924,0.0002761078,0.0002874472,0.0002634373,0.0004225109],"domain_scores_gemma":[0.9993586,0.0001210604,0.0002070106,0.000059545,0.0001983654,0.00005540053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002860558,0.001097649,0.4892379,0.001314646,0.0001545901,0.000005330573,0.02911303,0.0001919035,0.002999829,0.2276766,0.003999245,0.2413487],"study_design_scores_gemma":[0.03044702,0.0009126531,0.1415904,0.0006874282,0.0005869318,0.000007419254,0.1668753,0.4625086,0.009138516,0.01269999,0.1703263,0.004219291],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6531074,0.0003256163,0.1209039,0.001605229,0.000313866,0.00521568,0.00003318637,0.0002487387,0.2182464],"genre_scores_gemma":[0.9940863,0.000002063376,0.004859601,0.00007112436,0.0007889122,0.00005813344,0.000008473268,0.00001370247,0.0001116449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4623168,"threshold_uncertainty_score":0.3826888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2969727736","doi":"10.1145/3350546.3352561","title":"Blockchain based access control systems: State of the art and challenges","year":2019,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Access control; State (computer science); Blockchain; Control (management); Discretionary access control; Physical access; Data access; Face (sociological concept)","retraction":null,"screen_n_in":null,"score":{"opus":0.08719291932915742,"gpt":0.3392831230775589,"spread":0.2520902037484015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368523,0.0002132016,0.0003148976,0.0001474977,0.0001814748,0.0002563638,0.002119326,0.0001029122,0.0006246347],"category_scores_gemma":[0.0004792337,0.0001601236,0.0001020965,0.0001718431,0.0004469627,0.0001844376,0.0001314885,0.000262059,0.0001630209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008741296,"about_ca_system_score_gemma":0.0004170451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007296273,"about_ca_topic_score_gemma":0.001203884,"domain_scores_codex":[0.9975422,0.0003186253,0.0004477948,0.0004305081,0.000942554,0.0003182985],"domain_scores_gemma":[0.9977024,0.0006663618,0.0003743299,0.0004775639,0.0006636173,0.0001157361],"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.0005242998,0.0003623242,0.02475065,0.0001969179,0.0003236371,0.00001281477,0.003630207,0.01511586,0.001805901,0.8968988,0.0004414154,0.05593714],"study_design_scores_gemma":[0.00415711,0.0008939974,0.03029505,0.003184658,0.0001806232,0.00001442026,0.01162043,0.7578447,0.01287572,0.06977019,0.1067712,0.002391877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6593435,0.001672224,0.004985625,0.05049327,0.00938729,0.002888631,0.000395832,0.0002087872,0.2706248],"genre_scores_gemma":[0.9958542,0.0009328475,0.000023206,0.0004367178,0.0001545391,0.0000528528,0.000001717643,0.00001358678,0.002530349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8271286,"threshold_uncertainty_score":0.6839312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382318094","doi":"10.1109/tse.2023.3288901","title":"NLP-Based Automated Compliance Checking of Data Processing Agreements Against GDPR","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Access Control and Trust","field":"Social Sciences","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds National de la Recherche Luxembourg","keywords":"Computer science; Table (database); General Data Protection Regulation; Ambiguity; Software; Glossary; Compliance (psychology); Information retrieval; Software engineering; Database; Data Protection Act 1998; Computer security; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.09377241932177718,"gpt":0.3490663702075247,"spread":0.2552939508857475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003373022,0.0001445446,0.0001982882,0.0002148098,0.0003858672,0.00006398593,0.0005180663,0.00008417412,0.00003265569],"category_scores_gemma":[0.00006367495,0.0001589994,0.00005694199,0.001001613,0.0000641285,0.0004985509,0.000004157486,0.0001567061,0.00003050671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007342731,"about_ca_system_score_gemma":0.0001331308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001421879,"about_ca_topic_score_gemma":0.0001058707,"domain_scores_codex":[0.9986722,0.00002863711,0.0002566737,0.0002845405,0.0004043088,0.000353565],"domain_scores_gemma":[0.9992507,0.0001625416,0.00008191868,0.0003264279,0.00008775848,0.00009071505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002439721,0.0001361839,0.0006138902,0.0003501969,0.00008995602,0.00001906888,0.001442308,0.8118091,0.001259037,0.00002558094,0.0002363367,0.1839939],"study_design_scores_gemma":[0.0006827332,0.0000210747,0.001979903,0.0005795924,0.00004449857,3.222633e-7,0.000301262,0.9910432,0.002146853,0.00000609834,0.002873193,0.000321252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02630774,0.00006173871,0.9698002,0.0001079716,0.0005331926,0.0002339647,0.0001207164,0.002676582,0.0001579446],"genre_scores_gemma":[0.9925578,0.00002762497,0.007137051,0.00004079459,0.00005736037,0.00002667575,0.00002723232,0.00002949549,0.0000959375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9662501,"threshold_uncertainty_score":0.6483806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058990659","doi":"10.1109/iccgi.2010.17","title":"Online Trust: Definition and Principles","year":2010,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Trust anchor; Computer science; Computational trust; Selection (genetic algorithm); Web of trust; Trust management (information system); Online and offline; Express trust; Knowledge management; Computer security; Artificial intelligence; Public relations; Sociology; Political science; Reputation","retraction":null,"screen_n_in":null,"score":{"opus":0.04754501400952819,"gpt":0.3088062428617419,"spread":0.2612612288522136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001337903,0.00002895814,0.0000409063,0.00001611616,0.0002061796,0.00004886696,0.00005763612,0.00004483796,0.000631794],"category_scores_gemma":[0.0001168547,0.00002270884,0.0000112727,0.00004330125,0.0001164272,0.0001267567,0.00001640958,0.00006997176,0.00002131198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002753501,"about_ca_system_score_gemma":0.00002816239,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001123089,"about_ca_topic_score_gemma":0.02413809,"domain_scores_codex":[0.9996869,0.00001358602,0.00005224024,0.00007026509,0.00008385756,0.00009316202],"domain_scores_gemma":[0.9998164,0.00004217018,0.0000168288,0.00004512898,0.000024652,0.00005486292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002151404,0.00003075846,0.03305757,0.000001042011,0.000002188102,8.058911e-7,0.0004640134,6.465188e-8,0.000154369,0.9484037,0.00005483861,0.01782848],"study_design_scores_gemma":[0.0005332016,0.00002270824,0.463337,0.000003523181,0.0000152984,0.00000187278,0.002364914,0.0002801328,0.0001005072,0.05034707,0.4828146,0.0001792132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6948205,0.00001474355,0.00005270566,0.002138998,0.0001101381,0.00004119739,0.000002616951,0.00004599252,0.3027731],"genre_scores_gemma":[0.9955909,0.00003682872,0.001643327,0.0002312768,0.0002235424,0.000002386127,0.000002731611,0.00000202932,0.002266936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8980566,"threshold_uncertainty_score":0.9936689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013611975","doi":"10.1016/j.cose.2012.02.006","title":"Dynamic risk-based decision methods for access control systems","year":2012,"lang":"en","type":"article","venue":"Computers & Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; CA Technologies","keywords":"Computer science; Access control; Control (management); Computer security; Resource (disambiguation); Risk analysis (engineering); Order (exchange); Role-based access control; Computer network; Artificial intelligence; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.02636457232836061,"gpt":0.4094962820224867,"spread":0.3831317096941261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003069182,0.0001703112,0.0003644039,0.00009270459,0.0007709683,0.0003659882,0.0007536796,0.0001575221,0.00002350804],"category_scores_gemma":[0.0004886804,0.0001510876,0.0001911613,0.0002313466,0.0001499291,0.0006705152,0.00007668118,0.0001721315,0.00001502021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495182,"about_ca_system_score_gemma":0.000109698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001585303,"about_ca_topic_score_gemma":0.0002908153,"domain_scores_codex":[0.9976812,0.0008510542,0.0002977961,0.0002805959,0.0002754172,0.0006139302],"domain_scores_gemma":[0.9961393,0.002853406,0.0002539394,0.0002742503,0.0001811938,0.0002979345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000673166,0.0008336671,0.09441034,0.0002046827,0.0003266041,0.000004220454,0.008945093,0.00568264,0.00003203321,0.0619363,0.008481701,0.8184696],"study_design_scores_gemma":[0.003909934,0.00007769642,0.02274743,0.00007561298,0.0001882205,0.000001014179,0.0003364048,0.7485328,0.00001442194,0.01330332,0.2102748,0.0005383489],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0279173,0.002368361,0.963133,0.0004346202,0.004239673,0.001000318,0.0000435185,0.0001701574,0.0006930885],"genre_scores_gemma":[0.9742221,0.00003152743,0.02476593,0.0003040575,0.0005414319,0.00009576399,0.000008626358,0.0000159917,0.000014535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9463049,"threshold_uncertainty_score":0.6161172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148582294","doi":"10.1016/j.knosys.2011.01.004","title":"CRM: An efficient trust and reputation model for agent computing","year":2011,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Credibility; Computer science; Reputation; Novelty; Process (computing); Domain (mathematical analysis); Multi-agent system; Computational trust; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09924474921506656,"gpt":0.3377573085898879,"spread":0.2385125593748214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256335,0.000126586,0.000213149,0.00009214463,0.0007184837,0.00013969,0.0001764096,0.0001033425,0.000008844496],"category_scores_gemma":[0.0001103345,0.000115698,0.00006173662,0.0001437537,0.0001257281,0.0001198758,0.00001932455,0.00006037472,0.00001442782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009513602,"about_ca_system_score_gemma":0.0002044251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035754,"about_ca_topic_score_gemma":0.0006285778,"domain_scores_codex":[0.9986738,0.0002109421,0.0002967027,0.0003189992,0.0001836404,0.0003158971],"domain_scores_gemma":[0.9990981,0.0001327025,0.0001535799,0.0001662754,0.0002674657,0.0001818273],"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.0004028079,0.001994737,0.02525196,0.001149271,0.0001578747,0.00001141167,0.3391169,0.1797096,0.0003158331,0.369805,0.001052954,0.08103161],"study_design_scores_gemma":[0.000746712,0.00006074533,0.0009606866,0.00005303263,0.0000299099,3.650626e-7,0.003028032,0.9935402,0.0000265224,0.0002681536,0.001126926,0.0001587684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4565791,0.001110273,0.5033359,0.00006886802,0.001376529,0.001566996,0.00002266382,0.0002601106,0.03567955],"genre_scores_gemma":[0.9983116,0.000001763306,0.0007098423,0.00002687756,0.0003374089,0.00007061895,0.000009359414,0.00001727653,0.0005151854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8138306,"threshold_uncertainty_score":0.5526069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1015545679","doi":"10.1007/978-3-319-17040-4_12","title":"HGABAC: Towards a Formal Model of Hierarchical Attribute-Based Access Control","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Role-based access control; Computer science; Access control; Mandatory access control; Abstraction; Object (grammar); Control (management); Discretionary access control; Formal description; Software engineering; Distributed computing; Database; Computer security; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06104627247136883,"gpt":0.3260212957806216,"spread":0.2649750233092528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00218338,0.0003897776,0.0007712864,0.0005364016,0.0004202198,0.0003598586,0.002916267,0.000492056,0.00007368421],"category_scores_gemma":[0.0003979772,0.0003403974,0.0002125471,0.0004309839,0.002550438,0.0008998797,0.0005233049,0.0007837557,0.000008724566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003597153,"about_ca_system_score_gemma":0.004302495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005350236,"about_ca_topic_score_gemma":0.00110678,"domain_scores_codex":[0.9957865,0.00007888844,0.0005650038,0.0007974441,0.001889753,0.0008823379],"domain_scores_gemma":[0.9975268,0.0004675586,0.0003725907,0.0005481418,0.0007285547,0.000356382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001738893,0.00009623184,0.0007495062,0.00006605078,0.00003719562,0.00003746596,0.001859022,0.2978804,0.00002799167,0.06913316,0.00007922237,0.6298599],"study_design_scores_gemma":[0.001561238,0.0001594926,0.0002212324,0.0001951764,0.00004150113,0.000002051567,9.246178e-7,0.7966889,0.0001057997,0.1988688,0.001549507,0.0006053301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003188469,0.0002860595,0.976988,0.002281395,0.0006787633,0.0005738217,0.00008857489,0.0000769664,0.01870761],"genre_scores_gemma":[0.9856196,0.0000159168,0.01221566,0.001212768,0.0006196338,0.00001467713,0.000009123771,0.00002539075,0.0002672255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9853008,"threshold_uncertainty_score":0.9999048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063984812","doi":"10.1145/1363686.1364176","title":"CAT","year":2008,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0451368073462672,"gpt":0.311536794550653,"spread":0.2663999872043858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004447263,0.0000134965,0.00002316117,0.000006495067,0.0002854438,0.000007060821,0.00006139768,0.00001444271,0.001656905],"category_scores_gemma":[0.00002302424,0.00001044172,0.00001237167,0.00004051605,0.00007628503,0.00005090133,0.000005577392,0.00000984904,0.0003546911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007482216,"about_ca_system_score_gemma":0.00003786058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005786344,"about_ca_topic_score_gemma":0.002206085,"domain_scores_codex":[0.9997767,0.00001202981,0.00002330943,0.0000347857,0.00007820968,0.00007497121],"domain_scores_gemma":[0.9999027,0.00001571076,0.000005170613,0.00002970258,0.00001383407,0.00003283757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004695526,0.00004277044,0.1249692,7.535499e-7,0.000009107305,0.0000307785,0.01218837,0.000001341137,0.00003807108,0.7673358,0.05810819,0.03727093],"study_design_scores_gemma":[0.0001532876,0.000005644605,0.0356705,5.015831e-7,0.000001854619,0.000001164433,0.001111502,0.00001895904,0.0000387583,0.003994377,0.9589348,0.00006860292],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1349078,0.00001885215,0.0001058572,0.001576185,0.00006859133,0.0000208393,9.185737e-8,0.00004845642,0.8632533],"genre_scores_gemma":[0.9543714,0.00003369486,0.0001336375,0.0003195128,0.0001248354,0.000001362216,1.057343e-7,8.519282e-7,0.04501461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9008266,"threshold_uncertainty_score":0.9992557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129486938","doi":"10.1145/1143120.1143124","title":"Intentional access management","year":2006,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01834448827549199,"gpt":0.3312614531723745,"spread":0.3129169648968825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001106878,0.0000265514,0.00003108633,0.00002766049,0.0001948366,0.0001300776,0.0001905675,0.00001581397,0.00260839],"category_scores_gemma":[0.000003664788,0.00002202044,0.00002608557,0.0000992362,0.00005374716,0.0002382708,0.00004362473,0.00001863237,0.0001478011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001859895,"about_ca_system_score_gemma":0.000009289877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004718643,"about_ca_topic_score_gemma":0.003194379,"domain_scores_codex":[0.9995669,0.00001579619,0.00005927812,0.00007254375,0.0001710606,0.0001143841],"domain_scores_gemma":[0.9998853,0.00001167665,0.000014768,0.00004014,0.00002692726,0.00002115114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001552284,0.00002129642,0.01273916,0.000001020157,0.000004764482,0.000002615729,0.00001707034,0.00000421023,6.608192e-7,0.9621294,0.01604337,0.009034953],"study_design_scores_gemma":[0.0002426803,0.00000242952,0.1737151,0.000002751161,0.000008574493,1.147385e-7,0.0004539561,0.00003432004,0.000009107035,0.106447,0.7190046,0.00007935422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004557308,0.00002091553,0.004138903,0.002481793,0.0001534747,0.00007267456,7.172896e-7,0.00006642746,0.9885078],"genre_scores_gemma":[0.9235333,0.000008100088,0.000235307,0.0002395619,0.0001987224,0.000009242727,0.000003331394,0.000001567225,0.07577083],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.918976,"threshold_uncertainty_score":0.9983034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3147602438","doi":"10.2307/20721432","title":"Introduction to the Special Issue on Novel Perspectives on Trust in Information Systems","year":2010,"lang":"en","type":"article","venue":"MIS Quarterly","topic":"Access Control and Trust","field":"Social Sciences","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Information system; Knowledge management; Business; Computer science; Management science; Political science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.006703550874649212,"gpt":0.2548507609329635,"spread":0.2481472100583143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005299232,0.00008463464,0.0001012975,0.0001259576,0.0003055045,0.0002781206,0.0002241314,0.00007786135,0.000318583],"category_scores_gemma":[0.0001488155,0.00006097604,0.0000315019,0.000255463,0.00006491403,0.0004585113,0.000003334147,0.0002412393,0.001019131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008571053,"about_ca_system_score_gemma":0.00003775366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003308703,"about_ca_topic_score_gemma":0.005936884,"domain_scores_codex":[0.9990901,0.00006426918,0.0001731152,0.0001513719,0.0003249119,0.0001962398],"domain_scores_gemma":[0.9995544,0.00005448618,0.00006512971,0.0001880304,0.0000800832,0.00005787157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002238422,0.000213334,0.0003451548,0.000007311151,0.00001445802,0.000001114007,0.4494014,0.0002153622,0.0003295048,0.3007448,0.04441038,0.2040934],"study_design_scores_gemma":[0.0003295395,0.0002618897,0.008920362,0.00000686034,0.000003271587,5.438035e-7,0.1158358,0.0001226589,0.00001178467,0.00006671334,0.8743414,0.00009913994],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6106257,0.00001683715,0.0004838122,0.0862224,0.0103346,0.001360773,0.00002596103,0.0001140494,0.2908158],"genre_scores_gemma":[0.966678,0.000001063988,0.000018476,0.0002217613,0.03202636,0.00003885458,0.000003077848,0.000004101666,0.001008282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8299311,"threshold_uncertainty_score":0.9997587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157372716","doi":"10.1109/icdcsw.2007.82","title":"Towards a Gravity-Based Trust Model for Social Networking Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Popularity; Computer science; Social network (sociolinguistics); Focus (optics); Trust management (information system); Scheme (mathematics); The Internet; Computation; Social trust; Computational trust; World Wide Web; Social media; Data science; Computer security; Social capital; Sociology; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06682832598765394,"gpt":0.3536388273279389,"spread":0.286810501340285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537807,0.00009351275,0.0001758574,0.00003756539,0.0009851895,0.0001569462,0.0002196524,0.0001376189,0.0000170268],"category_scores_gemma":[0.00003937693,0.00008259811,0.000122049,0.0001840022,0.0001086603,0.0001273488,0.00001533106,0.00007390138,0.000005489723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009559451,"about_ca_system_score_gemma":0.0002253968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002742099,"about_ca_topic_score_gemma":0.003249062,"domain_scores_codex":[0.9987699,0.00004038363,0.0002012321,0.0001755028,0.0003106208,0.0005023236],"domain_scores_gemma":[0.9995098,0.0001187574,0.00007839759,0.00006882269,0.0001196915,0.0001045089],"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.0001828183,0.0000965498,0.004304555,0.00004099906,0.00004243249,0.000004269998,0.005294129,0.002835172,0.0000263356,0.9182346,0.005555015,0.06338309],"study_design_scores_gemma":[0.001862201,0.00003748558,0.001432464,0.00001842747,0.00006651685,2.246233e-7,0.004302911,0.8413783,0.00001562326,0.01507563,0.1353537,0.0004565247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008353372,0.0001029656,0.8415537,0.001482461,0.0008578632,0.00060277,0.00001007657,0.0002042032,0.1468326],"genre_scores_gemma":[0.9930029,0.000002148995,0.001051081,0.0004579185,0.002153294,0.00003950559,0.000005168072,0.0000117231,0.003276268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9846495,"threshold_uncertainty_score":0.7577381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987098882","doi":"10.1007/s10660-010-9056-y","title":"TREET: the Trust and Reputation Experimentation and Evaluation Testbed","year":2010,"lang":"en","type":"article","venue":"Electronic Commerce Research","topic":"Access Control and Trust","field":"Social Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Testbed; Computer science; Computer security; Competition (biology); Reputation system; Internet privacy; Knowledge management; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.07987949931591252,"gpt":0.4861550462912456,"spread":0.4062755469753331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005971567,0.00005628056,0.000065564,0.00007621853,0.001318897,0.0002322537,0.0001545844,0.00006227196,0.0002188143],"category_scores_gemma":[0.0006652495,0.00004249979,0.00001348127,0.0002981952,0.0004436407,0.0002462506,0.0000474615,0.0004955944,0.000007618302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021036,"about_ca_system_score_gemma":0.000344163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003508255,"about_ca_topic_score_gemma":0.01199352,"domain_scores_codex":[0.9978483,0.0007646403,0.0001042592,0.0001893645,0.0006901743,0.0004032545],"domain_scores_gemma":[0.998894,0.000664046,0.00003386691,0.0001377629,0.000202098,0.0000682547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00005958447,0.00005275879,0.01009255,0.000004542537,0.00002060779,4.660249e-7,0.02069677,0.000001825106,0.01080994,0.1535721,0.0006144941,0.8040743],"study_design_scores_gemma":[0.004876939,0.0007818493,0.5899089,0.00002766967,0.0001034625,0.00001550437,0.05784272,0.03514608,0.00299401,0.121628,0.1860715,0.0006033774],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691539,0.001162242,0.00002892001,0.01433577,0.00004758284,0.000597917,4.95643e-7,0.0000217565,0.01465143],"genre_scores_gemma":[0.998767,0.0003432835,0.0000187819,0.00006773698,0.000171133,0.0001258776,0.000005080066,0.000006558849,0.0004945836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.803471,"threshold_uncertainty_score":0.9999812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963957280","doi":"10.1145/344287.344299","title":"Modeling users in role-based access control","year":2000,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Embodied cognition; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02438771193122661,"gpt":0.3184032692818231,"spread":0.2940155573505964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003191958,0.00006948866,0.0001255539,0.00005972774,0.0001828941,0.0001683451,0.0003474527,0.00006818913,0.00430569],"category_scores_gemma":[0.00003412994,0.00006069196,0.00004505035,0.0002207149,0.00005378342,0.000486443,0.000006951766,0.00008443832,0.00009069837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004493143,"about_ca_system_score_gemma":0.0001239156,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02529627,"about_ca_topic_score_gemma":0.02220566,"domain_scores_codex":[0.999085,0.0000922651,0.0001492778,0.0001576633,0.0002198984,0.0002958904],"domain_scores_gemma":[0.9997101,0.00006592847,0.00001449023,0.00009473069,0.00003069305,0.0000840265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003178346,0.0002056134,0.1241413,0.000006059862,0.00002517456,0.00002048669,0.00262102,0.6642661,0.00002797646,0.02320227,0.000157405,0.1850088],"study_design_scores_gemma":[0.002507013,0.00001142521,0.003241135,0.00001141654,0.00001068818,6.322294e-8,0.001015086,0.9832184,0.00001301588,0.002768072,0.006999436,0.0002042157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5501372,0.00009690827,0.00497003,0.004160754,0.00006603786,0.000278662,0.000002420618,0.0001323624,0.4401556],"genre_scores_gemma":[0.9971358,0.0000158943,0.00005829877,0.001587093,0.00009774173,0.00002145536,9.3541e-7,0.000005830708,0.001076931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4469986,"threshold_uncertainty_score":0.9966045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967023604","doi":"10.1145/1151454.1151495","title":"Trusting advice from other buyers in e-marketplaces","year":2006,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Advice (programming); Computer science; Trustworthiness; Reputation system; Order (exchange); Multi-agent system; Ask price; Internet privacy; Business; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008345298722881313,"gpt":0.2700840185227243,"spread":0.261738719799843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003081186,0.00005664205,0.0000886026,0.00003932492,0.0001464903,0.0000707997,0.0001536115,0.00005750045,0.002504264],"category_scores_gemma":[0.00007702425,0.00004844552,0.0000255474,0.0001814659,0.00006292462,0.0002204168,0.00001520058,0.00005952868,0.00008284455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003512544,"about_ca_system_score_gemma":0.00003945629,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.346315,"about_ca_topic_score_gemma":0.2368866,"domain_scores_codex":[0.999267,0.000086525,0.0001272063,0.0001379938,0.0001682631,0.0002130482],"domain_scores_gemma":[0.9996064,0.0002427589,0.00003856257,0.0000621775,0.00001832066,0.00003172642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005178,0.00009354415,0.8942659,0.000003203362,0.0000143031,0.00001360215,0.003243829,0.0001339476,0.0002087714,0.06989407,0.006844684,0.02523235],"study_design_scores_gemma":[0.002154159,0.00001501797,0.4232576,0.00004385772,0.00002463109,1.704443e-7,0.02010799,0.002643294,0.0001939328,0.03394712,0.5170358,0.0005763875],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2818221,0.0001064954,0.0001098105,0.001032411,0.0000924862,0.00006222008,0.000002488077,0.00009100063,0.716681],"genre_scores_gemma":[0.9887409,0.000004609325,0.000579423,0.0003201858,0.0003432131,0.000005993552,0.000001326591,0.000005477245,0.009998881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7069188,"threshold_uncertainty_score":0.9984076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084788889","doi":"10.1109/saner.2015.7081869","title":"Trusting a library: A study of the latency to adopt the latest Maven release","year":2015,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Popularity; Correctness; Computer science; Dependency (UML); Open source; Latency (audio); World Wide Web; Computer security; Software engineering; Operating system; Political science; Software; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04893859744345697,"gpt":0.3004902388011502,"spread":0.2515516413576933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411636,0.00005980469,0.00009748,0.00001868842,0.0003242092,0.00008186424,0.0005815442,0.00002854126,0.000143178],"category_scores_gemma":[0.000422173,0.00002768435,0.00003594361,0.0004725229,0.00007036192,0.000225416,0.0001814643,0.00008524299,0.00003355496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001149151,"about_ca_system_score_gemma":0.0001549726,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008538388,"about_ca_topic_score_gemma":0.003804539,"domain_scores_codex":[0.9990373,0.0002125977,0.0001449437,0.0001134772,0.0003188413,0.0001727965],"domain_scores_gemma":[0.9994261,0.0001240457,0.00006596673,0.0002218179,0.00005432594,0.0001077699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00009215816,0.0005768208,0.7861739,0.000005263761,0.00005791398,0.00001021764,0.1426456,0.0004065777,0.000008831295,0.04120674,0.01699027,0.01182566],"study_design_scores_gemma":[0.003400881,0.0007341251,0.4451211,0.0000666427,0.0001823984,0.000001682373,0.410881,0.001090538,0.00007278006,0.01556981,0.1223555,0.0005235553],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7726939,0.00003388883,0.000006660641,0.01359958,0.0001456999,0.0005406637,0.000001620092,0.00005560514,0.2129223],"genre_scores_gemma":[0.9922637,0.000001930547,0.00004925448,0.000562892,0.0001409974,0.00001876875,1.3938e-7,0.000006270965,0.006955998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3410528,"threshold_uncertainty_score":0.9980639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991066","doi":"10.1001/archotol.1991.01870140096015","title":"Bayesian Network-Based Trust Model in Peer-to-Peer Networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Reputation; Computer science; Bayesian network; Peer-to-peer; Computational trust; Peer review; Bayesian probability; Internet privacy; World Wide Web; Artificial intelligence; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01923922786681527,"gpt":0.293599398402784,"spread":0.2743601705359687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516307,0.00013987,0.0002079079,0.00005596582,0.0003380247,0.0001427027,0.0003009518,0.000167683,0.0008202913],"category_scores_gemma":[0.0003120105,0.0001262803,0.00007327175,0.0006711758,0.00008302381,0.0001881615,0.00001979079,0.0001949801,0.00005084252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008891385,"about_ca_system_score_gemma":0.000240015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00181048,"about_ca_topic_score_gemma":0.0142945,"domain_scores_codex":[0.9979996,0.0001822903,0.0002339684,0.0002874067,0.0005853575,0.000711385],"domain_scores_gemma":[0.9992163,0.0001107857,0.00004235939,0.0001973398,0.0001710266,0.0002621631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000216141,0.00005425827,0.04595279,0.000001214357,0.000006246667,0.000007070825,0.0005526181,0.7607278,6.036167e-7,0.1676643,0.0211174,0.003894075],"study_design_scores_gemma":[0.0009529796,0.00002502707,0.003545443,0.00001337742,0.0000129573,1.829245e-7,0.0005406046,0.8707871,0.000003566767,0.01025558,0.1134905,0.0003726261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004932328,0.00007213326,0.3935364,0.01044793,0.000373378,0.000391978,0.000001698207,0.0001270555,0.5901171],"genre_scores_gemma":[0.9630694,0.000004665237,0.004154822,0.003369561,0.0002828913,0.00003674677,0.000003434707,0.00001551204,0.02906299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.958137,"threshold_uncertainty_score":0.8981614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062215838","doi":"10.1145/990036.990047","title":"A role-based approach to access control for XML databases","year":2004,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Database; XML database; XML; Access control; World Wide Web; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05933264869955239,"gpt":0.3561954484489704,"spread":0.296862799749418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003609382,0.0001033173,0.000174891,0.00006809752,0.0004418196,0.0002238636,0.0005201419,0.00004396613,0.00009889692],"category_scores_gemma":[0.000276497,0.00008340211,0.00008088559,0.0002377245,0.00008212069,0.0004594062,0.00003344891,0.00004783812,0.00003458333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006074413,"about_ca_system_score_gemma":0.0002959353,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008394493,"about_ca_topic_score_gemma":0.004452275,"domain_scores_codex":[0.9988967,0.00004111423,0.0001448748,0.0002735254,0.0002629144,0.0003808289],"domain_scores_gemma":[0.9992904,0.0001690373,0.00004310521,0.0001857012,0.0001096392,0.0002021395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003175309,0.0005259262,0.004031751,0.00002415551,0.00005128516,0.00000142451,0.001054106,0.006434771,0.0001705986,0.9721813,0.002344893,0.01286232],"study_design_scores_gemma":[0.0299543,0.0003610973,0.01452218,0.00007347303,0.0002972862,0.000001181668,0.007829488,0.008331264,0.002416841,0.03580072,0.8985565,0.001855685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004495175,0.0000616766,0.8216704,0.006845914,0.0001206709,0.001437608,0.00009151929,0.0001896596,0.1650874],"genre_scores_gemma":[0.9873506,0.000001421766,0.006725408,0.004596511,0.0003313953,0.0003764934,0.00001984245,0.00001066449,0.0005876996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9828554,"threshold_uncertainty_score":0.9982087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529085936","doi":"10.1007/0-387-24098-5_11","title":"A Trust Model with Statistical Foundation","year":2005,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Access Control and Trust","field":"Social Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Trustworthiness; Computer science; Foundation (evidence); The Internet; Face (sociological concept); Data science; Internet privacy; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02615348196355789,"gpt":0.31262783267181,"spread":0.2864743507082522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005764506,0.0003989667,0.0003413172,0.000408436,0.001547321,0.00253518,0.000443929,0.0004392786,0.001113126],"category_scores_gemma":[0.0002785786,0.0003804268,0.0001211834,0.00006694479,0.000272509,0.005638991,0.00004053102,0.0003326973,0.0003839454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000620152,"about_ca_system_score_gemma":0.001331029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006261815,"about_ca_topic_score_gemma":0.0004985474,"domain_scores_codex":[0.9968702,0.00002019346,0.0009723926,0.0003543333,0.001434708,0.00034814],"domain_scores_gemma":[0.9963059,0.0001200556,0.001001786,0.0001665572,0.002235677,0.0001700658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002561759,0.00002802273,0.00001294235,0.00006682448,0.00007522378,6.210238e-7,0.001840434,0.001897063,0.000001415418,0.8461627,0.005959635,0.1436989],"study_design_scores_gemma":[0.001163503,0.00006539837,0.00002543297,0.0001426017,0.00008229873,0.000005038824,0.0003021146,0.1141054,0.000008324719,0.03888331,0.8446993,0.0005173039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001141194,0.00002608615,0.3433046,0.002829069,0.0004247316,0.0008069723,0.00029382,0.0001742992,0.652129],"genre_scores_gemma":[0.2017983,0.0001106154,0.02183519,0.002887782,0.00250462,0.0005587107,0.009544817,0.0001074256,0.7606525],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8387397,"threshold_uncertainty_score":0.9998648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017533400","doi":"10.1007/s13278-013-0122-z","title":"Trust prediction from user-item ratings","year":2013,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Access Control and Trust","field":"Social Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Variety (cybernetics); Focus (optics); Set (abstract data type); Product (mathematics); Social network (sociolinguistics); Machine learning; Data mining; Data science; Artificial intelligence; Information retrieval; Social media; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0104398940578091,"gpt":0.2528056440147893,"spread":0.2423657499569802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003666669,0.00009846211,0.0002813908,0.00006033286,0.001578908,0.0003171041,0.000111205,0.0001274491,0.0007189693],"category_scores_gemma":[0.00006672856,0.00009262966,0.0001547844,0.0008305229,0.0001366064,0.0003237682,0.00003817437,0.00009464251,0.0000130795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002674785,"about_ca_system_score_gemma":0.00002985023,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01779826,"about_ca_topic_score_gemma":0.005292658,"domain_scores_codex":[0.9988396,0.0001514189,0.0002243721,0.0002337951,0.0002358378,0.0003150098],"domain_scores_gemma":[0.9994522,0.0001502681,0.0001475074,0.00006490051,0.00008239027,0.0001027363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000006134499,0.00001415386,0.8823279,0.000001301519,0.0007278927,0.000001000314,0.01420874,0.00009665395,0.00001253991,0.003092656,0.004490594,0.09502048],"study_design_scores_gemma":[0.0003448221,0.00001562608,0.949859,0.00001033694,0.001223574,3.922945e-8,0.01740489,0.009681419,0.000001205894,0.002683358,0.0185547,0.000221018],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818881,0.0003560292,0.001641184,0.0008698764,0.0001827574,0.0001238779,0.000009536911,0.00008026038,0.01484843],"genre_scores_gemma":[0.9949909,0.00008692034,0.0006147866,0.000225347,0.002769272,0.00002403216,0.00003220494,0.00000723403,0.001249336],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09479946,"threshold_uncertainty_score":0.9997209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976617111","doi":"10.1016/j.dss.2014.06.006","title":"Filtering trust opinions through reinforcement learning","year":2014,"lang":"en","type":"article","venue":"Decision Support Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Research Foundation","keywords":"Reinforcement learning; Trustworthiness; Computer science; Outcome (game theory); Accountability; Key (lock); Order (exchange); Intervention (counseling); Mechanism (biology); Cognitive psychology; Computer security; Artificial intelligence; Psychology; Business; Microeconomics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.03777623411525292,"gpt":0.3354713864031502,"spread":0.2976951522878972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001497694,0.0001361211,0.0002865208,0.00007545229,0.0009549183,0.0003059659,0.00038326,0.0001183839,0.001180928],"category_scores_gemma":[0.0005757512,0.0001176025,0.0001052389,0.0002260017,0.00007962844,0.000470984,0.00009747007,0.0001579637,0.0009066846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007219799,"about_ca_system_score_gemma":0.00008289683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001762156,"about_ca_topic_score_gemma":0.0000859767,"domain_scores_codex":[0.9978336,0.0001959027,0.0004952464,0.0002879215,0.0007699407,0.0004173573],"domain_scores_gemma":[0.9988502,0.0003829101,0.0001977317,0.0002861845,0.0001204798,0.0001624809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001700499,0.000136608,0.05709526,0.0001126332,0.0001720807,0.00006480988,0.03454718,0.03166474,0.0002069367,0.6287796,0.08635966,0.1606905],"study_design_scores_gemma":[0.0004119451,0.00006103107,0.0007002251,0.00005793253,0.000008501457,0.000003624108,0.003006125,0.004027903,0.000008647946,0.0004764937,0.991072,0.0001655856],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01327779,0.0001049088,0.4172083,0.0004924799,0.00415858,0.0005592586,0.000004694684,0.00031232,0.5638817],"genre_scores_gemma":[0.9862962,0.00004391208,0.000330884,0.0001182357,0.000776006,0.00004755535,0.00002584107,0.0000163722,0.01234496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730184,"threshold_uncertainty_score":0.9998713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170110871","doi":"10.1109/cie.2002.1186008","title":"A process model for building social capital in virtual learning communities","year":2003,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Social capital; Storytelling; Knowledge management; Computer science; Process (computing); Social learning; Individual capital; Financial capital; Sociology; Economic growth; Economics; Human capital; Social science","retraction":null,"screen_n_in":null,"score":{"opus":0.04358404259678156,"gpt":0.348836899028224,"spread":0.3052528564314424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199107,0.00006347021,0.0001139634,0.0000514458,0.0009082999,0.00008132139,0.0001561837,0.00006827005,0.0000649826],"category_scores_gemma":[0.0001618491,0.00006143434,0.00004003807,0.0001126614,0.0001233133,0.0003107348,0.00001357675,0.0001405814,0.000002195587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004369006,"about_ca_system_score_gemma":0.0001555048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001566031,"about_ca_topic_score_gemma":0.01120294,"domain_scores_codex":[0.9992796,0.0001113678,0.0001132211,0.00007652435,0.0001476419,0.0002716635],"domain_scores_gemma":[0.9997018,0.0001340119,0.00003714211,0.00003046279,0.00006438316,0.00003217869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.00001444217,0.00003750001,0.004736558,0.000006414502,0.000006572102,3.478322e-7,0.1685474,0.006985117,0.00001287497,0.8175307,0.00002817731,0.002093892],"study_design_scores_gemma":[0.001700775,0.00006090034,0.0004087698,0.00001644225,0.0000149442,3.535355e-7,0.6947358,0.2212677,0.00006434001,0.07890806,0.002438952,0.0003829192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.915393,0.00002751707,0.02831823,0.0003767152,0.00005207668,0.0002027861,0.000001706063,0.00006767018,0.05556033],"genre_scores_gemma":[0.997304,0.000004718192,0.0003025131,0.00009672653,0.00006575188,0.00005852698,0.000001426616,0.000007660259,0.002158639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7386226,"threshold_uncertainty_score":0.6986001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130719936","doi":"10.1109/euc.2008.149","title":"Probabilistic Trust Management in Pervasive Computing","year":2008,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Probabilistic logic; Computer science; Trust management (information system); Weighting; Ubiquitous computing; Scheme (mathematics); Distributed computing; Data mining; Computer security; Artificial intelligence; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.03302330855441828,"gpt":0.2990848013455227,"spread":0.2660614927911044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001987147,0.00004942817,0.00008385075,0.0000453492,0.0003117332,0.00002247793,0.0001542979,0.00002725064,0.0002727211],"category_scores_gemma":[0.00004668903,0.00004308438,0.00002569743,0.0002065715,0.0001310809,0.00009839472,0.0000409194,0.00005206727,0.00007199083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006133784,"about_ca_system_score_gemma":0.00003919258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002265341,"about_ca_topic_score_gemma":0.002903354,"domain_scores_codex":[0.9993072,0.00005090228,0.0001141573,0.0001347569,0.0001779767,0.0002150503],"domain_scores_gemma":[0.9997835,0.0000538428,0.00002411346,0.00006831957,0.00002509207,0.00004512491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001625213,0.0001895853,0.1548175,0.00002288657,0.00002857131,0.0002671247,0.01997737,0.0004099131,0.00000151143,0.7474031,0.001351845,0.07551432],"study_design_scores_gemma":[0.001863192,0.00003925029,0.9077082,0.00003562097,0.00002147849,0.000005229812,0.02054825,0.005301313,0.000006094227,0.01379415,0.05023314,0.0004440892],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3644002,0.00003217529,0.0003091246,0.0009892834,0.00008783944,0.0002567918,2.291943e-7,0.00007005539,0.6338543],"genre_scores_gemma":[0.9934132,0.00003618288,0.0005794286,0.0002374668,0.00008245402,0.000007547282,5.37396e-7,0.000003077526,0.005640157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7528907,"threshold_uncertainty_score":0.3424532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W165883286","doi":"10.65109/ovuf6099","title":"Maintenance-based trust for multi-agent systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Reputation; Process (computing); Multi-agent system; Order (exchange); Set (abstract data type); Trustworthiness; Computational trust; Architecture; Risk analysis (engineering); Computer security; Artificial intelligence; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.05975973110133603,"gpt":0.3397331027805341,"spread":0.2799733716791981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451244,0.00007044535,0.000124665,0.00002232567,0.0003379618,0.0001113294,0.0001866164,0.00006013902,0.0001018542],"category_scores_gemma":[0.000115183,0.00005290586,0.00007875203,0.00009430899,0.00005463213,0.0001068645,0.000003949808,0.00003522688,0.00004151267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006415124,"about_ca_system_score_gemma":0.00009333616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001324037,"about_ca_topic_score_gemma":0.0005640033,"domain_scores_codex":[0.9992057,0.00003957472,0.0001356955,0.0001491777,0.0001638015,0.0003060311],"domain_scores_gemma":[0.9995959,0.00005706347,0.00004849917,0.0001002371,0.00009859002,0.0000997031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001057125,0.0003332302,0.00581368,0.00002527162,0.0000275959,0.000008529109,0.001300223,0.000423409,0.0001124973,0.9118122,0.02236706,0.05767063],"study_design_scores_gemma":[0.004636485,0.0001952304,0.01523383,0.00004391936,0.00003971934,4.028495e-7,0.004827435,0.07827992,0.0001092659,0.001436551,0.8947526,0.0004446836],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01573228,0.0006418584,0.6425191,0.01897709,0.00220659,0.003002152,0.00003767441,0.0006720516,0.3162112],"genre_scores_gemma":[0.9804627,0.000008471003,0.00182233,0.001016659,0.0002722151,0.00004759845,0.000002662075,0.000004327955,0.01636301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9647304,"threshold_uncertainty_score":0.2599363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2248999929","doi":"","title":"A reputation management approach for resource constrained trustee agents","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Reputation; Reputation management; Computer science; Constraint (computer-aided design); Control (management); Work (physics); Trust management (information system); Resource (disambiguation); Computer security; Resource management (computing); Risk analysis (engineering); Multi-agent system; Business; Distributed computing; Law; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1450471926422882,"gpt":0.3607568540229891,"spread":0.2157096613807009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005505393,0.0001764906,0.0001847373,0.000202526,0.0004035771,0.0005408642,0.000565654,0.0001015567,0.002244384],"category_scores_gemma":[0.0003294468,0.0001715731,0.0001290074,0.0001753257,0.0003192955,0.0003738025,0.000061141,0.0001423323,0.0004224463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397206,"about_ca_system_score_gemma":0.00008360676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005177702,"about_ca_topic_score_gemma":0.00008406878,"domain_scores_codex":[0.9978905,0.0001090115,0.0005229541,0.0004677346,0.000644657,0.0003651917],"domain_scores_gemma":[0.9987761,0.0001423008,0.0002190084,0.0001919161,0.0005265474,0.0001441056],"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.00005593267,0.0001448499,0.00002475066,0.000007677401,0.0000495845,0.000002707344,0.00125293,0.000453522,0.00009279032,0.7513539,0.0007573327,0.245804],"study_design_scores_gemma":[0.0004359106,0.0002591716,0.001206905,0.000169649,0.00006630575,0.00000440072,0.04681274,0.3311746,0.002556185,0.5745426,0.04184154,0.0009300367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005762489,0.000007134275,0.4357693,0.009151272,0.0007084062,0.00171791,0.00002944632,0.0001563142,0.5466977],"genre_scores_gemma":[0.9881191,0.000027787,0.006580533,0.0007875913,0.0003519539,0.0005089941,0.00006447635,0.00001423863,0.003545379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9823565,"threshold_uncertainty_score":0.9986677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106964285","doi":"10.1145/1108906.1108910","title":"Access control to people location information","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Access control; Variety (cybernetics); Control (management); Computer security; Signature (topology); Database; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01012953432973272,"gpt":0.2770003379755333,"spread":0.2668708036458006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785043,0.0001132512,0.000158686,0.0002651849,0.0008679494,0.000595925,0.0002975675,0.000115513,0.0001337092],"category_scores_gemma":[0.0001139066,0.0001089115,0.00004418352,0.0004710334,0.00003288055,0.008169007,0.000006551364,0.0001266695,0.0006729529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001857065,"about_ca_system_score_gemma":0.0001049697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001802457,"about_ca_topic_score_gemma":0.002511679,"domain_scores_codex":[0.9987702,0.00009327544,0.0004535104,0.00008248526,0.0003897357,0.0002108228],"domain_scores_gemma":[0.9989996,0.00009762145,0.0001545442,0.0002210813,0.0003392879,0.0001878572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004092704,0.0001365359,0.002366775,0.0004460814,0.00009930901,2.531257e-7,0.1596724,0.01578945,0.000002261937,0.09424973,0.001723611,0.7251043],"study_design_scores_gemma":[0.005476695,0.0001938688,0.03100347,0.000210715,0.0001287572,0.00001296036,0.05555459,0.04280376,0.0001241591,0.0006919708,0.862885,0.0009140606],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06032619,0.00003373161,0.8789895,0.01629,0.0007379145,0.001799469,0.0001268884,0.0005307446,0.04116559],"genre_scores_gemma":[0.9978577,0.00002722856,0.0001514786,0.001683971,0.0000886293,0.0001346803,0.00001807094,0.000003018687,0.00003520655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9375315,"threshold_uncertainty_score":0.8649672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126888608","doi":"10.1007/s10207-007-0025-y","title":"A familiarity-based trust model for effective selection of sellers in multiagent e-commerce systems","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Computer science; Feeling; Order (exchange); Selection (genetic algorithm); Affect (linguistics); Similarity (geometry); Artificial intelligence; Psychology; Business; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01428129202086808,"gpt":0.3277341679274069,"spread":0.3134528759065388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551789,0.00007264499,0.0001717804,0.0003598507,0.00007829416,0.00006422973,0.0002713604,0.00009345956,0.000008450802],"category_scores_gemma":[0.000509843,0.00006828641,0.000118116,0.000190513,0.00005355087,0.001308084,0.00001250448,0.0001675603,0.000001651777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004120955,"about_ca_system_score_gemma":0.0002162298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009037089,"about_ca_topic_score_gemma":0.0006453344,"domain_scores_codex":[0.9983762,0.00007225008,0.0007390396,0.00004664439,0.0006265477,0.0001393416],"domain_scores_gemma":[0.9972439,0.0003273883,0.0007629546,0.00003553868,0.001565858,0.00006439225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006841097,0.001184297,0.2160593,0.0003316347,0.000611298,0.00001200701,0.1410339,0.4046442,0.000399473,0.1629685,0.001617721,0.06429654],"study_design_scores_gemma":[0.003842971,0.000113841,0.0263958,0.0001237,0.00002205868,0.000005962237,0.006189881,0.9561613,0.0004940159,0.001385657,0.005129947,0.0001349139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6094683,0.00003216631,0.3854883,0.0005261764,0.0008969627,0.0005518468,0.00003958899,0.0000124506,0.002984196],"genre_scores_gemma":[0.9988763,0.00001772996,0.0007868941,0.0001450643,0.0001420439,0.0000100783,0.000008178969,0.000002862105,0.0000108198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.551517,"threshold_uncertainty_score":0.2784639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2558469781","doi":"10.1109/iemcon.2016.7746297","title":"Using REST based protocol to enable ABAC within IoT systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Internet of Things; Computer science; Computer security; Key (lock); Access control; Protocol (science); Plan (archaeology); The Internet; Computer network; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1020676587738291,"gpt":0.4006426431319204,"spread":0.2985749843580913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006456972,0.00007457571,0.0001182671,0.00005050894,0.0003555872,0.0001386145,0.0002163049,0.00006153811,0.0004756701],"category_scores_gemma":[0.0001917606,0.00004262305,0.00002909831,0.0002011413,0.00006760716,0.0001157535,0.00002701137,0.00003195615,0.0001853169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066455,"about_ca_system_score_gemma":0.0002700449,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01460415,"about_ca_topic_score_gemma":0.003198755,"domain_scores_codex":[0.9989285,0.0001270854,0.0001716932,0.0001843815,0.0003031223,0.0002852232],"domain_scores_gemma":[0.9994263,0.00009117507,0.00006450702,0.0001539978,0.0001012981,0.0001627097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007338531,0.0005097915,0.0943706,0.0002660435,0.0001048612,0.00008126375,0.007080489,0.004293593,0.05520134,0.7982577,0.01800436,0.0210961],"study_design_scores_gemma":[0.004860396,0.0002541025,0.002406201,0.0007154514,0.00003337051,0.000001808065,0.004531117,0.008828522,0.006668174,0.002357156,0.9682913,0.001052354],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04598551,0.00001086281,0.03549781,0.01009872,0.001156362,0.1933499,0.000014733,0.0006548195,0.7132313],"genre_scores_gemma":[0.9626724,3.862184e-8,0.001265082,0.0003502083,0.0004161864,0.02058176,7.55029e-8,0.00001020939,0.014704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.950287,"threshold_uncertainty_score":0.9919577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1884165172","doi":"10.1007/11957454_7","title":"A Systemic Approach to Automate Privacy Policy Enforcement in Enterprises","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Leverage (statistics); Computer science; Enforcement; Privacy policy; Privacy by Design; Information privacy; Personally identifiable information; Computer security; Identity management; Internet privacy; Privacy law; Identity (music); Law enforcement; Privacy software; Work (physics); Knowledge management; Business; Access control; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01650924173830681,"gpt":0.2841144757810714,"spread":0.2676052340427646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001007058,0.0003888013,0.0005348785,0.001269334,0.0003424667,0.0004794459,0.00201411,0.0002825138,0.00002367876],"category_scores_gemma":[0.0001592651,0.0003500728,0.000105188,0.0008297114,0.0005904916,0.0003169753,0.0006270161,0.0004150897,0.00004172749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001124031,"about_ca_system_score_gemma":0.001143712,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007129139,"about_ca_topic_score_gemma":0.001261726,"domain_scores_codex":[0.9964473,0.00006478151,0.0005479878,0.0009847579,0.001094956,0.0008602692],"domain_scores_gemma":[0.9987243,0.0001962283,0.0002189148,0.0005421041,0.0001173581,0.0002011115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004019821,0.0001813137,0.002944642,0.0002110527,0.00002797443,0.00009485694,0.02773799,0.1477671,0.00004786845,0.184017,0.0001800865,0.6367499],"study_design_scores_gemma":[0.005965348,0.0009301803,0.01104497,0.009670581,0.000135871,0.0001661836,0.00007395833,0.3960493,0.0003808027,0.408457,0.157818,0.009307775],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007198221,0.0003468341,0.8090367,0.0008528665,0.0007072617,0.001237725,0.000009285693,0.0001564099,0.1869331],"genre_scores_gemma":[0.9845891,0.00003138436,0.01173857,0.001070988,0.001029132,0.00004349243,0.000005367354,0.00002591012,0.00146607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9838693,"threshold_uncertainty_score":0.9998952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990798025","doi":"10.4018/jhisi.2006010102","title":"Health Insurance Portability and Accountability Act (HIPPA) Compliant Access Control Model for Web Services","year":2006,"lang":"en","type":"article","venue":"International Journal of Healthcare Information Systems and Informatics","topic":"Access Control and Trust","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Health Insurance Portability and Accountability Act; Protected health information; Internet privacy; Business; Information privacy; Health care; Computer security; Access control; Privacy by Design; Computer science; World Wide Web; Confidentiality; Health policy; HRHIS","retraction":null,"screen_n_in":null,"score":{"opus":0.0285830546468775,"gpt":0.3604314762064048,"spread":0.3318484215595273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381622,0.0001392596,0.0004146024,0.0002054389,0.0004107909,0.0008441156,0.0004075518,0.0001062779,0.000002362179],"category_scores_gemma":[0.0001008338,0.0001143951,0.00007487758,0.00009196189,0.0001157398,0.006927821,0.0000448339,0.0001724956,0.000001432153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002379972,"about_ca_system_score_gemma":0.0007166954,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009298667,"about_ca_topic_score_gemma":0.003125672,"domain_scores_codex":[0.9968541,0.0000852837,0.001960111,0.00006067871,0.0007862834,0.0002535954],"domain_scores_gemma":[0.9951301,0.0002245127,0.002170497,0.00009888077,0.002191832,0.0001841944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006522693,0.0001164088,0.802277,0.003226866,0.0001744713,9.589378e-7,0.03443758,0.00880459,0.000002158217,0.08843649,0.001191624,0.06067963],"study_design_scores_gemma":[0.00544365,0.000217387,0.2885889,0.0006681855,0.00002228697,0.0001029576,0.02192986,0.6077347,0.000001173797,0.003378661,0.0715117,0.0004004567],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.92603,0.00155295,0.04273839,0.02156134,0.002423407,0.002167092,0.001235421,0.00009521253,0.002196216],"genre_scores_gemma":[0.9972417,0.0003563128,0.0004787619,0.001587841,0.000278976,0.00001938818,0.00002562463,0.000004773101,0.000006583714],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5989302,"threshold_uncertainty_score":0.9972985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003752715","doi":"10.1145/2752952.2752962","title":"Relationship-Based Access Control for an Open-Source Medical Records System","year":2015,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Access control; Authorization; Computer science; Role-based access control; Domain (mathematical analysis); Control (management); Medical record; Computer access control; Health care; Open source; Computer security; World Wide Web; Medicine; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1392873605600749,"gpt":0.4129945754964056,"spread":0.2737072149363308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266573,0.00009064876,0.0002148608,0.00005065688,0.000574152,0.0006164755,0.001354274,0.0001799007,0.0002343449],"category_scores_gemma":[0.002010075,0.00007218623,0.00004283594,0.0002023852,0.0001287633,0.001039347,0.00006678623,0.0001014193,0.000042909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265914,"about_ca_system_score_gemma":0.001053932,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01281669,"about_ca_topic_score_gemma":0.01965849,"domain_scores_codex":[0.9982078,0.0004056791,0.0002555312,0.0002436725,0.0005958746,0.0002914151],"domain_scores_gemma":[0.9980535,0.0007572084,0.0001058402,0.0002067881,0.0002925578,0.0005841241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005485876,0.0002480796,0.2197701,0.00003759678,0.00003747988,0.00000651013,0.001487947,0.0002696559,8.290531e-7,0.7228946,0.03279138,0.02190729],"study_design_scores_gemma":[0.02360394,0.000757936,0.01967932,0.0001145595,0.0001801369,0.000003562767,0.01814429,0.168974,0.00001347402,0.01140149,0.7561879,0.0009394923],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01657512,0.00006691222,0.4960535,0.01693244,0.001185708,0.002248726,0.00002313578,0.0005825015,0.466332],"genre_scores_gemma":[0.9939676,3.551103e-7,0.0005185078,0.00127877,0.0005685678,0.0002152627,0.00001195141,0.00001412402,0.003424854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9773925,"threshold_uncertainty_score":0.9982302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1565356825","doi":"","title":"Towards con-resistant trust models for distributed agent systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Access Control and Trust","field":"Social Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Reputation; Regret; Computer science; Scheme (mathematics); Focus (optics); Computer security; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04591233352695426,"gpt":0.3155450448495606,"spread":0.2696327113226064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000383674,0.0000984591,0.0001967295,0.00002742166,0.0004321502,0.0002086823,0.000251994,0.00008651555,0.0000832904],"category_scores_gemma":[0.0000769667,0.00007679974,0.00009557664,0.0001352105,0.00006515779,0.0002484208,0.00001176108,0.00004340856,0.00001193863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029988,"about_ca_system_score_gemma":0.0001361091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003251347,"about_ca_topic_score_gemma":0.0004163234,"domain_scores_codex":[0.998904,0.00005075755,0.0002105883,0.0001895997,0.0002901856,0.0003548048],"domain_scores_gemma":[0.9994498,0.00005644688,0.00006536676,0.0001308387,0.0001468477,0.0001506424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006327849,0.00005671154,0.00004296756,0.000007845586,0.00002077083,0.000003067833,0.0005588439,0.0006204588,0.00003873623,0.9850182,0.00587255,0.007696584],"study_design_scores_gemma":[0.004176893,0.0004500594,0.004997339,0.00006423421,0.0001649351,0.000001225135,0.01283791,0.1469453,0.0001514776,0.1391602,0.6900282,0.001022275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01576121,0.001159303,0.474643,0.01298715,0.001150979,0.002182792,0.0004666403,0.0005480325,0.4911009],"genre_scores_gemma":[0.9955899,0.00003141755,0.0001975581,0.0002726324,0.0002765075,0.00004707848,0.00002762941,0.000005002545,0.003552235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9798287,"threshold_uncertainty_score":0.4915086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160172686","doi":"10.1109/tkde.2009.138","title":"Credibility: How Agents Can Handle Unfair Third-Party Testimonies in Computational Trust Models","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Access Control and Trust","field":"Social Sciences","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Credibility; Computer science; Computer security; Work (physics); Computational trust; Empirical evidence; Computational model; Risk analysis (engineering); Artificial intelligence; Reputation; Business; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.05783747098160918,"gpt":0.3104771853336928,"spread":0.2526397143520836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606901,0.0001320807,0.0001690656,0.0001437295,0.0002836781,0.0001275585,0.0002628894,0.00007826867,0.00001537931],"category_scores_gemma":[0.00002116871,0.0001327873,0.00002878292,0.0002825026,0.00006043889,0.0007329466,0.000003832331,0.0001945632,0.000004671284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006746312,"about_ca_system_score_gemma":0.00009954358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003024363,"about_ca_topic_score_gemma":0.002143791,"domain_scores_codex":[0.9990965,0.00003431756,0.0001465006,0.0003112389,0.0001610127,0.0002504071],"domain_scores_gemma":[0.9994364,0.0001380822,0.00002193211,0.0002379025,0.00004530219,0.0001203725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005617999,0.0006797077,0.0006690598,0.0000622607,0.00007353054,0.00001819764,0.01004381,0.8923733,0.0001012633,0.00441379,0.0009623975,0.09054657],"study_design_scores_gemma":[0.0006606218,0.0000468688,0.003816734,0.00005727154,0.00002802441,0.000001540918,0.0004021025,0.9911923,0.00006364615,0.001303369,0.002203717,0.00022378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09402299,0.0007891028,0.8970188,0.002735875,0.0006427778,0.0004474031,0.0004894934,0.0003202429,0.003533253],"genre_scores_gemma":[0.9985486,0.0001002298,0.0009795846,0.00004033207,0.00008120397,0.00001102341,0.00002796481,0.000008155201,0.0002028725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9045256,"threshold_uncertainty_score":0.5414909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}