{"id":"W2952013250","doi":"10.48550/arxiv.1504.06657","title":"Intersection theorems for multisets","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Multiset; Intersection (aeronautics); Homomorphism; Mathematics; Combinatorics; Graph; Set (abstract data type); Discrete mathematics; Structured program theorem; Family of sets; Intersection graph; Computer science; Line graph","routes":{"ca_aff":true,"ca_fund":false,"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.002838596,0.0007229256,0.001130379,0.006349451,0.004142076,0.004987061,0.001677342,0.001092844,0.01069663],"category_scores_gemma":[0.009470742,0.0009045614,0.00206337,0.003966151,0.004397227,0.01312051,0.006012483,0.003596926,0.001434317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002909684,"about_ca_system_score_gemma":0.0006880459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008976604,"about_ca_topic_score_gemma":0.0005525851,"domain_scores_codex":[0.9964071,0.0005824472,0.000256462,0.001109599,0.001189459,0.0004549021],"domain_scores_gemma":[0.9882152,0.007582929,0.0009349555,0.00111248,0.001337742,0.0008165645],"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.00001904761,0.00001667705,0.0004938014,0.00006091993,0.00001457362,0.00008331938,0.0004588608,0.000411001,0.0005517203,0.9903836,0.001057772,0.006448771],"study_design_scores_gemma":[0.000007842715,0.00001832925,0.0003557277,0.00003546173,0.00001754599,0.0003078433,0.0002721785,0.003747203,0.001223921,0.9862581,0.007739463,0.00001630724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2982382,0.006370861,0.5305762,0.002513756,0.0005509747,0.0001440439,0.001626156,0.001333345,0.1586465],"genre_scores_gemma":[0.8833693,0.002416303,0.09243616,0.000912745,0.0007596284,0.0003865685,0.001458484,0.0004334902,0.01782727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01069663,"threshold_uncertainty_score":0.03578377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1870580923639326,"score_gpt":0.2477849489107906,"score_spread":0.06072685654685808,"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."}}