{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:34:46Z","timestamp":1774020886820,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174507","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1230-1235","source":"Crossref","is-referenced-by-count":9,"title":["Achievability of nearly-exact alignment for correlated Gaussian databases"],"prefix":"10.1109","author":[{"given":"Osman Emre","family":"Dai","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cullina","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique Fédérale de Lausanne"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Exact alignment recovery for correlated erdos-renyi graphs","author":"cullina","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref10","first-page":"3225","article-title":"Database alignment with Gaussian features","author":"dai","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref6","first-page":"9186","article-title":"(nearly) efficient algorithms for the graph matching problem on correlated random graphs","author":"barak","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849392"},{"key":"ref5","first-page":"63","article-title":"Improved achievability and converse bounds for erdos-renyi graph matching","author":"cullina","year":"0"},{"key":"ref8","article-title":"Efficient random graph matching via degree profiles","author":"ding","year":"2018"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/3376930.3376992","article-title":"Analysis of a canonical labeling algorithm for the alignment of correlated erdosrényi ? graphs","volume":"47","author":"dai","year":"2019","journal-title":"ACM Sigmetrics Performance Evaluation Review"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437908"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2010.0063"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174507.pdf?arnumber=9174507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:11Z","timestamp":1773347711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174507\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174507","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}