{"id":"W2954304163","doi":"10.23638/lmcs-17(1:9)2021","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Probabilistic CTL; Theoretical computer science; Automaton; Probabilistic analysis of algorithms; Programming language; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.006250663,0.0002754577,0.0004836993,0.0001704896,0.0005144781,0.000807377,0.002571722,0.00009525374,0.000007049867],"category_scores_gemma":[0.00346375,0.0002244393,0.0001245625,0.002605624,0.0006035753,0.0004915679,0.001673438,0.0004392459,0.00000456791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001349156,"about_ca_system_score_gemma":0.00040083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001038032,"about_ca_topic_score_gemma":0.000006440976,"domain_scores_codex":[0.9954943,0.0008118559,0.0005992987,0.001659852,0.0005843406,0.0008503725],"domain_scores_gemma":[0.9953909,0.002781154,0.0001740226,0.001062163,0.000357326,0.0002344329],"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.000004150894,0.0002549909,0.000482855,0.00009530874,0.000003831006,0.00004991794,0.0003230459,0.01781939,0.0003168931,0.1393363,0.00002949604,0.8412839],"study_design_scores_gemma":[0.0003202851,0.0001435772,0.005585358,0.00006800153,0.000003235276,0.00005272023,0.000004845108,0.8507817,0.0003624004,0.1413487,0.001047323,0.0002818563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003321628,0.0001165262,0.9921159,0.001570592,0.001697263,0.000395661,0.000002993653,0.0003696395,0.0004098216],"genre_scores_gemma":[0.06980336,0.000003303943,0.9293717,0.0005656652,0.0001892014,0.00003008145,0.000001950945,0.000008235625,0.00002649503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.841002,"threshold_uncertainty_score":0.9152369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06591931980726415,"score_gpt":0.4080842784368488,"score_spread":0.3421649586295846,"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."}}