{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KUSMPV5ATCSPOFOZPHAM6YN5AP","short_pith_number":"pith:KUSMPV5A","canonical_record":{"source":{"id":"1611.03579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T03:59:24Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"57548ae3bb2edd635ecba10fc478365cbce5d501cb8b4b44fd897f6e9990bd5d","abstract_canon_sha256":"f3666c618da5939022039541ca2c86dee202df89263ce2cbf7281956004fbec7"},"schema_version":"1.0"},"canonical_sha256":"5524c7d7a098a4f715d979c0cf61bd03ee9d90049bae8e0b88b83e81bfc73fff","source":{"kind":"arxiv","id":"1611.03579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03579","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03579v1","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03579","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"KUSMPV5ATCSP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KUSMPV5ATCSPOFOZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KUSMPV5A","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KUSMPV5ATCSPOFOZPHAM6YN5AP","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T03:59:24Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"57548ae3bb2edd635ecba10fc478365cbce5d501cb8b4b44fd897f6e9990bd5d","abstract_canon_sha256":"f3666c618da5939022039541ca2c86dee202df89263ce2cbf7281956004fbec7"},"schema_version":"1.0"},"canonical_sha256":"5524c7d7a098a4f715d979c0cf61bd03ee9d90049bae8e0b88b83e81bfc73fff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:33.822134Z","signature_b64":"sGXZOV0fHr2vSqXtekdT2uBiGxpvRwJJdYFzSlNNGybApIObX+YISYG06cW2QcixQIkvc3ZCpEgjxRLtNnMqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5524c7d7a098a4f715d979c0cf61bd03ee9d90049bae8e0b88b83e81bfc73fff","last_reissued_at":"2026-05-18T00:59:33.821439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:33.821439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03579","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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ln5ut228mrPdxfcSKUUXUEBoidh0K/rzqSXYL3fwSPdHQYQQHcpsdX3HYFtNhs2gckt0L0YFZFds32eic5FzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:17:40.308600Z"},"content_sha256":"6fea1201734b56ee789a57e814a64ace2bfafc88a158f00c0ab36c7c23f3ce1c","schema_version":"1.0","event_id":"sha256:6fea1201734b56ee789a57e814a64ace2bfafc88a158f00c0ab36c7c23f3ce1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KUSMPV5ATCSPOFOZPHAM6YN5AP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collision-based Testers are Optimal for Uniformity and Closeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Eric Price, Ilias Diakonikolas, John Peebles, Themis Gouleakis","submitted_at":"2016-11-11T03:59:24Z","abstract_excerpt":"We study the fundamental problems of (i) uniformity testing of a discrete distribution, and (ii) closeness testing between two discrete distributions with bounded $\\ell_2$-norm. These problems have been extensively studied in distribution testing and sample-optimal estimators are known for them~\\cite{Paninski:08, CDVV14, VV14, DKN:15}.\n  In this work, we show that the original collision-based testers proposed for these problems ~\\cite{GRdist:00, BFR+:00} are sample-optimal, up to constant factors. Previous analyses showed sample complexity upper bounds for these testers that are optimal as a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03579","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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZ025uSEkQ/ohlB45q8cYijZ7Pxqx7whzpw3tToE0s37FZrvNoJBrbIoBuLz7YQKSONrQT8IHN5UTV8ClwbkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:17:40.308957Z"},"content_sha256":"67473c2e03ce3852f80bc2827b26e75030c959ea49140f046760b4533dd537a9","schema_version":"1.0","event_id":"sha256:67473c2e03ce3852f80bc2827b26e75030c959ea49140f046760b4533dd537a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/bundle.json","state_url":"https://pith.science/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/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-05T16:17:40Z","links":{"resolver":"https://pith.science/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP","bundle":"https://pith.science/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/bundle.json","state":"https://pith.science/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUSMPV5ATCSPOFOZPHAM6YN5AP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KUSMPV5ATCSPOFOZPHAM6YN5AP","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":"f3666c618da5939022039541ca2c86dee202df89263ce2cbf7281956004fbec7","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T03:59:24Z","title_canon_sha256":"57548ae3bb2edd635ecba10fc478365cbce5d501cb8b4b44fd897f6e9990bd5d"},"schema_version":"1.0","source":{"id":"1611.03579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03579","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03579v1","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03579","created_at":"2026-05-18T00:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"KUSMPV5ATCSP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KUSMPV5ATCSPOFOZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KUSMPV5A","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:67473c2e03ce3852f80bc2827b26e75030c959ea49140f046760b4533dd537a9","target":"graph","created_at":"2026-05-18T00:59:33Z","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 study the fundamental problems of (i) uniformity testing of a discrete distribution, and (ii) closeness testing between two discrete distributions with bounded $\\ell_2$-norm. These problems have been extensively studied in distribution testing and sample-optimal estimators are known for them~\\cite{Paninski:08, CDVV14, VV14, DKN:15}.\n  In this work, we show that the original collision-based testers proposed for these problems ~\\cite{GRdist:00, BFR+:00} are sample-optimal, up to constant factors. Previous analyses showed sample complexity upper bounds for these testers that are optimal as a f","authors_text":"Eric Price, Ilias Diakonikolas, John Peebles, Themis Gouleakis","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T03:59:24Z","title":"Collision-based Testers are Optimal for Uniformity and Closeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03579","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:6fea1201734b56ee789a57e814a64ace2bfafc88a158f00c0ab36c7c23f3ce1c","target":"record","created_at":"2026-05-18T00:59:33Z","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":"f3666c618da5939022039541ca2c86dee202df89263ce2cbf7281956004fbec7","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T03:59:24Z","title_canon_sha256":"57548ae3bb2edd635ecba10fc478365cbce5d501cb8b4b44fd897f6e9990bd5d"},"schema_version":"1.0","source":{"id":"1611.03579","kind":"arxiv","version":1}},"canonical_sha256":"5524c7d7a098a4f715d979c0cf61bd03ee9d90049bae8e0b88b83e81bfc73fff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5524c7d7a098a4f715d979c0cf61bd03ee9d90049bae8e0b88b83e81bfc73fff","first_computed_at":"2026-05-18T00:59:33.821439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:33.821439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGXZOV0fHr2vSqXtekdT2uBiGxpvRwJJdYFzSlNNGybApIObX+YISYG06cW2QcixQIkvc3ZCpEgjxRLtNnMqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:33.822134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fea1201734b56ee789a57e814a64ace2bfafc88a158f00c0ab36c7c23f3ce1c","sha256:67473c2e03ce3852f80bc2827b26e75030c959ea49140f046760b4533dd537a9"],"state_sha256":"2da7a32c4f44a859531253c7a768e018d52fcde728a4d631ac3a1829959987d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+jAXv1ZHqgX7aYyaw2T40b+LlfHPUaOfrT4LFcA8ICxbLXb7LPWpkZBL5JtA20cv1Tkacp/yEclYKwCZMdVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:17:40.310966Z","bundle_sha256":"b72bef357fb7701409159090e014e134950630c0577793a9a429e0aba7ac17a1"}}