{"id":"W2162838679","doi":"10.1002/net.21463","title":"Distributed tree comparison with nodes of limited memory","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Tree (set theory); Task (project management); Class (philosophy); Automaton; Binary logarithm; Enhanced Data Rates for GSM Evolution; Theoretical computer science; State (computer science); Discrete mathematics; Shared memory; Parallel computing; Combinatorics; Mathematics; Algorithm; Computer network; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851514,0.0005106255,0.001416476,0.0007099955,0.001050041,0.002113797,0.002931828,0.001275338,0.005331776],"category_scores_gemma":[0.01187688,0.0004733684,0.0006063079,0.001148507,0.001187181,0.005672121,0.002139784,0.001003361,0.0006562305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336008,"about_ca_system_score_gemma":0.0009636314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009510076,"about_ca_topic_score_gemma":0.0009988729,"domain_scores_codex":[0.9979398,0.000592632,0.0001522451,0.0005705926,0.000455393,0.0002893798],"domain_scores_gemma":[0.9845886,0.009667278,0.001263678,0.002851583,0.0009778233,0.000651136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004651527,0.000501745,0.0051579,0.000556824,0.0001753485,0.0007934552,0.0008004474,0.6351975,0.0625192,0.09271314,0.002794625,0.1941382],"study_design_scores_gemma":[0.0001404201,0.0004223066,0.0005222938,0.00002173511,0.00005556658,0.0001389386,0.0001119599,0.9104282,0.02085456,0.06527229,0.002000058,0.00003164241],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5831999,0.0007441557,0.4083312,0.0005382897,0.00009350897,0.0001498882,0.0001659083,0.001204776,0.005572316],"genre_scores_gemma":[0.9001917,0.00009936787,0.09662548,0.0000610498,0.00004283781,0.0001142075,0.0001269997,0.0001083242,0.002629965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005331776,"threshold_uncertainty_score":0.01783657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01594654280864399,"score_gpt":0.2370205333862543,"score_spread":0.2210739905776103,"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."}}