{"id":"https://openalex.org/W7140107619","doi":"https://doi.org/10.48550/arxiv.2603.19671","title":"Acyclic Graph Pattern Counting under Local Differential Privacy","display_name":"Acyclic Graph Pattern Counting under Local Differential Privacy","publication_year":2026,"publication_date":"2026-03-20","ids":{"openalex":"https://openalex.org/W7140107619","doi":"https://doi.org/10.48550/arxiv.2603.19671"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.19671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.19671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101653411","display_name":"Yihua Hu","orcid":"https://orcid.org/0000-0002-1777-0242"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Yihua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111081551","display_name":"Kuncan Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Kuncan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130347447","display_name":"Wei Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong, Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.786899983882904,"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.786899983882904,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.07609999924898148,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.027699999511241913,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7949000000953674},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.6926000118255615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5774000287055969},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45010000467300415},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43560001254081726},{"id":"https://openalex.org/keywords/power-graph-analysis","display_name":"Power graph analysis","score":0.3986999988555908},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.3359000086784363},{"id":"https://openalex.org/keywords/moral-graph","display_name":"Moral graph","score":0.33169999718666077}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7949000000953674},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.6926000118255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000000238418579},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5774000287055969},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5519000291824341},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.3986999988555908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34360000491142273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3411000072956085},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.3359000086784363},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.33169999718666077},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.31949999928474426},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2784999907016754},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.19671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.19671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.607365071773529,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph":[0],"pattern":[1,97,150,163],"counting":[2,56,83,120],"serves":[3],"as":[4,48],"a":[5,136,145],"cornerstone":[6],"of":[7,64,172,179,187,200],"network":[8],"analysis":[9],"with":[10,16,164],"extensive":[11],"real-world":[12,194],"applications.":[13],"Its":[14],"integration":[15],"local":[17],"differential":[18],"privacy":[19],"(LDP)":[20],"has":[21,67],"gained":[22],"growing":[23],"attention":[24],"for":[25,44,55,61,82,159],"protecting":[26],"sensitive":[27],"graph":[28,58,162,190,195],"information":[29],"in":[30,148,212,217],"decentralized":[31],"settings.":[32],"However,":[33],"existing":[34],"LDP":[35],"frameworks":[36],"are":[37],"largely":[38],"ad":[39],"hoc,":[40],"offering":[41],"solutions":[42],"only":[43],"specific":[45],"patterns":[46,86,125,202],"such":[47],"triangles":[49],"and":[50,91,102,181,214],"stars.":[51],"A":[52],"general":[53,80],"mechanism":[54,154],"arbitrary":[57,84],"patterns,":[59,66],"even":[60],"the":[62,78,107,111,131,149,177,184,188,222],"subclass":[63],"acyclic":[65,85,161,201],"remained":[68],"an":[69,116,169],"open":[70],"problem.":[71],"To":[72,109],"fill":[73],"this":[74],"gap,":[75],"we":[76,114,134,167],"present":[77],"first":[79,112],"solution":[81],"under":[87],"LDP.":[88],"We":[89],"identify":[90],"tackle":[92],"two":[93],"fundamental":[94],"challenges:":[95],"generalizing":[96],"construction":[98],"from":[99],"distributed":[100],"data":[101],"eliminating":[103],"node":[104,143],"duplication":[105],"during":[106,151],"construction.":[108],"address":[110],"challenge,":[113,133],"propose":[115],"LDP-tailored":[117],"recursive":[118],"subpattern":[119],"framework":[121],"that":[122,140,204],"incrementally":[123],"builds":[124],"across":[126,197],"multiple":[127,198],"communication":[128,218],"rounds.":[129],"For":[130],"second":[132],"apply":[135],"random":[137],"marking":[138],"technique":[139],"restricts":[141],"each":[142],"to":[144,209,221],"unique":[146],"position":[147],"computation.":[152],"Our":[153],"achieves":[155],"strong":[156],"utility":[157,213],"guarantees:":[158],"any":[160],"$k$":[165],"edges,":[166],"achieve":[168,207],"additive":[170],"error":[171],"$\\tilde{O}(\\sqrt{N}d(G)^k)$,":[173],"where":[174],"$N$":[175],"is":[176,183],"number":[178],"nodes":[180],"$d(G)$":[182],"maximum":[185],"degree":[186],"input":[189],"$G$.":[191],"Experiments":[192],"on":[193],"datasets":[196],"types":[199],"demonstrate":[203],"our":[205],"mechanisms":[206],"up":[208],"$46$-$2600\\times$":[210],"improvement":[211],"$300$-$650\\times$":[215],"reduction":[216],"cost":[219],"compared":[220],"baseline":[223],"methods.":[224]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-24T00:00:00"}