{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007005711,0.0001694474,0.000191069,0.0003012287,0.0002208655,0.0004153078,0.00151054,0.00005946555,0.00000176535],"category_scores_gemma":[0.00005593506,0.0001523188,0.00003799844,0.00143558,0.00158934,0.0006036587,0.001006322,0.0002072812,0.000008296722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066304,"about_ca_system_score_gemma":0.00006751548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004248706,"about_ca_topic_score_gemma":0.000003127586,"domain_scores_codex":[0.9972033,0.00009286538,0.000412102,0.0009043391,0.0005579409,0.0008294765],"domain_scores_gemma":[0.9984318,0.0004407616,0.00006423972,0.0007033049,0.0001133119,0.0002465764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005741848,0.00005322833,0.00003579894,0.00001955015,0.000002133955,0.00001144382,0.0004410085,0.02791888,0.00002373781,0.8998895,0.000190793,0.07135653],"study_design_scores_gemma":[0.0006465532,0.0001822982,0.001904191,0.00004363752,0.000002141733,0.000002973568,0.00001211545,0.9670936,0.0006572321,0.02907719,0.0001913203,0.0001866843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04132121,0.00002847654,0.9543552,0.0005984764,0.0004323283,0.0006837207,8.867207e-7,0.000104978,0.002474686],"genre_scores_gemma":[0.7906343,0.000006931095,0.2086248,0.0005714042,0.0001275701,0.00001393518,0.000002353231,0.000006568052,0.0000121277],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9391748,"threshold_uncertainty_score":0.621138,"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."}}