{"id":"W1522486275","doi":"","title":"Bounded-hop strong connectivity for flocking swarms","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Topology (electrical circuits); Hop (telecommunications); Computer science; Flocking (texture); Network topology; Wireless ad hoc network; Graph; Wireless; Mathematics; Discrete mathematics; Computer network; Combinatorics; Theoretical computer science; Physics; Telecommunications","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.001144412,0.0006934722,0.001197032,0.001423713,0.0007923926,0.001499159,0.001592822,0.001108949,0.001988018],"category_scores_gemma":[0.009768924,0.0004474276,0.0005997702,0.001031257,0.001858747,0.002384267,0.002336663,0.001276674,0.0001591451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006939628,"about_ca_system_score_gemma":0.0004881565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363146,"about_ca_topic_score_gemma":0.0009717418,"domain_scores_codex":[0.9994272,0.0002270077,0.00003460238,0.0001039099,0.0001261802,0.00008118498],"domain_scores_gemma":[0.9927554,0.005347344,0.0006376557,0.0003433826,0.0004452554,0.0004710694],"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.000243513,0.00007391771,0.000886424,0.0001932472,0.00007310519,0.0002192944,0.0002400497,0.6647906,0.004361892,0.3077135,0.001662227,0.01954232],"study_design_scores_gemma":[0.00001892887,0.00006018183,0.0002468995,0.00001038038,0.00001233636,0.00004286951,0.00003746223,0.8986948,0.0002860161,0.1001609,0.0004189492,0.00001041653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2213375,0.001220405,0.7679313,0.0009176363,0.0001270554,0.00007556089,0.0001564864,0.0001780402,0.008056115],"genre_scores_gemma":[0.9774991,0.0006648964,0.01766914,0.00007136104,0.00007401651,0.0001102473,0.0001120597,0.00004563523,0.003753575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001988018,"threshold_uncertainty_score":0.006650627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01212208569051747,"score_gpt":0.2316067468875422,"score_spread":0.2194846611970247,"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."}}