{"id":"W30224642","doi":"10.1038/s41598-018-32298-1","title":"On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Combinatorics; Discrete mathematics; Computer science; Programming language; Software","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.0003625331,0.0004836807,0.0004075378,0.002236596,0.001072491,0.001677042,0.0005016754,0.0007592855,0.004841564],"category_scores_gemma":[0.002887326,0.0003067863,0.0004988468,0.001936421,0.001205118,0.002355579,0.0006216594,0.0005707491,0.0006470806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184839,"about_ca_system_score_gemma":0.0003252321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001157527,"about_ca_topic_score_gemma":0.002172339,"domain_scores_codex":[0.9994716,0.0001435889,0.00003106078,0.0001813638,0.00008020614,0.00009213614],"domain_scores_gemma":[0.9959866,0.002130064,0.0009908233,0.0003817804,0.0002028306,0.0003078523],"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.0003492094,0.00009533425,0.008778684,0.0006178233,0.0001449442,0.00107879,0.0008749234,0.02568556,0.01638531,0.8773311,0.007412106,0.06124604],"study_design_scores_gemma":[0.00003521507,0.0000751168,0.006708126,0.0001372721,0.00008385153,0.001681282,0.0003477469,0.05856226,0.004092145,0.8991627,0.02907863,0.00003571815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8082418,0.002120131,0.1465651,0.001800662,0.0001889533,0.0001322278,0.003464548,0.0005201134,0.03696653],"genre_scores_gemma":[0.949381,0.00202211,0.03441243,0.000354193,0.0002383727,0.0001605008,0.003180713,0.0001247686,0.01012598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004841564,"threshold_uncertainty_score":0.01619667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02159831771197511,"score_gpt":0.2879803176185879,"score_spread":0.2663819999066128,"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."}}