{"id":"W2096062220","doi":"10.1364/jocn.2.000793","title":"Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands","year":2010,"lang":"en","type":"article","venue":"Journal of Optical Communications and Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Computer science; Network topology; Computer network; Survivability; Path protection; Distributed computing; Logical topology; Overhead (engineering); Topology (electrical circuits); Bandwidth (computing); Wavelength-division multiplexing; Routing (electronic design automation); Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.000557558,0.0001163612,0.0003508454,0.00008171764,0.0001374139,0.00003381599,0.0005177564,0.0001633446,0.000006279597],"category_scores_gemma":[0.0001946159,0.00009568641,0.00008728748,0.0001869299,0.0003595485,0.0001542219,0.0001715378,0.0006595392,2.007093e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001651119,"about_ca_system_score_gemma":0.0000137843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.012177e-7,"about_ca_topic_score_gemma":0.00001290632,"domain_scores_codex":[0.9990392,0.00001995099,0.0005187656,0.00007504339,0.00009637204,0.0002506078],"domain_scores_gemma":[0.9978896,0.001361312,0.0001303975,0.0004105978,0.0001389346,0.00006909857],"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.0002267398,0.0003981018,0.004386071,0.0002653877,0.0004162434,0.000008410928,0.000202265,0.1032721,0.02944455,0.1851763,0.0003921828,0.6758117],"study_design_scores_gemma":[0.001663603,0.0007493328,0.001217367,0.0003475298,0.0002002569,0.0001515713,0.001020338,0.9273794,0.00240509,0.03249697,0.03180517,0.0005633408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8776489,0.00942017,0.1098597,0.0006215596,0.0004295924,0.0002003205,0.000002842439,0.0001470272,0.001669954],"genre_scores_gemma":[0.6723274,0.002623468,0.324938,0.000006381508,0.00008335379,0.000005427049,9.980264e-7,0.00001147075,0.000003440515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8241073,"threshold_uncertainty_score":0.3901979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03360453544351871,"score_gpt":0.2800130439526551,"score_spread":0.2464085085091364,"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."}}