{"id":"W2170631384","doi":"10.1007/978-3-642-17461-2_5","title":"Time Optimal Algorithms for Black Hole Search in Rings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Computer science; Focus (optics); Black hole (networking); Ring (chemistry); Algorithm; Upper and lower bounds; Search problem; Ring network; Asymptotically optimal algorithm; Time complexity; Mathematics; Physics; Routing (electronic design automation); Network topology; Computer network","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.001809009,0.001574682,0.001824986,0.001211717,0.001293267,0.002895036,0.003159118,0.002081573,0.01240911],"category_scores_gemma":[0.008609124,0.000829407,0.001317938,0.002199504,0.002123919,0.006271385,0.002673302,0.003011218,0.002085348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002127836,"about_ca_system_score_gemma":0.002087127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002245314,"about_ca_topic_score_gemma":0.003387699,"domain_scores_codex":[0.9985439,0.0004506031,0.00007974724,0.0002759572,0.0003618191,0.0002879979],"domain_scores_gemma":[0.9964253,0.002455412,0.0001667511,0.0005993422,0.0001785263,0.0001745904],"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.001001307,0.000333743,0.0005282835,0.0006402747,0.0001227128,0.00006662782,0.0004604832,0.2193218,0.003741107,0.5532019,0.02704906,0.1935327],"study_design_scores_gemma":[0.0002522195,0.00007952343,0.000138662,0.00004671304,0.00004751795,0.00004949121,0.0001013953,0.4111142,0.001356909,0.5822155,0.004574329,0.00002336203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04464845,0.002070685,0.9160464,0.001077468,0.0002854492,0.000245911,0.0004458162,0.002253914,0.03292585],"genre_scores_gemma":[0.2928761,0.001178662,0.6852955,0.0003682942,0.0002489785,0.0004335431,0.0007794197,0.0008172908,0.01800234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01240911,"threshold_uncertainty_score":0.04151267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02585653393387138,"score_gpt":0.2806499406378158,"score_spread":0.2547934067039445,"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."}}