{"id":"https://openalex.org/W4411141435","doi":"https://doi.org/10.1145/3725240","title":"Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation","display_name":"Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation","publication_year":2025,"publication_date":"2025-06-09","ids":{"openalex":"https://openalex.org/W4411141435","doi":"https://doi.org/10.1145/3725240"},"language":"en","primary_location":{"id":"doi:10.1145/3725240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725240","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3725240","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["BARC, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1516-9306","affiliations":[{"raw_affiliation_string":"BARC, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107124405","display_name":"Lukas Retschmeier","orcid":"https://orcid.org/0000-0003-2805-9939"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lukas Retschmeier","raw_affiliation_strings":["BARC, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2805-9939","affiliations":[{"raw_affiliation_string":"BARC, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100448261","display_name":"Hao Wu","orcid":"https://orcid.org/0000-0003-2853-5034"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hao Wu","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2853-5034","affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021028998","display_name":"H. H. Zhang","orcid":"https://orcid.org/0000-0002-3149-7799"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Hanwen Zhang","raw_affiliation_strings":["BARC, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-3149-7799","affiliations":[{"raw_affiliation_string":"BARC, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5014293815"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":2.1733,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.88809148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"3","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9998999834060669,"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":0.9998999834060669,"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.9993000030517578,"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.9988999962806702,"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/spanning-tree","display_name":"Spanning tree","score":0.7882764339447021},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6886124014854431},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.531173050403595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47859808802604675},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.47525307536125183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46344876289367676},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.17936483025550842}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7882764339447021},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6886124014854431},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.531173050403595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47859808802604675},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.47525307536125183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46344876289367676},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17936483025550842},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3725240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725240","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/91666600-d9eb-48bf-8269-7921764df738","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/91666600-d9eb-48bf-8269-7921764df738","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pagh , R , Retschmeier , L , Wu , H & Zhang , H 2025 , ' Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation ' , Proceedings of the ACM on Management of Data , vol. 3 , no. 2 , 103 , pp. 1-26 . https://doi.org/10.1145/3725240","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3725240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725240","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1664309637","https://openalex.org/W1873763122","https://openalex.org/W1965680834","https://openalex.org/W1965996575","https://openalex.org/W1986022261","https://openalex.org/W2026653933","https://openalex.org/W2032841680","https://openalex.org/W2084224084","https://openalex.org/W2123820077","https://openalex.org/W2138304862","https://openalex.org/W2150611147","https://openalex.org/W2163166770","https://openalex.org/W2169861334","https://openalex.org/W2274213011","https://openalex.org/W2560674852","https://openalex.org/W2990138404","https://openalex.org/W3190683899","https://openalex.org/W4205228770","https://openalex.org/W4312512934","https://openalex.org/W4317535868","https://openalex.org/W4390575676","https://openalex.org/W4405433986"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W4308416203","https://openalex.org/W2149927264","https://openalex.org/W2803918337","https://openalex.org/W4295683043","https://openalex.org/W2015718828","https://openalex.org/W2053060257","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2350799039"],"abstract_inverted_index":{"We":[0,144,254],"study":[1],"the":[2,77,152,163,171,175,207,221,238,248,263],"problem":[3],"of":[4,30,37,154,162,177,241,265],"privately":[5],"releasing":[6],"an":[7,47,55],"approximate":[8,56,216],"minimum":[9],"spanning":[10],"tree":[11],"(MST).":[12],"Given":[13],"a":[14,28,35,92,136,158,187,194],"graph":[15],"G":[16,99],"=":[17,100,110],"(":[18,101,111],"V":[19,26,70,102,112],",":[20,22,97,103,105,113,115],"E":[21,33,72,104,114],"W":[23,42,106,116,122,124],")":[24,107],"where":[25,69],"is":[27,34,46,52,80,85,148,227],"set":[29,36],"n":[31],"vertices,":[32],"m":[38],"undirected":[39],"edges,":[40],"and":[41,71,76,108,185,201,246],"\u2208":[43],"\u211d":[44],"|E|":[45],"edge-weight":[48,59],"vector,":[49],"our":[50,235,256,266],"goal":[51],"to":[53,150,169,196,230],"publish":[54],"MST":[57,133,180,214,244],"under":[58,215],"differential":[60,217],"privacy,":[61,218],"as":[62],"introduced":[63],"by":[64,192],"Sealfon":[65],"in":[66],"PODS":[67],"2016,":[68],"are":[73,118],"considered":[74],"public":[75],"weight":[78,172],"vector":[79,173],"private.":[81],"Our":[82],"neighboring":[83,119],"relation":[84],"\ud835\udcc1":[86],"\u221e":[87,96,126,129],"-distance":[88],"on":[89],"weights:":[90],"for":[91,213],"sensitivity":[93],"parameter":[94],"\u0394":[95,128],"graphs":[98],"G'":[109],"')":[117],"if":[120],"||":[121],"-":[123],"'||":[125],"\u2264":[127],").":[130],"Existing":[131],"private":[132,184],"algorithms":[134],"face":[135],"trade-off,":[137],"sacrificing":[138],"either":[139],"computational":[140],"efficiency":[141],"or":[142],"accuracy.":[143],"show":[145],"that":[146,165,220,261],"it":[147],"possible":[149],"get":[151],"best":[153],"both":[155],"worlds:":[156],"With":[157],"suitable":[159],"random":[160],"perturbation":[161],"input":[164],"does":[166],"not":[167],"suffice":[168],"make":[170],"private,":[174],"result":[176],"any":[178,242],"non-private":[179,243],"algorithm":[181,245],"will":[182],"be":[183],"achieves":[186,251],"state-of-the-art":[188],"error":[189,222],"guarantee.":[190],"Furthermore,":[191],"establishing":[193],"connection":[195],"Private":[197],"Top-k":[198],"Selection":[199],"[Steinke":[200],"Ullman,":[202],"FOCS":[203],"'17],":[204],"we":[205],"give":[206],"first":[208],"privacy-utility":[209],"trade-off":[210],"lower":[211],"bound":[212],"demonstrating":[219],"magnitude,":[223],"~O(n":[224],"3/2":[225],"),":[226],"optimal":[228,252],"up":[229],"logarithmic":[231],"factors.":[232],"That":[233],"is,":[234],"approach":[236],"matches":[237],"time":[239,250],"complexity":[240],"at":[247],"same":[249],"error.":[253],"complement":[255],"theoretical":[257],"treatment":[258],"with":[259],"experiments":[260],"confirm":[262],"practicality":[264],"approach.":[267]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}