{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001883638,0.0000517902,0.0001241642,0.00006461272,0.00001421469,0.000003080593,0.00006160451,0.00002929812,0.0001786278],"category_scores_gemma":[0.00001064841,0.00004894472,0.00004616877,0.00034684,0.00001652027,0.00006050247,0.000006889902,0.0000314256,0.000002798732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007089855,"about_ca_system_score_gemma":9.465733e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005851648,"about_ca_topic_score_gemma":4.843962e-7,"domain_scores_codex":[0.9996446,0.000006501756,0.0001665935,0.00004761631,0.00007570931,0.00005892721],"domain_scores_gemma":[0.9997661,0.0000121523,0.00004303397,0.0001069301,0.0000530509,0.00001875758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004785509,0.0001708584,0.04938291,0.0001996863,0.0003160321,0.000001536871,0.0009209824,0.04157899,0.08511505,0.8148834,0.001531922,0.005893807],"study_design_scores_gemma":[0.001082699,0.0001040216,0.2447855,0.00006038888,0.0001703995,0.000002133512,0.00004409004,0.5303177,0.120759,0.1017352,0.0004717119,0.0004671888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9975858,0.0001123141,0.0001343724,0.00001183946,0.0003235287,0.00003367563,0.000005494856,0.00003659327,0.001756422],"genre_scores_gemma":[0.9996442,0.0001393588,0.0001720512,0.000003270881,0.000001847836,0.000001561991,0.000008000206,0.000006491553,0.00002317363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7131482,"threshold_uncertainty_score":0.1995908,"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."}}