{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T11:12:57Z","timestamp":1783422777470,"version":"3.54.6"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156204","type":"print"},{"value":"9783032156211","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15621-1_7","type":"book-chapter","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T16:37:58Z","timestamp":1767631078000},"page":"74-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Top-K Exterior Power Persistent Homology: Algorithm, Structure, and\u00a0Stability"],"prefix":"10.1007","author":[{"given":"Yoshihiro","family":"Maruyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,6]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s41468-021-00071-5","volume":"5","author":"U Bauer","year":"2021","unstructured":"Bauer, U.: Ripser: efficient computation of Vietoris-Rips persistence barcodes. J. Appl. Comput. Topol. 5, 391\u2013423 (2021)","journal-title":"J. Appl. Comput. Topol."},{"issue":"2","key":"7_CR2","first-page":"292","volume":"14","author":"MT Bennett","year":"2021","unstructured":"Bennett, M.T., Maruyama, Y.: Philosophical specification of empathetic ethical artificial intelligence. IEEE Trans. CDS 14(2), 292\u2013300 (2021)","journal-title":"IEEE Trans. CDS"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10711-013-9937-z","volume":"173","author":"F Chazal","year":"2014","unstructured":"Chazal, F., de Silva, V., Oudot, S.: Persistence stability for geometric complexes. Geom. Dedicata. 173(1), 193\u2013214 (2014)","journal-title":"Geom. Dedicata."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chazal, F., de Silva, V., Glisse, M., Oudot, S.: The Structure and Stability of Persistence Modules. SpringerBriefs in Mathematics, Springer (2016)","DOI":"10.1007\/978-3-319-42545-0"},{"key":"7_CR5","unstructured":"Cormen, T.H., et al.: Introduction to Algorithms. MIT Press (2009)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geometry 37(1), 103\u2013120 (2007)","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comp. Sys. Sci. 38(1), 86\u2013124 (1989)","journal-title":"J. Comp. Sys. Sci."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Computational topology: an introduction. American Mathematical Society (2010)","DOI":"10.1090\/mbk\/069"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geometry 28(4), 511\u2013533 (2002)","journal-title":"Discrete Comput. Geometry"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"GN Frederickson","year":"1982","unstructured":"Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in $$X{+}Y$$ and matrices with sorted columns. J. Comp. Sys. Sci. 24(2), 197\u2013208 (1982)","journal-title":"J. Comp. Sys. Sci."},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1090\/S0273-0979-07-01191-3","volume":"45","author":"R Ghrist","year":"2008","unstructured":"Ghrist, R.: Barcodes: The persistent topology of data. Bull. Am. Math. Soc. 45(1), 61\u201375 (2008)","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR13","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a03: Sorting and Searching, 2nd ed. Addison\u2013Wesley (1998)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Maruyama, Y.: Algebraic study of lattice-valued logic and lattice-valued modal logic. Proc. ICLA, 170\u2013184 (2009)","DOI":"10.1007\/978-3-540-92701-3_12"},{"issue":"12","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1016\/j.apal.2010.05.002","volume":"161","author":"Y Maruyama","year":"2010","unstructured":"Maruyama, Y.: Fundamental results for pointfree convex geometry. Ann. Pure Appl. Logic 161(12), 1486\u20131501 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.jpaa.2011.07.002","volume":"216","author":"Y Maruyama","year":"2012","unstructured":"Maruyama, Y.: Natural duality, modality, and coalgebra. J. Pure Appl. Algebra 216(3), 565\u2013580 (2012)","journal-title":"J. Pure Appl. Algebra"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Maruyama, Y.: Full lambek hyperdoctrine: categorical semantics for first-order substructural logics. Proc. WoLLIC, 211\u2013225 (2013)","DOI":"10.1007\/978-3-642-39992-3_19"},{"key":"7_CR18","unstructured":"Maruyama, Y.: Categorical duality theory: with applications to domains, convexity, and the distribution monad. Proc. CSL, 500\u2013520 (2013)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Maruyama, Y.: Symbolic and statistical theories of cognition: towards integrated artificial intelligence. Proc. SEFM, 129\u2013146 (2020)","DOI":"10.1007\/978-3-030-67220-1_11"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Maruyama, Y.: The conditions of artificial general intelligence. Proc. AGI, 242\u2013251 (2020)","DOI":"10.1007\/978-3-030-52152-3_25"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Oudot, S.Y.: Persistence theory: from quiver representations to data analysis. Mathematical Surveys and Monographs 209, American Mathematical Society (2015)","DOI":"10.1090\/surv\/209"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geometry 33(2), 249\u2013274 (2005)","DOI":"10.1007\/s00454-004-1146-y"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15621-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T16:37:59Z","timestamp":1767631079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15621-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156204","9783032156211"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15621-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaa2026.framer.website\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}