{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:39Z","timestamp":1740099639070,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030474355"},{"type":"electronic","value":"9783030474362"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47436-2_12","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T07:02:47Z","timestamp":1588921367000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Assessing Centrality Without Knowing Connections"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0589-5814","authenticated-orcid":false,"given":"Leyla","family":"Roohi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2947-6980","authenticated-orcid":false,"given":"Benjamin I. P.","family":"Rubinstein","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2648-2565","authenticated-orcid":false,"given":"Vanessa","family":"Teague","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: SIGKDD 2010, pp. 503\u2013512 (2010). \nhttps:\/\/doi.org\/10.1145\/1835804.1835869","DOI":"10.1145\/1835804.1835869"},{"key":"12_CR2","unstructured":"Chen, R., Reznichenko, A., Francis, P., Gehrke, J.: Towards statistical queries over distributed private user data. In: NSDI, pp. 13\u201313 (2012)"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Day, W.Y., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. In: SIGMOD 2016, pp. 123\u2013138 (2016). \nhttps:\/\/doi.org\/10.1145\/2882903.2926745","DOI":"10.1145\/2882903.2926745"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11761679_29"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11681878_14"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","volume":"27","author":"M Everett","year":"2005","unstructured":"Everett, M., Borgatti, S.P.: Ego network betweenness. SN 27(1), 31\u201338 (2005). \nhttps:\/\/doi.org\/10.1016\/j.socnet.2004.11.007","journal-title":"SN"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"017101","DOI":"10.1103\/physreve.67.017101","volume":"67","author":"KI Goh","year":"2003","unstructured":"Goh, K.I., Oh, E., Kahng, B., Kim, D.: Betweenness centrality correlation in social networks. Phys. Rev. E 67(1), 017101 (2003). \nhttps:\/\/doi.org\/10.1103\/physreve.67.017101","journal-title":"Phys. Rev. E"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Hay, M., Li, C., Miklau, G., Jensen, D.: Accurate estimation of the degree distribution of private networks. In: ICDM, pp. 169\u2013178 (2009). \nhttps:\/\/doi.org\/10.1109\/icdm.2009.11","DOI":"10.1109\/icdm.2009.11"},{"issue":"11","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1145\/2611523","volume":"4","author":"V Karwa","year":"2011","unstructured":"Karwa, V., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. PVLDB 4(11), 1146\u20131157 (2011). \nhttps:\/\/doi.org\/10.1145\/2611523","journal-title":"PVLDB"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-36594-2_26","volume-title":"Theory of Cryptography","author":"SP Kasiviswanathan","year":"2013","unstructured":"Kasiviswanathan, S.P., Nissim, K., Raskhodnikova, S., Smith, A.: Analyzing graphs with node differential privacy. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 457\u2013476. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36594-2_26"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Kwon, S., Cha, M., Jung, K., Chen, W., Wang, Y.: Prominent features of rumor propagation in online social media. In: 2013 IEEE 13th ICDM, pp. 1103\u20131108. IEEE (2013). \nhttps:\/\/doi.org\/10.1109\/icdm.2013.61","DOI":"10.1109\/icdm.2013.61"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/s0378-8733(02)00016_3","volume":"24","author":"PV Marsden","year":"2002","unstructured":"Marsden, P.V.: Egocentric and sociocentric measures of network centrality. Soc. Netw. 24(4), 407\u2013422 (2002). \nhttps:\/\/doi.org\/10.1016\/s0378-8733(02)00016_3","journal-title":"Soc. Netw."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS 2007, pp. 94\u2013103. IEEE (2007). \nhttps:\/\/doi.org\/10.1109\/focs.2007.66","DOI":"10.1109\/focs.2007.66"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/tdsc.2013.22","volume":"11","author":"N Mohammed","year":"2013","unstructured":"Mohammed, N., Alhadidi, D., Fung, B.C., Debbabi, M.: Secure two-party differentially private data release for vertically partitioned data. IEEE Trans. Dependable Secure Comput. 11(1), 59\u201371 (2013). \nhttps:\/\/doi.org\/10.1109\/tdsc.2013.22","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"12_CR15","unstructured":"Monti, F., Frasca, F., Eynard, D., Mannion, D., Bronstein, M.M.: Fake news detection on social media using geometric deep learning. arXiv preprint \narXiv:1902.06673\n\n (2019)"},{"key":"12_CR16","unstructured":"M\u00fclle, Y., Clifton, C., B\u00f6hm, K.: Privacy-integrated graph clustering through differential privacy. In: EDBT\/ICDT Workshops, pp. 247\u2013254 (2015)"},{"key":"12_CR17","unstructured":"Raskhodnikova, S., Smith, A.: Efficient Lipschitz extensions for high-dimensional graph statistics and node private degree distributions. arXiv preprint \narXiv:1504.07912\n\n (2015)"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Roohi, L., Rubinstein, B.I.P., Teague, V.: Differentially-private two-party egocentric betweenness centrality. In: The 38th Annual IEEE International Conference on Computer Communications. INFOCOM (2019). \nhttps:\/\/doi.org\/10.1109\/infocom.2019.8737405","DOI":"10.1109\/infocom.2019.8737405"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Shen, E., Yu, T.: Mining frequent graph patterns with differential privacy. In: KDD 2013, pp. 545\u2013553 (2013). \nhttps:\/\/doi.org\/10.1145\/2487575.2487601","DOI":"10.1145\/2487575.2487601"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Zhang, J., Cormode, G., Procopiuc, C.M., Srivastava, D., Xiao, X.: Private release of graph statistics using ladder functions. In: SIGMOD 2015, pp. 731\u2013745 (2015). \nhttps:\/\/doi.org\/10.1145\/2723372.2737785","DOI":"10.1145\/2723372.2737785"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47436-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T08:04:22Z","timestamp":1588925062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47436-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474355","9783030474362"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47436-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"135","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}