{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:34:55Z","timestamp":1730295295072,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"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":[[2021,9,24]]},"DOI":"10.1109\/seeda-cecnsm53056.2021.9566230","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:30:59Z","timestamp":1634689859000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Re-Identification risk in anonymized data sets with parent-child information"],"prefix":"10.1109","author":[{"given":"Revekka","family":"Kalli","sequence":"first","affiliation":[]},{"given":"Miltiades E.","family":"Anagnostou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3453943"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/3372123","article-title":"The graph isomorphism problem","volume":"63","author":"m","year":"2020","journal-title":"Communications of the ACM"},{"journal-title":"Data Anonymization Techniques on Genealogical Graphs","year":"2019","author":"kalli","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2005.1532124"},{"journal-title":"Graph Isomorphism for Colored Graphs with Color Multiplicity Bounded by 3","year":"2005","author":"lal","key":"ref11"},{"key":"ref5","first-page":"330","article-title":"Multitrees: enriching and reusing hierarchical structure","volume":"94","author":"furnas","year":"1994","journal-title":"CHI"},{"journal-title":"The Design and Analysis of Computer Algorithms","first-page":"84","year":"1974","author":"aho","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43968-5_17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam9309"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/0025570X.1991.11977616"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633620"}],"event":{"name":"2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","start":{"date-parts":[[2021,9,24]]},"location":"Preveza, Greece","end":{"date-parts":[[2021,9,26]]}},"container-title":["2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9565881\/9565882\/09566230.pdf?arnumber=9566230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:47:30Z","timestamp":1652197650000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9566230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"references-count":11,"URL":"http:\/\/dx.doi.org\/10.1109\/seeda-cecnsm53056.2021.9566230","relation":{},"subject":[],"published":{"date-parts":[[2021,9,24]]}}}
