{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001780157,0.0004422261,0.0004930494,0.001160907,0.0002191956,0.0007150699,0.003654439,0.0004465625,0.00006313241],"category_scores_gemma":[0.0001011011,0.0004227082,0.0001275773,0.0007343409,0.001127007,0.0007053278,0.001430353,0.001340605,0.0001481795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000210558,"about_ca_system_score_gemma":0.0007202405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001802656,"about_ca_topic_score_gemma":0.00003521374,"domain_scores_codex":[0.9959251,0.00003603907,0.0005137734,0.001573707,0.0009903787,0.0009610568],"domain_scores_gemma":[0.9976307,0.0004950686,0.000141608,0.00110349,0.0003842666,0.0002448678],"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.000009390536,0.000057543,0.00001139673,0.00005774798,0.000006976599,0.00004445012,0.001949741,0.7127439,0.000525885,0.007811911,0.00003868524,0.2767424],"study_design_scores_gemma":[0.0004521841,0.0001886653,0.0000190306,0.0001584997,0.000001738347,0.00001074008,1.69191e-7,0.9801475,0.001444773,0.01477349,0.002317921,0.0004852972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001367743,0.00005877179,0.9946448,0.001459257,0.0006246313,0.0009123293,0.000009248205,0.0001293969,0.002024763],"genre_scores_gemma":[0.004359984,0.00003024222,0.9918269,0.0009211918,0.0003300229,0.00002481098,0.000012381,0.00004570086,0.002448778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2762571,"threshold_uncertainty_score":0.9998225,"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."}}