{"id":"W4400689446","doi":"10.1145/3673422.3674891","title":"DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Shortest path problem; Computer science; Routing (electronic design automation); Loop (graph theory); Computation; Path (computing); Private Network-to-Network Interface; Path vector protocol; Topology (electrical circuits); Computer network; Theoretical computer science; Link-state routing protocol; Algorithm; Mathematics; Routing protocol; Combinatorics; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479744,0.0007901167,0.001001973,0.001289475,0.0007611891,0.002118683,0.001812296,0.0009086719,0.004484968],"category_scores_gemma":[0.005291572,0.0004793025,0.0006556691,0.0008768677,0.001155373,0.004159239,0.003096955,0.003076218,0.001237083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006100781,"about_ca_system_score_gemma":0.0007348915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009112335,"about_ca_topic_score_gemma":0.0008516861,"domain_scores_codex":[0.9989706,0.0001904572,0.00008488135,0.0001608481,0.0004765612,0.0001165718],"domain_scores_gemma":[0.9982182,0.0007197476,0.0001299917,0.0005010018,0.0003214911,0.0001094734],"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.0007598542,0.0003235151,0.001072248,0.0005308048,0.0001272684,0.000297788,0.0004199464,0.1180698,0.05903077,0.3178312,0.01290154,0.4886352],"study_design_scores_gemma":[0.0003249139,0.0002745962,0.0003031389,0.0001004571,0.00007611994,0.0004423535,0.0001286734,0.7491425,0.06404652,0.09334795,0.0916633,0.0001495716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01029917,0.0007216993,0.9798684,0.0003465181,0.0002502432,0.00009503478,0.00007779968,0.003272088,0.005069055],"genre_scores_gemma":[0.1808763,0.001095236,0.8100897,0.0004031774,0.0001721064,0.0002307471,0.0003532057,0.0007089823,0.006070445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004484968,"threshold_uncertainty_score":0.01500374,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01999329747282931,"score_gpt":0.2851881112906218,"score_spread":0.2651948138177925,"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."}}