{"id":"W2738777098","doi":"10.1137/1.9781611975031.136","title":"Testing Bounded Arboricity","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Arboricity; Combinatorics; Bounded function; Treewidth; Mathematics; Omega; Dense graph; Degree (music); Upper and lower bounds; Planar graph; Graph; Discrete mathematics; Binary logarithm; 1-planar graph; Pathwidth; Chordal graph; Physics; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.003340282,0.0008525776,0.001151939,0.001378297,0.00101998,0.001718185,0.002504535,0.001579952,0.004386062],"category_scores_gemma":[0.06436271,0.0005205807,0.001154116,0.001437972,0.002135904,0.007253906,0.002720518,0.001863253,0.0008171666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009559906,"about_ca_system_score_gemma":0.001013226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111155,"about_ca_topic_score_gemma":0.001258955,"domain_scores_codex":[0.9911032,0.002670877,0.0005698021,0.00232896,0.002479783,0.0008473587],"domain_scores_gemma":[0.8781161,0.09281348,0.008514012,0.01261454,0.005137112,0.002804765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004293527,0.001064168,0.1773237,0.001206303,0.0007455854,0.003345332,0.001574061,0.3196367,0.08035108,0.1410029,0.009481875,0.2599748],"study_design_scores_gemma":[0.0001675729,0.001256583,0.01185582,0.0001277237,0.0001315781,0.002276012,0.0007974528,0.623799,0.04371275,0.3103398,0.005456585,0.00007910239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6126839,0.0003925103,0.3737195,0.00168059,0.00010005,0.0001991474,0.001790937,0.002281866,0.007151491],"genre_scores_gemma":[0.9548572,0.0001484435,0.04164016,0.0003160899,0.00007723676,0.0001021114,0.001781678,0.0002067385,0.0008703069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004386062,"threshold_uncertainty_score":0.01766533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1363170224176625,"score_gpt":0.2810234004014134,"score_spread":0.1447063779837509,"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."}}