{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L346V5BRDLPUVSP5ZZ6ZIIRQT6","short_pith_number":"pith:L346V5BR","schema_version":"1.0","canonical_sha256":"5ef9eaf4311adf4ac9fdce7d9422309fb30e03657734fbecc9ddebefb6c21917","source":{"kind":"arxiv","id":"1304.3754","version":2},"attestation_state":"computed","paper":{"title":"Faster Private Release of Marginals on Small Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Wan, Jonathan Ullman, Justin Thaler, Karthekeyan Chandrasekaran","submitted_at":"2013-04-13T00:37:17Z","abstract_excerpt":"We study the problem of answering \\emph{$k$-way marginal} queries on a database $D \\in (\\{0,1\\}^d)^n$, while preserving differential privacy. The answer to a $k$-way marginal query is the fraction of the database'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 on a dataset, and designing efficient algorithms for privately answering marginal queries has been identified as an important open problem in private data analysis.\n  For any $k$, we give a differentially private online algorithm that"},"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":"1304.3754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-13T00:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"54fa6f333df03f5b488c77716acc97244172a3559540f80e87c93aeeeda5d68e","abstract_canon_sha256":"fbd0b7432af7e7febfea138021bf907c00121611f13b82a52c1f4b6b18ca385e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:19.646648Z","signature_b64":"oO3QsIZeluPodc/6dLZb5K77m5TKCRxEBTO1R+MwaceFL9MV3tlwddIHPr8qj/5HHBPwRGmhYKP3wFAAulb3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef9eaf4311adf4ac9fdce7d9422309fb30e03657734fbecc9ddebefb6c21917","last_reissued_at":"2026-05-18T03:14:19.646176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:19.646176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Private Release of Marginals on Small Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Wan, Jonathan Ullman, Justin Thaler, Karthekeyan Chandrasekaran","submitted_at":"2013-04-13T00:37:17Z","abstract_excerpt":"We study the problem of answering \\emph{$k$-way marginal} queries on a database $D \\in (\\{0,1\\}^d)^n$, while preserving differential privacy. The answer to a $k$-way marginal query is the fraction of the database'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 on a dataset, and designing efficient algorithms for privately answering marginal queries has been identified as an important open problem in private data analysis.\n  For any $k$, we give a differentially private online algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3754","kind":"arxiv","version":2},"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":"1304.3754","created_at":"2026-05-18T03:14:19.646248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3754v2","created_at":"2026-05-18T03:14:19.646248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3754","created_at":"2026-05-18T03:14:19.646248+00:00"},{"alias_kind":"pith_short_12","alias_value":"L346V5BRDLPU","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L346V5BRDLPUVSP5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L346V5BR","created_at":"2026-05-18T12:27:51.066281+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/L346V5BRDLPUVSP5ZZ6ZIIRQT6","json":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6.json","graph_json":"https://pith.science/api/pith-number/L346V5BRDLPUVSP5ZZ6ZIIRQT6/graph.json","events_json":"https://pith.science/api/pith-number/L346V5BRDLPUVSP5ZZ6ZIIRQT6/events.json","paper":"https://pith.science/paper/L346V5BR"},"agent_actions":{"view_html":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6","download_json":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6.json","view_paper":"https://pith.science/paper/L346V5BR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3754&json=true","fetch_graph":"https://pith.science/api/pith-number/L346V5BRDLPUVSP5ZZ6ZIIRQT6/graph.json","fetch_events":"https://pith.science/api/pith-number/L346V5BRDLPUVSP5ZZ6ZIIRQT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6/action/storage_attestation","attest_author":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6/action/author_attestation","sign_citation":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6/action/citation_signature","submit_replication":"https://pith.science/pith/L346V5BRDLPUVSP5ZZ6ZIIRQT6/action/replication_record"}},"created_at":"2026-05-18T03:14:19.646248+00:00","updated_at":"2026-05-18T03:14:19.646248+00:00"}