{"id":"W1489988664","doi":"10.1109/pacrim.2005.1517256","title":"Survivability of optical virtual private network using the distributive shortest pair algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Survivability; Computer science; Backup; Distributive property; Shortest path problem; Private network; Computer network; Distributed computing; Multiprotocol Label Switching; Reliability (semiconductor); Algorithm; Theoretical computer science; Quality of service; Mathematics; Graph; Operating system","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.0002478159,0.0001805439,0.0002503396,0.00001502108,0.00006840051,0.00001351466,0.0002919153,0.0001323607,0.00003745526],"category_scores_gemma":[0.0001332599,0.0001248504,0.00007208422,0.0003516208,0.0003865625,0.0001217862,0.0001749714,0.0003203633,0.000007188089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001128287,"about_ca_system_score_gemma":0.00000828762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002605869,"about_ca_topic_score_gemma":0.00001119994,"domain_scores_codex":[0.9988483,0.00002296519,0.0003309172,0.0001848765,0.0001708096,0.0004421444],"domain_scores_gemma":[0.9989939,0.0004511329,0.00002677318,0.0004265723,0.00004751627,0.00005412146],"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.000004982349,0.00003197387,0.001844478,0.000004465898,0.0000406315,0.000001546235,0.00001308742,0.8568867,0.000264398,0.02535199,0.0001602595,0.1153955],"study_design_scores_gemma":[0.000113911,0.00004962263,0.003805607,0.00001618108,0.00002008322,0.000004174435,0.00008758486,0.9864151,0.004500072,0.002955787,0.001823217,0.0002086404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.200434,0.0001345903,0.797648,0.0001511699,0.0001121942,0.0001746447,0.00001413397,0.0006342671,0.000697048],"genre_scores_gemma":[0.7209918,0.00001873028,0.2787842,0.0000137144,0.0001531239,0.00000624167,0.000004641071,0.00001795212,0.000009585866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5205579,"threshold_uncertainty_score":0.5091251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01283949353004878,"score_gpt":0.2344150518589347,"score_spread":0.221575558328886,"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."}}