{"work":{"id":"dc08bb8d-dfc2-40ec-81f3-accd722f0087","openalex_id":"https://openalex.org/W2058785578","doi":"10.1145/1536414.1536461","arxiv_id":"6414.153646","raw_key":null,"title":"On the complexity of differentially private data release: efficient algorithms and hardness results,","authors":null,"authors_text":"Dan Feldman, Amos Fiat, Haim Kaplan, and Kobbi Nissim","year":2009,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/6414.153646","cited_by_count":804,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":null,"created_at":"2026-05-12T03:31:18.263892+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":false,"display_title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing , pages =","render_title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing , pages ="},"hub":{"state":{"tier_text":"hub","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":10,"external_cited_by_count":804},"tier":"hub","role_counts":[{"context_role":"background","n":1},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":1},{"context_polarity":"use_method","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}