{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BLB4MLEVFNLJPTXMWMWMRBZW5A","short_pith_number":"pith:BLB4MLEV","schema_version":"1.0","canonical_sha256":"0ac3c62c952b5697ceecb32cc88736e8194312a64f932bbd10e2fd67b018b148","source":{"kind":"arxiv","id":"1707.05128","version":3},"attestation_state":"computed","paper":{"title":"Differentially Private Testing of Identity and Closeness of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Huanyu Zhang, Jayadev Acharya, Ziteng Sun","submitted_at":"2017-07-17T13:00:13Z","abstract_excerpt":"We study the fundamental problems of identity testing (goodness of fit), and closeness testing (two sample test) of distributions over $k$ elements, under differential privacy. While the problems have a long history in statistics, finite sample bounds for these problems have only been established recently.\n  In this work, we derive upper and lower bounds on the sample complexity of both the problems under $(\\varepsilon, \\delta)$-differential privacy. We provide optimal sample complexity algorithms for identity testing problem for all parameter ranges, and the first results for closeness testin"},"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":"1707.05128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-17T13:00:13Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"524d47f9bd4c209a687d3ff8a4e62f22c4a2d77e58074f3c9f8ce9009baa2213","abstract_canon_sha256":"cecd84ad71006d487e6b0257a4b1a85a470bc783fc1d1255cc7e844812c4dee2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:44.967446Z","signature_b64":"5Q2t2YddnMRHf+qXbSusiEH2/eO5MC2Lvu/+US/iE7ZFcjeDiqLR90WIUMfCBT3A4yoF5RsJrXYEmz/LMNlzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac3c62c952b5697ceecb32cc88736e8194312a64f932bbd10e2fd67b018b148","last_reissued_at":"2026-05-18T00:31:44.966882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:44.966882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Testing of Identity and Closeness of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Huanyu Zhang, Jayadev Acharya, Ziteng Sun","submitted_at":"2017-07-17T13:00:13Z","abstract_excerpt":"We study the fundamental problems of identity testing (goodness of fit), and closeness testing (two sample test) of distributions over $k$ elements, under differential privacy. While the problems have a long history in statistics, finite sample bounds for these problems have only been established recently.\n  In this work, we derive upper and lower bounds on the sample complexity of both the problems under $(\\varepsilon, \\delta)$-differential privacy. We provide optimal sample complexity algorithms for identity testing problem for all parameter ranges, and the first results for closeness testin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05128","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":"1707.05128","created_at":"2026-05-18T00:31:44.966957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05128v3","created_at":"2026-05-18T00:31:44.966957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05128","created_at":"2026-05-18T00:31:44.966957+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLB4MLEVFNLJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLB4MLEVFNLJPTXM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLB4MLEV","created_at":"2026-05-18T12:31:08.081275+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/BLB4MLEVFNLJPTXMWMWMRBZW5A","json":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A.json","graph_json":"https://pith.science/api/pith-number/BLB4MLEVFNLJPTXMWMWMRBZW5A/graph.json","events_json":"https://pith.science/api/pith-number/BLB4MLEVFNLJPTXMWMWMRBZW5A/events.json","paper":"https://pith.science/paper/BLB4MLEV"},"agent_actions":{"view_html":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A","download_json":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A.json","view_paper":"https://pith.science/paper/BLB4MLEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05128&json=true","fetch_graph":"https://pith.science/api/pith-number/BLB4MLEVFNLJPTXMWMWMRBZW5A/graph.json","fetch_events":"https://pith.science/api/pith-number/BLB4MLEVFNLJPTXMWMWMRBZW5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A/action/storage_attestation","attest_author":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A/action/author_attestation","sign_citation":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A/action/citation_signature","submit_replication":"https://pith.science/pith/BLB4MLEVFNLJPTXMWMWMRBZW5A/action/replication_record"}},"created_at":"2026-05-18T00:31:44.966957+00:00","updated_at":"2026-05-18T00:31:44.966957+00:00"}