{"id":"W2403552696","doi":"","title":"On The Cyclomatic Number Of Linear Hypergraphs.","year":2012,"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; 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.001120006,0.000571453,0.0006553049,0.003395065,0.001615538,0.003476501,0.00107727,0.001306588,0.01691032],"category_scores_gemma":[0.009533299,0.0004740748,0.000406645,0.002192464,0.003237829,0.006197522,0.001708751,0.002957948,0.001436899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002257099,"about_ca_system_score_gemma":0.0008484243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009598502,"about_ca_topic_score_gemma":0.001375645,"domain_scores_codex":[0.9989079,0.0003655393,0.00003826312,0.0002153322,0.0002754117,0.0001975928],"domain_scores_gemma":[0.9918714,0.006016861,0.0006163158,0.0005317198,0.0004086561,0.0005551858],"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.00004864265,0.00001581016,0.0003011833,0.00004884263,0.000006963436,0.00003185828,0.00007505622,0.002035703,0.0003503955,0.9869382,0.004075048,0.006072323],"study_design_scores_gemma":[0.00001793828,0.00001297284,0.0003290966,0.00003576439,0.000007574779,0.0001074654,0.00004866273,0.007880766,0.0003560513,0.9864703,0.00472229,0.00001110705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3057545,0.007117194,0.1606133,0.01725035,0.001765126,0.0001222128,0.00177177,0.0005011173,0.5051043],"genre_scores_gemma":[0.9537963,0.002452666,0.01613005,0.001245552,0.001581579,0.0001881113,0.0004320384,0.0001188437,0.02405488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01691032,"threshold_uncertainty_score":0.05657065,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007735980619098375,"score_gpt":0.2101051116355522,"score_spread":0.2023691310164538,"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."}}