{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:31:57Z","timestamp":1772299917624,"version":"3.50.1"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T00:00:00Z","timestamp":1466726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2016,6,24]]},"abstract":"<jats:p>A theoretical breakthrough in graph isomorphism excites complexity experts, but will it lead to any practical improvements?<\/jats:p>","DOI":"10.1145\/2933412","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T13:41:38Z","timestamp":1467034898000},"page":"12-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph matching in theory and practice"],"prefix":"10.1145","volume":"59","author":[{"given":"Neil","family":"Savage","sequence":"first","affiliation":[{"name":"Lowell, MA"}]}],"member":"320","published-online":{"date-parts":[[2016,6,24]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Graph Isomorphism in Quasipolynomial Time, arXiv","author":"Babai L.","year":"2015"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562186"},{"key":"e_1_2_1_4_1","volume-title":"Complexity classes of equivalence problems revisited, Information and Computation, 209","author":"Fortnow L.","year":"2011"},{"key":"e_1_2_1_5_1","unstructured":"Isomorphic Graphs Example 1 Stats-Lab Dublin https:\/\/www.youtube.com\/watch?v=Xq8o-z1DsUA.  Isomorphic Graphs Example 1 Stats-Lab Dublin https:\/\/www.youtube.com\/watch?v=Xq8o-z1DsUA."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933412","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:03Z","timestamp":1750222563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,24]]},"references-count":5,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,6,24]]}},"alternative-id":["10.1145\/2933412"],"URL":"https:\/\/doi.org\/10.1145\/2933412","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,24]]},"assertion":[{"value":"2016-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}