{"id":"W2161536662","doi":"10.1007/978-3-642-13284-1_12","title":"Distributed Tree Comparison with Nodes of Limited Memory","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Tree (set theory); Task (project management); Automaton; Class (philosophy); Theoretical computer science; Distributed algorithm; Timed automaton; Enhanced Data Rates for GSM Evolution; Shared memory; Parallel computing; State (computer science); Distributed memory; Discrete mathematics; Distributed computing; Algorithm; Combinatorics; Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007122261,0.0006675236,0.001112519,0.0005890014,0.0002198616,0.0003866596,0.004041999,0.0005024389,0.0000145103],"category_scores_gemma":[0.00007279213,0.0005317654,0.0001586073,0.001025991,0.001260409,0.0005361208,0.0008012218,0.001247802,0.00001859898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001492502,"about_ca_system_score_gemma":0.0005661332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005980322,"about_ca_topic_score_gemma":0.0003359933,"domain_scores_codex":[0.9954646,0.00003986785,0.000911932,0.001519421,0.00134624,0.0007179899],"domain_scores_gemma":[0.995913,0.0003988185,0.0007729599,0.002087859,0.0005942425,0.0002330661],"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.00007574263,0.0003147659,0.001275781,0.0003056454,0.0000943144,0.0002486466,0.00169726,0.04945831,0.00367534,0.02636025,0.0001201331,0.9163738],"study_design_scores_gemma":[0.002054783,0.001012981,0.00326391,0.002504107,0.00005588252,0.0002784065,0.000001922426,0.92489,0.02923949,0.02545065,0.00860113,0.002646745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007063434,0.0003873089,0.993669,0.000359346,0.001159842,0.0004362105,0.00008014106,0.0001737609,0.003028057],"genre_scores_gemma":[0.756108,0.00001243147,0.2430863,0.0002438215,0.0002565009,0.00001267311,0.00005378548,0.00004101921,0.0001854659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.913727,"threshold_uncertainty_score":0.9997134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0146414705828723,"score_gpt":0.2375666501503124,"score_spread":0.2229251795674401,"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."}}