{"id":"W4392353220","doi":"10.1002/cpe.8059","title":"A recurrence for the surface area of the (n,k)$$ \\left(n,k\\right) $$‐star graph","year":2024,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Star (game theory); Computer science; Graph; Star network; A* search algorithm; Surface (topology); Combinatorics; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Network topology; Geometry; Computer network","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.0004905938,0.0003097449,0.0005314423,0.001203361,0.0006155657,0.0008656486,0.0007419745,0.0004617484,0.005918964],"category_scores_gemma":[0.003453235,0.0001705259,0.000599415,0.0008570289,0.001011143,0.00174647,0.0007875384,0.000786837,0.001134128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009559355,"about_ca_system_score_gemma":0.0003667519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001833357,"about_ca_topic_score_gemma":0.001613942,"domain_scores_codex":[0.9995926,0.00007758284,0.00003205602,0.00008947864,0.0001324873,0.0000757358],"domain_scores_gemma":[0.998166,0.0007953701,0.0001994898,0.0001710279,0.00056628,0.000101802],"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.00008178863,0.00002671162,0.003228882,0.0001581135,0.00002422976,0.0008625825,0.0005450745,0.06107876,0.01720301,0.8497005,0.01053895,0.05655146],"study_design_scores_gemma":[0.00001357274,0.00005009012,0.002489714,0.00003501459,0.00002408775,0.0008384393,0.0002136758,0.3767382,0.008675866,0.5954548,0.01540603,0.0000605051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2992011,0.0009280791,0.6285244,0.001815641,0.0003752582,0.0001003684,0.0007060299,0.0007674537,0.06758172],"genre_scores_gemma":[0.9212251,0.000409513,0.063936,0.000175769,0.0001479773,0.0001199363,0.0004360047,0.000293313,0.0132563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005918964,"threshold_uncertainty_score":0.01980084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02815759949889428,"score_gpt":0.3089877351882812,"score_spread":0.2808301356893869,"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."}}