{"id":"W1513478909","doi":"10.1109/drcn.2005.1563871","title":"A disjoint route-sets approach to design of path-protecting p-cycle networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Path protection; Path (computing); Computer science; Backup; Spare part; Heuristic; Node (physics); Network planning and design; Disjoint sets; Heuristics; Distributed computing; Topology (electrical circuits); Computer network; Wavelength-division multiplexing; Mathematics; Engineering; Discrete mathematics","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.00126372,0.001255722,0.0006237163,0.001203554,0.0005968849,0.001097796,0.001937876,0.0009163718,0.005111985],"category_scores_gemma":[0.002425668,0.0008581353,0.001582545,0.0008247745,0.0009978865,0.001343687,0.001124702,0.001680055,0.0006001115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440917,"about_ca_system_score_gemma":0.001529762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002040764,"about_ca_topic_score_gemma":0.002900636,"domain_scores_codex":[0.9991358,0.0003111789,0.00004691732,0.0001521612,0.0002792424,0.00007478435],"domain_scores_gemma":[0.9992823,0.000352051,0.00008827924,0.0001130523,0.0001271819,0.00003714478],"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.00004503851,0.00004702643,0.0002033543,0.000163725,0.00005665545,0.00008062959,0.00008464136,0.8817424,0.003616153,0.0581667,0.0009189635,0.0548748],"study_design_scores_gemma":[0.00004074966,0.0001647119,0.00007170118,0.00004883738,0.0000432109,0.00007905505,0.00003251518,0.9218459,0.00406113,0.06471614,0.008875887,0.00002010485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005733197,0.0001909798,0.9899458,0.00009960727,0.00002293597,0.0001162374,0.00004676065,0.0001556404,0.003688896],"genre_scores_gemma":[0.1606724,0.0005672342,0.8350748,0.0001765254,0.00002988366,0.0004920379,0.0001756163,0.0001237557,0.002687731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005111985,"threshold_uncertainty_score":0.01710135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01269191526758212,"score_gpt":0.2010559936108117,"score_spread":0.1883640783432296,"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."}}