{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NTFJIUZLMZC4EPYXBCR3SOGO57","short_pith_number":"pith:NTFJIUZL","canonical_record":{"source":{"id":"1705.00807","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-02T06:03:06Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"35d9ce080e09de991dbc1efab90a9b5a35cfdc37fa0e28dd8d36606aeabf761a","abstract_canon_sha256":"b7afc075b493c2c1b7e2896c2b2d39d28a0ca165b7064dd1b56e3439e002e603"},"schema_version":"1.0"},"canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","source":{"kind":"arxiv","id":"1705.00807","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00807","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00807v7","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00807","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"NTFJIUZLMZC4","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTFJIUZLMZC4EPYX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTFJIUZL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NTFJIUZLMZC4EPYXBCR3SOGO57","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00807","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-02T06:03:06Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"35d9ce080e09de991dbc1efab90a9b5a35cfdc37fa0e28dd8d36606aeabf761a","abstract_canon_sha256":"b7afc075b493c2c1b7e2896c2b2d39d28a0ca165b7064dd1b56e3439e002e603"},"schema_version":"1.0"},"canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:35.429938Z","signature_b64":"x0sQe0Wb5DC149cWj/RBvPNEYWWQ3ZJ5FGMCajzjQnT4wfG0iSYFVzAFGE0Te5Z/7bYT++03yG5bQ9qCZokBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","last_reissued_at":"2026-05-18T00:12:35.429348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:35.429348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00807","source_version":7,"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-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmItgnasigUM5Te+QWKDLQFHBYxld92C8bBvcpkDnCAml8TryV1ghHi0tmiEOONF82SF53hV7kbfGe+Mz2IPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:57.684619Z"},"content_sha256":"89ed9d863cc148739f76bc023c444616808efc94ca38911da5f9d73a605c1348","schema_version":"1.0","event_id":"sha256:89ed9d863cc148739f76bc023c444616808efc94ca38911da5f9d73a605c1348"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NTFJIUZLMZC4EPYXBCR3SOGO57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Estimation of the $L_1$ Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Jiantao Jiao, Tsachy Weissman, Yanjun Han","submitted_at":"2017-05-02T06:03:06Z","abstract_excerpt":"We consider the problem of estimating the $L_1$ distance between two discrete probability measures $P$ and $Q$ from empirical data in a nonasymptotic and large alphabet setting. When $Q$ is known and one obtains $n$ samples from $P$, we show that for every $Q$, the minimax rate-optimal estimator with $n$ samples achieves performance comparable to that of the maximum likelihood estimator (MLE) with $n\\ln n$ samples. When both $P$ and $Q$ are unknown, we construct minimax rate-optimal estimators whose worst case performance is essentially that of the known $Q$ case with $Q$ being uniform, implyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00807","kind":"arxiv","version":7},"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-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRqyrS3Vl07hCtOEfY2up+jnRtmXkOWn+fID5TCl+S/LXUc8HjnByzh6uN79Nw8BvP55Vsj2hZsDZfijaJ9aAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:57.685529Z"},"content_sha256":"126dd12275243c94d03a82be2d8688bc47662045458e89f24dbae486428dc4cd","schema_version":"1.0","event_id":"sha256:126dd12275243c94d03a82be2d8688bc47662045458e89f24dbae486428dc4cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/bundle.json","state_url":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/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-08-05T09:53:57Z","links":{"resolver":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57","bundle":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/bundle.json","state":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NTFJIUZLMZC4EPYXBCR3SOGO57","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":"b7afc075b493c2c1b7e2896c2b2d39d28a0ca165b7064dd1b56e3439e002e603","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-02T06:03:06Z","title_canon_sha256":"35d9ce080e09de991dbc1efab90a9b5a35cfdc37fa0e28dd8d36606aeabf761a"},"schema_version":"1.0","source":{"id":"1705.00807","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00807","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00807v7","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00807","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"NTFJIUZLMZC4","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTFJIUZLMZC4EPYX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTFJIUZL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:126dd12275243c94d03a82be2d8688bc47662045458e89f24dbae486428dc4cd","target":"graph","created_at":"2026-05-18T00:12:35Z","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 consider the problem of estimating the $L_1$ distance between two discrete probability measures $P$ and $Q$ from empirical data in a nonasymptotic and large alphabet setting. When $Q$ is known and one obtains $n$ samples from $P$, we show that for every $Q$, the minimax rate-optimal estimator with $n$ samples achieves performance comparable to that of the maximum likelihood estimator (MLE) with $n\\ln n$ samples. When both $P$ and $Q$ are unknown, we construct minimax rate-optimal estimators whose worst case performance is essentially that of the known $Q$ case with $Q$ being uniform, implyi","authors_text":"Jiantao Jiao, Tsachy Weissman, Yanjun Han","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-02T06:03:06Z","title":"Minimax Estimation of the $L_1$ Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00807","kind":"arxiv","version":7},"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:89ed9d863cc148739f76bc023c444616808efc94ca38911da5f9d73a605c1348","target":"record","created_at":"2026-05-18T00:12:35Z","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":"b7afc075b493c2c1b7e2896c2b2d39d28a0ca165b7064dd1b56e3439e002e603","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-02T06:03:06Z","title_canon_sha256":"35d9ce080e09de991dbc1efab90a9b5a35cfdc37fa0e28dd8d36606aeabf761a"},"schema_version":"1.0","source":{"id":"1705.00807","kind":"arxiv","version":7}},"canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","first_computed_at":"2026-05-18T00:12:35.429348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:35.429348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0sQe0Wb5DC149cWj/RBvPNEYWWQ3ZJ5FGMCajzjQnT4wfG0iSYFVzAFGE0Te5Z/7bYT++03yG5bQ9qCZokBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:35.429938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00807","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89ed9d863cc148739f76bc023c444616808efc94ca38911da5f9d73a605c1348","sha256:126dd12275243c94d03a82be2d8688bc47662045458e89f24dbae486428dc4cd"],"state_sha256":"2272b8976dd232870d62931f84010fc14b0f28fa9a188cf0c5d0a29b2948b9a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUZ4mH900Nn/FgTOW60bPCn7uAqjJkLCU5nUDkoJNhd2mDpOvJQ6J+zVyfGpKY1GmG7zFOizWW9yKfBAmMXgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:53:57.693201Z","bundle_sha256":"d86fcc64344505df09c856f80d338d3ddebd6e75c273c44d09a0a5e0639016ca"}}