{"id":"W2097049847","doi":"10.1007/3-540-44985-x_12","title":"On Graph Powers for Leaf-Labeled Trees","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Graph; Gomory–Hu tree; Combinatorics; Computer science; K-ary tree; Path (computing); Basis (linear algebra); Spanning tree; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Mathematics; Artificial intelligence; Binary tree; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761947,0.001376446,0.00149655,0.00263967,0.001996657,0.003491156,0.002177472,0.001547964,0.021803],"category_scores_gemma":[0.009490051,0.001357968,0.001895649,0.003670324,0.004888738,0.01560966,0.004575395,0.007074436,0.005954709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001489414,"about_ca_system_score_gemma":0.0004800984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001281602,"about_ca_topic_score_gemma":0.001894135,"domain_scores_codex":[0.9983528,0.0006083628,0.0001001261,0.000310452,0.0004568723,0.0001714422],"domain_scores_gemma":[0.9938725,0.004182615,0.0002417323,0.0009431423,0.0004172703,0.0003427053],"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.00004022218,0.0000270251,0.0001433169,0.0001051341,0.000007617656,0.00007307153,0.0004065672,0.001129478,0.0005572282,0.9710189,0.006906033,0.01958545],"study_design_scores_gemma":[0.000005213796,0.000003690942,0.00004253305,0.00001607559,0.000004601848,0.00004709471,0.00003146406,0.001692834,0.0001726141,0.9920235,0.005956424,0.000004016407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04531347,0.0046123,0.6305071,0.00491165,0.001352378,0.0002100874,0.0008004507,0.001248207,0.3110444],"genre_scores_gemma":[0.5352855,0.008634308,0.2652766,0.002538427,0.003275055,0.000654863,0.002324511,0.003322514,0.1786882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.021803,"threshold_uncertainty_score":0.07293826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02003337645477159,"score_gpt":0.2843146293703784,"score_spread":0.2642812529156068,"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."}}