{"id":"W1817870969","doi":"10.1016/j.ejc.2015.09.006","title":"Intersection theorems for multisets","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiset; Mathematics; Combinatorics; Intersection (aeronautics); Homomorphism; Graph; Family of sets; Discrete mathematics; Structured program theorem; Set (abstract data type); 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.003720575,0.001576161,0.002325013,0.00848329,0.006668262,0.008198849,0.002981636,0.002117695,0.01578258],"category_scores_gemma":[0.00749793,0.002126981,0.004154087,0.006774305,0.006904649,0.02526231,0.01125532,0.01011374,0.001851443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003433384,"about_ca_system_score_gemma":0.001008956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387844,"about_ca_topic_score_gemma":0.001024278,"domain_scores_codex":[0.9964961,0.0008439326,0.000320139,0.0008671783,0.00101365,0.0004589377],"domain_scores_gemma":[0.9904999,0.006458737,0.0005201646,0.0008115341,0.0009801039,0.0007295728],"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.00001826084,0.00001602913,0.0001644553,0.00003666643,0.00001496711,0.00005027024,0.000293059,0.000138006,0.0001694032,0.9956672,0.0007469886,0.002684584],"study_design_scores_gemma":[0.000008501093,0.000005566116,0.0001029504,0.00001517435,0.00001696713,0.00007662448,0.00009459578,0.0006428367,0.0001958097,0.9964464,0.002385688,0.000008867712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1989538,0.008781333,0.4611939,0.007227015,0.00120705,0.0001358304,0.001503136,0.001329892,0.319668],"genre_scores_gemma":[0.8506677,0.004342697,0.08505155,0.001843517,0.001460713,0.0004874081,0.002041441,0.0007509045,0.05335403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01578258,"threshold_uncertainty_score":0.05279791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1150609403224462,"score_gpt":0.3312272699063277,"score_spread":0.2161663295838814,"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."}}