{"id":"W3198893576","doi":"10.5802/alco.169","title":"The Erdős–Ko–Rado theorem for 2-intersecting families of perfect matchings","year":2021,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Perfect graph theorem; Mathematics; Vertex (graph theory); Matching (statistics); Graph; Perfect graph; Strong perfect graph theorem; Extension (predicate logic); Discrete mathematics; Line graph; Computer science; Graph power; Pathwidth","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417738,0.0002160564,0.000352372,0.0000557017,0.0007003398,0.00006113404,0.0004369828,0.0001103383,0.00002710291],"category_scores_gemma":[0.00220522,0.0001494277,0.0003107075,0.0003025169,0.0001822376,0.00007221532,0.0002816911,0.0002546115,0.000001325372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004706341,"about_ca_system_score_gemma":0.00006745406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007300173,"about_ca_topic_score_gemma":0.0000113237,"domain_scores_codex":[0.9984794,0.0001543169,0.0004479117,0.0002719483,0.0002922106,0.0003541673],"domain_scores_gemma":[0.9940526,0.004718998,0.0002441548,0.0006365206,0.0002920516,0.00005565771],"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.00003137912,0.00005671679,0.0004578013,0.0001725826,0.0001237005,0.000004030226,0.003665531,6.636699e-7,0.0003651008,0.9903278,0.001252167,0.003542513],"study_design_scores_gemma":[0.0005327806,0.00009225018,0.000178574,0.00005590368,0.00007479304,0.0000257319,0.003966828,0.0001058486,0.01068824,0.9813458,0.002754049,0.0001792454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875975,0.0009338385,0.00196286,0.0003345298,0.0020828,0.0003382167,0.00001287078,0.00009263775,0.006644737],"genre_scores_gemma":[0.9977735,0.0001182224,0.000969372,0.00009690315,0.00007984462,0.00002638331,0.000003969093,0.00004859174,0.0008831907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01032314,"threshold_uncertainty_score":0.6093484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02013845099307112,"score_gpt":0.2860455054698701,"score_spread":0.265907054476799,"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."}}