{"id":"W2058335745","doi":"10.1109/tsc.2013.19","title":"Computing Refined Ordering Relations with Uncertainty for Acyclic Process Models","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Concurrency; Theoretical computer science; Mathematical proof; Task (project management); Process (computing); Transitive relation; Computation; Algorithm; Programming language; Mathematics","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.002653066,0.001115714,0.0009648651,0.002427946,0.001083453,0.001638499,0.0013299,0.0009005003,0.002351745],"category_scores_gemma":[0.01816665,0.001017245,0.002526251,0.001916162,0.001795295,0.005490548,0.002719318,0.002006192,0.000330296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00189448,"about_ca_system_score_gemma":0.002394849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01073693,"about_ca_topic_score_gemma":0.0116088,"domain_scores_codex":[0.9968177,0.0007350103,0.0002811998,0.0006705518,0.001175647,0.0003198232],"domain_scores_gemma":[0.9922228,0.004962746,0.0006261389,0.001244296,0.0007949505,0.0001489642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001634695,0.00008898335,0.002721943,0.0002255981,0.00009007503,0.0003300771,0.0005862354,0.677628,0.007832482,0.1967093,0.001174477,0.1124494],"study_design_scores_gemma":[0.00001621558,0.00002611394,0.0002343413,0.00001702003,0.00003024118,0.00004457102,0.00005957093,0.8375156,0.00429629,0.156536,0.001202328,0.00002169363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01879815,0.00004934048,0.9798781,0.00005815459,0.00000688992,0.00006505543,0.0001318001,0.0005283363,0.0004842411],"genre_scores_gemma":[0.2380014,0.000194269,0.7593369,0.00005839269,0.00002334638,0.0001262507,0.001134123,0.0001940444,0.0009311045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01073693,"threshold_uncertainty_score":0.02134889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01848916297270074,"score_gpt":0.2324393211042485,"score_spread":0.2139501581315477,"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."}}