{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JQZFJQGETDJ5PIMEIS2BOX3Z7I","short_pith_number":"pith:JQZFJQGE","schema_version":"1.0","canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","source":{"kind":"arxiv","id":"1112.5659","version":1},"attestation_state":"computed","paper":{"title":"Testing $k$-Modal Distributions: Optimal Algorithms via Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Constantinos Daskalakis, Gregory Valiant, Ilias Diakonikolas, Paul Valiant, Rocco A. Servedio","submitted_at":"2011-12-23T20:50:05Z","abstract_excerpt":"We give highly efficient algorithms, and almost matching lower bounds, for a range of basic statistical problems that involve testing and estimating the L_1 distance between two k-modal distributions $p$ and $q$ over the discrete domain $\\{1,\\dots,n\\}$. More precisely, we consider the following four problems: given sample access to an unknown k-modal distribution $p$,\n  Testing identity to a known or unknown distribution:\n  1. Determine whether $p = q$ (for an explicitly given k-modal distribution $q$) versus $p$ is $\\eps$-far from $q$;\n  2. Determine whether $p=q$ (where $q$ is available via "},"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":"1112.5659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T20:50:05Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"65a40ad2eaa1ecdadd1532c16223d374b5f13f8ab809ef1786662a4e4ea7577c","abstract_canon_sha256":"7d0ad53bd6f19c22eead4aa4612239d08ddffccb6be8fb34c9d39e0f11d1f727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:46.334394Z","signature_b64":"sB4651VuFj6g2YqYuBWVjFH9tR/kbgkVSsnwSGqIcUgB2sfnXMC4/HVEoOWa3tkETJEpu8Kp5eOC5DRroBF+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","last_reissued_at":"2026-05-18T04:05:46.334011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:46.334011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing $k$-Modal Distributions: Optimal Algorithms via Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Constantinos Daskalakis, Gregory Valiant, Ilias Diakonikolas, Paul Valiant, Rocco A. Servedio","submitted_at":"2011-12-23T20:50:05Z","abstract_excerpt":"We give highly efficient algorithms, and almost matching lower bounds, for a range of basic statistical problems that involve testing and estimating the L_1 distance between two k-modal distributions $p$ and $q$ over the discrete domain $\\{1,\\dots,n\\}$. More precisely, we consider the following four problems: given sample access to an unknown k-modal distribution $p$,\n  Testing identity to a known or unknown distribution:\n  1. Determine whether $p = q$ (for an explicitly given k-modal distribution $q$) versus $p$ is $\\eps$-far from $q$;\n  2. Determine whether $p=q$ (where $q$ is available via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5659","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":"1112.5659","created_at":"2026-05-18T04:05:46.334068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5659v1","created_at":"2026-05-18T04:05:46.334068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5659","created_at":"2026-05-18T04:05:46.334068+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQZFJQGETDJ5","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQZFJQGETDJ5PIME","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQZFJQGE","created_at":"2026-05-18T12:26:32.869790+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/JQZFJQGETDJ5PIMEIS2BOX3Z7I","json":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I.json","graph_json":"https://pith.science/api/pith-number/JQZFJQGETDJ5PIMEIS2BOX3Z7I/graph.json","events_json":"https://pith.science/api/pith-number/JQZFJQGETDJ5PIMEIS2BOX3Z7I/events.json","paper":"https://pith.science/paper/JQZFJQGE"},"agent_actions":{"view_html":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I","download_json":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I.json","view_paper":"https://pith.science/paper/JQZFJQGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5659&json=true","fetch_graph":"https://pith.science/api/pith-number/JQZFJQGETDJ5PIMEIS2BOX3Z7I/graph.json","fetch_events":"https://pith.science/api/pith-number/JQZFJQGETDJ5PIMEIS2BOX3Z7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/action/storage_attestation","attest_author":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/action/author_attestation","sign_citation":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/action/citation_signature","submit_replication":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/action/replication_record"}},"created_at":"2026-05-18T04:05:46.334068+00:00","updated_at":"2026-05-18T04:05:46.334068+00:00"}