{"id":"W2571863560","doi":"","title":"D-Graphs For Graphs With Cyclomatic Number 1.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Discrete mathematics; Combinatorics; Computer science; Programming language","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.0003449377,0.0005103379,0.00029636,0.003169584,0.001300154,0.002186939,0.000811168,0.001186387,0.01894113],"category_scores_gemma":[0.001994058,0.000248981,0.000458508,0.001612237,0.001458142,0.002110744,0.001287727,0.00158411,0.002337638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001340232,"about_ca_system_score_gemma":0.0004702202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000848681,"about_ca_topic_score_gemma":0.001449565,"domain_scores_codex":[0.9995832,0.000117439,0.00002203567,0.0001151143,0.00007537883,0.0000867476],"domain_scores_gemma":[0.9983093,0.0007831331,0.0002911781,0.0002440141,0.0001762061,0.0001960761],"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.00002747241,0.0000163097,0.0002203818,0.00006231426,0.000006405007,0.00008466063,0.00007091268,0.0007076976,0.0009143579,0.9841893,0.005704655,0.007995443],"study_design_scores_gemma":[0.0000101435,0.00001088119,0.0003531429,0.00004330018,0.000008466522,0.0002745937,0.0001024259,0.005062324,0.001063671,0.9669724,0.02608493,0.00001385411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1909052,0.004566432,0.3654674,0.007970245,0.001749732,0.0002926851,0.004629096,0.001302729,0.4231165],"genre_scores_gemma":[0.8728641,0.002297986,0.0619387,0.002919526,0.0005576253,0.0003340156,0.001674018,0.000248342,0.05716579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01894113,"threshold_uncertainty_score":0.06336439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005566835813694077,"score_gpt":0.1961091470847512,"score_spread":0.1905423112710571,"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."}}