{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438346,0.0001631421,0.0002198795,0.00005752467,0.0000419324,0.00001516895,0.0001852014,0.0001249513,0.000005979247],"category_scores_gemma":[0.0000562788,0.0001460953,0.00004307397,0.0003373113,0.00003579831,0.00007605665,0.00008494009,0.0002457366,0.000009125174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005621702,"about_ca_system_score_gemma":0.00000306595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002304368,"about_ca_topic_score_gemma":0.00000335884,"domain_scores_codex":[0.9990313,0.00001599668,0.0002743545,0.0001948122,0.0001099921,0.0003735472],"domain_scores_gemma":[0.9995157,0.0001024771,0.00002559777,0.0002926046,0.00002100414,0.00004260219],"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.000005158035,0.00002290949,0.00006412104,0.00001685957,0.000007590802,0.000001380095,0.00001159584,0.9850646,0.0006722553,0.003556756,0.0003152117,0.01026157],"study_design_scores_gemma":[0.000110791,0.00003541468,0.0003138972,0.00002245605,0.000005036122,0.000002620768,0.00008892985,0.9935562,0.00171321,0.003871409,0.00008669703,0.0001933118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01110489,0.000171185,0.9752209,0.00001950999,0.00005947231,0.0004037598,0.000001180078,0.001299023,0.01172012],"genre_scores_gemma":[0.5860096,0.000005282969,0.4138437,0.000008104457,0.00003538074,0.00004863552,0.00000154099,0.00002487688,0.00002294615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5749047,"threshold_uncertainty_score":0.5957593,"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."}}