{"id":"W2549740858","doi":"10.1016/j.disc.2016.08.027","title":"Graph-intersecting set systems and LYM inequalities","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Limiting; Upper and lower bounds; Complete graph; Set (abstract data type); Discrete mathematics; 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.0006812308,0.0002624671,0.0004204492,0.0001217609,0.0002362084,0.00008572555,0.0002253132,0.0001106244,0.00005518935],"category_scores_gemma":[0.0006729337,0.0001469733,0.0001114723,0.00009872853,0.0001660337,0.0001524597,0.0002064337,0.00009871196,0.000007612451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002552079,"about_ca_system_score_gemma":0.000009954879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008520828,"about_ca_topic_score_gemma":0.000004028198,"domain_scores_codex":[0.998507,0.0001001498,0.0005253764,0.0002502912,0.0002817629,0.0003354582],"domain_scores_gemma":[0.9977817,0.001293273,0.0002515118,0.0005063782,0.00006487865,0.0001022343],"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.000007884809,0.0000135295,0.0003669852,0.0006191654,0.00008333785,0.000005395488,0.009401662,2.534234e-7,0.0003279219,0.9882968,0.0005715005,0.0003055763],"study_design_scores_gemma":[0.0004256448,0.00005226717,0.00004071598,0.0006134138,0.00006807246,0.0000876706,0.01006064,0.0002199983,0.0005070727,0.9871852,0.0004171004,0.000322151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9514832,0.0002757155,0.03588022,0.0001486562,0.0005556249,0.0003835365,0.0000976813,0.0002533119,0.01092207],"genre_scores_gemma":[0.9923531,0.00004452745,0.005963564,0.00003533306,0.0001316795,0.00002569441,0.000001821555,0.00005427161,0.00138999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04086994,"threshold_uncertainty_score":0.5993397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05286349505153703,"score_gpt":0.306530472386535,"score_spread":0.2536669773349979,"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."}}