{"id":"W4206652101","doi":"10.1007/11817949","title":"CONCUR 2006 – Concurrency Theory","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Universität Duisburg-Essen; Universität des Saarlandes; Università degli Studi di Trento; Rheinische Friedrich-Wilhelms-Universität Bonn; Università di Pisa; Technische Universiteit Eindhoven; Aalborg Universitet; Università degli Studi di Verona; State University of New York; European Research Consortium for Informatics and Mathematics; Imperial College London; York University; Masarykova Univerzita; Deutsche Forschungsgemeinschaft; National ICT Australia; Massachusetts Institute of Technology; Uppsala Universitet; Carl von Ossietzky Universität Oldenburg; Universiteit van Amsterdam; National University of Singapore; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Concurrency; Computer science; Series (stratigraphy); Programming language; Library science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224432,0.001283653,0.001130538,0.001370808,0.001057673,0.002859675,0.001479279,0.0008803369,0.02612364],"category_scores_gemma":[0.002765615,0.001039965,0.000747397,0.002455532,0.001165952,0.003712754,0.001568703,0.002866717,0.0171272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001239375,"about_ca_system_score_gemma":0.001709396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001481737,"about_ca_topic_score_gemma":0.002646151,"domain_scores_codex":[0.9986575,0.0001562567,0.0000675398,0.0001740791,0.0008766508,0.00006795239],"domain_scores_gemma":[0.9989337,0.0003203276,0.00004623806,0.0002952928,0.000312308,0.00009211721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005910253,0.00004888366,0.0001028906,0.0004160568,0.00002588554,0.0001200192,0.0001868827,0.003888572,0.00385919,0.3116993,0.3087312,0.370862],"study_design_scores_gemma":[0.00001919979,0.00003488653,0.0001968398,0.000142868,0.00001631862,0.000421527,0.00003435247,0.007739748,0.002916276,0.1788935,0.8095551,0.00002947017],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.002307853,0.02504104,0.6383494,0.002997531,0.007939727,0.0002245715,0.0006960141,0.006131544,0.3163123],"genre_scores_gemma":[0.05576103,0.01916499,0.3281732,0.001999344,0.004555681,0.0004983491,0.003241222,0.005608459,0.5809976],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02612364,"threshold_uncertainty_score":0.08739227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01664712475615086,"score_gpt":0.277783279766885,"score_spread":0.2611361550107342,"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."}}