{"id":"https://openalex.org/W2026706978","doi":"https://doi.org/10.1137/110857714","title":"Privately Releasing Conjunctions and the Statistical Query Barrier","display_name":"Privately Releasing Conjunctions and the Statistical Query Barrier","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2026706978","doi":"https://doi.org/10.1137/110857714","mag":"2026706978"},"language":"en","primary_location":{"id":"doi:10.1137/110857714","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110857714","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039915143","display_name":"Moritz Hardt","orcid":"https://orcid.org/0009-0000-7694-3038"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moritz Hardt","raw_affiliation_strings":["Center for Computational Intractability, Department of Computer Science, Princeton University"],"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Department of Computer Science, Princeton University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057693522","display_name":"Aaron Roth","orcid":"https://orcid.org/0000-0002-0586-0515"},"institutions":[{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Roth","raw_affiliation_strings":["Microsoft Research New England, Cambridge MA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge MA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034669615","display_name":"Jonathan Ullman","orcid":"https://orcid.org/0000-0002-0323-5564"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Ullman","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University, Cambridge MA"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University, Cambridge MA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":7.4137,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.96867686,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"42","issue":"4","first_page":"1494","last_page":"1520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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.9991000294685364,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7629178762435913},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.597245454788208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5669832229614258},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.507972776889801},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5051379799842834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5009050369262695},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.48175692558288574},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4178673326969147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35035040974617004},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33076542615890503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32116591930389404},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22394472360610962}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7629178762435913},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.597245454788208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5669832229614258},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.507972776889801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5051379799842834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5009050369262695},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.48175692558288574},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4178673326969147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35035040974617004},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33076542615890503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32116591930389404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22394472360610962},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110857714","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110857714","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4117300866","display_name":null,"funder_award_id":"832797","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4289525447","display_name":null,"funder_award_id":"CCF-0832797","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6835921093","display_name":"AF: Small: Future Directions in Approximation Algorithms Research","funder_award_id":"1016799","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7309005499","display_name":"ITR  Collaborative Research:    ASE-DMC Computational Complexity of Interactive Computation","funder_award_id":"0426582","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8357414737","display_name":"CT-ISG:  The Assumptions for Cryptography","funder_award_id":"0831289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1755884204","https://openalex.org/W1967051853","https://openalex.org/W1995897489","https://openalex.org/W2092654494","https://openalex.org/W2093825590","https://openalex.org/W2150865801","https://openalex.org/W2163032969","https://openalex.org/W2245160765","https://openalex.org/W2278268662","https://openalex.org/W2546502841","https://openalex.org/W2952022770"],"related_works":["https://openalex.org/W1990534671","https://openalex.org/W4220861526","https://openalex.org/W2560490008","https://openalex.org/W2080957551","https://openalex.org/W2150109348","https://openalex.org/W2026706978","https://openalex.org/W2960823870","https://openalex.org/W2778334647","https://openalex.org/W4288281849","https://openalex.org/W2964269122"],"abstract_inverted_index":{"Suppose":[0],"we":[1,24,49,54],"would":[2],"like":[3],"to":[4,8,20,39,77,80,98,129,182,191],"know":[5],"all":[6,42,192],"answers":[7,128,190],"a":[9,16,95,105,121,135,160,204,230,277],"set":[10,18],"of":[11,67,85,124,164,171,269,283],"statistical":[12,33,68,89,236,253],"queries":[13,43,69,254],"$C$":[14,86,130],"on":[15,120,203,215,223],"data":[17,28,173,210],"up":[19],"small":[21,122],"error,":[22],"but":[23,166,242],"can":[25,55,113,131,248],"access":[26],"the":[27,65,81,99,111,127,169,216,267,273,281],"itself":[29],"only":[30,158,235,239,252],"by":[31,134,259],"using":[32,234,251],"queries.":[34,237],"A":[35],"trivial":[36],"solution":[37],"is":[38,103],"exhaustively":[40],"ask":[41],"in":[44,87,208,272,280],"$C$.":[45],"In":[46,175],"this":[47,59,74,176],"paper,":[48],"investigate":[50],"how":[51],"and":[52,71,148,151,255],"when":[53,101],"do":[56],"better":[57],"than":[58],"na\u00efve":[60],"approach.":[61],"We":[62,107],"show":[63,109],"that":[64,110,185,228],"number":[66],"necessary":[70],"sufficient":[72],"for":[73],"task":[75],"is---up":[76],"polynomial":[78],"factors---equal":[79],"agnostic":[82,270],"learning":[83,161,271],"complexity":[84,268],"Kearns'":[88],"query":[90],"(SQ)":[91],"model.":[92],"This":[93,138,199],"gives":[94,219],"complete":[96],"answer":[97],"question":[100],"run-time":[102],"not":[104,157],"concern.":[106],"then":[108],"problem":[112,207],"be":[114,132,249],"solved":[115],"efficiently":[116,186],"(allowing":[117],"arbitrary":[118],"error":[119],"fraction":[123],"queries)":[125],"whenever":[126],"described":[133],"submodular":[136],"function.":[137],"includes":[139],"many":[140],"natural":[141],"concept":[142],"classes,":[143],"such":[144],"as":[145,276],"graph":[146],"cuts":[147],"Boolean":[149,193],"disjunctions":[150],"conjunctions.":[152],"These":[153],"results":[154],"are":[155,257],"interesting":[156],"from":[159,168],"theoretic":[162],"point":[163],"view,":[165],"also":[167,243],"perspective":[170],"privacy-preserving":[172,209],"analysis.":[174,211],"context,":[177],"our":[178,240],"second":[179],"result":[180,264],"leads":[181],"an":[183],"algorithm":[184,227],"releases":[187],"differentially":[188,225,284],"private":[189,226,246,285],"conjunctions":[194],"with":[195],"1%":[196],"average":[197],"error.":[198],"presents":[200],"significant":[201],"progress":[202],"key":[205],"open":[206],"Our":[212,263],"first":[213],"result,":[214],"other":[217],"hand,":[218],"unconditional":[220],"lower":[221,261],"bounds":[222],"any":[224],"admits":[229],"(potentially":[231],"non--privacy-preserving)":[232],"implementation":[233],"Not":[238],"algorithms":[241,247],"most":[244],"known":[245],"implemented":[250],"hence":[256],"constrained":[258],"these":[260],"bounds.":[262],"therefore":[265],"isolates":[266],"SQ":[274],"model":[275],"new":[278],"barrier":[279],"design":[282],"algorithms.":[286]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}