{"id":"W2022437016","doi":"10.1142/s1793830911001346","title":"TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Toronto Metropolitan University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Focus (optics); Computer science; Black hole (networking); Algorithm; Ring (chemistry); Upper and lower bounds; Task (project management); Mathematics; Computer network; Engineering; Routing (electronic design automation); Physics","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.002893911,0.001344119,0.001443108,0.001189686,0.001175325,0.001954021,0.002600196,0.001869669,0.005224044],"category_scores_gemma":[0.01135343,0.0006986018,0.001031551,0.001328244,0.00151858,0.004238567,0.002619341,0.001371583,0.00120078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812453,"about_ca_system_score_gemma":0.002678943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002562818,"about_ca_topic_score_gemma":0.002916481,"domain_scores_codex":[0.9975804,0.000759244,0.0001560736,0.000492674,0.0004526946,0.0005588388],"domain_scores_gemma":[0.9938307,0.004290299,0.0006943106,0.0006263293,0.0003080378,0.000250389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008437643,0.0003238825,0.001376987,0.0003827571,0.000110121,0.0001124022,0.0004847606,0.7502657,0.00459397,0.1091497,0.007274622,0.1250813],"study_design_scores_gemma":[0.0001828265,0.0001183267,0.0001740901,0.00002244144,0.00002583055,0.00006228135,0.00007830487,0.9319283,0.001573059,0.06417315,0.001641492,0.00001994833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04349561,0.0007566924,0.9462867,0.0004601462,0.00007247753,0.0002236489,0.0001182981,0.001357125,0.007229374],"genre_scores_gemma":[0.3945627,0.0005749652,0.5986359,0.0002053412,0.0001002276,0.0005453316,0.0003198617,0.0003490112,0.004706678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005224044,"threshold_uncertainty_score":0.0174762,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04500272391394888,"score_gpt":0.2952494002916094,"score_spread":0.2502466763776605,"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."}}