{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U3W5V3RTBJ2UNFK2IIPFDA4BNL","short_pith_number":"pith:U3W5V3RT","schema_version":"1.0","canonical_sha256":"a6eddaee330a7546955a421e5183816ac5ef66f25780fa1544d4bface7793a1c","source":{"kind":"arxiv","id":"1111.6842","version":1},"attestation_state":"computed","paper":{"title":"Fast Private Data Release Algorithms for Sparse Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Avrim Blum","submitted_at":"2011-11-29T15:23:08Z","abstract_excerpt":"We revisit the problem of accurately answering large classes of statistical queries while preserving differential privacy. Previous approaches to this problem have either been very general but have not had run-time polynomial in the size of the database, have applied only to very limited classes of queries, or have relaxed the notion of worst-case error guarantees. In this paper we consider the large class of sparse queries, which take non-zero values on only polynomially many universe elements. We give efficient query release algorithms for this class, in both the interactive and the non-inte"},"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":"1111.6842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-29T15:23:08Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"0a83e8a94c775cb38595bf8875e32ebb1e257123774b8eb2e7fb9a47b2b65602","abstract_canon_sha256":"263d0c95870ccad2ef972d48b132358fc498b3bd184c0a7e49f9ff931a3e0fa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:28.417412Z","signature_b64":"RKj1N4kHnOpCrrIhTnBkMIps/EwCGaMi7SOfWEh13yiUeGXbzAsS8tQJEjJjz7QvIouMxUGQZVSmJ+IOZMFSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6eddaee330a7546955a421e5183816ac5ef66f25780fa1544d4bface7793a1c","last_reissued_at":"2026-05-18T04:07:28.416936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:28.416936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Private Data Release Algorithms for Sparse Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Avrim Blum","submitted_at":"2011-11-29T15:23:08Z","abstract_excerpt":"We revisit the problem of accurately answering large classes of statistical queries while preserving differential privacy. Previous approaches to this problem have either been very general but have not had run-time polynomial in the size of the database, have applied only to very limited classes of queries, or have relaxed the notion of worst-case error guarantees. In this paper we consider the large class of sparse queries, which take non-zero values on only polynomially many universe elements. We give efficient query release algorithms for this class, in both the interactive and the non-inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6842","kind":"arxiv","version":1},"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":"1111.6842","created_at":"2026-05-18T04:07:28.417010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6842v1","created_at":"2026-05-18T04:07:28.417010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6842","created_at":"2026-05-18T04:07:28.417010+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3W5V3RTBJ2U","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3W5V3RTBJ2UNFK2","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3W5V3RT","created_at":"2026-05-18T12:26:42.757692+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/U3W5V3RTBJ2UNFK2IIPFDA4BNL","json":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL.json","graph_json":"https://pith.science/api/pith-number/U3W5V3RTBJ2UNFK2IIPFDA4BNL/graph.json","events_json":"https://pith.science/api/pith-number/U3W5V3RTBJ2UNFK2IIPFDA4BNL/events.json","paper":"https://pith.science/paper/U3W5V3RT"},"agent_actions":{"view_html":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL","download_json":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL.json","view_paper":"https://pith.science/paper/U3W5V3RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6842&json=true","fetch_graph":"https://pith.science/api/pith-number/U3W5V3RTBJ2UNFK2IIPFDA4BNL/graph.json","fetch_events":"https://pith.science/api/pith-number/U3W5V3RTBJ2UNFK2IIPFDA4BNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL/action/storage_attestation","attest_author":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL/action/author_attestation","sign_citation":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL/action/citation_signature","submit_replication":"https://pith.science/pith/U3W5V3RTBJ2UNFK2IIPFDA4BNL/action/replication_record"}},"created_at":"2026-05-18T04:07:28.417010+00:00","updated_at":"2026-05-18T04:07:28.417010+00:00"}