{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SKSNTVF3JNO7RVPPX2UGSOUPEF","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":"e1e7428df3b44c391564390d3a445472d03024455d6a5edc511686b849ea992a","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T01:24:01Z","title_canon_sha256":"860551075fcba15ef5dd720c3c5b701b7f2afc5da075773e1575e5d67f3cfaee"},"schema_version":"1.0","source":{"id":"2207.06596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.06596","created_at":"2026-07-05T04:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"2207.06596v1","created_at":"2026-07-05T04:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06596","created_at":"2026-07-05T04:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"SKSNTVF3JNO7","created_at":"2026-07-05T04:40:14Z"},{"alias_kind":"pith_short_16","alias_value":"SKSNTVF3JNO7RVPP","created_at":"2026-07-05T04:40:14Z"},{"alias_kind":"pith_short_8","alias_value":"SKSNTVF3","created_at":"2026-07-05T04:40:14Z"}],"graph_snapshots":[{"event_id":"sha256:0491c09c560a78c9c664c2e16be45f1e865dfeb4aa1dc1b7426e5f8fa9abbf41","target":"graph","created_at":"2026-07-05T04:40:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.06596/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the problem of testing whether a discrete probability distribution over an ordered domain is a histogram on a specified number of bins. One of the most common tools for the succinct approximation of data, $k$-histograms over $[n]$, are probability distributions that are piecewise constant over a set of $k$ intervals. The histogram testing problem is the following: Given samples from an unknown distribution $\\mathbf{p}$ on $[n]$, we want to distinguish between the cases that $\\mathbf{p}$ is a $k$-histogram versus $\\varepsilon$-far from any $k$-histogram, in total variation distan","authors_text":"Cl\\'ement L. Canonne, Daniel M. Kane, Ilias Diakonikolas, Sihan Liu","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T01:24:01Z","title":"Near-Optimal Bounds for Testing Histogram Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06596","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:f5a1949b75ee591687c5ec021542bda5191a5e863c6b762d31c51d49c861dd51","target":"record","created_at":"2026-07-05T04:40:14Z","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":"e1e7428df3b44c391564390d3a445472d03024455d6a5edc511686b849ea992a","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T01:24:01Z","title_canon_sha256":"860551075fcba15ef5dd720c3c5b701b7f2afc5da075773e1575e5d67f3cfaee"},"schema_version":"1.0","source":{"id":"2207.06596","kind":"arxiv","version":1}},"canonical_sha256":"92a4d9d4bb4b5df8d5efbea8693a8f214d2c9850da4bda8e945584f74b18c812","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92a4d9d4bb4b5df8d5efbea8693a8f214d2c9850da4bda8e945584f74b18c812","first_computed_at":"2026-07-05T04:40:14.556465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:40:14.556465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oOHEHTYYaPZe5BbkHPdBi3dlkZMEXqAA7l6lDd+9Jq6RvQaCdFBH8wvrGC28yzPJjamSghzdjV5YlXoPi3uRDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:40:14.557027Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.06596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5a1949b75ee591687c5ec021542bda5191a5e863c6b762d31c51d49c861dd51","sha256:0491c09c560a78c9c664c2e16be45f1e865dfeb4aa1dc1b7426e5f8fa9abbf41"],"state_sha256":"2d6456f8e6f28dd5010393e4e029d1ea9f2f6084d09953b5fa0828a4671362cb"}