{"id":"W2901879074","doi":"10.5539/mas.v12n12p163","title":"On Maximizing Reliability of Network Topology Design Using a Practical Dynamic Programming Approach","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network topology; Reliability (semiconductor); Benchmark (surveying); Sorting; Mathematical optimization; Constraint (computer-aided design); Dynamic programming; Set (abstract data type); Topology (electrical circuits); Reliability engineering; Algorithm; Mathematics; Computer network; Power (physics); Engineering","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.003297264,0.0001624621,0.0002626428,0.0001261289,0.0005602724,0.0001848313,0.0009532096,0.00009464514,0.00000380157],"category_scores_gemma":[0.0001240934,0.0001382339,0.000049892,0.001090035,0.0009569948,0.0003560884,0.000342094,0.0002152614,0.000009409956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001736641,"about_ca_system_score_gemma":0.0002621219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000220954,"about_ca_topic_score_gemma":0.000003482831,"domain_scores_codex":[0.99744,0.000131837,0.0003904374,0.00085298,0.0005339021,0.0006508324],"domain_scores_gemma":[0.9983871,0.0002265282,0.0002330895,0.0008187951,0.0002183366,0.0001161743],"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.0002151411,0.0004981836,0.0001473157,0.0000571717,0.00002046308,0.000007295665,0.004606983,0.2874904,0.05376264,0.6053584,0.0001725056,0.04766346],"study_design_scores_gemma":[0.000127185,0.0001672001,0.00004495096,0.00001917422,0.000003665092,0.00003954717,0.00005096837,0.9748592,0.000860032,0.0236317,0.00005075322,0.0001455914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0183955,0.000008219713,0.9767438,0.00007886648,0.0005570022,0.0004536337,1.628957e-7,0.0001037204,0.003659053],"genre_scores_gemma":[0.6022128,2.718984e-7,0.3976043,0.0000806829,0.00006826314,0.00001783392,1.115576e-7,0.000005531434,0.00001025215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6873688,"threshold_uncertainty_score":0.5637013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04965638370823534,"score_gpt":0.3067830348818581,"score_spread":0.2571266511736228,"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."}}