{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MQ7ZAUM2XORGTKUZMIBNY2F7XV","short_pith_number":"pith:MQ7ZAUM2","canonical_record":{"source":{"id":"1707.05497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-18T06:51:31Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"dece4de80b161965afbdf1bd69d217c1a1a4408ed42a8a65394b8b1e20cd2c70","abstract_canon_sha256":"c17fc9f397540b731c54aa60951163973a4ce17c1381f2691d94694c2bcb1888"},"schema_version":"1.0"},"canonical_sha256":"643f90519abba269aa996202dc68bfbd6d13258f0581485ecf20e89131f6d9c2","source":{"kind":"arxiv","id":"1707.05497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05497","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05497v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05497","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"MQ7ZAUM2XORG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQ7ZAUM2XORGTKUZ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQ7ZAUM2","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MQ7ZAUM2XORGTKUZMIBNY2F7XV","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-18T06:51:31Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"dece4de80b161965afbdf1bd69d217c1a1a4408ed42a8a65394b8b1e20cd2c70","abstract_canon_sha256":"c17fc9f397540b731c54aa60951163973a4ce17c1381f2691d94694c2bcb1888"},"schema_version":"1.0"},"canonical_sha256":"643f90519abba269aa996202dc68bfbd6d13258f0581485ecf20e89131f6d9c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.184341Z","signature_b64":"Y0RPUYpwBrtNQG+APBfNF3O0FwnEQdLf/TG17FBmTobmYvmg2elMhdMLhb5H1qmBYIjy/hOnJ1nwfXZFoDh0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"643f90519abba269aa996202dc68bfbd6d13258f0581485ecf20e89131f6d9c2","last_reissued_at":"2026-05-18T00:40:02.183780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.183780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05497","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmwKBSob0w9d8oHuq/qIOZQ2NCBYXxEWBlfhs/8Ss2VzjrhclpUpbJlDOinXYMr2ykmnuUtPxDjyTNRY2Y35Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:42:28.438957Z"},"content_sha256":"3b1e226c0a5fed2f99fa3ec94b43d673b83938368c8f1779ec17e7cca54a4cb4","schema_version":"1.0","event_id":"sha256:3b1e226c0a5fed2f99fa3ec94b43d673b83938368c8f1779ec17e7cca54a4cb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MQ7ZAUM2XORGTKUZMIBNY2F7XV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private Identity and Closeness Testing of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Maryam Aliakbarpour, Ronitt Rubinfeld","submitted_at":"2017-07-18T06:51:31Z","abstract_excerpt":"We investigate the problems of identity and closeness testing over a discrete population from random samples. Our goal is to develop efficient testers while guaranteeing Differential Privacy to the individuals of the population. We describe an approach that yields sample-efficient differentially private testers for these problems. Our theoretical results show that there exist private identity and closeness testers that are nearly as sample-efficient as their non-private counterparts. We perform an experimental evaluation of our algorithms on synthetic data. Our experiments illustrate that our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05497","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJoKh96HNbmuwNeqtKFlB5FAt2pd9dSgmvnPUX4NyBp8+0Mry+ByBZfwGyd5Gzjxr6m2/AGBhDO0zeTSe5NYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:42:28.439636Z"},"content_sha256":"16a91854c7615f2bbb73031a6edfe56d3997e63180e15eeb44eeba766e75ae04","schema_version":"1.0","event_id":"sha256:16a91854c7615f2bbb73031a6edfe56d3997e63180e15eeb44eeba766e75ae04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/bundle.json","state_url":"https://pith.science/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T22:42:28Z","links":{"resolver":"https://pith.science/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV","bundle":"https://pith.science/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/bundle.json","state":"https://pith.science/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQ7ZAUM2XORGTKUZMIBNY2F7XV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MQ7ZAUM2XORGTKUZMIBNY2F7XV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c17fc9f397540b731c54aa60951163973a4ce17c1381f2691d94694c2bcb1888","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-18T06:51:31Z","title_canon_sha256":"dece4de80b161965afbdf1bd69d217c1a1a4408ed42a8a65394b8b1e20cd2c70"},"schema_version":"1.0","source":{"id":"1707.05497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05497","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05497v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05497","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"MQ7ZAUM2XORG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQ7ZAUM2XORGTKUZ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQ7ZAUM2","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:16a91854c7615f2bbb73031a6edfe56d3997e63180e15eeb44eeba766e75ae04","target":"graph","created_at":"2026-05-18T00:40:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We investigate the problems of identity and closeness testing over a discrete population from random samples. Our goal is to develop efficient testers while guaranteeing Differential Privacy to the individuals of the population. We describe an approach that yields sample-efficient differentially private testers for these problems. Our theoretical results show that there exist private identity and closeness testers that are nearly as sample-efficient as their non-private counterparts. We perform an experimental evaluation of our algorithms on synthetic data. Our experiments illustrate that our ","authors_text":"Ilias Diakonikolas, Maryam Aliakbarpour, Ronitt Rubinfeld","cross_cats":["cs.DS","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-18T06:51:31Z","title":"Differentially Private Identity and Closeness Testing of Discrete Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05497","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b1e226c0a5fed2f99fa3ec94b43d673b83938368c8f1779ec17e7cca54a4cb4","target":"record","created_at":"2026-05-18T00:40:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c17fc9f397540b731c54aa60951163973a4ce17c1381f2691d94694c2bcb1888","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-18T06:51:31Z","title_canon_sha256":"dece4de80b161965afbdf1bd69d217c1a1a4408ed42a8a65394b8b1e20cd2c70"},"schema_version":"1.0","source":{"id":"1707.05497","kind":"arxiv","version":1}},"canonical_sha256":"643f90519abba269aa996202dc68bfbd6d13258f0581485ecf20e89131f6d9c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"643f90519abba269aa996202dc68bfbd6d13258f0581485ecf20e89131f6d9c2","first_computed_at":"2026-05-18T00:40:02.183780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.183780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0RPUYpwBrtNQG+APBfNF3O0FwnEQdLf/TG17FBmTobmYvmg2elMhdMLhb5H1qmBYIjy/hOnJ1nwfXZFoDh0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.184341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b1e226c0a5fed2f99fa3ec94b43d673b83938368c8f1779ec17e7cca54a4cb4","sha256:16a91854c7615f2bbb73031a6edfe56d3997e63180e15eeb44eeba766e75ae04"],"state_sha256":"631faa7a132b5ba214b855148bbc546cada1eb1a659081eff8f6cefba4c85d3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTeVABBAZ3jwtM9j0681LbNfLOatjABiNnmrrv8Niy3pHMkUF2D1OaPRa7hkWmiTaIwxsKNhO5wxR+4YdqOKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:42:28.443326Z","bundle_sha256":"83c32b5e6506d875f14e1e7165cf6caff64f9a745714c7b02189028a70b8a3db"}}