{"id":"W7053286013","doi":"","title":"Tree decompositions and linear time algorithms","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Laser Design and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Institute of Informatics; McGill University","keywords":"Tree decomposition; K-ary tree; Disjoint sets; Tree (set theory); Modular decomposition; Tree-depth; Time complexity; Interval tree; Gomory–Hu tree","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002323728,0.0006056571,0.0004994206,0.0002659257,0.0006623375,0.00006690375,0.0003442855,0.0006210108,0.0004523862],"category_scores_gemma":[0.00003592994,0.0006743068,0.0001866219,0.0003693212,0.00003666074,0.0005102051,0.00004680819,0.0009474646,0.001656888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001984307,"about_ca_system_score_gemma":0.000014852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004822175,"about_ca_topic_score_gemma":0.0001562782,"domain_scores_codex":[0.9979653,0.00006816109,0.0005328149,0.0005243207,0.0003242248,0.0005851301],"domain_scores_gemma":[0.99864,0.0001370968,0.0001195544,0.0005488241,0.0001277585,0.0004267702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005252564,0.0003822581,0.00001390643,0.0006961348,0.0007035102,0.00003334472,0.00003045027,0.0002973639,0.5826556,0.03263253,0.0004870343,0.3820153],"study_design_scores_gemma":[0.002729827,0.0002199551,0.005052618,0.000934664,0.001798215,0.000203843,0.0002467424,0.01146848,0.4006646,0.02113135,0.549764,0.005785698],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.665017,0.001680086,0.00001149931,0.00002580741,0.001307799,0.001289164,0.004303038,0.002037414,0.3243282],"genre_scores_gemma":[0.935223,0.0008592265,0.01463362,0.0001523346,0.0003892459,0.000803475,0.00847315,0.0007287622,0.03873723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5492769,"threshold_uncertainty_score":0.9995708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01179901987956402,"score_gpt":0.2258311636702186,"score_spread":0.2140321437906546,"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."}}