Harvard Dataverse has been upgraded to Dataverse 4.0 and is available for all to use at dataverse.harvard.edu
Please note that you will have to enter a new password when logging in for the first time due to stricter password requirements. Passwords in 4.0 must be at least 6 characters and contain at least one number and letter.
At the beginning of next week, April 13th, Harvard Dataverse will be upgraded to Dataverse 4.0! The current version of the Harvard Dataverse (thedata.harvard.edu) will still be available for the next month for you to view. However, you will be able to edit, upload, or download in the new release 4.0 and can benefit from the new functionalities there. Read more about Dataverse 4.0, Next Week!
Binary trees can be made differentially private by adding noise to every node and leaf. In such form they allow multifaceted exploration of a variable without revealing any individual information. While a differentially private binary tree can be used and read just like its conventional exact-valued analog, realizing that different combinations of nodes contain overlapping answers to the same information allows us to bring the statistical properties of multiple measurements under measurement error to noisy binary trees to create statistically efficient node estimates. We construct estimators that correctly use all available information in the tree, thus decreasing the error of nodes by up to eighty percent for the same level of privacy protection.