{"id":"W2038702538","doi":"10.1109/iscc.2007.4381566","title":"Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Backup; Computer science; Algorithm; Computer network; Network topology; Disjoint sets; Distributed computing; Shared mesh; Path (computing); Routing (electronic design automation); Topology (electrical circuits); Wireless mesh network; Mathematics; Discrete mathematics; Wireless network","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.0009804538,0.0005815218,0.0007813125,0.0004887578,0.0007682248,0.0006677601,0.001640042,0.0005748746,0.001714266],"category_scores_gemma":[0.00282343,0.0003097343,0.0003847166,0.0007164485,0.0006752753,0.001545322,0.001286729,0.0006522611,0.0001813188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103329,"about_ca_system_score_gemma":0.001794395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004896629,"about_ca_topic_score_gemma":0.005139453,"domain_scores_codex":[0.9995952,0.0001463083,0.00002448749,0.00006813007,0.00009737826,0.00006859098],"domain_scores_gemma":[0.9989892,0.0005570218,0.0001110698,0.0001724762,0.0001208562,0.00004935525],"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.0002656425,0.00009467638,0.0006522803,0.00008201125,0.00005182626,0.00004690649,0.0001650529,0.8706242,0.002558776,0.02473515,0.00164558,0.09907784],"study_design_scores_gemma":[0.00003898738,0.000031093,0.00005762709,0.000003548753,0.000006682179,0.00001283714,0.00002064149,0.9864087,0.0009261931,0.01197699,0.000511725,0.00000507953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05255413,0.0001878046,0.9453025,0.0001509008,0.00002057248,0.00005268158,0.00004831633,0.0005218058,0.001161183],"genre_scores_gemma":[0.5345955,0.0001027076,0.4637963,0.00004970135,0.00001597672,0.0001515115,0.0001431915,0.00006074287,0.00108442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004896629,"threshold_uncertainty_score":0.0097363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02581844019717274,"score_gpt":0.267010667060643,"score_spread":0.2411922268634703,"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."}}