{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941846,0.0002244442,0.0002833724,0.0002203903,0.0002651063,0.0003341784,0.0006222673,0.0000412211,0.000002381381],"category_scores_gemma":[0.00001332142,0.0001254808,0.00006376357,0.003071119,0.00003160401,0.0002468986,0.0003817636,0.0002573002,0.00002871296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001319283,"about_ca_system_score_gemma":0.000009235307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002732361,"about_ca_topic_score_gemma":0.000008400418,"domain_scores_codex":[0.9983706,0.00002304659,0.0003389742,0.0004138576,0.000321997,0.0005315509],"domain_scores_gemma":[0.9990473,0.0002107814,0.00004622413,0.0005611868,0.00003673427,0.00009770532],"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.000001197149,0.00002275133,0.0001058242,0.00006256174,0.0001012342,0.000007290483,0.0005822374,0.9890578,0.000002519346,0.006058143,0.0000945716,0.003903808],"study_design_scores_gemma":[0.000107792,0.00004550109,0.0001470159,0.0002277845,0.00008596086,0.000005028446,0.00004035951,0.9955022,0.000001669697,0.003039168,0.000602816,0.0001947191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005131501,0.00009198778,0.9929852,0.000716795,0.0000613533,0.0004991383,0.0000059501,0.0003388179,0.000169252],"genre_scores_gemma":[0.3132792,0.0001737892,0.6841925,0.0001444477,0.0003190397,0.0006662233,0.00006323762,0.00008267837,0.00107894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3087927,"threshold_uncertainty_score":0.511696,"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."}}