{"id":"W4387914158","doi":"10.1109/codit58514.2023.10284108","title":"The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm","year":2023,"lang":"en","type":"article","venue":"","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Path (computing); Disjoint sets; Jitter; Integer programming; Reliability (semiconductor); Routing (electronic design automation); Algorithm; Limit (mathematics); Flow network; Mathematical optimization; Linear programming; Mathematics; Computer network; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0002804715,0.0001284201,0.0001167919,0.0000301869,0.0001769321,0.00008804188,0.00008424672,0.00005009201,0.00001050896],"category_scores_gemma":[0.00002165254,0.00007703737,0.0000326281,0.000220813,0.00006128566,0.0001434521,0.00003311132,0.0001374475,0.00002304035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003383835,"about_ca_system_score_gemma":0.00001162526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002632953,"about_ca_topic_score_gemma":0.0001302462,"domain_scores_codex":[0.9992685,0.00002090828,0.0001582043,0.0001653152,0.0001210042,0.0002660681],"domain_scores_gemma":[0.9996105,0.00008952535,0.00001727046,0.0001856038,0.00004328969,0.00005384005],"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.000009275242,0.00002037256,0.0001595204,0.00009017394,0.00004870089,0.000004115605,0.0009255485,0.9128618,0.000268699,0.0004848941,0.001208773,0.08391809],"study_design_scores_gemma":[0.0003344299,0.00002596364,0.0002561077,0.00003660146,0.000008685249,0.000003578684,0.0004013116,0.99572,0.0009040782,0.0008266905,0.00134341,0.0001391513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01256625,0.00008161738,0.9843427,0.0005684761,0.0001404282,0.0004231919,0.00001311662,0.0009072103,0.0009570438],"genre_scores_gemma":[0.8064386,0.0009079523,0.1910454,0.0001005629,0.0001088647,0.0002159856,0.0000659525,0.00008762067,0.001029031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7938724,"threshold_uncertainty_score":0.3141493,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01147467101647752,"score_gpt":0.199789610187507,"score_spread":0.1883149391710294,"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."}}