{"id":"W2802275843","doi":"10.1109/access.2018.2827305","title":"On Invoking Transitivity to Enhance the <italic>Pursuit</italic>-Oriented Object Migration Automata","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Computer science; Theoretical computer science; Pairwise comparison; Automaton; Phenomenon; Markov chain; Transitive closure; Algorithm; Discrete mathematics; Combinatorics; Artificial intelligence; Mathematics; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"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.002044872,0.0007826001,0.0005725207,0.0007358568,0.0008944277,0.001901838,0.00142902,0.001113676,0.003835461],"category_scores_gemma":[0.008464599,0.0005681799,0.001288235,0.0005777233,0.003777649,0.004778504,0.003597028,0.003265749,0.001093448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390527,"about_ca_system_score_gemma":0.001300194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001394635,"about_ca_topic_score_gemma":0.001759823,"domain_scores_codex":[0.9986104,0.0004276901,0.0001294425,0.0003226149,0.0003331705,0.0001766462],"domain_scores_gemma":[0.9948724,0.002974124,0.0003073322,0.001086531,0.0005409674,0.0002186819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000205973,0.00009941111,0.0008697348,0.0001977162,0.00003024215,0.0002140602,0.0008382445,0.06728351,0.01829053,0.8320239,0.002098658,0.07784813],"study_design_scores_gemma":[0.00006068039,0.0002998257,0.0002583124,0.00007720435,0.00004728634,0.0002603136,0.0001334081,0.4171008,0.01861271,0.5402763,0.02281661,0.00005655667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02016629,0.0003022182,0.9624111,0.0007538721,0.0001261011,0.0001177112,0.0000484658,0.001206254,0.01486808],"genre_scores_gemma":[0.4879765,0.0007246335,0.4962013,0.001015913,0.0002301459,0.0004343375,0.0001988569,0.0005934126,0.01262488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003835461,"threshold_uncertainty_score":0.01283091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02383690043812528,"score_gpt":0.3278256711858171,"score_spread":0.3039887707476918,"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."}}