{"id":"W2104626533","doi":"10.1142/s1793830914500517","title":"The number of shortest paths in the (n, k)-star graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Voltage graph; Hypercube graph; Butterfly graph; Path graph; Star (game theory); Graph; Graph power; Complement graph; Line graph","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.0006181216,0.0006055759,0.0006789817,0.001898838,0.0007828041,0.00122851,0.0009359734,0.0006540013,0.003383053],"category_scores_gemma":[0.004404922,0.0002434593,0.0003909291,0.001854041,0.001095637,0.003711542,0.0007795384,0.0005295015,0.0005375497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005678512,"about_ca_system_score_gemma":0.0005391866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005675617,"about_ca_topic_score_gemma":0.001004277,"domain_scores_codex":[0.9992369,0.000154058,0.0001020049,0.000241537,0.0001646633,0.0001008452],"domain_scores_gemma":[0.9964194,0.001772755,0.0007134748,0.0003130775,0.0004453592,0.0003359373],"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.001157343,0.0002035249,0.02153069,0.00131356,0.0002756588,0.0005901671,0.0008269018,0.1653578,0.05508104,0.5389595,0.01161537,0.2030886],"study_design_scores_gemma":[0.00005553447,0.0003675219,0.007374339,0.0000910013,0.0001112943,0.001554397,0.0005075494,0.2884995,0.01969409,0.6637416,0.0178895,0.0001136757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6112514,0.0009657565,0.3712757,0.0007139429,0.0001948018,0.00008033972,0.002328247,0.0003062354,0.01288357],"genre_scores_gemma":[0.7569612,0.0009267341,0.2328957,0.00008532911,0.0001249089,0.000139152,0.001941417,0.0001306415,0.006794978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003383053,"threshold_uncertainty_score":0.01131737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01100409671084664,"score_gpt":0.2565698859081638,"score_spread":0.2455657891973171,"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."}}