{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BZC7KODIBUPVUSZMKZJGU35YP6","short_pith_number":"pith:BZC7KODI","canonical_record":{"source":{"id":"1504.01227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-06T07:42:31Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"784f25ab81d43adaf517a00c14c844b29cae50a802de852ce5151e9f34f64138","abstract_canon_sha256":"459bdfc50f714dde1a6e885e56b96dbaba2581cdfba87f6c3df43decc7583c60"},"schema_version":"1.0"},"canonical_sha256":"0e45f538680d1f5a4b2c56526a6fb87f88daae0cd72c2e7a46506f198c70a0b2","source":{"kind":"arxiv","id":"1504.01227","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01227","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01227v2","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01227","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"BZC7KODIBUPV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BZC7KODIBUPVUSZM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BZC7KODI","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BZC7KODIBUPVUSZMKZJGU35YP6","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-06T07:42:31Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"784f25ab81d43adaf517a00c14c844b29cae50a802de852ce5151e9f34f64138","abstract_canon_sha256":"459bdfc50f714dde1a6e885e56b96dbaba2581cdfba87f6c3df43decc7583c60"},"schema_version":"1.0"},"canonical_sha256":"0e45f538680d1f5a4b2c56526a6fb87f88daae0cd72c2e7a46506f198c70a0b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.788566Z","signature_b64":"yj0G80vfD5SQ8NndAuiPb3t88nLbeqOZeVGosomWlSsBwxR2XR4k6QJ8FqfkPvHxVSt1wYYoYi52gQhvWb15CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e45f538680d1f5a4b2c56526a6fb87f88daae0cd72c2e7a46506f198c70a0b2","last_reissued_at":"2026-05-18T00:55:25.787775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.787775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01227","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOuIW3s9ELrmOJPA6KjPgXLgwcVmZnGPEKttrGlSg+hYWYMPdFTIVn6JkYvizvSfp/TDR4VF1dj8j6aHVQnMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:32:42.867214Z"},"content_sha256":"4422cfd6c5063b3071ff7e9cf01311b7d21900373a61af6d12c92bc929cb8e63","schema_version":"1.0","event_id":"sha256:4422cfd6c5063b3071ff7e9cf01311b7d21900373a61af6d12c92bc929cb8e63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BZC7KODIBUPVUSZMKZJGU35YP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chebyshev polynomials, moment matching, and optimal estimation of the unseen","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pengkun Yang, Yihong Wu","submitted_at":"2015-04-06T07:42:31Z","abstract_excerpt":"We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \\frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample size to achieve an additive error of $\\epsilon k$ with probability at least 0.1 is within universal constant factors of $ \\frac{k}{\\log k}\\log^2\\frac{1}{\\epsilon} $, which improves the state-of-the-art result of $ \\frac{k}{\\epsilon^2 \\log k} $ in \\cite{VV13}. Similar characterization of the minimax risk is also obtained. Our procedure is a linear estimator base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01227","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sm3uS53WRSyS2Pud8x6QmrOUpG7GCCz+35IuPQB1gcs2QhifKzAcFZQARQ810ziCQXZxCDIuqYz0KreBe9l2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:32:42.867581Z"},"content_sha256":"38177bd933673b8aa157e2a1bd8728d81be60e2ad0eac6d6eabbb7abe615bc49","schema_version":"1.0","event_id":"sha256:38177bd933673b8aa157e2a1bd8728d81be60e2ad0eac6d6eabbb7abe615bc49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZC7KODIBUPVUSZMKZJGU35YP6/bundle.json","state_url":"https://pith.science/pith/BZC7KODIBUPVUSZMKZJGU35YP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZC7KODIBUPVUSZMKZJGU35YP6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T01:32:42Z","links":{"resolver":"https://pith.science/pith/BZC7KODIBUPVUSZMKZJGU35YP6","bundle":"https://pith.science/pith/BZC7KODIBUPVUSZMKZJGU35YP6/bundle.json","state":"https://pith.science/pith/BZC7KODIBUPVUSZMKZJGU35YP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZC7KODIBUPVUSZMKZJGU35YP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BZC7KODIBUPVUSZMKZJGU35YP6","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":"459bdfc50f714dde1a6e885e56b96dbaba2581cdfba87f6c3df43decc7583c60","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-06T07:42:31Z","title_canon_sha256":"784f25ab81d43adaf517a00c14c844b29cae50a802de852ce5151e9f34f64138"},"schema_version":"1.0","source":{"id":"1504.01227","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01227","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01227v2","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01227","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"BZC7KODIBUPV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BZC7KODIBUPVUSZM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BZC7KODI","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:38177bd933673b8aa157e2a1bd8728d81be60e2ad0eac6d6eabbb7abe615bc49","target":"graph","created_at":"2026-05-18T00:55:25Z","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 consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \\frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample size to achieve an additive error of $\\epsilon k$ with probability at least 0.1 is within universal constant factors of $ \\frac{k}{\\log k}\\log^2\\frac{1}{\\epsilon} $, which improves the state-of-the-art result of $ \\frac{k}{\\epsilon^2 \\log k} $ in \\cite{VV13}. Similar characterization of the minimax risk is also obtained. Our procedure is a linear estimator base","authors_text":"Pengkun Yang, Yihong Wu","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-06T07:42:31Z","title":"Chebyshev polynomials, moment matching, and optimal estimation of the unseen"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01227","kind":"arxiv","version":2},"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:4422cfd6c5063b3071ff7e9cf01311b7d21900373a61af6d12c92bc929cb8e63","target":"record","created_at":"2026-05-18T00:55:25Z","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":"459bdfc50f714dde1a6e885e56b96dbaba2581cdfba87f6c3df43decc7583c60","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-06T07:42:31Z","title_canon_sha256":"784f25ab81d43adaf517a00c14c844b29cae50a802de852ce5151e9f34f64138"},"schema_version":"1.0","source":{"id":"1504.01227","kind":"arxiv","version":2}},"canonical_sha256":"0e45f538680d1f5a4b2c56526a6fb87f88daae0cd72c2e7a46506f198c70a0b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e45f538680d1f5a4b2c56526a6fb87f88daae0cd72c2e7a46506f198c70a0b2","first_computed_at":"2026-05-18T00:55:25.787775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:25.787775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yj0G80vfD5SQ8NndAuiPb3t88nLbeqOZeVGosomWlSsBwxR2XR4k6QJ8FqfkPvHxVSt1wYYoYi52gQhvWb15CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:25.788566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01227","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4422cfd6c5063b3071ff7e9cf01311b7d21900373a61af6d12c92bc929cb8e63","sha256:38177bd933673b8aa157e2a1bd8728d81be60e2ad0eac6d6eabbb7abe615bc49"],"state_sha256":"a2607872796169d514ac120ce1db201cf2b0845c5068710dfafa42ab0dfec796"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PAFCPklCs+be8IidIiDa6hdq4cXat1il9iblaHV/qBVlV2o/+Hi85opjzNwbjjOOpsD/TvFsjnWqzSNruulKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:32:42.869717Z","bundle_sha256":"dfef096b11bcb2b0ee169cbf77c75d575eb64dc9d8128742eeeb88d1449fdb11"}}