{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009605957,0.0008238591,0.0007655164,0.0005535077,0.001604621,0.0006093591,0.002375032,0.0005027767,0.000001008885],"category_scores_gemma":[0.00003850185,0.0008897614,0.000214765,0.0008446838,0.0007790846,0.0006565748,0.0007787234,0.001233371,0.000006497228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003368487,"about_ca_system_score_gemma":0.00003924936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001163224,"about_ca_topic_score_gemma":0.00002062715,"domain_scores_codex":[0.9964341,0.00008957838,0.001297922,0.000885134,0.0004086098,0.0008846339],"domain_scores_gemma":[0.9942374,0.002188673,0.0004171925,0.002195529,0.0005722013,0.0003890645],"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.0004694684,0.001687286,0.0009661483,0.0004448007,0.0009864996,0.000009669476,0.005209354,0.5281969,0.008101696,0.1105995,0.0298673,0.3134614],"study_design_scores_gemma":[0.001139323,0.0008023251,0.0003613209,0.0006422338,0.00011108,0.00003977976,0.0002564985,0.9874158,0.0003347654,0.001705866,0.006224278,0.0009667115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01564679,0.001962144,0.9627352,0.01109205,0.001401369,0.002607252,0.00007789823,0.002449261,0.002028005],"genre_scores_gemma":[0.766206,0.007130182,0.2245516,0.0008257048,0.0003488461,0.0004507573,0.0003072538,0.0001535078,0.00002620236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7505592,"threshold_uncertainty_score":0.9996952,"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."}}