{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591087,0.0006857965,0.001241814,0.003374062,0.002651094,0.004099044,0.001967643,0.001655147,0.01180102],"category_scores_gemma":[0.007756303,0.0006492977,0.001165537,0.004153606,0.005225192,0.008400687,0.004363161,0.004921689,0.0005754151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002594775,"about_ca_system_score_gemma":0.0008571653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002953173,"about_ca_topic_score_gemma":0.002665145,"domain_scores_codex":[0.9985883,0.0005020285,0.00007143818,0.0002462255,0.0003875208,0.0002045276],"domain_scores_gemma":[0.9915176,0.006231401,0.0007181891,0.0003945812,0.0006020499,0.0005361038],"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.000005877776,0.000004524165,0.0000672581,0.00001604607,0.000003318069,0.00001354513,0.0000668018,0.0005553505,0.00006271106,0.9978495,0.0003712248,0.0009839683],"study_design_scores_gemma":[0.00000384176,0.000002139991,0.00005832178,0.000007092387,0.000003030133,0.00001867501,0.00004322948,0.002346175,0.00003818669,0.9967815,0.0006954233,0.000002489299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3236952,0.007758456,0.410303,0.01174343,0.0005292715,0.00009141298,0.001157456,0.0002374685,0.2444844],"genre_scores_gemma":[0.9398187,0.002803053,0.03671459,0.0008877426,0.0004585213,0.0001696125,0.0006145664,0.00009070847,0.01844249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01180102,"threshold_uncertainty_score":0.03947842,"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."}}