{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194558,0.0001332898,0.0003579885,0.0001825709,0.00006224976,0.00001967383,0.0002272989,0.00006659949,0.00005859624],"category_scores_gemma":[0.00004281688,0.000114991,0.0002161984,0.0002028828,0.00006481307,0.0001945923,0.000006258042,0.0002085212,0.000004238048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002251611,"about_ca_system_score_gemma":0.00001409911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.36278e-7,"about_ca_topic_score_gemma":1.019746e-7,"domain_scores_codex":[0.9989676,0.0001406525,0.0004886564,0.00005368584,0.0002062829,0.0001430971],"domain_scores_gemma":[0.999265,0.0001877038,0.0001760233,0.0001678537,0.0001219104,0.00008151878],"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.0005638578,0.0000917318,0.00001010282,0.00001731203,0.00008924308,0.00001385968,0.000223072,0.001246032,0.0204883,0.9762555,0.0005544894,0.0004465001],"study_design_scores_gemma":[0.000885479,0.001367618,0.0002562833,0.0001303929,0.00003596794,0.0001175891,0.0001744758,0.00002013272,0.01170792,0.981689,0.003489701,0.0001253766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9762382,0.0004978179,0.0008102675,0.00008354318,0.006078096,0.0001011408,0.0000139349,0.000057269,0.01611972],"genre_scores_gemma":[0.9995595,0.00003790577,0.0001126591,0.00003148542,0.0002219724,8.167768e-7,0.000001010208,0.00001277802,0.00002191494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02332125,"threshold_uncertainty_score":0.4689198,"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."}}