{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DDQJZGDMOOMCQKSBWTT2MDNC2N","short_pith_number":"pith:DDQJZGDM","schema_version":"1.0","canonical_sha256":"18e09c986c7398282a41b4e7a60da2d34f44e151edf471e2413d5f035f0ee521","source":{"kind":"arxiv","id":"1308.3946","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3946","created_at":"2026-05-18T03:15:35.219913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3946v1","created_at":"2026-05-18T03:15:35.219913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3946","created_at":"2026-05-18T03:15:35.219913+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDQJZGDMOOMC","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDQJZGDMOOMCQKSB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDQJZGDM","created_at":"2026-05-18T12:27:40.988391+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/DDQJZGDMOOMCQKSBWTT2MDNC2N","json":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N.json","graph_json":"https://pith.science/api/pith-number/DDQJZGDMOOMCQKSBWTT2MDNC2N/graph.json","events_json":"https://pith.science/api/pith-number/DDQJZGDMOOMCQKSBWTT2MDNC2N/events.json","paper":"https://pith.science/paper/DDQJZGDM"},"agent_actions":{"view_html":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N","download_json":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N.json","view_paper":"https://pith.science/paper/DDQJZGDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3946&json=true","fetch_graph":"https://pith.science/api/pith-number/DDQJZGDMOOMCQKSBWTT2MDNC2N/graph.json","fetch_events":"https://pith.science/api/pith-number/DDQJZGDMOOMCQKSBWTT2MDNC2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/action/storage_attestation","attest_author":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/action/author_attestation","sign_citation":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/action/citation_signature","submit_replication":"https://pith.science/pith/DDQJZGDMOOMCQKSBWTT2MDNC2N/action/replication_record"}},"created_at":"2026-05-18T03:15:35.219913+00:00","updated_at":"2026-05-18T03:15:35.219913+00:00"}