{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001357,0.00009178108,0.0001060806,0.00006862138,0.0002807684,0.0001474219,0.0004563572,0.00008270552,0.00001633404],"category_scores_gemma":[0.00001594002,0.0000860114,0.00005245525,0.000402575,0.00008417564,0.0004065779,0.0001065946,0.0001443721,0.00003836736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003175992,"about_ca_system_score_gemma":0.00006948048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005804794,"about_ca_topic_score_gemma":0.000002843348,"domain_scores_codex":[0.9988818,0.00005256483,0.0001773981,0.0002816035,0.000241796,0.0003648032],"domain_scores_gemma":[0.9992889,0.000068644,0.00004148483,0.000327701,0.0001711688,0.0001021705],"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.000004298219,0.00005183093,0.000139866,0.00002130257,0.000007240776,0.000001244243,0.0009354009,0.95442,0.00001948502,0.02264177,0.01213992,0.009617659],"study_design_scores_gemma":[0.0003781999,0.00008263224,0.0001356715,0.00001145968,0.00000100718,0.000003450997,0.000007238517,0.9875761,0.00004338084,0.000906962,0.01074752,0.0001063435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001123981,0.00007986391,0.9925829,0.0007538281,0.0001540031,0.0005760735,8.106447e-7,0.000180934,0.004547663],"genre_scores_gemma":[0.7866265,0.0002594457,0.206347,0.0007316229,0.0003625832,0.0001793962,0.00005222669,0.00002788214,0.005413424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7862359,"threshold_uncertainty_score":0.3507443,"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."}}