{"id":"W2130524435","doi":"10.1017/s0963548306008133","title":"Searching for a Black Hole in Synchronous Tree Networks","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Tree traversal; Node (physics); Tree (set theory); Black box; Black hole (networking); Computer science; Class (philosophy); TRACE (psycholinguistics); Mathematics; Algorithm; Combinatorics; Computer network; Physics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002557869,0.0003135304,0.000404971,0.0002082838,0.0002835533,0.0003277408,0.001503601,0.0001136123,0.00000167628],"category_scores_gemma":[0.00011887,0.0003496108,0.0001613091,0.001294319,0.0001014869,0.0002990781,0.001087149,0.0003951386,0.000009270102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009206422,"about_ca_system_score_gemma":0.0001297879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001761713,"about_ca_topic_score_gemma":0.00008312742,"domain_scores_codex":[0.9965101,0.0002822582,0.0007464017,0.001043208,0.0003997266,0.001018271],"domain_scores_gemma":[0.9975967,0.0007725446,0.0002302682,0.0011283,0.0001548337,0.0001173454],"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.000006465321,0.0003172641,0.003531021,0.000127583,0.000008118789,0.00001195579,0.0001233957,0.6338146,0.000007149757,0.325654,0.0004204847,0.03597794],"study_design_scores_gemma":[0.0009199529,0.0001220663,0.005365801,0.00006743651,0.000005507524,0.000001033638,0.000008714585,0.832991,0.00003707351,0.1595692,0.0006144464,0.0002978316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2008115,0.0002005638,0.7942917,0.000297387,0.0006114536,0.001618368,5.245775e-7,0.0003335185,0.00183491],"genre_scores_gemma":[0.9688289,0.00000361936,0.03070234,0.0001175106,0.0001743012,0.00007302011,0.00001087264,0.00002806805,0.00006139778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7680174,"threshold_uncertainty_score":0.9998956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0150184468477144,"score_gpt":0.2385637551410454,"score_spread":0.223545308293331,"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."}}