{"id":"https://openalex.org/W3177327406","doi":"https://doi.org/10.1137/21n974881","title":"Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016)","display_name":"Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016)","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3177327406","doi":"https://doi.org/10.1137/21n974881","mag":"3177327406"},"language":"en","primary_location":{"id":"doi:10.1137/21n974881","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21n974881","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/A5088346829","display_name":"Alexandr Andoni","orcid":"https://orcid.org/0009-0004-8042-0976"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexandr Andoni","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100394951","display_name":"Jing Chen","orcid":"https://orcid.org/0000-0003-0394-0375"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jing Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088346829"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10190366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"3","first_page":"STOC16","last_page":"i"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9951000213623047,"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/combinatorics","display_name":"Combinatorics","score":0.6532615423202515},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6085551977157593},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.46487143635749817},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.46110090613365173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45540058612823486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3656008839607239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3432583212852478}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6532615423202515},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6085551977157593},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.46487143635749817},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.46110090613365173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45540058612823486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3656008839607239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3432583212852478},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21n974881","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21n974881","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W4386185001","https://openalex.org/W4236048596","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W1989453388"],"abstract_inverted_index":{"This":[0,413,776,867,1110],"issue":[1],"of":[2,17,43,65,259,267,403,410,472,477,489,544,564,595,626,636,703,723,732,758,783,790,850,864,877,880,889,905,951,958,966,970,987,990,1026,1028,1087,1100,1107,1115],"SICOMP":[3,1155],"contains":[4],"14":[5],"specially":[6],"selected":[7],"papers":[8,30,48,132],"from":[9],"the":[10,37,40,44,55,60,131,141,154,174,214,219,257,265,303,307,314,334,350,354,384,401,408,411,468,475,487,525,534,545,593,612,627,689,721,745,770,781,788,795,839,845,862,874,890,902,911,952,959,964,968,979,993,999,1044,1085,1098,1134,1136,1141,1154],"48th":[11],"Annual":[12],"ACM":[13],"Symposium":[14],"on":[15,389,451,480,605,720,1020],"Theory":[16],"Computing":[18],"(STOC":[19],"2016),":[20],"held":[21],"June":[22],"18--June":[23],"21,":[24],"2016,":[25],"in":[26,135,161,213,253,393,418,423,427,662,678,695,826,992,1084,1160],"Cambridge,":[27],"Massachusetts.":[28],"The":[29,47,67,649],"here":[31,130],"were":[32,71,1040,1118],"chosen":[33],"to":[34,59,348,439,446,485,498,610,780,787,854,942,977,1034,1121,1126],"represent":[35],"both":[36,572,937],"excellence":[38],"and":[39,52,57,123,234,292,321,346,372,405,421,458,506,518,568,570,589,621,669,684,708,734,741,755,808,829,844,898,939,954,982,1012,1047,1076,1105,1124,1140,1150],"broad":[41],"range":[42],"STOC":[45,1144],"program.":[46],"have":[49],"been":[50,1055],"revised":[51],"extended":[53],"by":[54,462,549,1091],"authors":[56,315,526],"subjected":[58],"standard":[61],"thorough":[62],"reviewing":[63],"process":[64],"SICOMP.":[66],"program":[68,1137],"committee":[69,1138],"members":[70],"Alexandr":[72],"Andoni,":[73],"Sanjeev":[74,896],"Arora,":[75],"Allison":[76],"Bishop,":[77],"Avrim":[78],"Blum,":[79],"Keren":[80],"Censor-Hillel,":[81],"Timothy":[82],"Chan,":[83],"Chandra":[84],"Chekuri,":[85],"Jing":[86],"Chen,":[87],"Zeev":[88],"Dvir,":[89],"Fabrizio":[90],"Grandoni,":[91],"Parikshit":[92],"Gopalan,":[93],"Kasper":[94],"Green":[95],"Larsen,":[96],"Huijia":[97],"(Rachel)":[98],"Lin,":[99],"Konstantin":[100],"Makarychev,":[101],"Yishay":[102],"Mansour":[103],"(chair),":[104],"Jakob":[105],"Nordstr\u00f6m,":[106],"Debmalya":[107],"Panigrahi,":[108],"Prasad":[109],"Raghavendra,":[110],"Sofya":[111],"Raskhodnikova,":[112],"R":[113],"Ravi,":[114],"Mario":[115],"Szegedy,":[116],"\u00cava":[117],"Tardos,":[118],"Salil":[119],"Vadhan,":[120],"Avi":[121],"Wigderson,":[122],"Ronald":[124],"de":[125],"Wolf.":[126],"We":[127,1132],"briefly":[128],"describe":[129],"that":[133,190,528,616,688,818,822,933,1117],"appear":[134],"this":[136,208,254,263,523,655,855,1035,1122],"special":[137],"issue.":[138],"In":[139,180,228,256,286,357,444,493,575,673,729,797,882,1002,1059],"\u201cBreaking":[140],"Logarithmic":[142],"Barrier":[143],"for":[144,158,185,198,218,231,245,271,302,363,382,474,515,578,617,654,665,671,769,801,819,873,885,909,1007,1023,1043,1051,1062,1143,1146,1157],"Truthful":[145],"Combinatorial":[146],"Auctions":[147],"with":[148,164,275,337,537,581,601,630,726],"Submodular":[149],"Bidders,\u201d":[150],"Shahar":[151],"Dobzinski":[152],"provides":[153,644],"first":[155,304,746],"truthful":[156],"mechanism":[157,532,554],"welfare":[159],"maximization":[160],"combinatorial":[162],"auctions":[163],"submodular":[165],"bidders":[166],"whose":[167],"approximation":[168,431,470,573,652],"ratio":[169,176],"is":[170,331,344,400,407,435,694,869,936,997],"$O(\\sqrt{\\log":[171],"m})$.":[172],"Previously":[173,762],"best":[175,351,651,1000],"was":[177,210,226,718,766,859],"$O(\\log":[178,944],"m)$.":[179],"\u201cA":[181,358,494,576,1003],"Tight":[182],"Space":[183],"Bound":[184,1006],"Consensus,\u201d":[186],"Leqi":[187],"Zhu":[188],"proves":[189],"every":[191],"randomized":[192],"wait-free":[193],"(or":[194],"obstruction-free)":[195],"consensus":[196],"protocol":[197,837],"$n$":[199,399,597,955],"processes":[200],"must":[201],"use":[202],"at":[203],"least":[204],"$n-1$":[205],"registers.":[206],"Previously,":[207,278,712],"bound":[209,225,717,1019],"known":[211,441,719,767,860,1041,1119],"only":[212,222,282,713,768,1042],"anonymous":[215],"setting,":[216],"while":[217],"general":[220,335],"case":[221,336],"a":[223,241,250,299,317,322,338,376,429,440,463,511,530,542,550,602,631,645,658,759,764,834,848,870,927,971,988,1016,1056,1080,1093,1113],"$\\sqrt{n}$":[224],"known.":[227],"\u201cTwo-Source":[229],"Dispersers":[230],"Polylogarithmic":[232],"Entropy":[233],"Improved":[235],"Ramsey":[236],"Graphs,\u201d":[237],"Gil":[238],"Cohen":[239],"constructs":[240],"$2^{(\\log\\log":[242],"n)^c}$-Ramsey":[243],"graph":[244],"some":[246],"universal":[247],"constant":[248],"$c$,":[249],"significant":[251],"improvement":[252],"direction.":[255],"language":[258],"theoretical":[260],"computer":[261],"science,":[262],"resolves":[264],"problem":[266,388,476,594,656,693,965],"explicitly":[268],"constructing":[269],"dispersers":[270,280],"two":[272],"$n$-bit":[273],"sources":[274],"entropy":[276,284],"${polylog}(n)$.":[277],"such":[279,724,763],"could":[281],"support":[283],"$\\Omega(n)$.":[285],"\u201cAlgorithmic":[287,1060],"Bayesian":[288,296,499,551],"Persuasion,\u201d":[289],"Shaddin":[290],"Dughmi":[291],"Haifeng":[293],"Xu":[294],"examines":[295],"persuasion":[297],"through":[298],"computational":[300],"lens":[301],"time.":[305],"When":[306],"payoff":[308],"distributions":[309],"are":[310,557],"i.i.d.":[311],"across":[312],"actions,":[313],"provide":[316,510],"polynomial-time":[318],"optimal":[319,520,546],"solution":[320],"\u201csimple\u201d":[323],"$(1-1/e)$-approximation.":[324],"For":[325,333,916],"independent":[326],"but":[327,465],"nonidentical":[328],"distributions,":[329],"\\#P-hardness":[330],"proved.":[332],"black-box":[339,355],"sampling":[340],"oracle,":[341],"an":[342,623,714,748,918,943,984,1029],"FPTAS":[343],"provided":[345],"shown":[347],"be":[349,824],"possible":[352],"under":[353],"model.":[356],"Deterministic":[359],"Almost-Tight":[360],"Distributed":[361],"Algorithm":[362],"Approximating":[364],"Single-Source":[365],"Shortest":[366],"Paths,\u201d":[367],"Monika":[368],"Henzinger,":[369],"Sebastian":[370],"Krinninger,":[371],"Danupon":[373],"Nanongkai":[374],"present":[375],"deterministic":[377,420],"$(1":[378,646],"+":[379,395,647],"o(1))$-approximation":[380],"algorithm":[381],"solving":[383],"single-source":[385],"shortest":[386],"paths":[387],"distributed":[390],"weighted":[391,490],"networks":[392],"$O(n^{1/2+o(1)}":[394],"D^{1+o(1)})$":[396],"rounds,":[397],"where":[398,838,947],"number":[402,635,950,1114],"nodes":[404],"$D$":[406],"diameter":[409],"network.":[412],"improves":[414,1112],"upon":[415],"previous":[416,562,650],"results":[417],"being":[419],"completing":[422],"less":[424],"time":[425,664,828],"or":[426,533,559],"obtaining":[428],"smaller":[430],"factor.":[432],"Moreover,":[433],"it":[434,699],"almost":[436],"tight":[437,1095],"due":[438],"lower":[442,1018,1038],"bound.":[443],"\u201cLift-and-Round":[445],"Improve":[447],"Weighted":[448],"Completion":[449],"Time":[450],"Unrelated":[452],"Machines,\u201d":[453],"Nikhil":[454,504],"Bansal,":[455],"Aravind":[456],"Srinivasan,":[457],"Ola":[459],"Svensson":[460],"improve,":[461],"small":[464],"fixed":[466,619],"constant,":[467],"long-standing":[469],"factor":[471,989],"$3/2$":[473],"scheduling":[478,596],"jobs":[479,600],"unrelated":[481],"machines":[482,608],"so":[483],"as":[484,609],"minimize":[486,611],"sum":[488],"completion":[491],"times.":[492],"Duality-Based":[495],"Unified":[496],"Approach":[497],"Mechanism":[500],"Design,\u201d":[501],"Yang":[502,899],"Cai,":[503],"Devanur,":[505],"Seth":[507],"Matthew":[508],"Weinberg":[509],"duality-based":[512],"unified":[513],"framework":[514],"designing":[516],"simple":[517],"approximately":[519],"auctions.":[521],"Using":[522],"framework,":[524],"prove":[527,615,744],"either":[529],"posted-price":[531],"Vickrey--Clarke--Groves":[535],"auction":[536],"per-bidder":[538],"entry":[539],"fees":[540],"achieves":[541],"constant-factor":[543],"revenue":[547],"achievable":[548],"Incentive":[552],"Compatible":[553],"whenever":[555],"buyers":[556],"unit-demand":[558],"additive,":[560],"unifying":[561],"breakthroughs":[563],"Chawla":[565],"et":[566],"al.":[567],"Yao,":[569],"improving":[571],"ratios.":[574],"$(1+\\varepsilon)$-Approximation":[577],"Makespan":[579],"Scheduling":[580],"Precedence":[582],"Constraints":[583],"using":[584,926],"LP":[585,629],"Hierarchies,\u201d":[586],"Elaine":[587],"Levey":[588],"Thomas":[590,685,1072],"Rothvoss":[591],"consider":[592],"unit":[598],"size":[599,705,722,957,969],"precedence":[603],"order":[604],"$m$":[606,948],"identical":[607],"makespan.":[613],"They":[614,816,961],"any":[618,820,923],"$\\epsilon$":[620],"$m$,":[622],"LP-hierarchy":[624],"lift":[625],"time-indexed":[628],"slightly":[632],"super":[633],"poly-logarithmic":[634,727],"$r":[637],"=":[638],"(\\log":[639],"n)^{\\Theta(\\log":[640],"\\log":[641],"n)}$":[642],"rounds":[643],"\\epsilon)$-approximation.":[648],"algorithms":[653,908],"guarantee":[657],"$(2":[659],"-":[660],"7/(3m+1))$-approximation":[661],"polynomial":[663,827,842,1017],"$m":[666],"\\ge":[667],"4$":[668],"$4/3$":[670],"$m=3$.":[672],"\u201cBipartite":[674],"Perfect":[675],"Matching":[676],"Is":[677],"Quasi-${{NC}}$,\u201d":[679],"Stephen":[680],"Fenner,":[681],"Rohit":[682],"Gurjar,":[683],"Thierauf":[686],"show":[687,817,932,1015],"bipartite":[690],"perfect":[691],"matching":[692],"quasi-${{NC}}^2$.":[696],"That":[697],"is,":[698],"has":[700,778,841,847,1054],"uniform":[701],"circuits":[702,725],"quasi-polynomial":[704],"$n^{O(\\log":[706],"n)}$,":[707],"$O(\\log^2":[709],"n)$":[710,945],"depth.":[711,728],"exponential":[715,749],"upper":[716],"\u201cExponential":[730],"Separation":[731],"Communication":[733],"External":[735],"Information,\u201d":[736],"Anat":[737],"Ganor,":[738],"Gillat":[739],"Kol,":[740],"Ran":[742],"Raz":[743],"gap,":[747,750],"between":[751,1097],"external":[752],"information":[753,772,791],"complexity":[754,757,904,1022],"communication":[756,760,774,785],"task.":[761],"separation":[765],"internal":[771],"vs":[773],"complexity.":[775],"result":[777,868],"implication":[779],"question":[782],"compressing":[784],"protocols":[786],"amount":[789],"they":[792,931],"reveal":[793],"about":[794,851,861],"inputs.":[796],"\u201cConstant-Round":[798],"Interactive":[799],"Proofs":[800],"Delegating":[802],"Computation,\u201d":[803],"Omer":[804],"Reingold,":[805],"Guy":[806],"Rothblum,":[807],"Ron":[809],"Rothblum":[810],"design":[811,1106],"efficient,":[812],"constant-round":[813,835,865],"interactive":[814,836],"proofs.":[815],"statement":[821],"can":[823],"evaluated":[825],"space":[830,903,935,994],"$S$,":[831],"there":[832],"exists":[833],"prover":[840],"runtime":[843,849],"verifier":[846],"$n+\\poly(S)$.":[852],"Prior":[853,1033],"work,":[856,1036,1149],"very":[857],"little":[858],"power":[863],"protocol.":[866],"major":[871,1057],"step":[872,1082],"grand":[875],"challenge":[876],"verifiable":[878],"delegation":[879],"computation.":[881],"\u201cTight":[883],"Bounds":[884],"Single-Pass":[886],"Streaming":[887],"Complexity":[888],"Set":[891],"Cover":[892],"Problem,\u201d":[893],"Sepehr":[894],"Assadi,":[895],"Khanna,":[897],"Li":[900],"resolve":[901],"single-pass":[906,928],"streaming":[907,929],"approximating":[910],"classic":[912],"set":[913,920,973],"cover":[914,921,974],"problem.":[915],"finding":[917,978],"$\\alpha$-approximate":[919],"(for":[922],"$\\alpha=":[924],"o(\\sqrt{n})$)":[925],"algorithm,":[930],"$\\Theta(mn/\\alpha)$":[934],"sufficient":[938],"necessary":[940],"(up":[941],"factor),":[946],"denotes":[949,956],"sets":[953],"universe.":[960],"further":[962],"study":[963],"estimating":[967],"minimum":[972],"(as":[975],"opposed":[976],"actual":[980],"sets)":[981],"achieve":[983],"additional":[985],"saving":[986],"$\\alpha$":[991],"complexity,":[995],"which":[996],"also":[998],"possible.":[1001],"Polynomial":[1004],"Lower":[1005],"Testing":[1008],"Monotonicity,\u201d":[1009],"Aleksandrs":[1010],"Belovs":[1011],"Eric":[1013],"Blais":[1014],"query":[1021],"adaptive":[1024,1052,1088,1108],"testers":[1025,1053],"monotonicity":[1027],"$n$-variate":[1030],"Boolean":[1031],"function.":[1032],"similar":[1037,1049],"bounds":[1039,1050,1116],"nonadaptive":[1045],"testers,":[1046],"proving":[1048],"challenge.":[1058],"Stability":[1061],"Adaptive":[1063],"Data":[1064],"Analysis,\u201d":[1065],"Raef":[1066],"Bassily,":[1067],"Kobbi":[1068],"Nissim,":[1069],"Adam":[1070],"Smith,":[1071],"Steinke,":[1073],"Uri":[1074],"Stemmer,":[1075],"Jonathan":[1077],"Ullman":[1078],"take":[1079],"solid":[1081],"forward":[1083],"area":[1086],"data":[1089],"analysis":[1090],"establishing":[1092],"clean,":[1094],"connection":[1096,1111],"notion":[1099],"differential":[1101],"privacy":[1102],"(max-KL":[1103],"stability)":[1104],"queries.":[1109],"prior":[1120],"paper,":[1123],"generalizes":[1125],"handle":[1127],"more":[1128],"\u201cdata":[1129],"analysis\"":[1130],"settings.":[1131],"thank":[1133,1153],"authors,":[1135],"members,":[1139],"reviewers":[1142,1156],"2016":[1145],"their":[1147,1158],"hard":[1148],"we":[1151],"especially":[1152],"work":[1159],"evaluating":[1161],"submitted":[1162],"papers.":[1163]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}