{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:47Z","timestamp":1742913107210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545337"},{"type":"electronic","value":"9783031545344"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54534-4_25","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:39:18Z","timestamp":1710844758000},"page":"349-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6584-8534","authenticated-orcid":false,"given":"Dmitry I.","family":"Ignatov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0021-9800(67)80119-4","volume":"2","author":"G Rota","year":"1967","unstructured":"Rota, G.: A generalization of Sperner\u2019s theorem. J. Combin. Theory 2, 104 (1967)","journal-title":"J. Combin. Theory"},{"key":"25_CR2","unstructured":"Engel, K.: Encyclopedia of Mathematics and its Applications Sperner Theory. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BF03023067","volume":"1","author":"RL Graham","year":"1978","unstructured":"Graham, R.L.: Maximum antichains in the partition lattice. Math. Intell. 1(2), 84\u201386 (1978)","journal-title":"Math. Intell."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/0097-3165(74)90027-2","volume":"17","author":"LH Harper","year":"1974","unstructured":"Harper, L.H.: The morphology of partially ordered sets. J. Comb. Theory Ser. A 17(1), 44\u201358 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/sapm1984713207","volume":"71","author":"S Jichang","year":"1984","unstructured":"Jichang, S., Kleitman, D.J.: Superantichains in the lattice of partitions of a set. Stud. Appl. Math. 71(3), 207\u2013241 (1984)","journal-title":"Stud. Appl. Math."},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/rsa.3240060109","volume":"6","author":"ER Canfield","year":"1995","unstructured":"Canfield, E.R., Harper, L.H.: Large antichains in the partition lattice. Random Struct. Algorithms 6(1), 89\u2013104 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Canfield, E.R.: The size of the largest antichain in the partition lattice. J. Comb. Theory, Ser. A 83(2), 188\u2013201 (1998)","DOI":"10.1006\/jcta.1998.2871"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Farley, J.D.: Was Gelfand right? The many loves of lattice theory. Notices of the American Mathematical Society 69(2) (2022)","DOI":"10.1090\/noti2415"},{"key":"25_CR9","unstructured":"Korshunov, A.D., Shmulevich, I.: The number of special monotone Boolean functions and statistical properties of stack filters. Diskretn. Anal. Issled. Oper., Ser. 1 7(3), 17\u201344 (2000)"},{"key":"25_CR10","unstructured":"Ganter, B.: Algorithmen zur formalen begriffsanalyse. In: Ganter, B., Wille, R., Wolff, K.E. (eds.) Beitr\u00e4ge zur Begriffsanalyse, pp. 241\u2013254. B.I.-Wissenschaftsverlag, Mannheim (1987)"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order 8(3), 283\u2013290 (1991)","journal-title":"Order"},{"key":"25_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, 1st edn. Springer-Verlag, New York Inc, Secaucus, NJ, USA (1999)","edition":"1"},{"key":"25_CR13","volume-title":"Combinatorial Theory","author":"M Aigner","year":"2012","unstructured":"Aigner, M.: Combinatorial Theory. Springer, Berlin, Heidelberg (2012)"},{"key":"25_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-25485-2_3","volume-title":"Information Retrieval","author":"DI Ignatov","year":"2015","unstructured":"Ignatov, D.I.: Introduction to formal concept analysis and its applications in information retrieval and related fields. In: Braslavski, P., Karpov, N., Worring, M., Volkovich, Y., Ignatov, D.I. (eds.) RuSSIR 2014. CCIS, vol. 505, pp. 42\u2013141. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25485-2_3"},{"key":"25_CR15","unstructured":"Bocharov, A., Gnatyshak, D., Ignatov, D.I., Mirkin, B.G., Shestakov, A.: A lattice-based consensus clustering algorithm. In: Huchard, M., Kuznetsov, S.O., (eds.) Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, 18\u201322 July 2016. Volume 1624 of CEUR Workshop Proceedings, pp. 45\u201356. CEUR-WS.org (2016)"},{"key":"25_CR16","unstructured":"Knuth, D.: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1. Pearson Education (2014)"},{"key":"25_CR17","unstructured":"Canfield, E., Harper, L.: A Simplified Guide to Large Antichains in the Partition (2000)"},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(91)90016-U","volume":"88","author":"K Reuter","year":"1991","unstructured":"Reuter, K.: The jump number and the lattice of maximal antichains. Discret. Math. 88(2), 289\u2013307 (1991)","journal-title":"Discret. Math."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Markowsky, G., Markowsky, L.: Lattice data analytics: the poset of irreducibles and the macneille completion. In: 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2019, Metz, France, 18\u201321 September 2019, pp. 263\u2013268. IEEE (2019)","DOI":"10.1109\/IDAACS.2019.8924393"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Lahcen, B., Kwuida, L.: Lattice miner: a tool for concept lattice construction and exploration. In: Supplementary Proceeding of International Conference on Formal concept analysis (ICFCA 2010) (2010)","DOI":"10.1007\/978-3-642-11928-6"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-78921-5_17","volume-title":"Concept Lattices and Their Applications","author":"C Roth","year":"2008","unstructured":"Roth, C., Obiedkov, S., Kourie, D.: Towards concise representation for taxonomies of epistemic communities. In: Yahia, S.B., Nguifo, E.M., Belohlavek, R. (eds.) CLA 2006. LNCS (LNAI), vol. 4923, pp. 240\u2013255. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78921-5_17"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-29892-9_7","volume-title":"Formal Concept Analysis","author":"MA Babin","year":"2012","unstructured":"Babin, M.A., Kuznetsov, S.O.: Approximating concept stability. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 7\u201315. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_7"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54534-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:43:49Z","timestamp":1710845029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54534-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545337","9783031545344"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54534-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yerevan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Armenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Out of the 93 submission, 17 were rejected before being sent to peer review.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}