{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245234,0.001551504,0.001519812,0.00100356,0.0007278621,0.001424982,0.001761004,0.002379363,0.004551773],"category_scores_gemma":[0.003434619,0.0009236641,0.000847636,0.001390121,0.0008052035,0.001929183,0.001197342,0.001976017,0.0004691978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197906,"about_ca_system_score_gemma":0.001936943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003595198,"about_ca_topic_score_gemma":0.003045689,"domain_scores_codex":[0.9992784,0.0003343878,0.00002572985,0.0001372386,0.0001271747,0.00009705845],"domain_scores_gemma":[0.9984559,0.001178024,0.0001221344,0.00005221323,0.0001104379,0.00008125256],"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.00009936385,0.0001305505,0.0003591289,0.00007590092,0.00003128713,0.00005941152,0.00004782918,0.9450755,0.0004697658,0.01440535,0.00236512,0.03688071],"study_design_scores_gemma":[0.00003315316,0.00003659669,0.00004742729,0.00001002219,0.000006443235,0.00001569453,0.00001391652,0.9894404,0.0001623469,0.009675722,0.0005546444,0.000003665731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02864057,0.0004383333,0.9651219,0.0006392933,0.00005374981,0.0002528073,0.000210126,0.0003085975,0.00433464],"genre_scores_gemma":[0.1800965,0.0004080124,0.8138201,0.0001839761,0.00007372443,0.000489684,0.0005131235,0.0001355633,0.004279293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004551773,"threshold_uncertainty_score":0.0152272,"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."}}