{"id":"W1997741957","doi":"10.1007/s11107-009-0227-5","title":"Strategies for optimal logical topology design and traffic grooming","year":2009,"lang":"en","type":"article","venue":"Photonic Network Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Traffic grooming; Set (abstract data type); Logical topology; Topology (electrical circuits); Integer programming; Network topology; Computer network; Distributed computing; Throughput; Routing (electronic design automation); Suite; Integer (computer science); Mathematical optimization; Algorithm; Wavelength-division multiplexing; Mathematics; Wireless","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558155,0.0009186561,0.0007997714,0.001432848,0.0007482932,0.001745107,0.001689794,0.001127195,0.004158027],"category_scores_gemma":[0.005671201,0.0007189764,0.0005232412,0.001090512,0.000800574,0.002245191,0.00169802,0.0008638852,0.0004941876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009286538,"about_ca_system_score_gemma":0.001411106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007459465,"about_ca_topic_score_gemma":0.002118264,"domain_scores_codex":[0.9992515,0.0002719082,0.00003792224,0.00009691747,0.0002225613,0.000119262],"domain_scores_gemma":[0.9985479,0.0007831287,0.0001400997,0.0001717444,0.0002811116,0.00007593443],"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.0001540008,0.0002073951,0.0006178722,0.0002239785,0.00006002485,0.000123924,0.0001721053,0.5966178,0.01025384,0.1847432,0.004738859,0.202087],"study_design_scores_gemma":[0.0000258876,0.00004122392,0.00006249591,0.00001515385,0.00002215777,0.00004145353,0.00005245642,0.9210306,0.001568293,0.07535981,0.001768781,0.00001158719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008042735,0.0001566705,0.9872223,0.000247067,0.00004093942,0.00007452341,0.00002799266,0.0001178167,0.004069999],"genre_scores_gemma":[0.4340029,0.000445715,0.5619105,0.0002159772,0.00009859258,0.0003151153,0.00009430325,0.000112619,0.002804161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004158027,"threshold_uncertainty_score":0.01390994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03816941803725791,"score_gpt":0.2830027816898483,"score_spread":0.2448333636525904,"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."}}