{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009358739,0.0004092617,0.0009574732,0.00108888,0.001576193,0.002576826,0.001706147,0.001862891,0.009529248],"category_scores_gemma":[0.005584028,0.000382315,0.0007761872,0.001866542,0.00171386,0.00625246,0.002283842,0.002621633,0.0007178375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00100442,"about_ca_system_score_gemma":0.0008981267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001450137,"about_ca_topic_score_gemma":0.00154429,"domain_scores_codex":[0.9992207,0.0003956387,0.00002564444,0.0001470737,0.0001160023,0.00009496017],"domain_scores_gemma":[0.997003,0.001849543,0.0002383629,0.0002422898,0.0002610015,0.0004057527],"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.00005500366,0.00007388694,0.0002075252,0.00005347957,0.000009957525,0.00009750882,0.0001216165,0.005436601,0.0003577604,0.9811628,0.004655898,0.007767771],"study_design_scores_gemma":[0.00001817019,0.00001161389,0.0001358979,0.00001425323,0.00000752137,0.00007555205,0.00006262823,0.03229068,0.0001377196,0.9638388,0.003398765,0.00000838172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4406123,0.001561897,0.3288285,0.009328143,0.0004260689,0.0002052776,0.0009611212,0.0004978186,0.217579],"genre_scores_gemma":[0.8939923,0.001261694,0.05511739,0.001176412,0.000774226,0.0002049958,0.0008503756,0.0002068481,0.04641565],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009529248,"threshold_uncertainty_score":0.03187853,"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."}}