{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:SORH2EHMHYXGLJK2XAPCA4XCJK","short_pith_number":"pith:SORH2EHM","schema_version":"1.0","canonical_sha256":"93a27d10ec3e2e65a55ab81e2072e24a8be6646ba92da5abb337aa7b1c423e3e","source":{"kind":"arxiv","id":"math/0303071","version":1},"attestation_state":"computed","paper":{"title":"Bernoulli Sieve","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Gnedin","submitted_at":"2003-03-05T22:14:35Z","abstract_excerpt":"Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component intervals of a stick-breaking interval partition of $[0,1]$. We exploit Markov property of the composition and its renewal representation to derive asymptotics of the moments and to prove a central limit theorem for the number of parts."},"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":"math/0303071","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2003-03-05T22:14:35Z","cross_cats_sorted":[],"title_canon_sha256":"c679bcccc949ccbfc66dd9539859b51d0087108970b77be1c9b6be9b64009ccc","abstract_canon_sha256":"c0cdb3b95b418e85cd281f8f527fcd1f8b9f230bae86994e90604cc8b3b948bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:32.726419Z","signature_b64":"iXp9I65kGXrmMSwWZ8+bX/PSCJrp4HGVEY7WmY6ojRVjFLHfB3i8m9PRrAJbdK1C96lu8l5tWj40KxQKK4aMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a27d10ec3e2e65a55ab81e2072e24a8be6646ba92da5abb337aa7b1c423e3e","last_reissued_at":"2026-05-18T02:41:32.725973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:32.725973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bernoulli Sieve","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Gnedin","submitted_at":"2003-03-05T22:14:35Z","abstract_excerpt":"Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component intervals of a stick-breaking interval partition of $[0,1]$. We exploit Markov property of the composition and its renewal representation to derive asymptotics of the moments and to prove a central limit theorem for the number of parts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0303071","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":"math/0303071","created_at":"2026-05-18T02:41:32.726051+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0303071v1","created_at":"2026-05-18T02:41:32.726051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0303071","created_at":"2026-05-18T02:41:32.726051+00:00"},{"alias_kind":"pith_short_12","alias_value":"SORH2EHMHYXG","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"SORH2EHMHYXGLJK2","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"SORH2EHM","created_at":"2026-05-18T12:25:52.051335+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/SORH2EHMHYXGLJK2XAPCA4XCJK","json":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK.json","graph_json":"https://pith.science/api/pith-number/SORH2EHMHYXGLJK2XAPCA4XCJK/graph.json","events_json":"https://pith.science/api/pith-number/SORH2EHMHYXGLJK2XAPCA4XCJK/events.json","paper":"https://pith.science/paper/SORH2EHM"},"agent_actions":{"view_html":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK","download_json":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK.json","view_paper":"https://pith.science/paper/SORH2EHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0303071&json=true","fetch_graph":"https://pith.science/api/pith-number/SORH2EHMHYXGLJK2XAPCA4XCJK/graph.json","fetch_events":"https://pith.science/api/pith-number/SORH2EHMHYXGLJK2XAPCA4XCJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK/action/storage_attestation","attest_author":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK/action/author_attestation","sign_citation":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK/action/citation_signature","submit_replication":"https://pith.science/pith/SORH2EHMHYXGLJK2XAPCA4XCJK/action/replication_record"}},"created_at":"2026-05-18T02:41:32.726051+00:00","updated_at":"2026-05-18T02:41:32.726051+00:00"}