{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:42Z","timestamp":1750306542343,"version":"3.41.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":21,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Millenium Nucleus Center for Semantic Web Research","award":["NC120004"],"award-info":[{"award-number":["NC120004"]}]},{"name":"Fondecyt","award":["11140900"],"award-info":[{"award-number":["11140900"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741653","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"430-440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Skolemising Blank Nodes while Preserving Isomorphism"],"prefix":"10.1145","author":[{"given":"Aidan","family":"Hogan","sequence":"first","affiliation":[{"name":"University of Chile, Santiago, Chile"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"e_1_3_2_1_2_1","volume-title":"Well Behaved RDF: A Straw-Man Proposal for Taming Blank Nodes","author":"Booth D.","year":"2012","unstructured":"D. Booth . Well Behaved RDF: A Straw-Man Proposal for Taming Blank Nodes , 2012 . http:\/\/dbooth.org\/2013\/well-behaved-rdf\/Booth-well-behaved-rdf.pdf. D. Booth. Well Behaved RDF: A Straw-Man Proposal for Taming Blank Nodes, 2012. http:\/\/dbooth.org\/2013\/well-behaved-rdf\/Booth-well-behaved-rdf.pdf."},{"issue":"1","key":"e_1_3_2_1_3_1","first-page":"W3C","volume":"1","author":"Carothers G.","year":"2014","unstructured":"G. Carothers . RDF 1 . 1 N-Quads. W3C Recommendation, 2014 . http:\/\/www.w3.org\/TR\/n-quads\/. G. Carothers. RDF 1.1 N-Quads. W3C Recommendation, 2014. http:\/\/www.w3.org\/TR\/n-quads\/.","journal-title":"RDF"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_24"},{"key":"e_1_3_2_1_5_1","volume-title":"Feb.","author":"Cyganiak R.","year":"2014","unstructured":"R. Cyganiak , D. Wood , and M. Lanthaler . RDF 1.1 Concepts & Abstract Syntax. W3C Recommendation , Feb. 2014 . http:\/\/www.w3.org\/TR\/rdf11-concepts\/. R. Cyganiak, D. Wood, and M. Lanthaler. RDF 1.1 Concepts & Abstract Syntax. W3C Recommendation, Feb. 2014. http:\/\/www.w3.org\/TR\/rdf11-concepts\/."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.009"},{"key":"e_1_3_2_1_7_1","unstructured":"P. Hayes. RDF Semantics. W3C Recommendation 2004. http:\/\/www.w3.org\/TR\/2004\/REC-rdf-mt-20040210\/.  P. Hayes. RDF Semantics. W3C Recommendation 2004. http:\/\/www.w3.org\/TR\/2004\/REC-rdf-mt-20040210\/."},{"issue":"1","key":"e_1_3_2_1_8_1","first-page":"W3C","volume":"1","author":"Hayes P.","year":"2014","unstructured":"P. Hayes and P. F. Patel-Schneider . RDF 1 . 1 Semantics. W3C Recommendation, 2014 . http:\/\/www.w3.org\/TR\/2014\/REC-rdf11-mt-20140225\/. P. Hayes and P. F. Patel-Schneider. RDF 1.1 Semantics. W3C Recommendation, 2014. http:\/\/www.w3.org\/TR\/2014\/REC-rdf11-mt-20140225\/.","journal-title":"RDF"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1995335"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2014.06.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.02.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.13"},{"key":"e_1_3_2_1_13_1","unstructured":"T. Kafer and A. Harth. Billion Triples Challenge data set. http:\/\/km.aifb.kit.edu\/projects\/btc-2014\/ 2014.  T. Kafer and A. Harth. Billion Triples Challenge data set. http:\/\/km.aifb.kit.edu\/projects\/btc-2014\/ 2014."},{"key":"e_1_3_2_1_14_1","first-page":"w3","article-title":"Resource Description Framework (RDF) Model and Syntax Specification","author":"Lassila O.","year":"1999","unstructured":"O. Lassila and R. R. Swick . Resource Description Framework (RDF) Model and Syntax Specification . W3C Recommendation , 1999 . http:\/\/www. w3 .org\/TR\/1999\/REC-rdf-syntax-19990222\/. O. Lassila and R. R. Swick. Resource Description Framework (RDF) Model and Syntax Specification. W3C Recommendation, 1999. http:\/\/www.w3.org\/TR\/1999\/REC-rdf-syntax-19990222\/.","journal-title":"W3C Recommendation"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2063016.2063044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1067737"},{"key":"e_1_3_2_1_17_1","first-page":"45","volume-title":"Practical Graph Isomorphism. In Congressum Numerantium","volume":"30","author":"McKay B.","year":"1980","unstructured":"B. McKay . Practical Graph Isomorphism. In Congressum Numerantium , volume 30 , pages 45 -- 87 , 1980 . B. McKay. Practical Graph Isomorphism. In Congressum Numerantium, volume 30, pages 45--87, 1980."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_2_1_19_1","first-page":"239","volume-title":"II","author":"Miyazaki T.","year":"1997","unstructured":"T. Miyazaki . The Complexity of McKay's Canonical Labeling Algorithm. In Groups and Computation , II , pages 239 -- 256 , 1997 . T. Miyazaki. The Complexity of McKay's Canonical Labeling Algorithm. In Groups and Computation, II, pages 239--256, 1997."},{"key":"e_1_3_2_1_20_1","volume-title":"Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version). CoRR, abs\/0804.4881","author":"Piperno A.","year":"2008","unstructured":"A. Piperno . Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version). CoRR, abs\/0804.4881 , 2008 . A. Piperno. Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version). CoRR, abs\/0804.4881, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35176-1_37"}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Florence Italy","acronym":"WWW '15"},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:29Z","timestamp":1750227149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":21,"alternative-id":["10.1145\/2736277.2741653","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741653","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}