{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BKO2CCLUYOXCE274CKZRED2VRP","short_pith_number":"pith:BKO2CCLU","schema_version":"1.0","canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","source":{"kind":"arxiv","id":"1708.02728","version":2},"attestation_state":"computed","paper":{"title":"Optimal Identity Testing with High Probability","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":"2017-08-09T06:17:30Z","abstract_excerpt":"We study the problem of testing identity against a given distribution with a focus on the high confidence regime. More precisely, given samples from an unknown distribution $p$ over $n$ elements, an explicitly given distribution $q$, and parameters $0< \\epsilon, \\delta < 1$, we wish to distinguish, {\\em with probability at least $1-\\delta$}, whether the distributions are identical versus $\\varepsilon$-far in total variation distance. Most prior work focused on the case that $\\delta = \\Omega(1)$, for which the sample complexity of identity testing is known to be $\\Theta(\\sqrt{n}/\\epsilon^2)$. G"},"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":"1708.02728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:17:30Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"6b2aa715abf05bdf4e5a42323b50425f8f11a0bd55f24ab1cfbeab2d23024feb","abstract_canon_sha256":"dcf76e07e71da1bf67423cfed60e4e35761fa5766bcee2f2fa06d218da06b832"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:15.483593Z","signature_b64":"fDTRO9AEn584cgMlFifL6byLNCBYMf7ODRkzvvnAkaegVTlxVT4pB0RRLuWHWHAOTmvetLkr03rA1GJf14V1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","last_reissued_at":"2026-05-17T23:56:15.482990Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:15.482990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Identity Testing with High Probability","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":"2017-08-09T06:17:30Z","abstract_excerpt":"We study the problem of testing identity against a given distribution with a focus on the high confidence regime. More precisely, given samples from an unknown distribution $p$ over $n$ elements, an explicitly given distribution $q$, and parameters $0< \\epsilon, \\delta < 1$, we wish to distinguish, {\\em with probability at least $1-\\delta$}, whether the distributions are identical versus $\\varepsilon$-far in total variation distance. Most prior work focused on the case that $\\delta = \\Omega(1)$, for which the sample complexity of identity testing is known to be $\\Theta(\\sqrt{n}/\\epsilon^2)$. G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02728","kind":"arxiv","version":2},"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":"1708.02728","created_at":"2026-05-17T23:56:15.483074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02728v2","created_at":"2026-05-17T23:56:15.483074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02728","created_at":"2026-05-17T23:56:15.483074+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKO2CCLUYOXC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKO2CCLUYOXCE274","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKO2CCLU","created_at":"2026-05-18T12:31:08.081275+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/BKO2CCLUYOXCE274CKZRED2VRP","json":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP.json","graph_json":"https://pith.science/api/pith-number/BKO2CCLUYOXCE274CKZRED2VRP/graph.json","events_json":"https://pith.science/api/pith-number/BKO2CCLUYOXCE274CKZRED2VRP/events.json","paper":"https://pith.science/paper/BKO2CCLU"},"agent_actions":{"view_html":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP","download_json":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP.json","view_paper":"https://pith.science/paper/BKO2CCLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02728&json=true","fetch_graph":"https://pith.science/api/pith-number/BKO2CCLUYOXCE274CKZRED2VRP/graph.json","fetch_events":"https://pith.science/api/pith-number/BKO2CCLUYOXCE274CKZRED2VRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/action/storage_attestation","attest_author":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/action/author_attestation","sign_citation":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/action/citation_signature","submit_replication":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/action/replication_record"}},"created_at":"2026-05-17T23:56:15.483074+00:00","updated_at":"2026-05-17T23:56:15.483074+00:00"}