{"id":"W2519829944","doi":"10.1002/net.20233","title":"Approximation bounds for Black Hole Search problems","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Computer science; Black hole (networking); Black box; Set (abstract data type); Time complexity; Process (computing); Task (project management); Approximation algorithm; Theoretical computer science; Algorithm; Computer network; Artificial intelligence; Physics","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.005030249,0.002921402,0.002827012,0.001743235,0.002046162,0.005197806,0.004274332,0.002951806,0.01290938],"category_scores_gemma":[0.02303686,0.0008669325,0.002536654,0.002532583,0.002547989,0.0103958,0.004122124,0.005896852,0.002024447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00526238,"about_ca_system_score_gemma":0.003305891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004371668,"about_ca_topic_score_gemma":0.004314383,"domain_scores_codex":[0.9952971,0.001486744,0.0002241025,0.0008479627,0.001018916,0.001125115],"domain_scores_gemma":[0.978693,0.01667993,0.0009134464,0.002140395,0.0007568795,0.0008164498],"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.002769681,0.0009114922,0.004667447,0.001340925,0.0004229807,0.0002762597,0.000891641,0.5960666,0.003786061,0.2407882,0.0363896,0.1116892],"study_design_scores_gemma":[0.0001861426,0.0001334548,0.0005101138,0.0001056937,0.0001170843,0.0001596286,0.0001701211,0.7376651,0.001220402,0.25387,0.005839984,0.00002229767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1423223,0.009391626,0.768687,0.01227459,0.0006440409,0.0005543108,0.002208028,0.003897461,0.06002072],"genre_scores_gemma":[0.6767558,0.003555257,0.2984015,0.001818512,0.0006510671,0.0008072711,0.003403295,0.001206311,0.01340094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01290938,"threshold_uncertainty_score":0.04318619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04569803779833919,"score_gpt":0.2672764333897557,"score_spread":0.2215783955914165,"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."}}