{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T17:52:59Z","timestamp":1761587579628,"version":"build-2065373602"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:00:00Z","timestamp":1698019200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:00:00Z","timestamp":1698019200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004152","name":"IPM","doi-asserted-by":"publisher","award":["1402050113"],"award-info":[{"award-number":["1402050113"]}],"id":[{"id":"10.13039\/501100004152","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,23]]},"DOI":"10.1109\/isncc58260.2023.10323834","type":"proceedings-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T14:36:01Z","timestamp":1701095761000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs"],"prefix":"10.1109","author":[{"given":"Javad B.","family":"Ebrahimi","sequence":"first","affiliation":[{"name":"Sharif University of Technology,Department of Mathematical Sciences,Tehran,Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza Tofighi","family":"Mohammadi","sequence":"additional","affiliation":[{"name":"Sharif University of Technology,Department of Mathematical Sciences,Tehran,Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh","family":"Kermani","sequence":"additional","affiliation":[{"name":"Sharif University of Technology,Department of Mathematical Sciences,Tehran,Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Differentially private all-pairs shortest distances for low tree-width graphs","author":"Ebrahimi","year":"2023","journal-title":"arXiv preprint"},{"key":"ref2","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1998","journal-title":"Acta Cybernetica"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch184"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834836"},{"key":"ref8","article-title":"Breaking the linear error barrier in differentially private graph distance release","author":"Fan","year":"2022","journal-title":"arXiv preprint"},{"volume-title":"Treewidth and graph minors","year":"2012","author":"Feige","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902291"}],"event":{"name":"2023 International Symposium on Networks, Computers and Communications (ISNCC)","start":{"date-parts":[[2023,10,23]]},"location":"Doha, Qatar","end":{"date-parts":[[2023,10,26]]}},"container-title":["2023 International Symposium on Networks, Computers and Communications (ISNCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10323591\/10323546\/10323834.pdf?arnumber=10323834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T17:50:24Z","timestamp":1761587424000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10323834\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,23]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isncc58260.2023.10323834","relation":{},"subject":[],"published":{"date-parts":[[2023,10,23]]}}}