{"id":"W2165290294","doi":"10.1109/pccc.2004.1395018","title":"Adaptive gossip-based routing algorithm","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Ad hoc On-Demand Distance Vector Routing; Dynamic Source Routing; Computer network; Gossip; Distance-vector routing protocol; Multipath routing; Static routing; Optimized Link State Routing Protocol; Algorithm; Distributed computing; Routing (electronic design automation); Routing protocol; Psychology","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.0004710111,0.0004438846,0.0004747198,0.0004935848,0.0004379036,0.0005851809,0.001171571,0.0004696636,0.001534931],"category_scores_gemma":[0.000997399,0.000130595,0.0002452918,0.0004401011,0.0003870866,0.0007738313,0.0005114897,0.0004540003,0.0007293619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003291891,"about_ca_system_score_gemma":0.0004756658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006907893,"about_ca_topic_score_gemma":0.0008292651,"domain_scores_codex":[0.9996362,0.0000716173,0.0000245924,0.00006360972,0.0001739304,0.00003009391],"domain_scores_gemma":[0.9995545,0.0001588582,0.00004327056,0.00008240509,0.0001324164,0.00002864492],"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.000519546,0.0002206424,0.001630447,0.0004496826,0.0002353406,0.0004308888,0.0002548364,0.4319704,0.07036907,0.08468871,0.01085076,0.3983796],"study_design_scores_gemma":[0.00009805683,0.0003220594,0.0004553196,0.0000160968,0.00009076285,0.0003718211,0.00005770812,0.9340994,0.01895268,0.02040033,0.02509661,0.00003912651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02966591,0.001221799,0.9537309,0.000270732,0.0002751127,0.0002334256,0.0001197075,0.002235346,0.01224706],"genre_scores_gemma":[0.59922,0.001179945,0.3886398,0.0002574887,0.0001814696,0.0002698644,0.0003410888,0.0001558671,0.009754486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001534931,"threshold_uncertainty_score":0.005134881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04607843156584731,"score_gpt":0.303006085752787,"score_spread":0.2569276541869397,"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."}}