{"id":"W1985908622","doi":"10.1016/j.jcta.2009.02.007","title":"On decompositions of complete hypergraphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Hypergraph; Combinatorics; Partition (number theory); Mathematics; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.0008335137,0.0009645384,0.0008228446,0.003015992,0.001305247,0.003679089,0.000921784,0.0009107245,0.009855652],"category_scores_gemma":[0.003153087,0.001036469,0.001078451,0.002300069,0.001830416,0.003997308,0.001941249,0.002342566,0.001196421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001316447,"about_ca_system_score_gemma":0.0004769524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508634,"about_ca_topic_score_gemma":0.002417096,"domain_scores_codex":[0.9993984,0.0001911957,0.00003384738,0.0001147001,0.0001382911,0.0001236461],"domain_scores_gemma":[0.9976274,0.001054359,0.0003060391,0.0002529543,0.0003220331,0.0004371634],"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.00005018482,0.00003464227,0.0004126475,0.00006453329,0.00002166296,0.0001138935,0.0004551811,0.003848743,0.001256662,0.9772148,0.004259898,0.01226712],"study_design_scores_gemma":[0.000009719613,0.000006901406,0.0002495508,0.0000349639,0.00001004478,0.00006576428,0.000139784,0.008481467,0.0001653812,0.9874715,0.003358706,0.000006108444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3927959,0.00327265,0.4431622,0.001844724,0.0004103318,0.0002258787,0.00180161,0.0003651809,0.1561216],"genre_scores_gemma":[0.777779,0.003346457,0.141207,0.0007452833,0.0005106958,0.0002647225,0.003128337,0.0005056236,0.07251295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009855652,"threshold_uncertainty_score":0.03297049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005404203268405634,"score_gpt":0.1992977980009139,"score_spread":0.1938935947325083,"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."}}