{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OW6QKAPFVYNTCPZFDLNMFCGKUH","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":"5da58d93581f2d2fa7edbff6be27b25a779ef2e48249f96ce2462be55e732818","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":"2015-08-22T18:49:50Z","title_canon_sha256":"bd5793ad42f3d0e8e00af3c114c27181c379a750ad4231316f500b86a3b097ad"},"schema_version":"1.0","source":{"id":"1508.05538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05538","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05538v1","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05538","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"OW6QKAPFVYNT","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW6QKAPFVYNTCPZF","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW6QKAPF","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:6dd256e7d78c1979e23e0176a58c53fee166b1cf7a5ed5213699c877080d0f58","target":"graph","created_at":"2026-05-18T01:34:52Z","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 a general unified method that can be used for $L_1$ {\\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for testing the equivalence of two unknown (potentially arbitrary) univariate distributions under the $\\mathcal{A}_k$-distance metric: Given sample access to distributions with density functions $p, q: I \\to \\mathbb{R}$, we want to distinguish between the cases that $p=q$ and $\\|p-q\\|_{\\mathcal{A}_k} \\ge \\epsilon$ with probability at least $2/3$. We show that for ","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Vladimir Nikishkin","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":"2015-08-22T18:49:50Z","title":"Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05538","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:92c4f87e56374cf2c6d088386238363017d5a9075269c2118a5b2e308eb5937b","target":"record","created_at":"2026-05-18T01:34:52Z","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":"5da58d93581f2d2fa7edbff6be27b25a779ef2e48249f96ce2462be55e732818","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":"2015-08-22T18:49:50Z","title_canon_sha256":"bd5793ad42f3d0e8e00af3c114c27181c379a750ad4231316f500b86a3b097ad"},"schema_version":"1.0","source":{"id":"1508.05538","kind":"arxiv","version":1}},"canonical_sha256":"75bd0501e5ae1b313f251adac288caa1d490e56a521d15e4d75ffb911ca0c03e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75bd0501e5ae1b313f251adac288caa1d490e56a521d15e4d75ffb911ca0c03e","first_computed_at":"2026-05-18T01:34:52.243879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:52.243879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pX/OJ3vuU8VOV2VOa9u1rVgtAlY0YixyqB4FaE/gQ14MsMV13HsTdjD3TFxvbUs/BmNFMAB41S4wQKGOYZ25AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:52.244579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c4f87e56374cf2c6d088386238363017d5a9075269c2118a5b2e308eb5937b","sha256:6dd256e7d78c1979e23e0176a58c53fee166b1cf7a5ed5213699c877080d0f58"],"state_sha256":"326be791593f563d3f3e1bd6f63def7aeccdf7fb1e3125c3da30c418378c4a61"}