{"id":"W2971070621","doi":"10.4230/lipics.concur.2019.9","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Automaton; Theoretical computer science; Artificial intelligence","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.00302083,0.0009937249,0.001183722,0.002202852,0.0009211045,0.002595654,0.001859553,0.002028804,0.003161703],"category_scores_gemma":[0.02474133,0.0006671151,0.001420346,0.001451324,0.002658114,0.00563705,0.004359007,0.002886181,0.0006783508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220338,"about_ca_system_score_gemma":0.001817152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001011397,"about_ca_topic_score_gemma":0.001157006,"domain_scores_codex":[0.9951845,0.001400975,0.0005024987,0.001382079,0.001194274,0.0003355978],"domain_scores_gemma":[0.9886352,0.007715312,0.0008442549,0.001421771,0.0009609234,0.0004226013],"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.0003159506,0.000153602,0.002314687,0.0002716894,0.0001183131,0.0001289916,0.0005756702,0.2242252,0.009838816,0.6576885,0.001168379,0.1032003],"study_design_scores_gemma":[0.00002517504,0.00007357354,0.0001951833,0.00001935387,0.00001624143,0.00004786618,0.00004844195,0.5049061,0.005636772,0.4878343,0.001165859,0.00003108987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05757129,0.00009990922,0.9400107,0.0001772568,0.00003141724,0.00008945485,0.0001225768,0.0005342207,0.00136305],"genre_scores_gemma":[0.5758184,0.0001164683,0.4212777,0.0001533094,0.00003914165,0.0002544438,0.0004500765,0.0002094996,0.001680993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003161703,"threshold_uncertainty_score":0.0161097,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01153238464875654,"score_gpt":0.2636695619378635,"score_spread":0.252137177289107,"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."}}