{"id":"W2159652182","doi":"10.1002/jcd.20280","title":"An existence theory for loopy graph decompositions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Simple graph; Complement graph; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532093,0.0005115406,0.0005490005,0.002940136,0.001531856,0.002234318,0.0008352248,0.001193112,0.008431268],"category_scores_gemma":[0.005882284,0.0009068496,0.0008759116,0.001762544,0.002634146,0.005005575,0.002417426,0.002235707,0.001146295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561076,"about_ca_system_score_gemma":0.0004570736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004834477,"about_ca_topic_score_gemma":0.0005090308,"domain_scores_codex":[0.9990187,0.0002237748,0.00006242415,0.0002665538,0.0002641274,0.0001644472],"domain_scores_gemma":[0.9958157,0.002612621,0.0003775091,0.0003694191,0.0005503657,0.0002743814],"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.00001405548,0.00001134571,0.0002015045,0.00005590851,0.000005091287,0.00003147281,0.0002404094,0.001442313,0.0004157261,0.9882195,0.00100903,0.008353637],"study_design_scores_gemma":[0.00001451706,0.00003229516,0.0001979672,0.00005624147,0.00001650707,0.0001449712,0.0001536941,0.01438731,0.0006899565,0.973205,0.0110901,0.00001138089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1263185,0.002675069,0.7940701,0.001234529,0.0001269236,0.0001027836,0.0004695782,0.0004791751,0.07452331],"genre_scores_gemma":[0.7727302,0.002122774,0.1936429,0.0005977795,0.0003509854,0.0003812233,0.0007488495,0.0001863403,0.029239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008431268,"threshold_uncertainty_score":0.02820534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03905277402300821,"score_gpt":0.2514002905828278,"score_spread":0.2123475165598196,"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."}}