{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:44Z","timestamp":1730280704772,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785687","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Describing free $\\omega$ -categories"],"prefix":"10.1109","author":[{"given":"Simon","family":"Forest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Mimram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084230"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4310\/HHA.2004.v6.n1.a12"},{"key":"ref12","first-page":"501","article-title":"Opetopes and chain complexes","volume":"26","author":"steiner","year":"2012","journal-title":"Theory and Applications of Categories"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(87)90137-X"},{"key":"ref14","first-page":"315","article-title":"Parity complexes","volume":"32","author":"street","year":"1991","journal-title":"Cahiers de Topologie et C&#x00E9;om&#x00E9;trie diff&#x00E9;rentielle cai&#x00E9;qoriques"},{"key":"ref15","first-page":"359","article-title":"Parity complexes: corrigenda","volume":"35","author":"street","year":"1994","journal-title":"Cahiers de topologie et q&#x00E9;om&#x00E9;irie diff&#x00E9;rentielle cat&#x00E9;qoriques"},{"journal-title":"Agda formalization of the counter-example for parity complexes","year":"2018","author":"forest","key":"ref4"},{"journal-title":"Unifying notions of pasting diagrams","year":"2018","author":"forest","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(89)90136-9"},{"journal-title":"Non-unital polygraphs form a presheaf category","year":"2017","author":"henry","key":"ref5"},{"key":"ref8","first-page":"29","article-title":"oo-groupoids and homotopy types","volume":"32","author":"kapranov","year":"1991","journal-title":"Cahiers de Topologie et G&#x00E9;om&#x00E9;tric Differen-tielle Cat&#x00E9;qoriques"},{"key":"ref7","first-page":"11","article-title":"Combinatorial-geometric aspects of polycategory theory: pasting schemes and higher Bruhat orders (list of results)","volume":"32","author":"kapranov","year":"1991","journal-title":"Cahiers de Topologie et C&#x00E9;om&#x00E9;trie diff&#x00E9;rentielle cai&#x00E9;qoriques"},{"journal-title":"Agda issue #3466 two definitionally equal terms are not equal","year":"2018","author":"forest","key":"ref2"},{"key":"ref1","first-page":"25","article-title":"A formal verification of the theory of parity complexes","volume":"8","author":"buckley","year":"2015","journal-title":"Journal of Formalized Reasoning"},{"journal-title":"An implementation of parity complexes","year":"2016","author":"mimram","key":"ref9"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785687.pdf?arnumber=8785687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785687","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}