{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000230734,0.0003596004,0.0003790072,0.000434554,0.001260343,0.000636304,0.0003776286,0.0001098774,0.00005627597],"category_scores_gemma":[0.000004040344,0.0003151048,0.000141543,0.001277155,0.00003873648,0.001823688,0.000007737538,0.0002842853,0.00008123145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004272027,"about_ca_system_score_gemma":0.00003678876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001874031,"about_ca_topic_score_gemma":0.0005282792,"domain_scores_codex":[0.9980462,0.00001030029,0.0005058101,0.0006007369,0.0003251176,0.0005117902],"domain_scores_gemma":[0.9983205,0.0001327128,0.000367004,0.0003051208,0.0008425938,0.00003207168],"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.00003210014,0.0001018168,0.0001079004,0.0006053667,0.00008293565,6.556977e-7,0.0002655389,0.9738024,0.00007778141,0.0001545326,0.00001301882,0.02475591],"study_design_scores_gemma":[0.0007632156,0.00001590123,0.00008048299,0.0004523155,0.000185146,0.000002788382,0.001069376,0.9947903,0.00007198068,0.002026308,0.000126941,0.0004152212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3431211,0.00001576067,0.6545942,0.0007400144,0.0001427084,0.0003487664,0.000002340681,0.0004240659,0.0006110121],"genre_scores_gemma":[0.9922317,0.000002019458,0.005817881,0.001312656,0.0003732166,0.00006714227,0.00002891199,0.0000766673,0.00008982798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6491106,"threshold_uncertainty_score":0.9999301,"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."}}