{"id":"W2041190751","doi":"10.1016/j.disc.2010.06.035","title":"On the size of maximal chains and the number of pairwise disjoint maximal antichains","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Pairwise comparison; Natural number; Maximal set; Enumeration; Discrete mathematics; Set (abstract data type); Statistics; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005684164,0.0001523753,0.0002835914,0.00001849933,0.0001060536,0.00003945546,0.000679033,0.00004827053,0.00004544868],"category_scores_gemma":[0.0005508733,0.00007028927,0.0001320328,0.0001630321,0.0005554426,0.00009235323,0.0002895625,0.0002229693,0.000009106847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003777249,"about_ca_system_score_gemma":0.00001933029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004244465,"about_ca_topic_score_gemma":0.000003995896,"domain_scores_codex":[0.9989467,0.00005805686,0.00032569,0.000179864,0.0002921957,0.0001975244],"domain_scores_gemma":[0.9975656,0.001310725,0.0002495018,0.0007753688,0.00005385435,0.00004500627],"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.00001224167,0.00006275043,0.0001420427,0.00004878569,0.0000185177,0.000001870609,0.002733162,0.00000490076,0.0007825904,0.9956689,0.00002261067,0.000501616],"study_design_scores_gemma":[0.0008184516,0.00008136861,0.002133784,0.00007212455,0.00003206994,0.00004184152,0.0006666257,0.08044527,0.002672172,0.9127905,0.00005210047,0.0001936338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8066564,0.00002183846,0.1845925,0.002665549,0.0001283623,0.0003405882,0.00001146944,0.00003890481,0.005544319],"genre_scores_gemma":[0.9619312,0.00001018269,0.03770059,0.0001626873,0.00002349388,0.00001242474,4.050722e-7,0.00001023346,0.0001487884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1552748,"threshold_uncertainty_score":0.2866313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01065944028338643,"score_gpt":0.2423140936012091,"score_spread":0.2316546533178227,"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."}}