{"id":"W1517252525","doi":"10.1109/icccn.2002.1043080","title":"Different implementations of token tree algorithm for DWDM network protection/restoration","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed minimum spanning tree; Spanning tree; Network topology; Security token; Polling; Tree (set theory); Suzuki-Kasami algorithm; Algorithm; Node (physics); Shortest-path tree; Computer network; Dinic's algorithm; Tree traversal; Minimum spanning tree; Dijkstra's algorithm; Graph; Theoretical computer science; Shortest path problem; Mathematics; Engineering","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.00004518094,0.00009114342,0.0001133571,0.00003526979,0.00004862894,0.000007900443,0.00005462822,0.00005421892,0.00003889761],"category_scores_gemma":[0.00002939178,0.00008088906,0.0000376003,0.0001563652,0.0000218329,0.00008109381,0.000009178744,0.00006149017,0.000002185823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000488313,"about_ca_system_score_gemma":0.00000404968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001515622,"about_ca_topic_score_gemma":0.00004620139,"domain_scores_codex":[0.9994574,0.000007723671,0.0001977463,0.00008834963,0.0000623615,0.0001864414],"domain_scores_gemma":[0.9997347,0.00005390197,0.00002460836,0.0001289948,0.00003602411,0.00002178895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005723385,0.00005074094,0.0003000943,0.00005342717,0.00008597364,2.945469e-7,0.00003663826,0.271054,0.002295039,0.1201556,0.004508593,0.6014539],"study_design_scores_gemma":[0.001239187,0.0003685159,0.001568372,0.00002935953,0.00005282088,0.000003187479,0.0003702836,0.8531972,0.0430287,0.0754825,0.02418442,0.0004754953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004225179,0.00007769684,0.9928296,0.00003500981,0.0001771675,0.0005836182,0.00000725363,0.000436735,0.001627701],"genre_scores_gemma":[0.3065783,0.00003524198,0.6926819,0.000009653852,0.00006798474,0.0004627405,0.00001591417,0.00002377839,0.0001244691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6009784,"threshold_uncertainty_score":0.329856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02062835791360767,"score_gpt":0.2523208077878212,"score_spread":0.2316924498742136,"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."}}