{"id":"W2237745239","doi":"","title":"Modeling and Verifying Probabilistic Social Commitments in Multi-Agent Systems","year":2015,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Concordia University","keywords":"Probabilistic logic; Correctness; Computer science; Model checking; Probabilistic CTL; Multi-agent system; Verifiable secret sharing; Context (archaeology); Theoretical computer science; Artificial intelligence; Probabilistic analysis of algorithms; Algorithm; Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001193093,0.0003134326,0.0004950315,0.001260618,0.0007196874,0.0004744442,0.0009817337,0.0003848895,0.000001488631],"category_scores_gemma":[0.00006882581,0.0003585549,0.0000960157,0.0009118675,0.00006903725,0.0006334285,0.0003169599,0.0008832608,0.00001560152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736827,"about_ca_system_score_gemma":0.0008143127,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02784509,"about_ca_topic_score_gemma":0.01503521,"domain_scores_codex":[0.9959292,0.000999834,0.0004379475,0.000932669,0.00101844,0.0006818669],"domain_scores_gemma":[0.99854,0.00009476219,0.0002071605,0.000506117,0.0003771748,0.0002747653],"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.005302066,0.008158488,0.31248,0.03038535,0.003853334,0.02609132,0.204901,0.09522454,0.04029706,0.2418773,0.008800187,0.02262945],"study_design_scores_gemma":[0.002628122,0.0002458987,0.02963891,0.0007057407,0.00004456734,0.00002574539,0.006930966,0.9561797,0.0002323435,0.000338545,0.002174611,0.0008548282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830353,0.000624521,0.004208053,0.00006759186,0.002017655,0.001524033,0.000007765555,0.0001354571,0.008379572],"genre_scores_gemma":[0.9914402,0.0000638606,0.00009385545,0.000001748723,0.0001708771,0.00001616931,0.00005158333,0.00003043957,0.008131318],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8609552,"threshold_uncertainty_score":0.9998866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1007800320010015,"score_gpt":0.3293852558243314,"score_spread":0.2286052238233299,"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."}}