{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007437114,0.001120399,0.0021856,0.004976392,0.002868357,0.006594774,0.004390708,0.003042149,0.01154246],"category_scores_gemma":[0.04645324,0.001855984,0.001496121,0.004022934,0.009834842,0.02127708,0.003650773,0.004042116,0.0006213884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002458173,"about_ca_system_score_gemma":0.0014478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147445,"about_ca_topic_score_gemma":0.001558797,"domain_scores_codex":[0.9952923,0.001518917,0.0003772065,0.001154827,0.000996802,0.000660037],"domain_scores_gemma":[0.8318157,0.1429962,0.009272355,0.005235577,0.003565639,0.007114482],"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.001331798,0.0002104887,0.01561948,0.0004548467,0.0001877489,0.0003278484,0.001016824,0.02101377,0.006551992,0.9273195,0.004459684,0.02150596],"study_design_scores_gemma":[0.0001244128,0.00008817058,0.003516877,0.00009285496,0.0001064519,0.0004399491,0.0003487336,0.0370257,0.002175624,0.9540246,0.001991942,0.00006478143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.796508,0.003870582,0.1419069,0.007356419,0.0003902641,0.000136258,0.00253179,0.0003747026,0.04692521],"genre_scores_gemma":[0.9633672,0.001634584,0.02782245,0.0003895598,0.0007046204,0.0001784857,0.001161951,0.0001890947,0.004552143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01154246,"threshold_uncertainty_score":0.03933167,"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."}}