{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005027413,0.0001189202,0.0001225986,0.00003062624,0.0004018653,0.0003535241,0.0003447669,0.00004244027,0.000005140626],"category_scores_gemma":[0.0001781467,0.00006789653,0.00005936025,0.0003342954,0.0001881098,0.0009584099,0.0001140467,0.0001471663,0.000001441923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008900151,"about_ca_system_score_gemma":0.00007182293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000307474,"about_ca_topic_score_gemma":0.000005977946,"domain_scores_codex":[0.9989232,0.0001243152,0.0002797215,0.0003373097,0.0001838763,0.0001515373],"domain_scores_gemma":[0.997591,0.001817444,0.0001393458,0.0002189568,0.0001916139,0.00004161596],"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.00006067626,0.00009932727,0.0004728946,0.0003617871,0.000129623,0.000008531571,0.09468284,0.002439656,0.0004923598,0.6412616,0.00839188,0.2515988],"study_design_scores_gemma":[0.0002291349,0.0001639269,0.000440633,0.0002985865,0.00003491519,0.0002058868,0.004251601,0.8901858,0.0004944577,0.008145772,0.0953344,0.0002148622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05508335,0.01506324,0.9215249,0.00406338,0.003199492,0.0004619327,0.000006640831,0.00006235686,0.000534662],"genre_scores_gemma":[0.9975209,0.0006069667,0.001420171,0.0002767051,0.00005250202,0.00003055366,8.233584e-7,0.000004170434,0.00008723846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9424375,"threshold_uncertainty_score":0.3409041,"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."}}