{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667697,0.00007544988,0.0001178819,0.0005885825,0.0001827501,0.0003070143,0.001262275,0.00002598324,0.000009755106],"category_scores_gemma":[0.00007804969,0.00007259803,0.00005309625,0.0005057841,0.0002098552,0.002305185,0.0003752584,0.0001258373,0.000001236703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337932,"about_ca_system_score_gemma":0.0001589844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247115,"about_ca_topic_score_gemma":0.000006393983,"domain_scores_codex":[0.9983521,0.00002071625,0.0005180026,0.0001708882,0.0007811825,0.0001571762],"domain_scores_gemma":[0.9978631,0.0001323465,0.0005338295,0.0001442846,0.001228696,0.00009778518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002423924,0.0001602441,0.004737921,0.00000721011,0.00005144537,0.00003267328,0.00195527,0.005882518,0.01026991,0.02896764,0.00005556263,0.9478554],"study_design_scores_gemma":[0.00111555,0.0006814713,0.06550327,0.0002796777,0.00001571005,0.001620713,0.00009022217,0.8874925,0.02809394,0.007781611,0.007007896,0.0003174247],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4502548,0.00002756003,0.54773,0.00006749676,0.001797688,0.00002938893,2.530147e-7,0.000006222132,0.00008660444],"genre_scores_gemma":[0.7824401,0.00001672691,0.2171717,0.00007765774,0.0002867479,2.651337e-7,1.388471e-7,0.000002059685,0.00000450364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.947538,"threshold_uncertainty_score":0.2960546,"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."}}