{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BKO2CCLUYOXCE274CKZRED2VRP","short_pith_number":"pith:BKO2CCLU","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"},"canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","source":{"kind":"arxiv","id":"1708.02728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02728","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02728v2","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02728","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"pith_short_12","alias_value":"BKO2CCLUYOXC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKO2CCLUYOXCE274","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKO2CCLU","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BKO2CCLUYOXCE274CKZRED2VRP","target":"record","payload":{"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"},"canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","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"},"source_kind":"arxiv","source_id":"1708.02728","source_version":2,"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-17T23:56:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0i05+R2opHsGTL8MGl7OZplfjePfsaSAmKCqeQoogd8Pg/F2UNdyEoplD1KIAVax3tpoNBie9BrYREya7GbaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:11:18.178500Z"},"content_sha256":"f2074a40feacbe3819b61ea58a0464f7d332cedb462b95b24e5be2bae8aea280","schema_version":"1.0","event_id":"sha256:f2074a40feacbe3819b61ea58a0464f7d332cedb462b95b24e5be2bae8aea280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BKO2CCLUYOXCE274CKZRED2VRP","target":"graph","payload":{"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"},"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-17T23:56:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mphiszwn7yqVvdMjoZ7xpiwaSJSwhE6zxjczXEv7EsZZz8azE32g4Vj1cxu7f9TQip9GGmPT79WvYuutKh53AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:11:18.179202Z"},"content_sha256":"c51324239cbf06f08b3b487030ae4fbcd45c12d7eb18e70ae188b9b9dabf7b89","schema_version":"1.0","event_id":"sha256:c51324239cbf06f08b3b487030ae4fbcd45c12d7eb18e70ae188b9b9dabf7b89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/bundle.json","state_url":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKO2CCLUYOXCE274CKZRED2VRP/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-06T13:11:18Z","links":{"resolver":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP","bundle":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/bundle.json","state":"https://pith.science/pith/BKO2CCLUYOXCE274CKZRED2VRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKO2CCLUYOXCE274CKZRED2VRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BKO2CCLUYOXCE274CKZRED2VRP","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":"dcf76e07e71da1bf67423cfed60e4e35761fa5766bcee2f2fa06d218da06b832","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:17:30Z","title_canon_sha256":"6b2aa715abf05bdf4e5a42323b50425f8f11a0bd55f24ab1cfbeab2d23024feb"},"schema_version":"1.0","source":{"id":"1708.02728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02728","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02728v2","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02728","created_at":"2026-05-17T23:56:15Z"},{"alias_kind":"pith_short_12","alias_value":"BKO2CCLUYOXC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKO2CCLUYOXCE274","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKO2CCLU","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c51324239cbf06f08b3b487030ae4fbcd45c12d7eb18e70ae188b9b9dabf7b89","target":"graph","created_at":"2026-05-17T23:56:15Z","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 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","authors_text":"Eric Price, Ilias Diakonikolas, John Peebles, Themis Gouleakis","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:17:30Z","title":"Optimal Identity Testing with High Probability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02728","kind":"arxiv","version":2},"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:f2074a40feacbe3819b61ea58a0464f7d332cedb462b95b24e5be2bae8aea280","target":"record","created_at":"2026-05-17T23:56:15Z","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":"dcf76e07e71da1bf67423cfed60e4e35761fa5766bcee2f2fa06d218da06b832","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:17:30Z","title_canon_sha256":"6b2aa715abf05bdf4e5a42323b50425f8f11a0bd55f24ab1cfbeab2d23024feb"},"schema_version":"1.0","source":{"id":"1708.02728","kind":"arxiv","version":2}},"canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a9da10974c3ae226bfc12b3120f558be58cdc087846dd86a80dca610b3ab4bb","first_computed_at":"2026-05-17T23:56:15.482990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:15.482990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fDTRO9AEn584cgMlFifL6byLNCBYMf7ODRkzvvnAkaegVTlxVT4pB0RRLuWHWHAOTmvetLkr03rA1GJf14V1Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:15.483593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2074a40feacbe3819b61ea58a0464f7d332cedb462b95b24e5be2bae8aea280","sha256:c51324239cbf06f08b3b487030ae4fbcd45c12d7eb18e70ae188b9b9dabf7b89"],"state_sha256":"19e471672d528807162e9f67a1b4fb99d8cc07f2a83ecea96c19d5cd6b5216f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9A0/i8L+Ty0irvprIPD5/+T3GhaCNYhwIrYK2vT5eTidVuZ5f+TvGaqeoWeygkdCnS/ofqgUSdn9wS4XUbkKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:11:18.182913Z","bundle_sha256":"6719c882e7587445be602775a33addb46ff9a70cc170ba5d6c7ec012ca8f9fbb"}}