{"id":"W4366503778","doi":"10.1007/978-3-031-30829-1_14","title":"Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"University of Oxford","keywords":"Probabilistic logic; Markov chain; Probabilistic CTL; Sequence (biology); Computer science; Similarity (geometry); Algorithm; Discrete mathematics; Construct (python library); Markov process; Theoretical computer science; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Programming language; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001947391,0.0005652824,0.0005095818,0.001344908,0.0007300152,0.002092306,0.001526437,0.001220332,0.003616929],"category_scores_gemma":[0.0106369,0.0004962769,0.001459783,0.001298166,0.002540949,0.003980415,0.002032461,0.002331518,0.0003873312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002537338,"about_ca_system_score_gemma":0.0009316368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001355193,"about_ca_topic_score_gemma":0.001125964,"domain_scores_codex":[0.9973416,0.0007143223,0.000177166,0.0006642829,0.0009008463,0.0002018195],"domain_scores_gemma":[0.989549,0.007939549,0.0006954565,0.000884218,0.0007371921,0.0001944927],"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.0001020598,0.00003992089,0.001066408,0.0001583621,0.00004278413,0.0001797788,0.0004029582,0.04380878,0.004311554,0.917027,0.001084218,0.03177615],"study_design_scores_gemma":[0.00002054721,0.00004129977,0.0003882936,0.00004068034,0.00003759125,0.0001309271,0.00005883219,0.2028996,0.005051395,0.78675,0.004553867,0.00002710707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08662875,0.0004448129,0.9027931,0.0008223473,0.00006834118,0.0001030963,0.0001943407,0.0008349625,0.008110129],"genre_scores_gemma":[0.6973527,0.0003681133,0.2964277,0.0003298897,0.00007845213,0.0002116378,0.0004605307,0.0002202459,0.004550692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003616929,"threshold_uncertainty_score":0.01840979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0411923936904238,"score_gpt":0.2994723685979013,"score_spread":0.2582799749074774,"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."}}