{"id":"W3042433848","doi":"10.1007/s11761-020-00298-7","title":"A graph database-based approach utilizing FAHP and directed bipartite graph for service composition","year":2020,"lang":"en","type":"article","venue":"Service Oriented Computing and Applications","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph database; Bipartite graph; Dijkstra's algorithm; Database; Cloud computing; Graph; Theoretical computer science; Data mining; Shortest path problem","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002179825,0.0003688804,0.000344854,0.0002056052,0.0009050207,0.0002756209,0.0007500515,0.0001058626,0.000001304078],"category_scores_gemma":[0.000005262692,0.0003700737,0.00007246238,0.003053379,0.00004851545,0.0003103264,0.0004499542,0.0002577902,0.0000052593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000133369,"about_ca_system_score_gemma":0.00005541408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002535382,"about_ca_topic_score_gemma":0.00007655298,"domain_scores_codex":[0.9975514,0.00009845371,0.0004384716,0.001143892,0.0002775982,0.0004901283],"domain_scores_gemma":[0.9980351,0.0002893903,0.0002394599,0.000644753,0.0003948776,0.0003963967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007502699,0.002649856,0.009465595,0.01378054,0.0009349167,0.00001312344,0.043558,0.02967371,0.1226571,0.6663572,0.0008970071,0.1092627],"study_design_scores_gemma":[0.001670441,0.0001006187,0.001304907,0.0001418141,0.00009997372,0.00001461158,0.000789086,0.980829,0.001626005,0.001661796,0.01119846,0.0005632925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.069047,0.000455435,0.9201749,0.007558388,0.00007189067,0.001195559,0.0001081909,0.001092501,0.0002961242],"genre_scores_gemma":[0.7881139,0.00002578709,0.1869204,0.02345482,0.0002700663,0.0003370136,0.00082855,0.00004797116,0.000001453519],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9511553,"threshold_uncertainty_score":0.9998751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02120740045095552,"score_gpt":0.2514484409857296,"score_spread":0.2302410405347741,"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."}}