{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.002624567,0.0002297935,0.0005939748,0.0000762627,0.0004673243,0.00005826933,0.000701185,0.0001465803,0.0005480182],"category_scores_gemma":[0.001096893,0.0001378754,0.0003464403,0.0001842551,0.0004888367,0.0002788865,0.00007197473,0.0004594722,0.000001644285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170421,"about_ca_system_score_gemma":0.00008689216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002060079,"about_ca_topic_score_gemma":0.000001362381,"domain_scores_codex":[0.9976677,0.00037734,0.0009820182,0.0001111762,0.0005518879,0.0003099172],"domain_scores_gemma":[0.9947706,0.003669848,0.0007641268,0.0004070066,0.000279874,0.0001085691],"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.007286414,0.00006887874,0.0000598448,0.00002920482,0.0002629358,0.00002738498,0.00166612,0.000003872517,0.0004134008,0.9837077,0.0003410318,0.006133179],"study_design_scores_gemma":[0.001640287,0.001065404,0.0001210309,0.00007799426,0.000100824,0.0002497369,0.001452192,0.000001103935,0.00423508,0.9735577,0.01734041,0.0001582506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973737,0.0003406373,0.00003322676,0.0002167483,0.004450598,0.0001667173,0.00001354389,0.00002515092,0.02101639],"genre_scores_gemma":[0.9975855,0.0003266048,0.000696117,0.00007714955,0.0005452199,0.000002292127,4.033601e-7,0.00003134754,0.0007353119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02384857,"threshold_uncertainty_score":0.6000415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122255240268587,"score_gpt":0.2518255740639708,"score_spread":0.2396000500371121,"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."}}