{"id":"W2177504740","doi":"10.1016/j.ins.2015.11.012","title":"Length two path centered surface areas of the (n, k)-star graph","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Path (computing); Mathematics; Graph; Star (game theory); Distance; Surface (topology); Path length; Factor-critical graph; Path graph; Distance-hereditary graph; Discrete mathematics; Computer science; Graph power; Geometry; Line graph; Shortest path problem; Mathematical analysis","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.001237965,0.00006594593,0.00008859701,0.00006932859,0.0001735731,0.0002476637,0.000990121,0.00002208442,0.0000048324],"category_scores_gemma":[0.0000656888,0.00003890051,0.00005347079,0.000773041,0.0001299583,0.002536326,0.0001420141,0.00005441976,0.00003426574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002235474,"about_ca_system_score_gemma":0.0001257703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002073804,"about_ca_topic_score_gemma":0.00003104229,"domain_scores_codex":[0.9987814,0.00007818102,0.000342296,0.00009245677,0.000554007,0.000151706],"domain_scores_gemma":[0.9991004,0.00004102219,0.0002667667,0.0002747294,0.0002602628,0.00005677811],"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.0000251567,0.00009860757,0.05035235,0.00005425383,0.00004003444,0.000001079679,0.05397922,0.147307,0.0001857641,0.6597637,0.05448278,0.03371006],"study_design_scores_gemma":[0.0008172669,0.0002519844,0.006236985,0.000105505,0.000003556597,0.00004423248,0.004552274,0.9326702,0.00176366,0.007466438,0.0458207,0.00026722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6725385,0.00007476096,0.2771437,0.001422862,0.004588555,0.0003181188,0.000007016712,0.0001184092,0.04378809],"genre_scores_gemma":[0.9982863,0.000002364221,0.001328282,0.0002981322,0.00002425627,0.00000190089,5.448743e-7,8.036729e-7,0.00005741619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7853632,"threshold_uncertainty_score":0.2388227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04572188069862702,"score_gpt":0.2653010909778355,"score_spread":0.2195792102792085,"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."}}