{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685748,0.00008105327,0.0001165692,0.00002142662,0.0002292785,0.0001493319,0.0005361068,0.00003001422,0.000001868505],"category_scores_gemma":[0.0000159447,0.00004282365,0.00004636637,0.0002788855,0.00007478851,0.00006504251,0.00006608274,0.00008463094,0.000006849515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004243571,"about_ca_system_score_gemma":0.000007280841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002346418,"about_ca_topic_score_gemma":0.0000209643,"domain_scores_codex":[0.9992154,0.0000497921,0.0002989453,0.0001467179,0.0001581082,0.0001310804],"domain_scores_gemma":[0.9988596,0.0004159416,0.0001150695,0.0005298372,0.00005387588,0.00002569495],"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":[1.650339e-7,0.00002999676,0.0001030571,0.00001121051,0.000005413478,9.777878e-8,0.0009683105,0.00002145409,0.000008746378,0.9873749,0.0001374756,0.01133918],"study_design_scores_gemma":[0.0001561589,0.00002607744,0.001002981,0.00004099534,0.00001021075,0.00003714786,0.001615692,0.6487256,0.00003082016,0.3164522,0.03174742,0.0001546713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003266725,0.00007875902,0.988912,0.0008179972,0.00004935153,0.0003522647,0.000004064578,0.00001981006,0.006498978],"genre_scores_gemma":[0.9782614,0.00007895576,0.02092376,0.0001091439,0.0001078099,0.000387149,0.000003027956,0.000007976857,0.0001208061],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9749947,"threshold_uncertainty_score":0.1763448,"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."}}