{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003681448,0.0004581526,0.0007031053,0.0005931524,0.0002564544,0.0001905877,0.003671442,0.0003267678,0.000005206812],"category_scores_gemma":[0.001613538,0.0004194141,0.0001904525,0.0009684674,0.001243861,0.0005155267,0.001060472,0.000493704,0.000005499287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003661792,"about_ca_system_score_gemma":0.0005922544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000143357,"about_ca_topic_score_gemma":0.00009296497,"domain_scores_codex":[0.9959096,0.00008850353,0.0008409665,0.001611765,0.0009250368,0.0006240912],"domain_scores_gemma":[0.9951499,0.001593856,0.0005529033,0.001968199,0.0006088055,0.0001263753],"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.00003642874,0.00007325334,0.00009381821,0.0006777255,0.00001532768,0.000008152537,0.001096303,0.007717431,0.0001168063,0.4267923,0.00002079425,0.5633517],"study_design_scores_gemma":[0.0002189197,0.0001941947,0.0002729841,0.0002548522,0.00000863964,0.000004892571,3.313401e-7,0.5503018,0.001210209,0.4465803,0.0005395959,0.0004132333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001441344,0.0001145045,0.9947671,0.0004430345,0.002133057,0.001349198,0.00004053427,0.000216563,0.0007918957],"genre_scores_gemma":[0.02826699,0.00003025936,0.9708179,0.0001562415,0.0001821297,0.00009083278,0.00000907545,0.00003571744,0.0004108674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5629385,"threshold_uncertainty_score":0.9998258,"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."}}