{"id":"https://openalex.org/W4365456680","doi":"https://doi.org/10.1145/3584372.3588671","title":"Node-Differentially Private Estimation of the Number of Connected Components","display_name":"Node-Differentially Private Estimation of the Number of Connected Components","publication_year":2023,"publication_date":"2023-06-02","ids":{"openalex":"https://openalex.org/W4365456680","doi":"https://doi.org/10.1145/3584372.3588671"},"language":"en","primary_location":{"id":"doi:10.1145/3584372.3588671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3584372.3588671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2304.05890","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059418572","display_name":"Iden Kalemaj","orcid":"https://orcid.org/0000-0002-0995-6346"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Iden Kalemaj","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080839778","display_name":"Sofya Raskhodnikova","orcid":"https://orcid.org/0000-0002-4902-050X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sofya Raskhodnikova","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074728200","display_name":"Adam Smith","orcid":"https://orcid.org/0000-0001-9393-1127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adam Smith","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069421706","display_name":"Charalampos E. Tsourakakis","orcid":"https://orcid.org/0000-0001-5591-3585"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charalampos E. Tsourakakis","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059418572"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6959,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74525784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"183","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.6024869680404663},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5536794662475586},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.549130916595459},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5293259024620056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.525448739528656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5150675177574158},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.46794193983078003},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4596012234687805},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.45267605781555176},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.4381873607635498},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3985676169395447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39175039529800415},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3441880941390991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2860831618309021},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.20960018038749695}],"concepts":[{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.6024869680404663},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5536794662475586},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.549130916595459},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5293259024620056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.525448739528656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5150675177574158},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.46794193983078003},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4596012234687805},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.45267605781555176},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.4381873607635498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3985676169395447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39175039529800415},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3441880941390991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2860831618309021},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.20960018038749695},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3584372.3588671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3584372.3588671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2304.05890","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2304.05890","pdf_url":"https://arxiv.org/pdf/2304.05890","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:null:2144/48591","is_oa":true,"landing_page_url":"http://doi.org/10.1145/3584372.3588671","pdf_url":null,"source":{"id":"https://openalex.org/S4306402384","display_name":"OpenBU (Boston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I111088046","host_organization_name":"Boston University","host_organization_lineage":["https://openalex.org/I111088046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference materials"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2304.05890","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2304.05890","pdf_url":"https://arxiv.org/pdf/2304.05890","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G240243492","display_name":null,"funder_award_id":"CNS-2120667 and CCF-1763786","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4365456680.pdf","grobid_xml":"https://content.openalex.org/works/W4365456680.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W18223240","https://openalex.org/W188453470","https://openalex.org/W204323566","https://openalex.org/W1523918473","https://openalex.org/W1557833142","https://openalex.org/W1586209290","https://openalex.org/W1603132403","https://openalex.org/W1818923311","https://openalex.org/W1886450519","https://openalex.org/W1925003247","https://openalex.org/W1957063030","https://openalex.org/W1992461601","https://openalex.org/W1993116423","https://openalex.org/W2009946412","https://openalex.org/W2017509273","https://openalex.org/W2028584480","https://openalex.org/W2054063908","https://openalex.org/W2061784418","https://openalex.org/W2066865129","https://openalex.org/W2080900058","https://openalex.org/W2082227928","https://openalex.org/W2086924628","https://openalex.org/W2088011174","https://openalex.org/W2089554624","https://openalex.org/W2101771965","https://openalex.org/W2125678004","https://openalex.org/W2150611147","https://openalex.org/W2153624566","https://openalex.org/W2163288205","https://openalex.org/W2166037832","https://openalex.org/W2169861334","https://openalex.org/W2403599181","https://openalex.org/W2436309872","https://openalex.org/W2503846958","https://openalex.org/W2515312139","https://openalex.org/W2566032744","https://openalex.org/W2620961206","https://openalex.org/W2626769593","https://openalex.org/W2897278297","https://openalex.org/W2921425899","https://openalex.org/W2952937126","https://openalex.org/W2961344605","https://openalex.org/W2963697313","https://openalex.org/W2963862932","https://openalex.org/W2963970591","https://openalex.org/W3001405476","https://openalex.org/W3019440225","https://openalex.org/W3030115066","https://openalex.org/W3102719874","https://openalex.org/W3108449706","https://openalex.org/W3126642835","https://openalex.org/W3129153384","https://openalex.org/W3136115669","https://openalex.org/W3143219376","https://openalex.org/W3173549438","https://openalex.org/W3207208702","https://openalex.org/W4221159218","https://openalex.org/W4221162549","https://openalex.org/W4226146800","https://openalex.org/W4234281613","https://openalex.org/W4301476203","https://openalex.org/W4313203118","https://openalex.org/W4327652982","https://openalex.org/W6910507049"],"related_works":["https://openalex.org/W2789984241","https://openalex.org/W2376814941","https://openalex.org/W4380840098","https://openalex.org/W2562218965","https://openalex.org/W2943635264","https://openalex.org/W3113248774","https://openalex.org/W1143194816","https://openalex.org/W2138987445","https://openalex.org/W2014932051","https://openalex.org/W4366983102"],"abstract_inverted_index":{"We":[0,121,168],"design":[1],"the":[2,9,49,83,134,141,150,155,163,204,210,214,217,232],"first":[3],"node-differentially":[4],"private":[5,61],"algorithm":[6,31,81],"for":[7,66,77,82,203,216],"approximating":[8],"number":[10,69,84,135,205],"of":[11,54,58,70,85,117,128,133,136,143,149,157,166,189,206,213,222,230,235],"connected":[12,86,119,137,207],"components":[13,87,138,208],"in":[14,33,176],"a":[15,18,26,55,67,115,118,126,144,179,186],"graph.":[16,120],"Given":[17],"database":[19,71],"representing":[20],"an":[21,80],"n-vertex":[22],"graph":[23,91,113,180],"G":[24],"and":[25],"privacy":[27,107],"parameter":[28],"\u03b5,":[29],"our":[30,158,200,236],"runs":[32],"polynomial":[34],"time":[35],"and,":[36],"with":[37,100,181],"probability":[38],"1-o(1),":[39],"has":[40,185],"additive":[41],"error":[42,234],"\u00d5(\u0394^*\u0142n\u0142n":[43],"n\u03b5":[44],"),":[45],"where":[46],"\u0394^*":[47],"is":[48,88,93,108,114,153,160,239],"smallest":[50],"possible":[51,219],"maximum":[52],"degree":[53,190],"spanning":[56,145,174,187],"forest":[57,164,188],"G.":[59,167],"Node-differentially":[60],"algorithms":[62],"are":[63],"known":[64],"only":[65],"small":[68],"analysis":[72],"tasks.":[73],"A":[74],"major":[75],"obstacle":[76],"designing":[78,125],"such":[79],"that":[89,105,178,199],"this":[90,123,195],"statistic":[92],"not":[94],"robust":[95],"to":[96,110],"adding":[97],"one":[98],"node":[99],"arbitrary":[101],"connections":[102],"(a":[103],"change":[104],"node-differential":[106],"designed":[109],"hide):":[111],"every":[112],"neighbor":[116],"overcome":[122],"by":[124],"family":[127],"efficiently":[129],"computable":[130],"Lipschitz":[131,201,237],"extensions":[132,202,238],"or,":[139],"equivalently,":[140],"size":[142],"forest.":[146],"The":[147],"construction":[148],"extensions,":[151],"which":[152],"at":[154,191],"core":[156],"algorithm,":[159],"based":[161],"on":[162,226],"polytope":[165],"prove":[169],"several":[170],"combinatorial":[171],"facts":[172],"about":[173],"forests,":[175],"particular,":[177],"no":[182],"induced":[183],"\u0394-stars":[184],"most":[192],"\u0394.":[193],"With":[194],"fact,":[196],"we":[197],"show":[198],"equal":[209],"true":[211],"value":[212],"function":[215],"largest":[218],"monotone":[220,228],"families":[221],"graphs.":[223],"More":[224],"generally,":[225],"all":[227],"sets":[229],"graphs,":[231],"l\u221e":[233],"nearly":[240],"optimal.":[241]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}