{"id":"W2002893084","doi":"10.1016/j.jctb.2003.08.004","title":"Bounded degree acyclic decompositions of digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Digraph; Partition (number theory); Combinatorics; Directed acyclic graph; Mathematics; Degree (music); Bounded function; Integer (computer science); Vertex (graph theory); Decomposition; Directed graph; Discrete mathematics; Graph; Chemistry; Computer science; Physics","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.0009627664,0.0001619621,0.0004045725,0.0001960094,0.00009109095,0.00003570963,0.0002481903,0.0001008705,0.0001148732],"category_scores_gemma":[0.0001224997,0.0001449681,0.0002623848,0.0002933051,0.0001352999,0.0003840648,0.0000103818,0.0002409659,0.000004292626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003280323,"about_ca_system_score_gemma":0.00003958879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.594454e-7,"about_ca_topic_score_gemma":7.559202e-7,"domain_scores_codex":[0.9985785,0.0003020168,0.0006323055,0.00006577166,0.0002270693,0.0001942655],"domain_scores_gemma":[0.9990549,0.0002194033,0.0002391587,0.0002151264,0.0001608353,0.000110581],"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.0001874419,0.00007753454,0.0001675565,0.00004720756,0.0002107946,0.00001341788,0.0004717327,0.0001728244,0.01058065,0.9876216,0.0002530403,0.0001962227],"study_design_scores_gemma":[0.001065507,0.0003243892,0.0002278137,0.00009056829,0.0000684183,0.0002455413,0.000658778,0.000003264543,0.05521779,0.9299679,0.01196423,0.0001657772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9567669,0.001093146,0.00152384,0.00001460564,0.009941388,0.0001114536,0.000007001949,0.00005434499,0.03048733],"genre_scores_gemma":[0.9993917,0.0000812271,0.0002667129,0.000007000127,0.0001618119,0.000002774733,7.698187e-7,0.00002536793,0.00006266037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05765366,"threshold_uncertainty_score":0.5911629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009481242828341514,"score_gpt":0.2070802576993297,"score_spread":0.1975990148709882,"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."}}