{"id":"W2164367088","doi":"10.1109/mnet.2011.5687952","title":"Toward scalable cut vertex and link detection with applications in wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"IEEE Network","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scalability; Wireless ad hoc network; Distributed computing; Correctness; Network partition; Partition (number theory); Fault tolerance; Node (physics); Wireless; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.00204583,0.001074738,0.0009199638,0.001838639,0.0008052706,0.002072385,0.002077705,0.001254271,0.001856086],"category_scores_gemma":[0.01009135,0.0006234774,0.0005868531,0.003015113,0.00126289,0.003519229,0.002663171,0.002398186,0.0009280143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006490051,"about_ca_system_score_gemma":0.0007925919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001022031,"about_ca_topic_score_gemma":0.001245952,"domain_scores_codex":[0.9984558,0.000530005,0.00007752138,0.0001892233,0.0006597314,0.00008772485],"domain_scores_gemma":[0.9957536,0.002415321,0.0002400554,0.0006938303,0.0007513579,0.0001458144],"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.0002087333,0.0001961167,0.001900095,0.0004427555,0.00006187711,0.0003648538,0.0004381842,0.2373555,0.01381347,0.252634,0.01174585,0.4808386],"study_design_scores_gemma":[0.00002281752,0.00008355914,0.0001908601,0.00004380703,0.00002220316,0.000160339,0.00009309321,0.8199419,0.00371824,0.1677833,0.007921913,0.00001792911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006374831,0.0007819076,0.9895912,0.000504331,0.00006153588,0.00007652101,0.00002640957,0.000619732,0.001963629],"genre_scores_gemma":[0.1276987,0.001352687,0.867801,0.0003059213,0.0002094665,0.0002524131,0.0001344829,0.0001334772,0.002111944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002077705,"threshold_uncertainty_score":0.01081949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01608249840638611,"score_gpt":0.2091176424354441,"score_spread":0.193035144029058,"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."}}