{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395846,0.0001273793,0.0002354613,0.0004244435,0.0001217402,0.00009093311,0.001045074,0.00005107694,0.00004433647],"category_scores_gemma":[0.0002179893,0.00009901651,0.0002315064,0.00050154,0.00007128929,0.0005336372,0.00005814444,0.0002902137,0.00002593883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004903602,"about_ca_system_score_gemma":0.00002407752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.431888e-7,"about_ca_topic_score_gemma":6.311886e-7,"domain_scores_codex":[0.9985064,0.00007176486,0.0003409511,0.0001877468,0.0005465663,0.000346585],"domain_scores_gemma":[0.9984966,0.0004571131,0.0002420202,0.0003318491,0.0002942011,0.0001782268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003722315,0.001290388,0.0001163931,0.00003790876,0.0004032319,0.0004687269,0.002169072,0.004201855,0.007837825,0.1827552,0.03441151,0.7659357],"study_design_scores_gemma":[0.009287728,0.01096123,0.0005601627,0.0002232687,0.00004353909,0.0007936193,0.0002757831,0.1835527,0.01590231,0.7330955,0.04439,0.0009142273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00971924,0.0006946633,0.9855723,0.002310569,0.000749701,0.0001735396,0.000003724788,0.00003619088,0.0007400155],"genre_scores_gemma":[0.4085287,0.0006586592,0.5845398,0.001246507,0.0008120199,0.00002209856,0.000001339647,0.00006987902,0.004121083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7650214,"threshold_uncertainty_score":0.4037776,"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."}}