{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005121885,0.0004232621,0.0004568636,0.0002400852,0.0004412874,0.000290348,0.002092248,0.0001670157,0.00008616206],"category_scores_gemma":[0.0001428641,0.0004464832,0.0002471927,0.001859618,0.0001811436,0.001116469,0.0005879773,0.0006204873,0.001429013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000192403,"about_ca_system_score_gemma":0.0001125561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006848611,"about_ca_topic_score_gemma":0.00001089986,"domain_scores_codex":[0.9963376,0.0001842283,0.0004435141,0.0009097371,0.001136073,0.0009888762],"domain_scores_gemma":[0.9974142,0.0003524015,0.000179795,0.001497327,0.0001768964,0.0003793861],"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.00003395196,0.0004576774,0.003737905,0.00004389769,0.00006826623,0.00006665834,0.0008065655,0.00009875501,0.001100302,0.9922997,0.0001743098,0.001112018],"study_design_scores_gemma":[0.002025192,0.0001517602,0.004344225,0.0001746964,0.000009932037,0.00003924073,0.00004546131,0.0002450276,0.02083041,0.9715254,0.0001103999,0.0004982891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880079,0.00007844772,0.003041865,0.0005617631,0.001402146,0.0004644551,0.000007591369,0.0004144792,0.006021321],"genre_scores_gemma":[0.9968105,0.00008006245,0.002270909,0.0004208203,0.00001123696,0.00007493193,0.000003846088,0.00005799732,0.0002696769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02077433,"threshold_uncertainty_score":0.9997987,"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."}}