{"id":"W4413822863","doi":"10.1109/icccn65249.2025.11133867","title":"Attaining Loop-Free Routing with Coordinated Updates Carrying Minimum Link-State Information","year":2025,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Link (geometry); Routing (electronic design automation); Loop (graph theory); Computer science; State (computer science); State information; Computer network; Distributed computing; Mathematics; Algorithm","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.0004456981,0.000130568,0.0001678835,0.0001803027,0.0002410516,0.0005446201,0.0005686838,0.00005328671,0.00000887194],"category_scores_gemma":[0.00005702597,0.00009996031,0.00003700661,0.0006605475,0.00001824975,0.001308883,0.000257028,0.0001415751,0.00002823917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006124291,"about_ca_system_score_gemma":0.00007007874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001694451,"about_ca_topic_score_gemma":0.00007828783,"domain_scores_codex":[0.9989489,0.00005033133,0.0003737676,0.0001952784,0.0001537002,0.000278061],"domain_scores_gemma":[0.9990609,0.00008108746,0.0001348248,0.0004306222,0.0002497079,0.00004282613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000992025,0.00005320917,0.03998975,0.0002407386,0.0004439497,0.00005186594,0.01570859,0.05359618,0.0003390633,0.5681983,0.05496377,0.2663154],"study_design_scores_gemma":[0.0008210678,0.00008264797,0.0007151996,0.0002645688,0.000007120519,0.00002388294,0.0009567317,0.9883026,0.0008959071,0.0007851875,0.006894723,0.0002503122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03211848,0.00001932127,0.9211847,0.001710418,0.0007064352,0.0001681034,9.608797e-7,0.0003749628,0.04371658],"genre_scores_gemma":[0.9919524,0.000001705321,0.004778806,0.0008268405,0.00004358706,0.00001276814,0.000005615648,0.000004225729,0.00237402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.959834,"threshold_uncertainty_score":0.5251784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00639178784785149,"score_gpt":0.2140048073911761,"score_spread":0.2076130195433246,"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."}}