{"id":"W2074286471","doi":"10.1109/broadnets.2007.4550404","title":"Weight functions for shortest path routing of periodically scheduled burst flows","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Equal-cost multi-path routing; Private Network-to-Network Interface; Shortest path problem; Routing (electronic design automation); Computer science; Computer network; Path (computing); K shortest path routing; Link-state routing protocol; Routing protocol; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0001528667,0.0001265697,0.0001802936,0.00006543747,0.00006592073,0.00001041702,0.0001331254,0.0001339005,0.00006143762],"category_scores_gemma":[0.000189251,0.0001124327,0.00007245367,0.0002228479,0.00007034597,0.00007977988,0.00003605435,0.000157025,0.00001248705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004246091,"about_ca_system_score_gemma":0.000008113773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001183978,"about_ca_topic_score_gemma":0.00002981895,"domain_scores_codex":[0.9991127,0.000001870993,0.000297263,0.0001414921,0.00009686949,0.0003497842],"domain_scores_gemma":[0.9994408,0.0002041144,0.00002083563,0.0002169413,0.00005949468,0.00005784929],"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.0001450389,0.0003185306,0.01753189,0.0002103932,0.000378497,0.00002697758,0.0002015925,0.3815186,0.08108476,0.2431049,0.003208895,0.2722699],"study_design_scores_gemma":[0.001063762,0.0002978068,0.005427088,0.000113468,0.00007750542,0.000009385426,0.001004074,0.9515097,0.0129713,0.003636491,0.02313232,0.0007571027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223407,0.0001369198,0.8687831,0.00005581587,0.0001977778,0.0001914038,0.000006762813,0.001064614,0.007222927],"genre_scores_gemma":[0.7075798,0.00001264076,0.2921809,0.00001134209,0.00007214952,0.0000157514,0.000006345284,0.00002266376,0.00009842299],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5852391,"threshold_uncertainty_score":0.4584874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009313014235434708,"score_gpt":0.2240239606014859,"score_spread":0.2147109463660512,"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."}}