{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001204539,0.00008476294,0.0001439264,0.00009970629,0.00006713915,0.00004830471,0.0002641228,0.00003279281,0.0001254872],"category_scores_gemma":[0.000003971854,0.00006012673,0.00004006324,0.0002912688,0.00004717772,0.0002821097,0.00004544465,0.00005507151,0.00002664995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001391977,"about_ca_system_score_gemma":0.000004310007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001699986,"about_ca_topic_score_gemma":0.000136087,"domain_scores_codex":[0.9992846,0.00004294299,0.00018928,0.0001928079,0.0001650166,0.0001253121],"domain_scores_gemma":[0.9994643,0.00004778353,0.00008504651,0.0002550247,0.0001042689,0.00004356633],"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.00005326445,0.0003179853,0.006142676,0.00009635739,0.0001552559,0.00004454808,0.009494503,0.005422512,0.00912644,0.912019,0.03782592,0.01930151],"study_design_scores_gemma":[0.0005334969,0.0009761676,0.002818541,0.0001099992,0.000006679134,0.00005719379,0.0003363019,0.9854454,0.0005456785,0.001756364,0.007172074,0.0002421479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6173699,0.0001936041,0.3620975,0.0009601029,0.0005902072,0.0002429645,0.000001559745,0.000278154,0.01826599],"genre_scores_gemma":[0.9894648,0.000008565975,0.009511112,0.000116577,0.00002402638,0.000005728714,7.500575e-7,0.000004470712,0.0008639738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9800228,"threshold_uncertainty_score":0.2451897,"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."}}