{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001318306,0.0005207511,0.0006775261,0.0002087234,0.0005416945,0.0008687425,0.001996158,0.0002089691,0.00001822123],"category_scores_gemma":[0.0004815774,0.0004478285,0.0003367724,0.0004396103,0.0001291174,0.001347242,0.000620668,0.0005103045,0.000135474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001619319,"about_ca_system_score_gemma":0.0001646584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001813867,"about_ca_topic_score_gemma":0.00001244072,"domain_scores_codex":[0.9963906,0.0000689635,0.001253391,0.0006062191,0.0006070886,0.001073722],"domain_scores_gemma":[0.9967661,0.0006578408,0.0006373877,0.00129351,0.0004028815,0.0002422766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005119619,0.002884311,0.03599028,0.02115414,0.0007928387,0.00001638867,0.03221017,0.03103548,0.00009616494,0.5479634,0.01741241,0.3099325],"study_design_scores_gemma":[0.002514576,0.0004593584,0.0009783888,0.0002373698,0.00002860841,0.00003139126,0.0001976218,0.9220527,0.00004263471,0.006527924,0.06630583,0.0006236101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09614114,0.00004734222,0.891601,0.0009043206,0.002452298,0.003997268,0.0004544875,0.0009554405,0.00344666],"genre_scores_gemma":[0.8022777,0.000006042248,0.1950889,0.0008148628,0.0002989211,0.0002225824,0.0004626571,0.00006754213,0.000760785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8910172,"threshold_uncertainty_score":0.9997973,"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."}}