{"id":"W2564348232","doi":"","title":"Path graphs and pr-trees","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Path (computing); Mathematics; Combinatorics; Ackermann function; K-ary tree; Inverse; Gomory–Hu tree; Graph; Discrete mathematics; Tree structure; Binary tree; Computer science","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.0002833843,0.0001390257,0.0001287235,0.0001150894,0.00006596737,0.00009539999,0.000433726,0.0001550733,0.00003007855],"category_scores_gemma":[0.00005663255,0.000118501,0.00003517239,0.0001715275,0.00001493168,0.0004984569,0.00004317858,0.0001320814,0.00004827614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001099777,"about_ca_system_score_gemma":0.00002666883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002781735,"about_ca_topic_score_gemma":0.00003891077,"domain_scores_codex":[0.9991769,0.00004762393,0.0001619744,0.000260411,0.0001862877,0.0001668243],"domain_scores_gemma":[0.9993004,0.0000383822,0.0001135749,0.0004210735,0.00005939591,0.00006722313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000003726973,0.0000233553,0.000465173,0.00008352307,0.00001078604,4.02892e-7,0.001591665,1.384951e-7,0.0006906061,0.8300288,0.0008764768,0.1662254],"study_design_scores_gemma":[0.000465503,0.0002430914,0.8187986,0.000266922,0.00008808567,0.00003740162,0.001368228,0.01243036,0.02563133,0.1104791,0.02834795,0.001843438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1490061,0.005300781,0.5005592,0.00009899042,0.007303399,0.0009020172,0.000006070503,0.001165136,0.3356583],"genre_scores_gemma":[0.07099351,0.0001585888,0.9149898,0.00009017924,0.00005253256,0.00004655185,0.00007654505,0.00001805037,0.01357421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8183334,"threshold_uncertainty_score":0.4832329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02094045729866418,"score_gpt":0.2979886627635859,"score_spread":0.2770482054649217,"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."}}