{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001382335,0.0002825796,0.0003153602,0.0008272471,0.0004851708,0.0009774477,0.0005640566,0.0005684635,0.005966773],"category_scores_gemma":[0.001251413,0.0001906304,0.0002131219,0.0005365949,0.000617657,0.0008322468,0.0005598424,0.0004478247,0.0006402654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003991003,"about_ca_system_score_gemma":0.0003132668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007649241,"about_ca_topic_score_gemma":0.0009784712,"domain_scores_codex":[0.9998597,0.00003914976,0.00000586547,0.00002993323,0.00003939342,0.00002594298],"domain_scores_gemma":[0.9990864,0.0004164733,0.0001438934,0.00004691151,0.0001463538,0.0001600129],"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.001077695,0.0001354786,0.006864764,0.0002882054,0.00005850347,0.0006787324,0.0007404519,0.06599503,0.05176388,0.8051866,0.00707245,0.0601383],"study_design_scores_gemma":[0.00008513205,0.000231371,0.009984299,0.00004523162,0.00004079199,0.0007492217,0.0005550078,0.2847931,0.01015485,0.6851587,0.008159491,0.00004273354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9030043,0.0002866407,0.06506073,0.0004146617,0.00004791654,0.00003445685,0.0004391694,0.0001927432,0.03051948],"genre_scores_gemma":[0.9791448,0.0001663332,0.01276915,0.00004483894,0.00003397644,0.00003934152,0.0003227382,0.00004295545,0.007435873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005966773,"threshold_uncertainty_score":0.01996088,"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."}}