{"id":"W2402760489","doi":"","title":"Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Decomposition; Robertson–Seymour theorem; Cograph; Modular decomposition; 1-planar graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Graph; Line graph; Chemistry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293052,0.0004995808,0.0006227476,0.00136063,0.001117039,0.003034084,0.001125941,0.0009553172,0.008297121],"category_scores_gemma":[0.003737305,0.0005537175,0.0008323452,0.001643127,0.001484522,0.004752159,0.001539666,0.002027107,0.001585777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482147,"about_ca_system_score_gemma":0.0008023902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562936,"about_ca_topic_score_gemma":0.002493558,"domain_scores_codex":[0.999228,0.0002594564,0.00004729074,0.000171796,0.0001466809,0.0001468089],"domain_scores_gemma":[0.9970165,0.001431604,0.000368835,0.0005016611,0.0003104834,0.0003710086],"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.00009091249,0.00004874034,0.0006537907,0.000138591,0.00001929798,0.00004605551,0.0002160515,0.004423025,0.001405295,0.9617047,0.008222566,0.02303099],"study_design_scores_gemma":[0.00001405035,0.0000106619,0.0004251972,0.00004851638,0.00001510428,0.000101227,0.0001508287,0.01379055,0.0006538699,0.9748175,0.009963835,0.000008616334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1525842,0.003015626,0.7170677,0.002355354,0.000241274,0.0001998558,0.003573791,0.0006193763,0.1203429],"genre_scores_gemma":[0.653976,0.002167996,0.2962945,0.0008428945,0.0003185096,0.00030906,0.005533294,0.0004241959,0.04013349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008297121,"threshold_uncertainty_score":0.02775663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01455192649411272,"score_gpt":0.2458431949260564,"score_spread":0.2312912684319437,"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."}}