{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DDQJZGDMOOMCQKSBWTT2MDNC2N","short_pith_number":"pith:DDQJZGDM","canonical_record":{"source":{"id":"1308.3946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T07:45:07Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"2f4d0777bc71b5901cb045b4c74def8f8a57745ca30ff0bd2349a943aada5567","abstract_canon_sha256":"4066eeb28cb9a5655d0dcdb1dd88c6798de5fb3a07e7f39a8671d761d4d8e76a"},"schema_version":"1.0"},"canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","source":{"kind":"arxiv","id":"1308.3946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3946","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3946v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3946","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"DDQJZGDMOOMC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDQJZGDMOOMCQKSB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDQJZGDM","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DDQJZGDMOOMCQKSBWTT2MDNC2N","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T07:45:07Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"2f4d0777bc71b5901cb045b4c74def8f8a57745ca30ff0bd2349a943aada5567","abstract_canon_sha256":"4066eeb28cb9a5655d0dcdb1dd88c6798de5fb3a07e7f39a8671d761d4d8e76a"},"schema_version":"1.0"},"canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:35.220553Z","signature_b64":"VtEjVvkUzbaE9R3wIjuKg54+dI+TTqM8+0eF+jA2dZPzui96mXKKWlWlDZE8RVggF84uX/j0xD0q7QFZYczMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","last_reissued_at":"2026-05-18T03:15:35.219776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:35.219776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3946","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-18T03:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNBwdA0bmmpokSBvAkDfBHNp7DlVxcqB7O20aEkAQbMc2O7i2MZO/TXakseWHqateDxgOPKUifuFNNGTbDOEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:33:20.033199Z"},"content_sha256":"92d6183fe106bd5e3e076507fb772ff5c07e38bf09b36aef51f785632fba93cb","schema_version":"1.0","event_id":"sha256:92d6183fe106bd5e3e076507fb772ff5c07e38bf09b36aef51f785632fba93cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DDQJZGDMOOMCQKSBWTT2MDNC2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Testing Closeness of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Gregory Valiant, Ilias Diakonikolas, Paul Valiant, Siu-on Chan","submitted_at":"2013-08-19T07:45:07Z","abstract_excerpt":"We study the question of closeness testing for two discrete distributions. More precisely, given samples from two distributions $p$ and $q$ over an $n$-element set, we wish to distinguish whether $p=q$ versus $p$ is at least $\\eps$-far from $q$, in either $\\ell_1$ or $\\ell_2$ distance. Batu et al. gave the first sub-linear time algorithms for these problems, which matched the lower bounds of Valiant up to a logarithmic factor in $n$, and a polynomial factor of $\\eps.$\n  In this work, we present simple (and new) testers for both the $\\ell_1$ and $\\ell_2$ settings, with sample complexity that is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3946","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-18T03:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXfAZIZeJgVrIBEcaTEnInkihlos6daIMNu6AOLBkw1EFg7tNGImiJ0lWe3bl2zg8BhWg6BNcnGz6M8Uoe0tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:33:20.033878Z"},"content_sha256":"6eccae1141303fffe19fc02a6505b1846045c6d9a95d6022e22422e232633e28","schema_version":"1.0","event_id":"sha256:6eccae1141303fffe19fc02a6505b1846045c6d9a95d6022e22422e232633e28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/bundle.json","state_url":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/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-05T21:33:20Z","links":{"resolver":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N","bundle":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/bundle.json","state":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DDQJZGDMOOMCQKSBWTT2MDNC2N","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":"4066eeb28cb9a5655d0dcdb1dd88c6798de5fb3a07e7f39a8671d761d4d8e76a","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T07:45:07Z","title_canon_sha256":"2f4d0777bc71b5901cb045b4c74def8f8a57745ca30ff0bd2349a943aada5567"},"schema_version":"1.0","source":{"id":"1308.3946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3946","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3946v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3946","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"DDQJZGDMOOMC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDQJZGDMOOMCQKSB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDQJZGDM","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:6eccae1141303fffe19fc02a6505b1846045c6d9a95d6022e22422e232633e28","target":"graph","created_at":"2026-05-18T03:15:35Z","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 question of closeness testing for two discrete distributions. More precisely, given samples from two distributions $p$ and $q$ over an $n$-element set, we wish to distinguish whether $p=q$ versus $p$ is at least $\\eps$-far from $q$, in either $\\ell_1$ or $\\ell_2$ distance. Batu et al. gave the first sub-linear time algorithms for these problems, which matched the lower bounds of Valiant up to a logarithmic factor in $n$, and a polynomial factor of $\\eps.$\n  In this work, we present simple (and new) testers for both the $\\ell_1$ and $\\ell_2$ settings, with sample complexity that is","authors_text":"Gregory Valiant, Ilias Diakonikolas, Paul Valiant, Siu-on Chan","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T07:45:07Z","title":"Optimal Algorithms for Testing Closeness of Discrete Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3946","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:92d6183fe106bd5e3e076507fb772ff5c07e38bf09b36aef51f785632fba93cb","target":"record","created_at":"2026-05-18T03:15:35Z","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":"4066eeb28cb9a5655d0dcdb1dd88c6798de5fb3a07e7f39a8671d761d4d8e76a","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T07:45:07Z","title_canon_sha256":"2f4d0777bc71b5901cb045b4c74def8f8a57745ca30ff0bd2349a943aada5567"},"schema_version":"1.0","source":{"id":"1308.3946","kind":"arxiv","version":1}},"canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","first_computed_at":"2026-05-18T03:15:35.219776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:35.219776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtEjVvkUzbaE9R3wIjuKg54+dI+TTqM8+0eF+jA2dZPzui96mXKKWlWlDZE8RVggF84uX/j0xD0q7QFZYczMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:35.220553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92d6183fe106bd5e3e076507fb772ff5c07e38bf09b36aef51f785632fba93cb","sha256:6eccae1141303fffe19fc02a6505b1846045c6d9a95d6022e22422e232633e28"],"state_sha256":"350e6dcbb6177b403ed9413fbf654afa1dac14c5c99a95b377fe47d627d9ab67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZvY+ewuRZAmCntLTShhghbpAQ8viJwvDt8l37tZ1/dImk76Hkv+g9vHtzM5eRPBXHWTYzUik1r45+tB2iuIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:33:20.036913Z","bundle_sha256":"023186ad98d70ea383cbe68b938d1e1869362c8cfc236ef3168fae5e2c372667"}}