{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","routes":{"ca_aff":true,"ca_fund":true,"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.00378113,0.001362835,0.001826165,0.00298513,0.002416722,0.004615928,0.002895744,0.001940002,0.01902505],"category_scores_gemma":[0.02577149,0.001442906,0.002226385,0.003623326,0.005760364,0.01980979,0.007851724,0.006103778,0.004192377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001650097,"about_ca_system_score_gemma":0.0007938486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001597764,"about_ca_topic_score_gemma":0.002786919,"domain_scores_codex":[0.9961271,0.001492459,0.0002272565,0.0006752347,0.0009965573,0.0004814684],"domain_scores_gemma":[0.9782035,0.0147588,0.0009382038,0.003337046,0.001407835,0.001354519],"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.0002450627,0.0001164066,0.001059587,0.0001823459,0.00002985859,0.00019902,0.001055934,0.005331087,0.001311713,0.9434649,0.009740135,0.03726394],"study_design_scores_gemma":[0.0000225799,0.00001621757,0.0001244026,0.00003078928,0.00001864366,0.0001042346,0.0001123089,0.01079087,0.0005482291,0.9826973,0.005524204,0.00001021811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1124517,0.001914371,0.7488641,0.006389906,0.000836478,0.0003549371,0.0008050301,0.001380372,0.1270032],"genre_scores_gemma":[0.6431389,0.003183889,0.2658906,0.002149142,0.001708575,0.0005637613,0.002122162,0.002426018,0.07881697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01902505,"threshold_uncertainty_score":0.06364518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03359346603976615,"score_gpt":0.3027998815668668,"score_spread":0.2692064155271007,"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."}}