{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DJ67MQEBUVFTCYSOMXWDV7OQ37","short_pith_number":"pith:DJ67MQEB","schema_version":"1.0","canonical_sha256":"1a7df64081a54b31624e65ec3afdd0dfea0acfa18467bb29ab6d771dfab0a95a","source":{"kind":"arxiv","id":"1110.3100","version":1},"attestation_state":"computed","paper":{"title":"Telling Two Distributions Apart: a Tight Characterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eyal Even Dar, Mark Sandler","submitted_at":"2011-10-14T00:46:23Z","abstract_excerpt":"We consider the problem of distinguishing between two arbitrary black-box distributions defined over the domain [n], given access to $s$ samples from both. It is known that in the worst case O(n^{2/3}) samples is both necessary and sufficient, provided that the distributions have L1 difference of at least {\\epsilon}. However, it is also known that in many cases fewer samples suffice. We identify a new parameter, that provides an upper bound on how many samples needed, and present an efficient algorithm that requires the number of samples independent of the domain size. Also for a large subclas"},"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":"1110.3100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-14T00:46:23Z","cross_cats_sorted":[],"title_canon_sha256":"997fd9bcf4b1dbe2fdc8843c0d498f0d51c46c46e1a3dc7e17e58a08f755224f","abstract_canon_sha256":"ab99bb8e235bcc8c245fef8d55f53d8297baafbcefffe75bbf4e90054ddff027"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:58.071552Z","signature_b64":"apBOaRKurCxwBhTZql6Rk/LI6g0v41KB9YhXmxj99wZ17l3kLzsdh9xpmPAT6RHTmvuCCD4NwG428pFNFx7SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7df64081a54b31624e65ec3afdd0dfea0acfa18467bb29ab6d771dfab0a95a","last_reissued_at":"2026-05-18T04:10:58.071117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:58.071117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Telling Two Distributions Apart: a Tight Characterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eyal Even Dar, Mark Sandler","submitted_at":"2011-10-14T00:46:23Z","abstract_excerpt":"We consider the problem of distinguishing between two arbitrary black-box distributions defined over the domain [n], given access to $s$ samples from both. It is known that in the worst case O(n^{2/3}) samples is both necessary and sufficient, provided that the distributions have L1 difference of at least {\\epsilon}. However, it is also known that in many cases fewer samples suffice. We identify a new parameter, that provides an upper bound on how many samples needed, and present an efficient algorithm that requires the number of samples independent of the domain size. Also for a large subclas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3100","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":"1110.3100","created_at":"2026-05-18T04:10:58.071176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3100v1","created_at":"2026-05-18T04:10:58.071176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3100","created_at":"2026-05-18T04:10:58.071176+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJ67MQEBUVFT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJ67MQEBUVFTCYSO","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJ67MQEB","created_at":"2026-05-18T12:26:26.731475+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/DJ67MQEBUVFTCYSOMXWDV7OQ37","json":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37.json","graph_json":"https://pith.science/api/pith-number/DJ67MQEBUVFTCYSOMXWDV7OQ37/graph.json","events_json":"https://pith.science/api/pith-number/DJ67MQEBUVFTCYSOMXWDV7OQ37/events.json","paper":"https://pith.science/paper/DJ67MQEB"},"agent_actions":{"view_html":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37","download_json":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37.json","view_paper":"https://pith.science/paper/DJ67MQEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3100&json=true","fetch_graph":"https://pith.science/api/pith-number/DJ67MQEBUVFTCYSOMXWDV7OQ37/graph.json","fetch_events":"https://pith.science/api/pith-number/DJ67MQEBUVFTCYSOMXWDV7OQ37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37/action/storage_attestation","attest_author":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37/action/author_attestation","sign_citation":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37/action/citation_signature","submit_replication":"https://pith.science/pith/DJ67MQEBUVFTCYSOMXWDV7OQ37/action/replication_record"}},"created_at":"2026-05-18T04:10:58.071176+00:00","updated_at":"2026-05-18T04:10:58.071176+00:00"}