{"id":"W42443586","doi":"10.1007/978-3-642-36907-0_19","title":"An Approach on Merging Agents’ Trust Distributions in a Possibilitic Domain","year":2013,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Trustworthiness; Computer science; Set (abstract data type); Order (exchange); Domain (mathematical analysis); Distribution (mathematics); Block (permutation group theory); Multi-agent system; Artificial intelligence; Computer security; Mathematics; Business","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519548,0.000156697,0.0002065174,0.0006947998,0.001086068,0.0006557027,0.001791802,0.0001352661,0.00006138279],"category_scores_gemma":[0.00006985438,0.0001526799,0.00003585165,0.0004298789,0.001631521,0.005146988,0.0003680361,0.0004111715,0.0000638022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003222252,"about_ca_system_score_gemma":0.0003274927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003980514,"about_ca_topic_score_gemma":0.0001591109,"domain_scores_codex":[0.9984185,0.00009579345,0.0005337446,0.0002282247,0.0004379874,0.0002858117],"domain_scores_gemma":[0.9982098,0.0001616682,0.0002046449,0.001073395,0.0002081581,0.0001423374],"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.000001771293,0.00004004246,0.0002973099,0.000006916382,0.000001867551,1.244459e-7,0.006911107,0.0001119719,2.311761e-7,0.9267448,0.00004694098,0.06583698],"study_design_scores_gemma":[0.001689924,0.0001531467,0.0684109,0.0005476349,0.00002122688,0.000006978189,0.004793512,0.390937,0.000001295185,0.1434325,0.3887004,0.001305576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.003314675,0.0001106206,0.01966623,0.001112261,0.0001540052,0.0007606573,0.00003777508,0.00006222968,0.9747816],"genre_scores_gemma":[0.9832311,0.0007326704,0.01409784,0.0005120568,0.00006004533,0.00008916195,0.0001676877,0.000007176124,0.001102215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9799165,"threshold_uncertainty_score":0.835327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04608582332322127,"score_gpt":0.3328916053492407,"score_spread":0.2868057820260194,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}