{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NTFJIUZLMZC4EPYXBCR3SOGO57","short_pith_number":"pith:NTFJIUZL","schema_version":"1.0","canonical_sha256":"6cca94532b6645c23f1708a3b938ceefc91dd30955861606bbf40fb130006af8","source":{"kind":"arxiv","id":"1705.00807","version":7},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.00807","created_at":"2026-05-18T00:12:35.429430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00807v7","created_at":"2026-05-18T00:12:35.429430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00807","created_at":"2026-05-18T00:12:35.429430+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTFJIUZLMZC4","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTFJIUZLMZC4EPYX","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTFJIUZL","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.03905","citing_title":"On estimating operator norm distance, with optimal trace distance estimation when one state is pure","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57","json":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57.json","graph_json":"https://pith.science/api/pith-number/NTFJIUZLMZC4EPYXBCR3SOGO57/graph.json","events_json":"https://pith.science/api/pith-number/NTFJIUZLMZC4EPYXBCR3SOGO57/events.json","paper":"https://pith.science/paper/NTFJIUZL"},"agent_actions":{"view_html":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57","download_json":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57.json","view_paper":"https://pith.science/paper/NTFJIUZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00807&json=true","fetch_graph":"https://pith.science/api/pith-number/NTFJIUZLMZC4EPYXBCR3SOGO57/graph.json","fetch_events":"https://pith.science/api/pith-number/NTFJIUZLMZC4EPYXBCR3SOGO57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/action/storage_attestation","attest_author":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/action/author_attestation","sign_citation":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/action/citation_signature","submit_replication":"https://pith.science/pith/NTFJIUZLMZC4EPYXBCR3SOGO57/action/replication_record"}},"created_at":"2026-05-18T00:12:35.429430+00:00","updated_at":"2026-05-18T00:12:35.429430+00:00"}