{"id":"W2059398229","doi":"10.1137/110846828","title":"Planar Graphs Have Exponentially Many 3-Arboricities","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Exponential growth; Colored; Projective test; Graph; Discrete mathematics; Class (philosophy); Planar straight-line graph; Outerplanar graph; 1-planar graph; Pathwidth; Line graph; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.00134385,0.0002841733,0.0003349062,0.0004203798,0.0003805479,0.0003721354,0.001431543,0.0000826964,0.00007853108],"category_scores_gemma":[0.0001557427,0.0002151881,0.0002358118,0.000338962,0.0001364786,0.001147491,0.0001927594,0.0006427185,0.0001972421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007778981,"about_ca_system_score_gemma":0.00004793493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.752477e-7,"about_ca_topic_score_gemma":5.615473e-7,"domain_scores_codex":[0.9971294,0.0001765603,0.0005411655,0.0002192674,0.001056633,0.0008769289],"domain_scores_gemma":[0.9980198,0.000340091,0.0003286863,0.0007310642,0.000116415,0.0004639024],"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.00001743013,0.0001688393,0.0002165113,0.00004395419,0.00006403457,0.00005898933,0.002839267,0.00003720285,0.0006318915,0.9937953,0.0007379951,0.001388544],"study_design_scores_gemma":[0.0005797716,0.0003384002,0.0005093721,0.0002070489,0.00002371222,0.0007390095,0.001343398,0.004073199,0.002634085,0.9862626,0.002778577,0.000510852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0375157,0.0006187732,0.9425919,0.0006861399,0.0008268535,0.000253358,0.000007861542,0.0001547856,0.01734464],"genre_scores_gemma":[0.8371521,0.0001992495,0.1604205,0.0002943663,0.0003523981,0.00001725064,0.000001979177,0.00005919122,0.001502963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7996364,"threshold_uncertainty_score":0.8775117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03082149681854752,"score_gpt":0.2991658034290409,"score_spread":0.2683443066104934,"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."}}