{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JQZFJQGETDJ5PIMEIS2BOX3Z7I","short_pith_number":"pith:JQZFJQGE","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"},"canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","source":{"kind":"arxiv","id":"1112.5659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5659","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5659v1","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5659","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"JQZFJQGETDJ5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JQZFJQGETDJ5PIME","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JQZFJQGE","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JQZFJQGETDJ5PIMEIS2BOX3Z7I","target":"record","payload":{"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"},"canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","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"},"source_kind":"arxiv","source_id":"1112.5659","source_version":1,"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-18T04:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5QjKWHTkQN+xfr4/Ct3t/4MFqXb4UYBor0F1MFFo+eSJeUE+iibtIpazriosULx5YSbjoVOMWLmt91AtwkUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:59:38.379836Z"},"content_sha256":"173157e180f2c7284a25b2223a384ff97ab2564f2fa1a0baa9a39b2f4ce913e4","schema_version":"1.0","event_id":"sha256:173157e180f2c7284a25b2223a384ff97ab2564f2fa1a0baa9a39b2f4ce913e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JQZFJQGETDJ5PIMEIS2BOX3Z7I","target":"graph","payload":{"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"},"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-18T04:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1JHfn/TJcPNQ2dbvhVFTUj4nU22UaPqSCwd1rbK7WyhG7asf9Dfj5SlGHo4qDksnrXZMO59qXXnir2ZNvGoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:59:38.380186Z"},"content_sha256":"12879fc36d77ae0690eba10e8afcf54e0858d80bdcbf9ec572ef9fb0b73053e7","schema_version":"1.0","event_id":"sha256:12879fc36d77ae0690eba10e8afcf54e0858d80bdcbf9ec572ef9fb0b73053e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/bundle.json","state_url":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/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-05T10:59:38Z","links":{"resolver":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I","bundle":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/bundle.json","state":"https://pith.science/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQZFJQGETDJ5PIMEIS2BOX3Z7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JQZFJQGETDJ5PIMEIS2BOX3Z7I","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":"7d0ad53bd6f19c22eead4aa4612239d08ddffccb6be8fb34c9d39e0f11d1f727","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T20:50:05Z","title_canon_sha256":"65a40ad2eaa1ecdadd1532c16223d374b5f13f8ab809ef1786662a4e4ea7577c"},"schema_version":"1.0","source":{"id":"1112.5659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5659","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5659v1","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5659","created_at":"2026-05-18T04:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"JQZFJQGETDJ5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JQZFJQGETDJ5PIME","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JQZFJQGE","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:12879fc36d77ae0690eba10e8afcf54e0858d80bdcbf9ec572ef9fb0b73053e7","target":"graph","created_at":"2026-05-18T04:05:46Z","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 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 ","authors_text":"Constantinos Daskalakis, Gregory Valiant, Ilias Diakonikolas, Paul Valiant, Rocco A. Servedio","cross_cats":["math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T20:50:05Z","title":"Testing $k$-Modal Distributions: Optimal Algorithms via Reductions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5659","kind":"arxiv","version":1},"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:173157e180f2c7284a25b2223a384ff97ab2564f2fa1a0baa9a39b2f4ce913e4","target":"record","created_at":"2026-05-18T04:05:46Z","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":"7d0ad53bd6f19c22eead4aa4612239d08ddffccb6be8fb34c9d39e0f11d1f727","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T20:50:05Z","title_canon_sha256":"65a40ad2eaa1ecdadd1532c16223d374b5f13f8ab809ef1786662a4e4ea7577c"},"schema_version":"1.0","source":{"id":"1112.5659","kind":"arxiv","version":1}},"canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c3254c0c498d3d7a18444b4175f79fa03e76377bee7abd9b6fbe4d7a7103b2d","first_computed_at":"2026-05-18T04:05:46.334011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:46.334011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sB4651VuFj6g2YqYuBWVjFH9tR/kbgkVSsnwSGqIcUgB2sfnXMC4/HVEoOWa3tkETJEpu8Kp5eOC5DRroBF+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:46.334394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:173157e180f2c7284a25b2223a384ff97ab2564f2fa1a0baa9a39b2f4ce913e4","sha256:12879fc36d77ae0690eba10e8afcf54e0858d80bdcbf9ec572ef9fb0b73053e7"],"state_sha256":"4d2f5da94d0b40dd4b05362df15c324f557a344a4b1a971f0692196671fb90a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5a3hAJR6Nf9c07PsRRSgW22rE/L8hcPS/BnHAcr0B949k2KMBsJvmNCcdmsPNeFg/vmEwBcLbYGa8cHO1t9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:59:38.382060Z","bundle_sha256":"227fdd10a8f1d3ed7dc04a272ccd9dce1a742c3f298138b41c180b29d7cb3bc5"}}