{"id":"W2128537388","doi":"10.1109/spdp.1993.395464","title":"Optimal communication algorithms on the star interconnection network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Instituto de Telecomunicações","keywords":"Interconnection; Star (game theory); Node (physics); Computer science; Star network; Link (geometry); Computer network; Telecommunications network; A* search algorithm; Algorithm; Theoretical computer science; Distributed computing; Network topology; Topology (electrical circuits); Mathematics; Combinatorics; Engineering","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.000646524,0.0001078026,0.0001003702,0.00003721877,0.0004228615,0.0002592061,0.0008036526,0.00005554392,0.0004635334],"category_scores_gemma":[0.00002051938,0.00006814935,0.00007119396,0.0002940741,0.00002950193,0.0002889902,0.0001652915,0.0002092927,0.0004437853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004912819,"about_ca_system_score_gemma":0.000003397564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000594942,"about_ca_topic_score_gemma":0.00003586094,"domain_scores_codex":[0.998886,0.0002478575,0.0002255027,0.0002200552,0.0001710335,0.0002494902],"domain_scores_gemma":[0.998681,0.0002864664,0.00007955019,0.0008399831,0.00007256194,0.0000404265],"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.000004652336,0.00006991799,0.00003034532,0.000002033219,0.00003388584,0.000001867113,0.001226696,0.02149379,0.00001211062,0.7134364,0.2396269,0.02406135],"study_design_scores_gemma":[0.00009473119,0.0001161126,0.00005727266,0.00002827472,0.000001607888,0.00001842466,0.0001457023,0.9508213,0.00006491871,0.0008713531,0.04767766,0.0001026404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009640845,0.0002132668,0.9091782,0.00987264,0.001577522,0.0002713731,3.8645e-7,0.0003440866,0.06890167],"genre_scores_gemma":[0.9834991,0.00005197234,0.01048229,0.001911885,0.0003403595,0.00003549448,9.968866e-7,0.000007924237,0.00367005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738582,"threshold_uncertainty_score":0.570411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03584981227663083,"score_gpt":0.2278909888305391,"score_spread":0.1920411765539083,"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."}}