{"id":"W1577506113","doi":"10.1007/978-3-540-68880-8_6","title":"New Upper Bounds on Continuous Tree Edge-Partition Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Partition (number theory); Combinatorics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","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.007071384,0.005059019,0.005279716,0.005830077,0.003510085,0.01096447,0.01560795,0.005970926,0.03528636],"category_scores_gemma":[0.04158605,0.00228955,0.003611192,0.01211632,0.004806225,0.02523936,0.01019002,0.02137154,0.006089563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006414008,"about_ca_system_score_gemma":0.00333679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002559813,"about_ca_topic_score_gemma":0.003394442,"domain_scores_codex":[0.9927618,0.001612529,0.0002630179,0.001378161,0.002646099,0.001338374],"domain_scores_gemma":[0.9606264,0.02959759,0.001152266,0.003420267,0.002372061,0.002831326],"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.00121511,0.001039931,0.001452663,0.00221033,0.0002378316,0.000256253,0.0006026766,0.1036474,0.004689264,0.5871701,0.1245985,0.17288],"study_design_scores_gemma":[0.0001493479,0.0001586664,0.0008158185,0.0004254915,0.0002249975,0.0003215722,0.0002028268,0.3042214,0.001946277,0.6678003,0.02364721,0.00008622631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03406784,0.02698122,0.7765784,0.01188462,0.003810094,0.0005167897,0.003378461,0.002429546,0.140353],"genre_scores_gemma":[0.3635649,0.02325006,0.5246913,0.006158402,0.01032479,0.002500889,0.008344537,0.003897397,0.05726768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03528636,"threshold_uncertainty_score":0.1180447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01924551912285989,"score_gpt":0.2659052201453175,"score_spread":0.2466597010224576,"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."}}