{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5R3355SV3ZRXNDKLT4W7UMLTSI","short_pith_number":"pith:5R3355SV","schema_version":"1.0","canonical_sha256":"ec77bef655de63768d4b9f2dfa3173922542d95dfae439d47526e7e51fd6a520","source":{"kind":"arxiv","id":"1410.2266","version":1},"attestation_state":"computed","paper":{"title":"Testing Identity of Structured 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, Vladimir Nikishkin","submitted_at":"2014-10-08T20:31:20Z","abstract_excerpt":"We study the question of identity testing for structured distributions. More precisely, given samples from a {\\em structured} distribution $q$ over $[n]$ and an explicit distribution $p$ over $[n]$, we wish to distinguish whether $q=p$ versus $q$ is at least $\\epsilon$-far from $p$, in $L_1$ distance. In this work, we present a unified approach that yields new, simple testers, with sample complexity that is information-theoretically optimal, for broad classes of structured distributions, including $t$-flat distributions, $t$-modal distributions, log-concave distributions, monotone hazard rate "},"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":"1410.2266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-08T20:31:20Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"0475e39e4a4aaf5d5bde31fad55a8edfd75bf7472f84eafcc17cadac306960dd","abstract_canon_sha256":"f854075d788cfa01b6a0c519e6874723b3bcfffca2556780e4e754f2dcbfd226"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.811231Z","signature_b64":"XCaEveWZlLSiG4z81oTWo0OJYIZ7A2FYAkP6G9VL2UhORIYmgqFF9Aa7fhkYjDkFO5pjAMHmWRRe/9V9EdAYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec77bef655de63768d4b9f2dfa3173922542d95dfae439d47526e7e51fd6a520","last_reissued_at":"2026-05-18T02:40:46.810653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.810653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Identity of Structured 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, Vladimir Nikishkin","submitted_at":"2014-10-08T20:31:20Z","abstract_excerpt":"We study the question of identity testing for structured distributions. More precisely, given samples from a {\\em structured} distribution $q$ over $[n]$ and an explicit distribution $p$ over $[n]$, we wish to distinguish whether $q=p$ versus $q$ is at least $\\epsilon$-far from $p$, in $L_1$ distance. In this work, we present a unified approach that yields new, simple testers, with sample complexity that is information-theoretically optimal, for broad classes of structured distributions, including $t$-flat distributions, $t$-modal distributions, log-concave distributions, monotone hazard rate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2266","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2266","created_at":"2026-05-18T02:40:46.810735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2266v1","created_at":"2026-05-18T02:40:46.810735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2266","created_at":"2026-05-18T02:40:46.810735+00:00"},{"alias_kind":"pith_short_12","alias_value":"5R3355SV3ZRX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5R3355SV3ZRXNDKL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5R3355SV","created_at":"2026-05-18T12:28:14.216126+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/5R3355SV3ZRXNDKLT4W7UMLTSI","json":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI.json","graph_json":"https://pith.science/api/pith-number/5R3355SV3ZRXNDKLT4W7UMLTSI/graph.json","events_json":"https://pith.science/api/pith-number/5R3355SV3ZRXNDKLT4W7UMLTSI/events.json","paper":"https://pith.science/paper/5R3355SV"},"agent_actions":{"view_html":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI","download_json":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI.json","view_paper":"https://pith.science/paper/5R3355SV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2266&json=true","fetch_graph":"https://pith.science/api/pith-number/5R3355SV3ZRXNDKLT4W7UMLTSI/graph.json","fetch_events":"https://pith.science/api/pith-number/5R3355SV3ZRXNDKLT4W7UMLTSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI/action/storage_attestation","attest_author":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI/action/author_attestation","sign_citation":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI/action/citation_signature","submit_replication":"https://pith.science/pith/5R3355SV3ZRXNDKLT4W7UMLTSI/action/replication_record"}},"created_at":"2026-05-18T02:40:46.810735+00:00","updated_at":"2026-05-18T02:40:46.810735+00:00"}