{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SKSNTVF3JNO7RVPPX2UGSOUPEF","short_pith_number":"pith:SKSNTVF3","schema_version":"1.0","canonical_sha256":"92a4d9d4bb4b5df8d5efbea8693a8f214d2c9850da4bda8e945584f74b18c812","source":{"kind":"arxiv","id":"2207.06596","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Bounds for Testing Histogram Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement L. Canonne, Daniel M. Kane, Ilias Diakonikolas, Sihan Liu","submitted_at":"2022-07-14T01:24:01Z","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"},"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":"2207.06596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T01:24:01Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"860551075fcba15ef5dd720c3c5b701b7f2afc5da075773e1575e5d67f3cfaee","abstract_canon_sha256":"e1e7428df3b44c391564390d3a445472d03024455d6a5edc511686b849ea992a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:14.557027Z","signature_b64":"oOHEHTYYaPZe5BbkHPdBi3dlkZMEXqAA7l6lDd+9Jq6RvQaCdFBH8wvrGC28yzPJjamSghzdjV5YlXoPi3uRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a4d9d4bb4b5df8d5efbea8693a8f214d2c9850da4bda8e945584f74b18c812","last_reissued_at":"2026-07-05T04:40:14.556465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:14.556465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Bounds for Testing Histogram Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement L. Canonne, Daniel M. Kane, Ilias Diakonikolas, Sihan Liu","submitted_at":"2022-07-14T01:24:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06596","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.06596/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.06596","created_at":"2026-07-05T04:40:14.556530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06596v1","created_at":"2026-07-05T04:40:14.556530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06596","created_at":"2026-07-05T04:40:14.556530+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKSNTVF3JNO7","created_at":"2026-07-05T04:40:14.556530+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKSNTVF3JNO7RVPP","created_at":"2026-07-05T04:40:14.556530+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKSNTVF3","created_at":"2026-07-05T04:40:14.556530+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/SKSNTVF3JNO7RVPPX2UGSOUPEF","json":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF.json","graph_json":"https://pith.science/api/pith-number/SKSNTVF3JNO7RVPPX2UGSOUPEF/graph.json","events_json":"https://pith.science/api/pith-number/SKSNTVF3JNO7RVPPX2UGSOUPEF/events.json","paper":"https://pith.science/paper/SKSNTVF3"},"agent_actions":{"view_html":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF","download_json":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF.json","view_paper":"https://pith.science/paper/SKSNTVF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06596&json=true","fetch_graph":"https://pith.science/api/pith-number/SKSNTVF3JNO7RVPPX2UGSOUPEF/graph.json","fetch_events":"https://pith.science/api/pith-number/SKSNTVF3JNO7RVPPX2UGSOUPEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF/action/storage_attestation","attest_author":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF/action/author_attestation","sign_citation":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF/action/citation_signature","submit_replication":"https://pith.science/pith/SKSNTVF3JNO7RVPPX2UGSOUPEF/action/replication_record"}},"created_at":"2026-07-05T04:40:14.556530+00:00","updated_at":"2026-07-05T04:40:14.556530+00:00"}