{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K7FCTV6KAHDCBTHGONBGRC7V3R","short_pith_number":"pith:K7FCTV6K","schema_version":"1.0","canonical_sha256":"57ca29d7ca01c620cce67342688bf5dc4f8e1114522dcad0a825fec249925d19","source":{"kind":"arxiv","id":"1205.1758","version":3},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Privately Releasing Marginals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonathan Ullman, Justin Thaler, Salil Vadhan","submitted_at":"2012-05-08T17:43:11Z","abstract_excerpt":"We study the problem of releasing $k$-way marginals of a database $D \\in (\\{0,1\\}^d)^n$, while preserving differential privacy. The answer to a $k$-way marginal query is the fraction of $D$'s records $x \\in \\{0,1\\}^d$ with a given value in each of a given set of up to $k$ columns. Marginal queries enable a rich class of statistical analyses of a dataset, and designing efficient algorithms for privately releasing marginal queries has been identified as an important open problem in private data analysis (cf. Barak et. al., PODS '07).\n  We give an algorithm that runs in time $d^{O(\\sqrt{k})}$ and"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.1758","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-08T17:43:11Z","cross_cats_sorted":[],"title_canon_sha256":"70abe4ec8d06d6eea624d0340dec63109a21c35b4be9f4aaa6173ede5399223c","abstract_canon_sha256":"3a4c287596b2ad7a7e93442f95b03578c2f7df7cb014bb6702fb12329682197a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:21.462382Z","signature_b64":"fmSEA3rfB7tq80Cf7hqxgDz3Ru7lqbVeloEMVE1qs+8R7JlhCINSdMu+W/JKEpqBVbzwpiacBR4W18ufS5HfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ca29d7ca01c620cce67342688bf5dc4f8e1114522dcad0a825fec249925d19","last_reissued_at":"2026-05-18T02:56:21.461062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:21.461062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Privately Releasing Marginals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonathan Ullman, Justin Thaler, Salil Vadhan","submitted_at":"2012-05-08T17:43:11Z","abstract_excerpt":"We study the problem of releasing $k$-way marginals of a database $D \\in (\\{0,1\\}^d)^n$, while preserving differential privacy. The answer to a $k$-way marginal query is the fraction of $D$'s records $x \\in \\{0,1\\}^d$ with a given value in each of a given set of up to $k$ columns. Marginal queries enable a rich class of statistical analyses of a dataset, and designing efficient algorithms for privately releasing marginal queries has been identified as an important open problem in private data analysis (cf. Barak et. al., PODS '07).\n  We give an algorithm that runs in time $d^{O(\\sqrt{k})}$ and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1758","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.1758","created_at":"2026-05-18T02:56:21.461185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1758v3","created_at":"2026-05-18T02:56:21.461185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1758","created_at":"2026-05-18T02:56:21.461185+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7FCTV6KAHDC","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7FCTV6KAHDCBTHG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7FCTV6K","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R","json":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R.json","graph_json":"https://pith.science/api/pith-number/K7FCTV6KAHDCBTHGONBGRC7V3R/graph.json","events_json":"https://pith.science/api/pith-number/K7FCTV6KAHDCBTHGONBGRC7V3R/events.json","paper":"https://pith.science/paper/K7FCTV6K"},"agent_actions":{"view_html":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R","download_json":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R.json","view_paper":"https://pith.science/paper/K7FCTV6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1758&json=true","fetch_graph":"https://pith.science/api/pith-number/K7FCTV6KAHDCBTHGONBGRC7V3R/graph.json","fetch_events":"https://pith.science/api/pith-number/K7FCTV6KAHDCBTHGONBGRC7V3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R/action/storage_attestation","attest_author":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R/action/author_attestation","sign_citation":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R/action/citation_signature","submit_replication":"https://pith.science/pith/K7FCTV6KAHDCBTHGONBGRC7V3R/action/replication_record"}},"created_at":"2026-05-18T02:56:21.461185+00:00","updated_at":"2026-05-18T02:56:21.461185+00:00"}