{"id":"W2099846147","doi":"10.1016/j.tcs.2007.04.024","title":"Hardness and approximation results for Black Hole Search in arbitrary networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Black hole (networking); Approximation algorithm; Tree (set theory); Upper and lower bounds; Computer science; Mathematics; Black box; Combinatorics; Planar graph; Discrete mathematics; Theoretical computer science; Graph; Physics; Computer network; Artificial intelligence; Routing (electronic design automation)","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.0055136,0.002949484,0.005125513,0.002504314,0.004242499,0.007526721,0.008601036,0.005794986,0.01545314],"category_scores_gemma":[0.04494069,0.00197467,0.003921007,0.00452938,0.008152681,0.02375679,0.006971813,0.01114513,0.001384522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006116815,"about_ca_system_score_gemma":0.004960661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006893515,"about_ca_topic_score_gemma":0.006081599,"domain_scores_codex":[0.9936062,0.0022944,0.0002979356,0.00117119,0.00125277,0.001377502],"domain_scores_gemma":[0.9445315,0.04592365,0.001910183,0.004702879,0.001072816,0.001858939],"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.003184538,0.0008669957,0.004124478,0.001644647,0.0004627462,0.0003980582,0.001492177,0.3657103,0.002155084,0.5312062,0.03902747,0.0497273],"study_design_scores_gemma":[0.0002981964,0.00007309555,0.000405852,0.0000698186,0.0001242289,0.00009723454,0.0002220457,0.3043947,0.0005551329,0.6914922,0.002231102,0.00003639024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1997959,0.006310434,0.6928235,0.02800412,0.0009602827,0.0006961545,0.003269905,0.002509625,0.06563013],"genre_scores_gemma":[0.8443563,0.003262397,0.1243605,0.002856961,0.001334194,0.0007471672,0.002615312,0.0009316416,0.01953556],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01545314,"threshold_uncertainty_score":0.05169588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01559449462084517,"score_gpt":0.2638893272896888,"score_spread":0.2482948326688437,"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."}}