{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004032081,0.0002523855,0.0004215052,0.0003626438,0.0002774619,0.0001033069,0.0005782684,0.00009431787,0.000005749288],"category_scores_gemma":[0.00002422908,0.0002442971,0.0001226634,0.0009456354,0.0001765385,0.0003545891,0.0001579855,0.0001704163,0.00001712227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001661763,"about_ca_system_score_gemma":0.00002827691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009476304,"about_ca_topic_score_gemma":0.00001071167,"domain_scores_codex":[0.9980782,0.0001344321,0.0005222402,0.0005239577,0.0003773473,0.0003638551],"domain_scores_gemma":[0.9985344,0.0001302505,0.0002335499,0.0006888412,0.0002064025,0.0002065424],"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.00001694007,0.0001823476,0.001049706,0.00001469779,0.00002714087,0.00000672443,0.0003960243,0.00002645228,0.05108817,0.9440003,0.0006258235,0.002565668],"study_design_scores_gemma":[0.00167503,0.000539736,0.01032536,0.00006958521,0.00002133131,0.00001449034,0.00001035688,0.008298239,0.002797076,0.975731,0.0002427632,0.0002749884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952485,0.0009816769,0.0008694827,0.001121016,0.0007507218,0.0002539681,0.000004932637,0.0002640764,0.0005056404],"genre_scores_gemma":[0.9881855,0.00008902001,0.01122296,0.0004576474,6.676289e-7,0.000007149109,0.00001150714,0.00001080919,0.00001470044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0482911,"threshold_uncertainty_score":0.9962144,"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."}}