{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001091592,0.000704947,0.0006623931,0.001877582,0.0004517162,0.0005033395,0.005589997,0.0003642488,0.00005748086],"category_scores_gemma":[0.0001790737,0.0006330531,0.0002975395,0.001098758,0.001259091,0.0006154671,0.0007151478,0.001022579,0.00008965441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002720622,"about_ca_system_score_gemma":0.0004546997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005706325,"about_ca_topic_score_gemma":0.00005071864,"domain_scores_codex":[0.9945447,0.00005606469,0.0005237908,0.002283536,0.001373584,0.001218357],"domain_scores_gemma":[0.9952385,0.001823067,0.0002149499,0.002180303,0.0002571662,0.0002859813],"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.00007585116,0.00005285589,0.000004158994,0.00002333963,0.00001893957,0.00006018108,0.0003068918,0.04759992,0.000210876,0.309029,0.00005802908,0.64256],"study_design_scores_gemma":[0.0005679879,0.0007125802,0.00001303012,0.0002462685,0.00000490051,0.00002553351,9.317737e-8,0.08352718,0.001315691,0.9091807,0.003703312,0.0007027356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009327419,0.0003842208,0.9907405,0.0007456475,0.001100329,0.0009359524,0.00001683839,0.0002444618,0.005738769],"genre_scores_gemma":[0.1364612,0.0003361146,0.8512751,0.006537634,0.0009102434,0.0001647447,0.00004109122,0.0002412524,0.00403254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6418573,"threshold_uncertainty_score":0.9997903,"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."}}