{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350193,0.0001061337,0.0001941887,0.0001105255,0.0000857907,0.00002975448,0.0002916198,0.00002294226,0.000006124388],"category_scores_gemma":[0.001234949,0.00007788502,0.0001496605,0.00009548339,0.0000476571,0.000113415,0.00006024819,0.0001942801,0.000002980878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005564204,"about_ca_system_score_gemma":0.00002682668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.24418e-7,"about_ca_topic_score_gemma":8.264581e-8,"domain_scores_codex":[0.9988503,0.0003035716,0.0004122237,0.00007260978,0.0002296025,0.0001316415],"domain_scores_gemma":[0.9985544,0.0002508838,0.0004178614,0.0001649226,0.0004722649,0.0001396632],"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.000175479,0.000094863,0.0002272707,0.00002588363,0.00006313733,0.00004675929,0.002561142,0.000009226666,0.00006085625,0.9745165,0.01919436,0.003024491],"study_design_scores_gemma":[0.001930312,0.0007152502,0.0002301946,0.00004212402,0.00004555955,0.0001588387,0.0004410741,0.00005934748,0.0003454786,0.973191,0.02273316,0.0001076425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8505054,0.0003135495,0.1051716,0.0001433725,0.008250087,0.0002097028,0.000004657434,0.00004837796,0.03535324],"genre_scores_gemma":[0.9953884,0.000008828522,0.003947129,0.00004759614,0.000306727,4.275474e-7,4.411202e-7,0.00003604089,0.0002644203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.144883,"threshold_uncertainty_score":0.3176059,"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."}}