{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001523556,0.0004068352,0.000496769,0.0004434899,0.0002421997,0.0005778263,0.00123041,0.0003475891,7.194135e-7],"category_scores_gemma":[0.00002756693,0.0003838736,0.00004424912,0.0003391116,0.000226925,0.0004141119,0.000946825,0.0007335767,6.415993e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001524494,"about_ca_system_score_gemma":0.0001696652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008739616,"about_ca_topic_score_gemma":0.0001790142,"domain_scores_codex":[0.9970364,0.00004256511,0.0003867125,0.001423525,0.0003726856,0.0007381439],"domain_scores_gemma":[0.9983107,0.0007161893,0.0001398554,0.0005898433,0.0001031716,0.0001402669],"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.000003963407,0.00001383707,0.0000610146,0.00005774686,0.000004081237,0.00002205246,0.000962362,0.02524923,0.000006130929,0.01021212,8.378316e-7,0.9634066],"study_design_scores_gemma":[0.0003307585,0.0002151409,0.001153329,0.0006683524,0.000002950867,0.00005301708,3.912164e-7,0.9473935,0.00001820471,0.04948745,0.0002536408,0.0004232482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001338653,0.003718182,0.9918265,0.001091085,0.0002514307,0.00252029,7.578701e-7,0.0001059313,0.0003519509],"genre_scores_gemma":[0.5508606,0.002030709,0.4453872,0.0008981284,0.0005617372,0.0001524735,0.000002446914,0.00005588238,0.0000508772],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9629834,"threshold_uncertainty_score":0.9998613,"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."}}