{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D2F3CN5ZGNR42LS32TOKSELFVG","short_pith_number":"pith:D2F3CN5Z","schema_version":"1.0","canonical_sha256":"1e8bb137b93363cd2e5bd4dca91165a9a6e6b7d60a9e1bb819fb7bb485461785","source":{"kind":"arxiv","id":"1709.02087","version":1},"attestation_state":"computed","paper":{"title":"Sharp Bounds for Generalized Uniformity Testing","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":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2017-09-07T06:16:08Z","abstract_excerpt":"We study the problem of generalized uniformity testing \\cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\\em unknown} discrete domain $\\mathbf{\\Omega}$, we want to distinguish, with probability at least $2/3$, between the case that $p$ is uniform on some {\\em subset} of $\\mathbf{\\Omega}$ versus $\\epsilon$-far, in total variation distance, from any such uniform distribution.\n  We establish tight bounds on the sample complexity of generalized uniformity testing. In more detail, we present a computationally efficient tester whose sample"},"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":"1709.02087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T06:16:08Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"49fe3bde4cc958a409a76fe93313f76537f024c2ec108f9efebf0f1d8bc04ac6","abstract_canon_sha256":"d6b94587676ea7850749a695a2a6db8634d8d466b6ce5e4c4c819398291f9f9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:50.286240Z","signature_b64":"lUGyWJGHPUYo7w9uSLtsn/5kiPaAHNtHxhs7pa9e4sHSY13xbdejR+4lvE+5V3LKpV4BInLeDLlMFYZzNW+XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e8bb137b93363cd2e5bd4dca91165a9a6e6b7d60a9e1bb819fb7bb485461785","last_reissued_at":"2026-05-18T00:35:50.285764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:50.285764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Bounds for Generalized Uniformity Testing","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":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2017-09-07T06:16:08Z","abstract_excerpt":"We study the problem of generalized uniformity testing \\cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\\em unknown} discrete domain $\\mathbf{\\Omega}$, we want to distinguish, with probability at least $2/3$, between the case that $p$ is uniform on some {\\em subset} of $\\mathbf{\\Omega}$ versus $\\epsilon$-far, in total variation distance, from any such uniform distribution.\n  We establish tight bounds on the sample complexity of generalized uniformity testing. In more detail, we present a computationally efficient tester whose sample"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02087","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":"1709.02087","created_at":"2026-05-18T00:35:50.285830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02087v1","created_at":"2026-05-18T00:35:50.285830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02087","created_at":"2026-05-18T00:35:50.285830+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2F3CN5ZGNR4","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2F3CN5ZGNR42LS3","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2F3CN5Z","created_at":"2026-05-18T12:31:10.602751+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/D2F3CN5ZGNR42LS32TOKSELFVG","json":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG.json","graph_json":"https://pith.science/api/pith-number/D2F3CN5ZGNR42LS32TOKSELFVG/graph.json","events_json":"https://pith.science/api/pith-number/D2F3CN5ZGNR42LS32TOKSELFVG/events.json","paper":"https://pith.science/paper/D2F3CN5Z"},"agent_actions":{"view_html":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG","download_json":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG.json","view_paper":"https://pith.science/paper/D2F3CN5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02087&json=true","fetch_graph":"https://pith.science/api/pith-number/D2F3CN5ZGNR42LS32TOKSELFVG/graph.json","fetch_events":"https://pith.science/api/pith-number/D2F3CN5ZGNR42LS32TOKSELFVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG/action/storage_attestation","attest_author":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG/action/author_attestation","sign_citation":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG/action/citation_signature","submit_replication":"https://pith.science/pith/D2F3CN5ZGNR42LS32TOKSELFVG/action/replication_record"}},"created_at":"2026-05-18T00:35:50.285830+00:00","updated_at":"2026-05-18T00:35:50.285830+00:00"}