{"id":"https://openalex.org/W2541184038","doi":"https://doi.org/10.1109/lics.2017.8005147","title":"Data structures for quasistrict higher categories","display_name":"Data structures for quasistrict higher categories","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2541184038","doi":"https://doi.org/10.1109/lics.2017.8005147","mag":"2541184038"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035980551","display_name":"Krzysztof Bar","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Krzysztof Bar","raw_affiliation_strings":["Department of Computer Science, University of Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017943933","display_name":"Jamie Vicary","orcid":"https://orcid.org/0000-0002-0998-1701"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jamie Vicary","raw_affiliation_strings":["Department of Computer Science, University of Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":9.1456,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.98535565,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10287","display_name":"Algebraic structures and combinatorial models","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10304","display_name":"Geometric and Algebraic Topology","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjunction","display_name":"Adjunction","score":0.9348713755607605},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.8191955089569092},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.730294942855835},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6544579267501831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5696326494216919},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5524616837501526},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5071942806243896},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5051456093788147},{"id":"https://openalex.org/keywords/algebraic-structure","display_name":"Algebraic structure","score":0.4382711946964264},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.4201534390449524},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.41365963220596313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3725718855857849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36314961314201355},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.20068782567977905},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13988283276557922}],"concepts":[{"id":"https://openalex.org/C2780580338","wikidata":"https://www.wikidata.org/wiki/Q577835","display_name":"Adjunction","level":2,"score":0.9348713755607605},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.8191955089569092},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.730294942855835},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6544579267501831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5696326494216919},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5524616837501526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5071942806243896},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5051456093788147},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.4382711946964264},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.4201534390449524},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.41365963220596313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3725718855857849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36314961314201355},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.20068782567977905},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13988283276557922},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2017.8005147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:384f994d-f47f-4cc5-9a1e-bcd48612a336","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:384f994d-f47f-4cc5-9a1e-bcd48612a336","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference item"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f90b3c05-be6b-4392-9752-1a8e955dc85b","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f90b3c05-be6b-4392-9752-1a8e955dc85b","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bar, K & Vicary, J 2017, Data structures for quasistrict higher categories. in Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017). IEEE Computer Society, 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017), Reykjavik, Iceland, 20/06/17. https://doi.org/10.1109/LICS.2017.8005147","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W23303143","https://openalex.org/W129100082","https://openalex.org/W159571509","https://openalex.org/W1484215330","https://openalex.org/W1522688556","https://openalex.org/W1537982644","https://openalex.org/W1538658958","https://openalex.org/W1677393765","https://openalex.org/W1716456307","https://openalex.org/W1755048877","https://openalex.org/W1933268633","https://openalex.org/W1973799895","https://openalex.org/W1980172188","https://openalex.org/W2003970329","https://openalex.org/W2012997603","https://openalex.org/W2022585163","https://openalex.org/W2022608773","https://openalex.org/W2070886143","https://openalex.org/W2077270594","https://openalex.org/W2092347581","https://openalex.org/W2102916790","https://openalex.org/W2118122645","https://openalex.org/W2133073844","https://openalex.org/W2136213479","https://openalex.org/W2137065916","https://openalex.org/W2150941507","https://openalex.org/W2151404275","https://openalex.org/W2170604368","https://openalex.org/W2171840498","https://openalex.org/W2172068359","https://openalex.org/W2281986078","https://openalex.org/W2344528088","https://openalex.org/W2494316805","https://openalex.org/W2527633362","https://openalex.org/W2533890487","https://openalex.org/W2541184038","https://openalex.org/W2949096982","https://openalex.org/W2951241596","https://openalex.org/W2951474320","https://openalex.org/W2963300453","https://openalex.org/W2963361413","https://openalex.org/W2968872845","https://openalex.org/W3037863750","https://openalex.org/W3098673620","https://openalex.org/W3102482356","https://openalex.org/W3105507374","https://openalex.org/W3105845589","https://openalex.org/W3121619817","https://openalex.org/W4205374018","https://openalex.org/W4250557834","https://openalex.org/W4310911578","https://openalex.org/W6605293222","https://openalex.org/W6606450318","https://openalex.org/W6634381161","https://openalex.org/W6636952266","https://openalex.org/W6677259286","https://openalex.org/W6695536089","https://openalex.org/W6785915538"],"related_works":["https://openalex.org/W2290698615","https://openalex.org/W2804012463","https://openalex.org/W73679669","https://openalex.org/W2796594186","https://openalex.org/W2917725221","https://openalex.org/W1551462233","https://openalex.org/W1479761178","https://openalex.org/W2980968212","https://openalex.org/W2038571047","https://openalex.org/W4287867911"],"abstract_inverted_index":{"We":[0],"present":[1],"new":[2],"data":[3],"structures":[4],"for":[5,33],"quasistrict":[6,37,62],"higher":[7],"categories,":[8],"in":[9,36,60],"which":[10],"associativity":[11],"and":[12,28,45],"unit":[13],"laws":[14],"hold":[15],"strictly.":[16],"Our":[17],"approach":[18],"has":[19],"low":[20],"axiomatic":[21],"complexity":[22],"compared":[23],"to":[24,42,49,67],"traditional":[25],"algebraic":[26,53],"approaches,":[27],"gives":[29],"a":[30,51,61,68],"practical":[31],"method":[32],"performing":[34],"calculations":[35],"4-categories.":[38],"It":[39],"is":[40],"amenable":[41],"computer":[43],"implementation,":[44],"we":[46],"exploit":[47],"this":[48],"give":[50],"machine-verified":[52],"proof":[54],"that":[55],"every":[56],"adjunction":[57,70],"of":[58],"1-cells":[59],"4-category":[63],"can":[64],"be":[65],"promoted":[66],"coherent":[69],"satisfying":[71],"the":[72],"butterfly":[73],"equations.":[74]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}