{"id":"W4388190725","doi":"10.18280/mmep.100542","title":"Employing the Bellman-Ford Algorithm with Score Functions to Address the Linear Diophantine Fuzzy Shortest Path Problem in Network Analysis","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Diophantine equation; Path (computing); K shortest path routing; Algorithm; Mathematical optimization; Mathematics; Computer science; Fuzzy logic; Discrete mathematics; Artificial intelligence; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002841326,0.001123899,0.001355693,0.001583592,0.001116264,0.001534349,0.002362251,0.001855289,0.002287946],"category_scores_gemma":[0.004888986,0.0005972101,0.0007649923,0.002915352,0.001203385,0.002072243,0.001187516,0.002345157,0.0004744236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002712089,"about_ca_system_score_gemma":0.004249925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01617538,"about_ca_topic_score_gemma":0.01678166,"domain_scores_codex":[0.9992064,0.0002986554,0.00005407737,0.0001739162,0.0002057464,0.00006133276],"domain_scores_gemma":[0.9983079,0.001092072,0.0001249264,0.00009193281,0.0003309627,0.00005212719],"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.00003539702,0.00005032198,0.0005095575,0.0001631034,0.0000445085,0.00007186409,0.0001189289,0.8028727,0.001098083,0.06659646,0.001403153,0.1270359],"study_design_scores_gemma":[0.000006025006,0.00002336819,0.00003895681,0.000008828113,0.000006293759,0.00002050856,0.000011122,0.9845793,0.0004198135,0.01360857,0.00126894,0.000008197665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001825398,0.0002155535,0.9969506,0.00008767819,0.0000271417,0.0000431497,0.00001462427,0.00005788524,0.0007778862],"genre_scores_gemma":[0.08908677,0.0007374089,0.9076676,0.00007106483,0.00004216411,0.0001607807,0.0000937479,0.00004676542,0.002093701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01617538,"threshold_uncertainty_score":0.03216249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02854225577939242,"score_gpt":0.2221157528379905,"score_spread":0.1935734970585981,"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."}}