{"id":"W29918265","doi":"","title":"Characterizations of arboricity of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Arboricity; Mathematics; Dense graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Bounding overwatch; Spanning tree; Trémaux tree; Cograph; Graph; Line graph; Planar graph; Computer science","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.0007089751,0.0008262647,0.0004226368,0.002934966,0.0007045013,0.001716497,0.0008369412,0.000945325,0.007302269],"category_scores_gemma":[0.005653793,0.0003816778,0.0006558054,0.002373707,0.001282525,0.003639739,0.0009937107,0.001625762,0.000811216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007310504,"about_ca_system_score_gemma":0.0002246892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002254,"about_ca_topic_score_gemma":0.0004284075,"domain_scores_codex":[0.9990966,0.0002064161,0.00007497959,0.0002368998,0.0002518948,0.0001330848],"domain_scores_gemma":[0.9925235,0.004429303,0.001525818,0.00054342,0.0004709715,0.0005069272],"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.0002039933,0.0001451127,0.0111733,0.0006205348,0.00009229471,0.0006107564,0.0008215785,0.02866337,0.01891398,0.8583778,0.007149659,0.0732277],"study_design_scores_gemma":[0.00002354482,0.0001554054,0.00549641,0.0001221781,0.0000553598,0.002268796,0.0004866859,0.05322375,0.00585669,0.9111688,0.02111056,0.00003176791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4262697,0.003674345,0.4651577,0.001695601,0.0001675304,0.0002027372,0.002813668,0.0006979863,0.09932083],"genre_scores_gemma":[0.9448115,0.001592652,0.04522379,0.0002909258,0.0002770366,0.0001721554,0.002475295,0.0001572375,0.004999387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007302269,"threshold_uncertainty_score":0.02442849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008007175654805906,"score_gpt":0.1794947977873769,"score_spread":0.171487622132571,"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."}}