{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957949,0.0002421684,0.000273792,0.00007072902,0.0001814487,0.0001092892,0.0006065787,0.000195238,0.000005656138],"category_scores_gemma":[0.00000221317,0.0002192677,0.0000380811,0.001120567,0.0001023051,0.0003938826,0.0001392514,0.0004129149,0.0000188706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006233787,"about_ca_system_score_gemma":0.00004245469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004903205,"about_ca_topic_score_gemma":0.0008498983,"domain_scores_codex":[0.9981716,0.00008826918,0.0002923131,0.0006387228,0.0001927362,0.000616307],"domain_scores_gemma":[0.9987995,0.0001227924,0.0001274456,0.0007082502,0.00006476178,0.0001772425],"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.0002542071,0.0002308123,0.0153143,0.00005554895,0.00009679297,0.00007202301,0.001638825,0.08487856,0.00006679827,0.00764961,0.004166702,0.8855758],"study_design_scores_gemma":[0.001457968,0.0005968717,0.03107906,0.0002830809,0.00004698572,0.00009735257,0.00004481178,0.9360361,0.0006050393,0.01050537,0.01818821,0.00105914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02741899,0.001947681,0.9661545,0.00005673427,0.001312429,0.0007325623,5.116316e-7,0.0002884617,0.002088189],"genre_scores_gemma":[0.9897639,0.0006019672,0.007986931,0.0002087771,0.0009634513,0.000350077,0.000002620166,0.00003189402,0.00009038397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623449,"threshold_uncertainty_score":0.8941477,"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."}}