{"id":"W2162676381","doi":"10.1109/infcom.1995.515970","title":"Multicast and self-routing in ATM radix trees and banyan networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Banyan; Computer science; Routing (electronic design automation); Decoding methods; Multicast; Tree (set theory); Radix (gastropod); Computer network; Multistage interconnection networks; Binary tree; Algorithm; Theoretical computer science; Mathematics; Combinatorics","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.0003648538,0.0003148906,0.000253096,0.0007191066,0.0006266626,0.0007419477,0.0003926307,0.0006990986,0.002381805],"category_scores_gemma":[0.001173077,0.0002052279,0.0002774214,0.000893831,0.0005761237,0.001542743,0.0004786355,0.0004313296,0.0005265253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003717772,"about_ca_system_score_gemma":0.0002165063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005525032,"about_ca_topic_score_gemma":0.0007923997,"domain_scores_codex":[0.999726,0.0001031665,0.00001264062,0.00004014816,0.00008415998,0.00003393865],"domain_scores_gemma":[0.9994767,0.0002809353,0.00005047837,0.00006618736,0.0001102333,0.00001548095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002415788,0.0001325422,0.001362829,0.0003004961,0.00005932239,0.0003418658,0.0004143968,0.05349084,0.01656384,0.5588818,0.00633006,0.3618805],"study_design_scores_gemma":[0.00004136802,0.0004067693,0.001598878,0.00009036486,0.00007511175,0.001202312,0.000407265,0.4927778,0.030658,0.3764392,0.09624149,0.00006142281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07367243,0.00305558,0.8762701,0.0005402649,0.0003765221,0.0001188121,0.00003568933,0.0003426047,0.04558798],"genre_scores_gemma":[0.5456121,0.005039005,0.3996124,0.0005346077,0.0005966091,0.0002304224,0.00009433481,0.0001306428,0.04814991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002381805,"threshold_uncertainty_score":0.007967949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01327854244229131,"score_gpt":0.2014613310406147,"score_spread":0.1881827885983234,"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."}}