{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HDFT3SUMFRBJQDPSZ4UIC2YUFV","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":"45b5b290b6a99e5ef01b3c31263270fdb3e65d12140604e721eb52b5d0c76d7e","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T01:32:24Z","title_canon_sha256":"3b0c22e4e61906f01f909e83a46edac72949bbdac616455b55951f5be976968c"},"schema_version":"1.0","source":{"id":"1202.1574","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1574","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1574v3","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1574","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"HDFT3SUMFRBJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HDFT3SUMFRBJQDPS","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HDFT3SUM","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:39f84e098517e732825454b720e6ce20614bb254d4099567e71293eba7859d10","target":"graph","created_at":"2026-05-18T01:17:05Z","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":"The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are observed. The distributions share an alphabet of size $m$, which is significantly larger than $n$ and $N$. How does $N,n,m$ affect the probability of classification error? We characterize the achievable error rate in a high-dimensional setting in which $N,n,m$ all tend to infinity, under the assumption that probability of any symbol is $O(m^{-1})$. The results a","authors_text":"Dayu Huang, Sean Meyn","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T01:32:24Z","title":"Classification with High-Dimensional Sparse Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1574","kind":"arxiv","version":3},"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:3cfd4b4ef26b73dc0990fa8c0f0af9dbb4429a8d5c85e0e740842d892e982768","target":"record","created_at":"2026-05-18T01:17:05Z","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":"45b5b290b6a99e5ef01b3c31263270fdb3e65d12140604e721eb52b5d0c76d7e","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T01:32:24Z","title_canon_sha256":"3b0c22e4e61906f01f909e83a46edac72949bbdac616455b55951f5be976968c"},"schema_version":"1.0","source":{"id":"1202.1574","kind":"arxiv","version":3}},"canonical_sha256":"38cb3dca8c2c42980df2cf28816b142d407f98a5cd8117e830ca689ce738a36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38cb3dca8c2c42980df2cf28816b142d407f98a5cd8117e830ca689ce738a36c","first_computed_at":"2026-05-18T01:17:05.919651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:05.919651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kwAPYzmtqYSkA4814OUuNB4DZ81qOmubKIvjVaK7kMHw479yj9pRKjX2i7JKY+AKCURPU+4LPK+esc3a0BiHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:05.920399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1574","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cfd4b4ef26b73dc0990fa8c0f0af9dbb4429a8d5c85e0e740842d892e982768","sha256:39f84e098517e732825454b720e6ce20614bb254d4099567e71293eba7859d10"],"state_sha256":"9458d7c359efd738e96bcb9c66dba0de798d21907960720182c88a374db6b79c"}