{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498574,0.0001455895,0.0003048565,0.00003350448,0.00006712192,0.00004929955,0.0005136598,0.00009232192,0.000006791248],"category_scores_gemma":[0.00001026764,0.0001115973,0.00005458905,0.0005375801,0.00005825011,0.0003532225,0.0000891613,0.0001554427,0.000009885122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002388055,"about_ca_system_score_gemma":0.0000186862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000030287,"about_ca_topic_score_gemma":0.00001535555,"domain_scores_codex":[0.9987708,0.00006339496,0.0003126902,0.0001973043,0.0002433597,0.0004125017],"domain_scores_gemma":[0.9989502,0.00007906761,0.0002042485,0.000527564,0.00009915785,0.0001397631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000227085,0.001878292,0.4518661,0.0001676662,0.0003669459,0.00002628583,0.002602482,0.1492686,0.0004566564,0.05235099,0.0811118,0.2596771],"study_design_scores_gemma":[0.001106475,0.0001609286,0.1634271,0.0001783092,0.00002862154,0.00002664911,0.0001304229,0.8162447,0.0007317896,0.00003390234,0.01749825,0.0004329126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03375377,0.001351595,0.9612498,0.0000917459,0.0004024348,0.000130681,0.00001539415,0.000125967,0.00287866],"genre_scores_gemma":[0.9957228,0.000006637503,0.003911203,0.0000548366,0.0001772177,0.00001191595,0.00004538858,0.000008411528,0.00006155461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9619691,"threshold_uncertainty_score":0.4550807,"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."}}