{"id":"W1984719907","doi":"10.1007/s00446-006-0154-y","title":"Searching for a black hole in arbitrary networks: optimal mobile agents protocols","year":2006,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Node (physics); Ignorance; Computer science; Mathematical proof; Upper and lower bounds; Protocol (science); Topology (electrical circuits); Flexibility (engineering); Degree (music); Constructive; Mathematics; Computer network; Discrete mathematics; Combinatorics","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.00068446,0.0001693568,0.0002118744,0.0001242952,0.0002127669,0.0004404158,0.0007874536,0.00007565095,0.000005696114],"category_scores_gemma":[0.00003331737,0.0001775384,0.00008651515,0.000773529,0.0000477693,0.000315948,0.0002632925,0.0002652817,0.000008576883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008846001,"about_ca_system_score_gemma":0.00008774924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003923658,"about_ca_topic_score_gemma":0.000003575963,"domain_scores_codex":[0.9980365,0.0001256601,0.0004307605,0.0004713197,0.0002545684,0.0006811789],"domain_scores_gemma":[0.9991409,0.000181176,0.0001200235,0.0003477407,0.0001114417,0.00009875417],"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.000008784551,0.0001474263,0.0009739586,0.00003392355,0.00000530689,0.00001118204,0.0001683371,0.9849128,0.00003175967,0.008067607,0.0009016587,0.004737279],"study_design_scores_gemma":[0.0009270316,0.00009386793,0.001333949,0.0001098051,0.000001166569,0.000001752215,0.00003311459,0.9940535,0.0001372622,0.0006859876,0.002426452,0.0001961037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923591,0.0000192458,0.9724547,0.0001259404,0.00005364388,0.007478134,0.00001604434,0.0002337948,0.0003825811],"genre_scores_gemma":[0.8802769,0.000001153948,0.1173456,0.0001389187,0.0001431681,0.00177121,0.0002711594,0.000019581,0.00003226253],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.861041,"threshold_uncertainty_score":0.7239804,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02511181324543472,"score_gpt":0.3120113948574338,"score_spread":0.2868995816119991,"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."}}