{"id":"W2121235810","doi":"10.1109/hicss.1995.375502","title":"Embeddings of complete binary trees into star graphs with congestion 1","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":"Concordia University","funders":"","keywords":"Combinatorics; Star (game theory); Binary tree; Vertex (graph theory); Upper and lower bounds; Binary number; Mathematics; Dilation (metric space); Binary search tree; Discrete mathematics; Graph; Arithmetic","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.0001888191,0.000374739,0.000286282,0.0003566223,0.000551789,0.0006256108,0.0003866149,0.000381989,0.003619119],"category_scores_gemma":[0.00127545,0.0003986212,0.0004769097,0.0003920847,0.0006998646,0.002075066,0.001537334,0.0008517887,0.0007343633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006321779,"about_ca_system_score_gemma":0.0002939465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006768529,"about_ca_topic_score_gemma":0.001286422,"domain_scores_codex":[0.9997779,0.00004996141,0.00001588053,0.00005279146,0.00007118808,0.00003240424],"domain_scores_gemma":[0.9993643,0.0001954616,0.0001132695,0.0001331692,0.0001075281,0.00008620958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002121189,0.0001063957,0.001345551,0.0001675245,0.0000272715,0.0003261244,0.0005714231,0.0565243,0.02627498,0.8224089,0.006181675,0.08585378],"study_design_scores_gemma":[0.00006373211,0.0003569955,0.002899364,0.00006130746,0.00005217218,0.0009057822,0.0003842519,0.2769028,0.03314827,0.6277385,0.05741753,0.00006938934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497495,0.0002707104,0.70324,0.000464346,0.000125398,0.000146451,0.0003968207,0.0009780172,0.04462875],"genre_scores_gemma":[0.6518147,0.0004529865,0.3302078,0.0002082579,0.00005296022,0.0001753836,0.0008351287,0.0002622848,0.01599045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003619119,"threshold_uncertainty_score":0.01210713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02205484126597855,"score_gpt":0.2149959904199189,"score_spread":0.1929411491539404,"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."}}