{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T13:42:16Z","timestamp":1769694136001,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031107351","type":"print"},{"value":"9783031107368","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10736-8_2","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:09:53Z","timestamp":1658509793000},"page":"23-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Discrete Density Comonads and\u00a0Graph Parameters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3921-6637","authenticated-orcid":false,"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1930-4904","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Jakl","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Paine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Dawar, A., Wang, P.: The pebbling comonad in finite model theory. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312. IEEE (2017)","DOI":"10.1109\/LICS.2017.8005129"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Marsden, D.: Comonadic semantics for guarded fragments. In: Proceedings of the 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313. IEEE (2021)","DOI":"10.1109\/LICS52264.2021.9470594"},{"key":"2_CR3","unstructured":"Abramsky, S., Reggio, L.: Arboreal categories and resources. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), pp. 115:1\u2013115:20. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"6","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1093\/logcom\/exab048","volume":"31","author":"S Abramsky","year":"2021","unstructured":"Abramsky, S., Shah, N.: Relating structure and power: Comonadic semantics for computational resources. J. Log. Comput. 31(6), 1390\u20131428 (2021)","journal-title":"J. Log. Comput."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Abramsky, S., Tzevelekos, N.: Introduction to categories and categorical logic. In: New Structures for Physics, pp. 3\u201394. Springer Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12821-9","DOI":"10.1007\/978-3-642-12821-9"},{"key":"2_CR6","volume-title":"Abstract and Concrete Categories","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories. John Wiley & Sons Inc., New York (1990)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories, vol. 189. Cambridge University Press, Cambridge (1994)","DOI":"10.1017\/CBO9780511600579"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Appelgate, H., Tierney, M.: Categories with models. In: Eckmann, B. (ed.) Seminar on Triples and Categorical Homology Theory. LNM, vol. 80, pp. 156\u2013244. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0083086","DOI":"10.1007\/BFb0083086"},{"key":"2_CR9","unstructured":"Awodey, S.: Category Theory. Oxford University Press, New York (2010)"},{"key":"2_CR10","unstructured":"B\u00f6ker, J.: Structural similarity and homomorphism counts. Master\u2019s thesis, RWTH Aachen (2018)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-016-0235-7","volume":"79","author":"J Bulian","year":"2017","unstructured":"Bulian, J., Dawar, A.: Fixed-parameter tractable distances to sparse graph classes. Algorithmica 79(1), 139\u2013158 (2017)","journal-title":"Algorithmica"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Conghaile, A.\u00d3., Dawar, A.: Game comonads & generalised quantifiers. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 183, pp. 16:1\u201316:17. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.16","DOI":"10.4230\/LIPIcs.CSL.2021.16"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Dawar, A., Jakl, T., Reggio, L.: Lov\u00e1sz-type theorems and game comonads. In: Proceedings of the 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470609","DOI":"10.1109\/LICS52264.2021.9470609"},{"key":"2_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0075890","volume-title":"Categories of Boolean Sheaves of Simple Algebras","author":"Yves Diers","year":"1986","unstructured":"Diers, Yves: Categories of Boolean sheaves of simple algebras. In: Categories of Boolean Sheaves of Simple Algebras. LNM, vol. 1187, pp. 48\u2013113. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/BFb0075890"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Kan extensions in Enriched Category Theory. LNM, vol. 145. Springer, Heidelberg (1970). https:\/\/doi.org\/10.1007\/BFb0060485","DOI":"10.1007\/BFb0060485"},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1002\/jgt.20461","volume":"64","author":"Z Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, Z.: On recognizing graphs by numbers of homomorphisms. J. Graph Theory 64(4), 330\u2013342 (2010)","journal-title":"J. Graph Theory"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Counting bounded tree depth homomorphisms. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 507\u2013520 (2020)","DOI":"10.1145\/3373718.3394739"},{"key":"2_CR18","unstructured":"Grohe, M., Rattan, G., Seppelt, T.: Homomorphism tensors and linear equations (2022). https:\/\/arxiv.org\/abs\/2111.11313, Sccepted at the 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Hammack, R.H., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs, vol. 2. CRC Press, Taylor & Francis Group, New York (2011)","DOI":"10.1201\/b10959"},{"key":"2_CR20","unstructured":"Jakl, T., Marsden, D., Shah, N.: A game comonadic account of Courcelle and Feferman-Vaught-Mostowski theorems (2022). in preparation, arXiv preprint. https:\/\/arxiv.org\/abs\/2205.05387"},{"key":"2_CR21","unstructured":"Kock, A.: Continuous Yoneda representation of a small category, University of Aarhus, Denmark (1966)"},{"issue":"13","key":"2_CR22","first-page":"332","volume":"28","author":"T Leinster","year":"2013","unstructured":"Leinster, T.: Codensity and the ultrafilter monad. Theory Appl. Categ. 28(13), 332\u2013370 (2013)","journal-title":"Theory Appl. Categ."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02280291","volume":"18","author":"L Lov\u00e1sz","year":"1967","unstructured":"Lov\u00e1sz, L.: Operations with structures. Acta Math. Acad. Sci. Hungar. 18, 321\u2013328 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits, vol. 60. American Mathematical Society (2012)","DOI":"10.1090\/coll\/060"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Man\u010dinska, L., Roberson, D.E.: Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00067"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Montacute, Y., Shah, N.: The Pebble-Relation Comonad in Finite Model Theory (2021). https:\/\/arxiv.org\/abs\/2110.08196, Accepted at the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","DOI":"10.1145\/3531130.3533335"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ejc.2011.01.006","volume":"32","author":"J Ne\u0161et\u0159il","year":"2011","unstructured":"Ne\u0161et\u0159il, J., De Mendez, P.O.: On nowhere dense graphs. Eur. J. Comb. 32(4), 600\u2013617 (2011)","journal-title":"Eur. J. Comb."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(94)90241-0","volume":"132","author":"MV Ramana","year":"1994","unstructured":"Ramana, M.V., Scheinerman, E.R., Ullman, D.: Fractional isomorphism of graphs. Discret. Math. 132, 247\u2013265 (1994)","journal-title":"Discret. Math."},{"key":"2_CR29","unstructured":"Reggio, L.: Polyadic sets and homomorphism counting (2021). Submitted, arXiv preprint. https:\/\/arxiv.org\/abs\/2110.11061"},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10485-007-9076-5","volume":"16","author":"R Wisbauer","year":"2008","unstructured":"Wisbauer, R.: Algebras versus coalgebras. Appl. Categ. Struct. 16(1), 255\u2013295 (2008)","journal-title":"Appl. Categ. Struct."}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10736-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T11:20:23Z","timestamp":1676200823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10736-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107351","9783031107368"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10736-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","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":"9","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":"75% - 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":"2","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)"}}]}}