{"id":"W4390063511","doi":"10.2478/fcds-2023-0021","title":"A DNA Algorithm for Calculating the Maximum Flow of a Network","year":2023,"lang":"en","type":"article","venue":"Foundations of Computing and Decision Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Institute of Genetics","keywords":"DNA computing; Computer science; Maximum flow problem; Algorithm; Flow (mathematics); Flow network; Encoding (memory); Field (mathematics); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computation","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.001230871,0.0007890242,0.0007076801,0.00206982,0.0008456934,0.001447714,0.001548572,0.001709338,0.006806684],"category_scores_gemma":[0.006558745,0.000415882,0.0005847365,0.001691819,0.001137759,0.001711539,0.00113332,0.0008789439,0.001082688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001889501,"about_ca_system_score_gemma":0.002426069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00410713,"about_ca_topic_score_gemma":0.003208239,"domain_scores_codex":[0.9993196,0.0002049461,0.00004637933,0.0001531548,0.0001962708,0.00007974413],"domain_scores_gemma":[0.9980001,0.001344408,0.0001345635,0.0001214361,0.0003312888,0.0000681514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003062253,0.0001246694,0.001012646,0.0002666591,0.00005994197,0.0001264972,0.0001746759,0.6068559,0.007858275,0.08370183,0.003647037,0.2958656],"study_design_scores_gemma":[0.00008224088,0.00005384901,0.0001599906,0.00003436923,0.00001212302,0.00005870745,0.00002938478,0.9456152,0.003725701,0.04759957,0.002613409,0.00001546373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01107861,0.0001400138,0.9849513,0.0001896411,0.00005031252,0.00008697552,0.00008741425,0.0006163734,0.002799422],"genre_scores_gemma":[0.09727454,0.0001239937,0.9000403,0.00006482282,0.00003403933,0.0002116839,0.0001608389,0.00009046604,0.001999261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006806684,"threshold_uncertainty_score":0.02277058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04385491570993191,"score_gpt":0.3532504922015683,"score_spread":0.3093955764916364,"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."}}