{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:50:54Z","timestamp":1784299854037,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T00:00:00Z","timestamp":1591574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1944993"],"award-info":[{"award-number":["CCF-1944993"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,8]]},"DOI":"10.1145\/3393691.3394211","type":"proceedings-article","created":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T22:04:07Z","timestamp":1591653847000},"page":"99-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Partial Recovery of Erd\u0151s-R\u00e9nyi Graph Alignment via k-Core Alignment"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Cullina","sequence":"first","affiliation":[{"name":"Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prateek","family":"Mittal","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1235","volume-title":"ACM","author":"Pedarsani P.","year":"2011","unstructured":"P. Pedarsani and M. Grossglauser , \" On the privacy of anonymized networks,\" in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM , 2011 , pp. 1235 -- 1243 . P. Pedarsani and M. Grossglauser, \"On the privacy of anonymized networks,\" in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2011, pp. 1235--1243."},{"key":"e_1_3_2_1_2_1","volume-title":"Nov.","author":"Cullina D.","year":"2017","unstructured":"BIBentryALTinterwordspacing D. Cullina and N. Kiyavash , \" Exact alignment recovery for correlated Erdos R\u00e9nyi graphs,\" arXiv:1711.06783 [cs, math] , Nov. 2017 , arXiv: 1711.06783. [Online]. Available: http:\/\/arxiv.org\/abs\/1711.06783. BIBentryALTinterwordspacingD. Cullina and N. Kiyavash, \"Exact alignment recovery for correlated Erdos R\u00e9nyi graphs,\" arXiv:1711.06783 [cs, math], Nov. 2017, arXiv: 1711.06783. [Online]. Available: http:\/\/arxiv.org\/abs\/1711.06783."},{"key":"e_1_3_2_1_3_1","first-page":"63","volume-title":"ACM","author":"Cullina D.","year":"2016","unstructured":"BIBentryALTinterwordspacing D. Cullina and N. Kiyavash achievability and converse bounds for Erdos-R\u00e9nyi graph matching,\" in Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science . ACM , 2016 , pp. 63 -- 72 . ----, \"Improved achievability and converse bounds for Erdos-R\u00e9nyi graph matching,\" in Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. ACM, 2016, pp. 63--72."},{"key":"e_1_3_2_1_4_1","volume-title":"The evolution of sparse graphs","author":"Bollob\u00e1s B.","year":"1983","unstructured":"B. Bollob\u00e1s , The evolution of sparse graphs , Graph Theory and Combinatorics (Cambridge 1983 ), 35--57. Academic Press , London, 1984. B. Bollob\u00e1s, The evolution of sparse graphs, Graph Theory and Combinatorics (Cambridge 1983), 35--57. Academic Press, London, 1984."}],"event":{"name":"SIGMETRICS '20: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Boston MA USA","acronym":"SIGMETRICS '20","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2020 SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3393691.3394211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3393691.3394211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:39:02Z","timestamp":1750199942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3393691.3394211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,8]]},"references-count":4,"alternative-id":["10.1145\/3393691.3394211","10.1145\/3393691"],"URL":"https:\/\/doi.org\/10.1145\/3393691.3394211","relation":{},"subject":[],"published":{"date-parts":[[2020,6,8]]},"assertion":[{"value":"2020-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}