{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097118,0.0004721347,0.0005117796,0.000912635,0.000594812,0.0009397773,0.001626736,0.0006690498,0.002280239],"category_scores_gemma":[0.0017467,0.0002061974,0.0004528495,0.001177278,0.0004286863,0.001674346,0.0003835405,0.0006857226,0.0005296604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000808325,"about_ca_system_score_gemma":0.0008000931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00102858,"about_ca_topic_score_gemma":0.00116543,"domain_scores_codex":[0.9994623,0.0001681313,0.00006145076,0.00007961251,0.0001673433,0.0000610642],"domain_scores_gemma":[0.9991751,0.000257369,0.0001050245,0.0001907029,0.0002316764,0.00004007789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008948275,0.0002023083,0.001480364,0.0005264269,0.0001684369,0.0001037622,0.0001541649,0.1285629,0.02067466,0.07191519,0.005173541,0.7701434],"study_design_scores_gemma":[0.0002285341,0.0004650014,0.0009472982,0.00006474985,0.0001568432,0.0006838383,0.0001013864,0.8662539,0.06667723,0.02673741,0.0375798,0.0001039348],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0174943,0.0009539318,0.9773844,0.00008873414,0.0001364558,0.0001073131,0.00005584066,0.0009008857,0.002878178],"genre_scores_gemma":[0.2638342,0.000998065,0.7311056,0.00006778484,0.00005580346,0.0001263859,0.0002492159,0.0001625337,0.003400475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002280239,"threshold_uncertainty_score":0.007628143,"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."}}