{"id":"W2171315559","doi":"10.1109/mpcs.1994.367032","title":"A fast algorithm for data exchange in reconfigurable tree structures","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Node (physics); Time complexity; Table (database); Data structure; Feature (linguistics); Routing table; Tree structure; Data exchange; Sequence (biology); Routing (electronic design automation); Theoretical computer science; Parallel computing; Binary tree; Mathematics; Data mining; Computer network; Routing protocol","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.0002448618,0.0000838147,0.0001303041,0.00008152016,0.00005514315,0.0001486599,0.0009050844,0.00005083361,0.00036115],"category_scores_gemma":[0.00001217228,0.00006746121,0.0000272811,0.0001787972,0.00000833234,0.0004651299,0.00009383127,0.00006030585,0.00002995525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002028138,"about_ca_system_score_gemma":0.000005490447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002181481,"about_ca_topic_score_gemma":0.0008628531,"domain_scores_codex":[0.999103,0.0000326943,0.0001938403,0.0003575239,0.00008915745,0.0002237996],"domain_scores_gemma":[0.9991249,0.0000648011,0.00004200667,0.0006952132,0.0000330747,0.00003997735],"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":[6.291461e-7,0.00001532626,0.0000144127,0.000006756607,0.000005583388,0.000002866815,0.0002835419,0.00002429601,0.00001186382,0.00673641,0.09498145,0.8979169],"study_design_scores_gemma":[0.0002806728,0.00004130047,0.0000406912,0.000009763573,7.89417e-7,0.00001797236,0.00004694936,0.9159319,0.00007437506,0.000913088,0.08254884,0.00009365803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009807278,0.0002433168,0.9610289,0.0005246938,0.0009620042,0.0002315336,0.00001163533,0.00007765808,0.0368222],"genre_scores_gemma":[0.4221042,0.0001655947,0.4800083,0.002627846,0.001973933,0.0002410452,0.0000728528,0.00004973539,0.09275655],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9159076,"threshold_uncertainty_score":0.395434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07497217069477873,"score_gpt":0.2672321350796171,"score_spread":0.1922599643848383,"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."}}