{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NODKHXQ6PEPTNMVIZWGOCMLQYA","short_pith_number":"pith:NODKHXQ6","canonical_record":{"source":{"id":"1601.05557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-21T09:06:17Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"ee8c712fde87acdf172a6254530a155a323f394b4b3d4553a0fcc18b72900d50","abstract_canon_sha256":"194da631c0e02bff2c086001b16d9cae7eaa6cc7b2a958d118d83b26d0f19a6e"},"schema_version":"1.0"},"canonical_sha256":"6b86a3de1e791f36b2a8cd8ce13170c011abd52db6224720ec94d37f4b134131","source":{"kind":"arxiv","id":"1601.05557","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05557","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05557v2","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05557","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"NODKHXQ6PEPT","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NODKHXQ6PEPTNMVI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NODKHXQ6","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NODKHXQ6PEPTNMVIZWGOCMLQYA","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-21T09:06:17Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"ee8c712fde87acdf172a6254530a155a323f394b4b3d4553a0fcc18b72900d50","abstract_canon_sha256":"194da631c0e02bff2c086001b16d9cae7eaa6cc7b2a958d118d83b26d0f19a6e"},"schema_version":"1.0"},"canonical_sha256":"6b86a3de1e791f36b2a8cd8ce13170c011abd52db6224720ec94d37f4b134131","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:22.754688Z","signature_b64":"36rwYhylrFXlTACHjnZ7VRBvBoUjOOU3kiSKWkiWXX59ogUUJmWYhQbR3aOAreTkcexavvHHAIgL3kYd3KjTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b86a3de1e791f36b2a8cd8ce13170c011abd52db6224720ec94d37f4b134131","last_reissued_at":"2026-05-18T01:15:22.754022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:22.754022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05557","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-18T01:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JaBYdy7dGXRhoKeZrQbIAZB/b7a57LbUlZSKuig03GLCqSRS84HDkGRjPk+mHdbNjG7yKigoVYRPT9ccnrJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:15:41.949477Z"},"content_sha256":"a0535b0f547124308364c97066f7ff3c94d3dcf826f8982684629035f16d82ee","schema_version":"1.0","event_id":"sha256:a0535b0f547124308364c97066f7ff3c94d3dcf826f8982684629035f16d82ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NODKHXQ6PEPTNMVIZWGOCMLQYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Approach for Testing Properties of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2016-01-21T09:06:17Z","abstract_excerpt":"In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we resolve the sample complexity of a wide variety of testing problems.\n  Our upper bounds are obtained via a modular reduction-based approach. Our approach yields optimal testers for numerous problems by using a standard $\\ell_2$-identity tester as a black-box. Using this recipe, we obtain simple estimators for a wide range of problems, encompassing most problems p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05557","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-18T01:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMdN0pLj3l44ktPaVFTrbg6OQQqrfeXkcN7rs29wZ++RudGHQ0XlmrYz0nqiVL8vOT4UfNUdTgiD/Pt9jm4tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:15:41.949837Z"},"content_sha256":"d502c41926331270613f7eff98fe0ef8904233d1ae260cc90c9547582f36c170","schema_version":"1.0","event_id":"sha256:d502c41926331270613f7eff98fe0ef8904233d1ae260cc90c9547582f36c170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/bundle.json","state_url":"https://pith.science/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/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-05T12:15:41Z","links":{"resolver":"https://pith.science/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA","bundle":"https://pith.science/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/bundle.json","state":"https://pith.science/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NODKHXQ6PEPTNMVIZWGOCMLQYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NODKHXQ6PEPTNMVIZWGOCMLQYA","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":"194da631c0e02bff2c086001b16d9cae7eaa6cc7b2a958d118d83b26d0f19a6e","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-21T09:06:17Z","title_canon_sha256":"ee8c712fde87acdf172a6254530a155a323f394b4b3d4553a0fcc18b72900d50"},"schema_version":"1.0","source":{"id":"1601.05557","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05557","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05557v2","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05557","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"NODKHXQ6PEPT","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NODKHXQ6PEPTNMVI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NODKHXQ6","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d502c41926331270613f7eff98fe0ef8904233d1ae260cc90c9547582f36c170","target":"graph","created_at":"2026-05-18T01:15:22Z","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":"In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we resolve the sample complexity of a wide variety of testing problems.\n  Our upper bounds are obtained via a modular reduction-based approach. Our approach yields optimal testers for numerous problems by using a standard $\\ell_2$-identity tester as a black-box. Using this recipe, we obtain simple estimators for a wide range of problems, encompassing most problems p","authors_text":"Daniel M. Kane, Ilias Diakonikolas","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-21T09:06:17Z","title":"A New Approach for Testing Properties of Discrete Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05557","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:a0535b0f547124308364c97066f7ff3c94d3dcf826f8982684629035f16d82ee","target":"record","created_at":"2026-05-18T01:15:22Z","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":"194da631c0e02bff2c086001b16d9cae7eaa6cc7b2a958d118d83b26d0f19a6e","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-21T09:06:17Z","title_canon_sha256":"ee8c712fde87acdf172a6254530a155a323f394b4b3d4553a0fcc18b72900d50"},"schema_version":"1.0","source":{"id":"1601.05557","kind":"arxiv","version":2}},"canonical_sha256":"6b86a3de1e791f36b2a8cd8ce13170c011abd52db6224720ec94d37f4b134131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b86a3de1e791f36b2a8cd8ce13170c011abd52db6224720ec94d37f4b134131","first_computed_at":"2026-05-18T01:15:22.754022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:22.754022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36rwYhylrFXlTACHjnZ7VRBvBoUjOOU3kiSKWkiWXX59ogUUJmWYhQbR3aOAreTkcexavvHHAIgL3kYd3KjTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:22.754688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05557","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0535b0f547124308364c97066f7ff3c94d3dcf826f8982684629035f16d82ee","sha256:d502c41926331270613f7eff98fe0ef8904233d1ae260cc90c9547582f36c170"],"state_sha256":"6741c4b9eae27b36448b63998f5b6ad9b624dccf028833c2154223c05f9724ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rP7cPW0wYhxzqUh7YeRRqpaMv4bnhlJh/eOG/fmCF8np9Lr+ev8aNdwQJWxWDwyvltX+M2Igpu+O59ZRrZTICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:15:41.951847Z","bundle_sha256":"8c88c9e12b6c1116d583a7a22d85e85cb23e7b8a9dac030480e947d6e0bc9b94"}}