{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00408242,0.0006405156,0.0006340384,0.0009334304,0.0002980654,0.0006858172,0.006363729,0.0004851885,0.000020944],"category_scores_gemma":[0.0005326585,0.0005991572,0.0001641315,0.001691913,0.001380093,0.001127511,0.001414294,0.001176996,0.0001358731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009645439,"about_ca_system_score_gemma":0.002265444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002225928,"about_ca_topic_score_gemma":0.00001892383,"domain_scores_codex":[0.9943691,0.0003010056,0.0007910552,0.001889887,0.001676169,0.0009727161],"domain_scores_gemma":[0.9955676,0.0009081915,0.0005256852,0.002286167,0.000537065,0.0001753191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004014015,0.00004884671,0.00003966643,0.00005966432,0.000007153057,0.00004129234,0.0003971255,0.00780107,0.00006897585,0.1862952,0.002533014,0.802704],"study_design_scores_gemma":[0.0003715774,0.0001922669,0.0003011588,0.00035559,0.00001209784,0.00009354627,1.056068e-7,0.4083107,0.00294402,0.5566133,0.02964827,0.001157368],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001437876,0.0008594112,0.9648299,0.0001541396,0.004789425,0.0004989407,0.00001374827,0.0003351547,0.02850489],"genre_scores_gemma":[0.004858801,0.00001807195,0.9889274,0.001242506,0.000920654,0.00003136751,0.00001769753,0.00004332465,0.003940191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8015466,"threshold_uncertainty_score":0.999646,"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."}}