{"id":"W1506148641","doi":"10.1007/978-3-642-04383-3_4","title":"Challenges for Routing and Search in Dynamic and Self-organizing Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Flooding (psychology); Shortest path problem; Exploit; Routing (electronic design automation); Network topology; Geographic routing; Distributed computing; Routing protocol; Static routing; Computer network; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005270526,0.0006517364,0.001776585,0.0008455962,0.001861859,0.007841994,0.003233156,0.006004714,0.00568695],"category_scores_gemma":[0.0175082,0.0008446645,0.0006759308,0.001671818,0.007127416,0.02103386,0.003235583,0.005323651,0.001575721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551064,"about_ca_system_score_gemma":0.00154787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00135853,"about_ca_topic_score_gemma":0.001243576,"domain_scores_codex":[0.9979505,0.0007821965,0.0001229269,0.0002847161,0.0006403766,0.0002193694],"domain_scores_gemma":[0.9896243,0.008037983,0.0003457751,0.0008014805,0.0006841547,0.0005063351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003951559,0.00004040391,0.0002373284,0.0003826972,0.00002929546,0.00007524467,0.0003293342,0.02448282,0.0004528755,0.9060242,0.01595899,0.05194734],"study_design_scores_gemma":[0.00001227838,0.00001437432,0.00006763375,0.00006142832,0.00000640805,0.00008742939,0.0002657767,0.02923345,0.000112047,0.9455339,0.02458662,0.00001865399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03246786,0.1564112,0.5390708,0.1662807,0.004899474,0.0001661487,0.0005200171,0.0006824771,0.09950122],"genre_scores_gemma":[0.6303292,0.1264045,0.1849346,0.006753067,0.0115925,0.0007247682,0.0004892349,0.0003376743,0.03843452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007841994,"threshold_uncertainty_score":0.02787352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02317202419675893,"score_gpt":0.269305049185894,"score_spread":0.2461330249891351,"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."}}