{"id":"W2029485128","doi":"10.1016/j.jcta.2004.02.002","title":"A hypergraph extension of the bipartite Turán problem","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Extension (predicate logic); Hypergraph; Combinatorics; Upper and lower bounds; Mathematics; Bipartite graph; Element (criminal law); Set (abstract data type); Computer science; Graph; Law; Mathematical analysis; Political science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529579,0.0001791457,0.0004522849,0.0001124991,0.0002301833,0.0000244807,0.0005356703,0.0001219991,0.00004291025],"category_scores_gemma":[0.0006702988,0.00009920482,0.0004174357,0.0003154559,0.0003663919,0.0002490448,0.0001618325,0.0003686641,5.19237e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003880255,"about_ca_system_score_gemma":0.0001144476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000177785,"about_ca_topic_score_gemma":9.263018e-7,"domain_scores_codex":[0.9981622,0.0002874352,0.0007421534,0.0001086967,0.0004974796,0.0002020988],"domain_scores_gemma":[0.9978466,0.0003283328,0.0008979468,0.0004350061,0.0004158168,0.00007629525],"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.0008206634,0.0001444684,0.0001007701,0.00005591912,0.0001132769,0.00001060761,0.001560267,0.00003285627,0.004060304,0.9926088,0.0002342679,0.0002578195],"study_design_scores_gemma":[0.001467581,0.0004619829,0.0002918769,0.0002401353,0.0001055524,0.0002264458,0.0003561041,2.408043e-7,0.02086608,0.9735658,0.002304204,0.0001140075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9914446,0.0004034671,0.0001865121,0.0003758938,0.005514471,0.0002065449,0.000004056068,0.00001721455,0.001847163],"genre_scores_gemma":[0.9969671,0.00006475822,0.002369016,0.00006146529,0.00039639,0.00000198095,1.175651e-7,0.00002494331,0.0001141704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01904299,"threshold_uncertainty_score":0.4045455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0143958301668347,"score_gpt":0.255271512604746,"score_spread":0.2408756824379112,"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."}}