{"id":"W1966140610","doi":"10.1142/s0129054107004838","title":"DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Chord (peer-to-peer); Chordal graph; Asynchronous communication; Computer science; Torus; Node (physics); Human decontamination; Upper and lower bounds; Visibility; Mathematics; Theoretical computer science; Computer network; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.001049295,0.0009975866,0.001024449,0.0006037618,0.001131066,0.00101277,0.001762565,0.0009704225,0.00161489],"category_scores_gemma":[0.00510588,0.0004228481,0.0009375245,0.0005621231,0.00155378,0.002357065,0.00268579,0.0008971564,0.0003650627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000734088,"about_ca_system_score_gemma":0.0008190114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00309501,"about_ca_topic_score_gemma":0.002401525,"domain_scores_codex":[0.9990253,0.0002672138,0.00005028044,0.0002300949,0.0001971907,0.0002298817],"domain_scores_gemma":[0.997452,0.001160568,0.0003895328,0.0006198107,0.0001741054,0.0002040908],"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.0003752697,0.00007182068,0.001129899,0.0002207487,0.0000623808,0.0004573489,0.0003912522,0.8970886,0.01314152,0.03919096,0.001165622,0.04670452],"study_design_scores_gemma":[0.00004872883,0.000162335,0.0002668151,0.00001493144,0.00002396038,0.0001630147,0.000262139,0.9682611,0.006183206,0.02136761,0.003225327,0.00002088805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.195187,0.0006897692,0.7966315,0.0003168646,0.0001256544,0.0002178069,0.0001015516,0.0008576534,0.005872224],"genre_scores_gemma":[0.7726598,0.0004286937,0.2231316,0.00007841225,0.00004271535,0.00014844,0.0001751508,0.0001058634,0.003229243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00309501,"threshold_uncertainty_score":0.006154001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01931218671582376,"score_gpt":0.3218863398165222,"score_spread":0.3025741531006985,"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."}}