{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008578529,0.0004225729,0.0005890692,0.00004683017,0.0006036252,0.0006170587,0.001044523,0.0006923754,0.000002318907],"category_scores_gemma":[0.00009317298,0.0003973587,0.0004436006,0.0001190634,0.0003408487,0.00004041371,0.002073142,0.0008123675,0.00000297944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005865838,"about_ca_system_score_gemma":0.0002686384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001122331,"about_ca_topic_score_gemma":0.00000120539,"domain_scores_codex":[0.9978969,0.00001030708,0.0005418207,0.0007401733,0.0003433668,0.0004674788],"domain_scores_gemma":[0.9979843,0.0005500258,0.0004497742,0.0007284053,0.0001441143,0.0001433873],"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.000009839869,0.0001427271,0.000003685653,0.0007583813,0.0003254079,6.934991e-7,0.004196934,0.000007796359,0.000466685,0.9155459,0.006275033,0.07226685],"study_design_scores_gemma":[0.0008056351,0.00007137648,0.000002166536,0.0001932665,0.00008570728,0.000004641758,0.0001281755,0.03099619,0.001649892,0.9624963,0.003049725,0.0005169133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03720259,0.00006003891,0.9252816,0.0002364712,0.001949715,0.003072902,0.0001341718,0.0008010768,0.03126143],"genre_scores_gemma":[0.01113854,0.000003049234,0.986303,0.0001830588,0.00168867,0.0003466409,0.00001494321,0.00003858859,0.0002834827],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07174994,"threshold_uncertainty_score":0.9998478,"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."}}