{"id":"W4415933928","doi":"10.1109/nof66640.2025.11223326","title":"Using Path Identifiers for Efficient Loop-Free Routing in Computer Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Identifier; Equal-cost multi-path routing; Private Network-to-Network Interface; Link-state routing protocol; Open Shortest Path First; Static routing; Path (computing); Shortest path problem; Routing (electronic design automation)","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001659554,0.0003999335,0.000485518,0.0004132806,0.0006635889,0.001444383,0.0013566,0.0002844715,0.000009305106],"category_scores_gemma":[0.0001026446,0.0004225969,0.0001828495,0.002536219,0.0001176484,0.0004130914,0.001017271,0.000347503,0.000002541077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003020062,"about_ca_system_score_gemma":0.0003970672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006403916,"about_ca_topic_score_gemma":0.00003621706,"domain_scores_codex":[0.9963125,0.0001798404,0.0009989288,0.001148831,0.0003090549,0.001050863],"domain_scores_gemma":[0.9979436,0.000335486,0.0003190739,0.0009504688,0.0003273581,0.0001239691],"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.00002567733,0.0001263081,0.0007013698,0.0001015842,0.00002544677,0.000005493281,0.0004124765,0.8733261,0.000004834715,0.01000603,0.001388885,0.1138758],"study_design_scores_gemma":[0.001601139,0.00004854368,0.0001492063,0.001316657,0.00004574908,0.000003507499,0.00005748274,0.9948564,0.00005390243,0.001410872,0.00004323219,0.0004133118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005388531,0.0009073055,0.9860414,0.0003960752,0.005637084,0.0007396153,0.000001806447,0.0001378373,0.0007502969],"genre_scores_gemma":[0.5912874,0.00004522087,0.4063935,0.0009027525,0.0004328123,0.00001773779,0.000007142738,0.00002693968,0.0008864805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5858989,"threshold_uncertainty_score":0.9998226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02159458978258456,"score_gpt":0.2767346107233662,"score_spread":0.2551400209407817,"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."}}