{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:33:40Z","timestamp":1740148420027,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:00:00Z","timestamp":1581638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:00:00Z","timestamp":1581638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present DiscreteZOO, a project which illustrates some of the possibilities for computer-supported management of collections of finite combinatorial (discrete) objects, in particular graphs with a high degree of symmetry. DiscreteZOO encompasses a data repository, a website and a SageMath Package.<\/jats:p>","DOI":"10.1007\/s11786-020-00453-5","type":"journal-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T16:03:44Z","timestamp":1581696224000},"page":"559-575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DiscreteZOO: A Fingerprint Database of Discrete Objects"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6678-8975","authenticated-orcid":false,"given":"Katja","family":"Ber\u010di\u010d","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8061-9169","authenticated-orcid":false,"given":"Jano\u0161","family":"Vidali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"453_CR1","doi-asserted-by":"publisher","unstructured":"Babai, L., Luks, E.M.: Canonical Labeling of Graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing. STOC \u201983. New York, NY, USA: ACM, pp. 171\u2013183 (1983). ISBN: 0-89791-099-0. https:\/\/doi.org\/10.1145\/800061.808746","DOI":"10.1145\/800061.808746"},{"key":"453_CR2","unstructured":"Ber\u010di\u010d, K., Vidali, J.: DiscreteZOO repositories. https:\/\/github.com\/DiscreteZOO"},{"key":"453_CR3","unstructured":"Ber\u010di\u010d, K.: Math Databases. https:\/\/github.com\/MathHubInfo\/Documentation\/wiki\/Math-Databases. Accessed 29 Nov 2018"},{"key":"453_CR4","unstructured":"Berg, C., Stump, C.: FindStat: The Combinatorial Statistic Finder (2014). http:\/\/www.FindStat.org"},{"issue":"8","key":"453_CR5","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1090\/noti1029","volume":"60","author":"SC Billey","year":"2013","unstructured":"Billey, S.C., Tenner, B.E.: Fingerprint databases for theorems. Not. Am. Math. Soc. 60(8), 1034\u20131039 (2013). https:\/\/doi.org\/10.1090\/noti1029. issn: 0002-9920","journal-title":"Not. Am. Math. Soc."},{"key":"453_CR6","doi-asserted-by":"publisher","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. In: J. Symb. Comput. 24.3-4. Computational algebra and number theory (London, 1993), pp. 235\u2013265, (1997). ISSN: 0747-7171. https:\/\/doi.org\/10.1006\/jsco.1996.0125","DOI":"10.1006\/jsco.1996.0125"},{"issue":"1","key":"453_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.dam.2012.07.018","volume":"161","author":"G Brinkmann","year":"2013","unstructured":"Brinkmann, G., et al.: House of graphs: a database of interesting graphs. Discrete Appl. Math. 161(1), 311\u2013314 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.07.018. issn: 0166-218X","journal-title":"Discrete Appl. Math."},{"key":"453_CR8","doi-asserted-by":"crossref","unstructured":"Chacon, S., Straub, B.: Pro Git (2014). https:\/\/git-scm.com\/","DOI":"10.1007\/978-1-4842-0076-6"},{"key":"453_CR9","unstructured":"Conder, M.D.E., et al.: The Extended Foster Census. https:\/\/www.math.auckland.ac.nz\/~conder\/symmcubic2048list.txt"},{"key":"453_CR10","unstructured":"Dehaye, P.-O. et al.: Interoperability in the OpenDreamKit project: the math-in-the-middle approach. In: Kohlhase, M., et al. (eds.) Intelligent Computer Mathematics 2016. LNAI 9791. Springer, (2016). ISBN: 978-3-319-08434-3. https:\/\/github.com\/OpenDreamKit\/OpenDreamKit\/blob\/master\/WP6\/CICM2016\/published.pdf"},{"key":"453_CR11","first-page":"1082","volume-title":"Encyclopedia of Knowledge Management","author":"WM Farmer","year":"2011","unstructured":"Farmer, W.M.: Mathematical knowledge management. In: Schwartz, D., Te\u2019eni, D. (eds.) Encyclopedia of Knowledge Management, 2nd edn, pp. 1082\u20131089. Idea Group Reference, Hershey (2011)","edition":"2"},{"key":"453_CR12","unstructured":"Grout, J.: Small Graph Database. https:\/\/jasongrout.org\/graph_database. Accessed 3 Dec 2018"},{"key":"453_CR13","unstructured":"Junttila, T., Kaski, P.: Bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs. http:\/\/www.tcs.hut.fi\/Software\/bliss\/"},{"key":"453_CR14","volume-title":"Design Systems","author":"A Kholmatova","year":"2017","unstructured":"Kholmatova, A.: Design Systems. Smashing Media AG, Breisgau (2017)"},{"key":"453_CR15","unstructured":"Kohlhase, M.: Math Object Identifiers\u2014Towards Research Data in Mathematics. In: Kohlhase, A., K\u00fcbler, E. (ed.) Wissens- und Erfahrungsmanagement (Knowledge and Experience Management), FGWM. Workshop at LWDA 2017, pp. 214\u2013252 (2017). http:\/\/ceur-ws.org\/Vol-1917\/paper33.pdf"},{"key":"453_CR16","unstructured":"Kohlhase, M.: Mathematical knowledge management: transcending the one-brain-barrier with theory graphs. In: EMS Newsletter, pp. 22\u201327 (2014). https:\/\/kwarc.info\/people\/mkohlhase\/papers\/ems13.pdf"},{"key":"453_CR17","unstructured":"Lozier, D.W.: NIST Digital Library of Mathematical Function. In: Annals of Mathematics and Artificial Intelligence\u2014Special Issue on Mathematical Knowledge Management 38, pp. 105\u2013119 (2003). http:\/\/dlmf.nist.gov\/about\/publications\/MKM-Lozier.pdf"},{"issue":"4","key":"453_CR18","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1002\/jgt.22134","volume":"86","author":"T Marc","year":"2017","unstructured":"Marc, T.: Classification of vertex-transitive cubic partial cubes. J. Graph Theory 86(4), 406\u2013421 (2017). https:\/\/doi.org\/10.1002\/jgt.22134","journal-title":"J. Graph Theory"},{"key":"453_CR19","unstructured":"MathOverflow contributors. What are some early examples of creation of lists \/ catalogues of (particularly) combinatorial objects? MathOverflow. https:\/\/mathoverflow.net\/questions\/47044\/what-are-some-early-examples-of-creation-of-lists-catalogues-of-particularly. Accessed 20 Nov 2018"},{"key":"453_CR20","unstructured":"McKay, B., Royle, G.: Transitive Graphs. http:\/\/staffhome.ecm.uwa.edu.au\/~00013890\/remote\/trans\/index.html"},{"key":"453_CR21","unstructured":"McKay, B.: Description of graph6, sparse6 and digraph6 encodings. http:\/\/users.cecs.anu.edu.au\/~bdm\/data\/formats.txt"},{"key":"453_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003. issn: 0747-7171","journal-title":"J. Symb. Comput."},{"key":"453_CR23","first-page":"xxviii+780","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, p. xxviii+780. CRC Press, Boca Raton (1997)"},{"key":"453_CR24","volume-title":"The Design of Everyday Things. Revised and Expanded","author":"D Norman","year":"2013","unstructured":"Norman, D.: The Design of Everyday Things. Revised and Expanded. Basic Books, New York (2013)"},{"key":"453_CR25","unstructured":"OEIS Foundation Inc., ed. The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org (visited on 05\/28\/2017)"},{"key":"453_CR26","unstructured":"Pisanski, T., et al.: The Encyclopedia of Graphs. http:\/\/atlas.gregas.eu. Accessed 3 Dec 2018"},{"issue":"2","key":"453_CR27","doi-asserted-by":"publisher","first-page":"349","DOI":"10.26493\/1855-3974.1684.b0d","volume":"17","author":"P Poto\u010dnik","year":"2019","unstructured":"Poto\u010dnik, P., Vidali, J.: Girth-regular graphs. ARS Math. Contemp. 17(2), 349\u2013368 (2019). https:\/\/doi.org\/10.26493\/1855-3974.1684.b0d","journal-title":"ARS Math. Contemp."},{"key":"453_CR28","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.jsc.2012.09.002","volume":"50","author":"P Poto\u010dnik","year":"2013","unstructured":"Poto\u010dnik, P., Spiga, P., Verret, G.: Cubic vertex-transitive graphs on up to 1280 vertices. J. Symb. Comput. 50, 465\u2013477 (2013). https:\/\/doi.org\/10.1016\/j.jsc.2012.09.002. issn: 0747-7171","journal-title":"J. Symb. Comput."},{"key":"453_CR29","unstructured":"Read, R.C., Wilson, R.J.: An Atlas of Graphs. p. 464 (2005)"},{"key":"453_CR30","unstructured":"Tenner, B.E.: Database of permutation pattern avoidance. http:\/\/math.depaul.edu\/bridget\/patterns.html"},{"key":"453_CR31","unstructured":"The Kant Project. Querying Algebraic Objects System. http:\/\/page.math.tu-berlin.de\/~kant\/database.html. Accessed 3 Dec 2018"},{"key":"453_CR32","unstructured":"The LMFDB Collaboration. The L-functions and Modular Forms Database. http:\/\/www.lmfdb.org. Accessed 1 Feb 2016"},{"key":"453_CR33","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 8.3) (2018). http:\/\/www.sagemath.org"},{"key":"453_CR34","unstructured":"The SymbolicData Project. SymbolicData Project. https:\/\/symbolicdata.github.io\/. Accessed 3 Dec 2018"},{"key":"453_CR35","unstructured":"UniFormal\/MMT\u2014The MMT Language and System. https:\/\/github.com\/UniFormal\/MMT. Accessed 24 Oct 2017"},{"key":"453_CR36","unstructured":"Wiesing, T., Kohlhase, M., Rabe, F.: Virtual theories\u2014a uniform interface to mathematical knowledge bases. In: Bl\u00f6mer, J., Kutsia, T., Simos, D. (eds.) MACIS 2017: Seventh International Conference on Mathematical Aspects of Computer and Information Sciences. LNCS 10693. Springer, pp. 243\u2013257 (2017). https:\/\/github.com\/OpenDreamKit\/OpenDreamKit\/blob\/master\/WP6\/MACIS17-vt\/crc.pdf"},{"key":"453_CR37","unstructured":"Wikipedia contributors. Fingerprint (disambiguation). Wikipedia, The Free Encyclopedia. http:\/\/en.wikipedia.org\/wiki\/Fingerprint_(disambiguation). Accessed 22 Nov 2018"},{"key":"453_CR38","unstructured":"Wilson, R., et al.: ATLAS of Finite Group Representations\u2014Version 3. http:\/\/brauer.maths.qmul.ac.uk\/Atlas\/v3\/. Accessed 3 Dec 2018"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00453-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-020-00453-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00453-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T23:05:24Z","timestamp":1613257524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-020-00453-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,14]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["453"],"URL":"https:\/\/doi.org\/10.1007\/s11786-020-00453-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"type":"print","value":"1661-8270"},{"type":"electronic","value":"1661-8289"}],"subject":[],"published":{"date-parts":[[2020,2,14]]},"assertion":[{"value":"1 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}