{"id":"W1509961009","doi":"10.22061/jecei.2014.42","title":"DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs","year":2014,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Asynchronous communication; Node (physics); Distributed algorithm; Human decontamination; Computation; Algorithm; Computer network; Engineering","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001527603,0.0004522114,0.0008466431,0.001221535,0.0002599733,0.001224668,0.006052508,0.0001892348,0.0003944518],"category_scores_gemma":[0.0001764192,0.000442371,0.0002316194,0.002954812,0.0002074297,0.006741178,0.001494902,0.0007900284,0.00001768012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000178639,"about_ca_system_score_gemma":0.0001102554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002608436,"about_ca_topic_score_gemma":0.00009107609,"domain_scores_codex":[0.9959316,0.0004973208,0.001161051,0.000877008,0.0008167849,0.0007162092],"domain_scores_gemma":[0.9967949,0.0006304302,0.000937574,0.0009966646,0.0002932646,0.0003471344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000057118,0.0004874204,0.09392336,0.00006047239,0.00009882751,0.0001386388,0.0001752804,0.008124075,0.004285565,0.008896266,0.01110292,0.8726501],"study_design_scores_gemma":[0.001454229,0.00005300352,0.617073,0.0004985604,0.00003024465,0.00006393348,0.00003557195,0.1415346,0.01107483,0.220586,0.006535631,0.001060401],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0694047,0.004796978,0.9220484,0.0003100204,0.0009809929,0.0005441803,0.00002917656,0.0001408159,0.001744763],"genre_scores_gemma":[0.975822,0.003191822,0.0198584,0.0007783031,0.0001501683,0.00006572596,0.00003709015,0.00005173987,0.00004474448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9064173,"threshold_uncertainty_score":0.9998122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08912439903010141,"score_gpt":0.4720683068139423,"score_spread":0.3829439077838409,"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."}}