{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2J6L2ETEEMC7CP46KIDPJBUW26","short_pith_number":"pith:2J6L2ETE","canonical_record":{"source":{"id":"1601.06537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-25T10:00:30Z","cross_cats_sorted":["stat.AP","stat.TH"],"title_canon_sha256":"bb21f32da97a438da352814d842194a7e50147515eb5a21c6ba8a029f7c1e5a6","abstract_canon_sha256":"6a70982ab6d9a5630bee0c3087ea137129ec7f37d5b4d49359de95633ab0d7b4"},"schema_version":"1.0"},"canonical_sha256":"d27cbd12642305f13f9e5206f48696d7a012e4f81c84b755841f9144694cf08c","source":{"kind":"arxiv","id":"1601.06537","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06537","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06537v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06537","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"2J6L2ETEEMC7","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2J6L2ETEEMC7CP46","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2J6L2ETE","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2J6L2ETEEMC7CP46KIDPJBUW26","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-25T10:00:30Z","cross_cats_sorted":["stat.AP","stat.TH"],"title_canon_sha256":"bb21f32da97a438da352814d842194a7e50147515eb5a21c6ba8a029f7c1e5a6","abstract_canon_sha256":"6a70982ab6d9a5630bee0c3087ea137129ec7f37d5b4d49359de95633ab0d7b4"},"schema_version":"1.0"},"canonical_sha256":"d27cbd12642305f13f9e5206f48696d7a012e4f81c84b755841f9144694cf08c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.235530Z","signature_b64":"aoSEUIYMADYf3DgUbXmhdbhc4wKJz15vqyHWLt1TiiKr+AaKkGrd4qb2YBtJjjRunUc1oc2QGe9EdI7/5GMyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d27cbd12642305f13f9e5206f48696d7a012e4f81c84b755841f9144694cf08c","last_reissued_at":"2026-05-18T00:58:34.234882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.234882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06537","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLz+IlhGTBrK6o2alnQ0gwBeLx3egLzU/lKViopwRuaUitvF9dgThGEojXEMp2RQd+9+BkQsEkVNWltCI8DWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:27:23.482951Z"},"content_sha256":"4e6a8330ff4a72b118dba3a014d753da3c82ff536fe44ff49fc58cbd08df0bf0","schema_version":"1.0","event_id":"sha256:4e6a8330ff4a72b118dba3a014d753da3c82ff536fe44ff49fc58cbd08df0bf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2J6L2ETEEMC7CP46KIDPJBUW26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite sample properties of the mean occupancy counts and probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.TH"],"primary_cat":"math.ST","authors_text":"Geoffrey Decrouez, Michael Grabchak, Quentin Paris","submitted_at":"2016-01-25T10:00:30Z","abstract_excerpt":"For a probability distribution $P$ on an at most countable alphabet $\\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\\mathbb E K_{n,r}$ and probabilities $\\mathbb E M_{n,r}$. Both upper and lower bounds are given in terms of the counting function $\\nu$ of $P$. Special attention is given to the case where $\\nu$ is bounded by a regularly varying function. In this case, it is shown that our general results lead to an optimal-rate control of the expected occupancy counts and probabilities with explicit constants. Our results are also put in perspective with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06537","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZ+lV8bfy5MTuA6hldY2VJ5fEoL9BI2HGz3a2NTPf571tVoiFVLzWvbSiK52ttxIPthHEKOKv3zAb8YumR2EAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:27:23.483356Z"},"content_sha256":"e3febcd527241a90f1e6ccccdaa383af2405a6fc756d6220e155284f6ef43f66","schema_version":"1.0","event_id":"sha256:e3febcd527241a90f1e6ccccdaa383af2405a6fc756d6220e155284f6ef43f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2J6L2ETEEMC7CP46KIDPJBUW26/bundle.json","state_url":"https://pith.science/pith/2J6L2ETEEMC7CP46KIDPJBUW26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2J6L2ETEEMC7CP46KIDPJBUW26/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-11T08:27:23Z","links":{"resolver":"https://pith.science/pith/2J6L2ETEEMC7CP46KIDPJBUW26","bundle":"https://pith.science/pith/2J6L2ETEEMC7CP46KIDPJBUW26/bundle.json","state":"https://pith.science/pith/2J6L2ETEEMC7CP46KIDPJBUW26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2J6L2ETEEMC7CP46KIDPJBUW26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2J6L2ETEEMC7CP46KIDPJBUW26","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":"6a70982ab6d9a5630bee0c3087ea137129ec7f37d5b4d49359de95633ab0d7b4","cross_cats_sorted":["stat.AP","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-25T10:00:30Z","title_canon_sha256":"bb21f32da97a438da352814d842194a7e50147515eb5a21c6ba8a029f7c1e5a6"},"schema_version":"1.0","source":{"id":"1601.06537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06537","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06537v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06537","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"2J6L2ETEEMC7","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2J6L2ETEEMC7CP46","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2J6L2ETE","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:e3febcd527241a90f1e6ccccdaa383af2405a6fc756d6220e155284f6ef43f66","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"For a probability distribution $P$ on an at most countable alphabet $\\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\\mathbb E K_{n,r}$ and probabilities $\\mathbb E M_{n,r}$. Both upper and lower bounds are given in terms of the counting function $\\nu$ of $P$. Special attention is given to the case where $\\nu$ is bounded by a regularly varying function. In this case, it is shown that our general results lead to an optimal-rate control of the expected occupancy counts and probabilities with explicit constants. Our results are also put in perspective with ","authors_text":"Geoffrey Decrouez, Michael Grabchak, Quentin Paris","cross_cats":["stat.AP","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-25T10:00:30Z","title":"Finite sample properties of the mean occupancy counts and probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06537","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:4e6a8330ff4a72b118dba3a014d753da3c82ff536fe44ff49fc58cbd08df0bf0","target":"record","created_at":"2026-05-18T00:58:34Z","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":"6a70982ab6d9a5630bee0c3087ea137129ec7f37d5b4d49359de95633ab0d7b4","cross_cats_sorted":["stat.AP","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-25T10:00:30Z","title_canon_sha256":"bb21f32da97a438da352814d842194a7e50147515eb5a21c6ba8a029f7c1e5a6"},"schema_version":"1.0","source":{"id":"1601.06537","kind":"arxiv","version":2}},"canonical_sha256":"d27cbd12642305f13f9e5206f48696d7a012e4f81c84b755841f9144694cf08c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d27cbd12642305f13f9e5206f48696d7a012e4f81c84b755841f9144694cf08c","first_computed_at":"2026-05-18T00:58:34.234882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.234882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aoSEUIYMADYf3DgUbXmhdbhc4wKJz15vqyHWLt1TiiKr+AaKkGrd4qb2YBtJjjRunUc1oc2QGe9EdI7/5GMyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.235530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e6a8330ff4a72b118dba3a014d753da3c82ff536fe44ff49fc58cbd08df0bf0","sha256:e3febcd527241a90f1e6ccccdaa383af2405a6fc756d6220e155284f6ef43f66"],"state_sha256":"f94fa1ccf11b16230934972b48a9285dc274d9a385660f25fc76d38214746561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+z8tdsE1Ar0ivhnHLrrDIZi55Mkj6l0RSyzQj+KYaz2VeWhCzlaie2IuWI1Z/xOk9rTgWedQ0rEAaTillcbCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:27:23.485672Z","bundle_sha256":"0c1b8f95a7239692f7b7264763258f1850cbfba6677ebb713929697d072495a7"}}