{"id":"W2124706286","doi":"10.1007/s11227-014-1085-1","title":"Deriving length two path centered surface area for the arrangement graph: a generating function approach","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Path (computing); Graph; Scalability; Path length; Surface (topology); Focus (optics); Algorithm; Combinatorics; Theoretical computer science; Mathematics; Geometry; Physics","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.005177432,0.0001538176,0.0002356758,0.00005346314,0.0008079736,0.0002919125,0.0008070446,0.00003288959,0.000002207138],"category_scores_gemma":[0.00006844453,0.00008171727,0.0001948344,0.0002056416,0.0000279632,0.0003196085,0.0001347411,0.0002778198,0.000001022645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004635318,"about_ca_system_score_gemma":0.0000234313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003613271,"about_ca_topic_score_gemma":0.00001063606,"domain_scores_codex":[0.9982103,0.0004175183,0.0005821782,0.0001625098,0.0003177638,0.0003096961],"domain_scores_gemma":[0.9981769,0.0008123654,0.0003733168,0.0003288447,0.0002549387,0.00005360452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004910465,0.0000768816,0.0009621333,0.00004334569,0.0002377901,0.0000010451,0.008116858,0.9249327,0.009807655,0.005814359,0.002221905,0.04773623],"study_design_scores_gemma":[0.0005203161,0.0001659945,0.0002010669,0.0001045839,0.00003662865,0.0001627932,0.001354191,0.9960254,0.000142314,0.0002580047,0.000924254,0.0001044975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2472478,0.0003363378,0.7502221,0.0003732275,0.001498546,0.0001747353,2.696255e-7,0.000024961,0.0001219741],"genre_scores_gemma":[0.9743141,0.00001492744,0.0240209,0.0003452744,0.00127074,0.000002241294,5.055747e-7,0.00001322873,0.00001810767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7270663,"threshold_uncertainty_score":0.6214361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03476657181284009,"score_gpt":0.2330884815264402,"score_spread":0.1983219097136001,"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."}}