{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7F5LBMF3FUKYAZUJ57TTRJBZOX","short_pith_number":"pith:7F5LBMF3","schema_version":"1.0","canonical_sha256":"f97ab0b0bb2d15806689efe738a43975eb91c929c101a85dd17a9989a00b05c9","source":{"kind":"arxiv","id":"1609.09238","version":1},"attestation_state":"computed","paper":{"title":"A law of the iterated logarithm for the number of occupied boxes in the Bernoulli sieve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Iksanov, Fethi Bouzeffour, Wissem Jedidi","submitted_at":"2016-09-29T07:45:05Z","abstract_excerpt":"The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the uniform sample. We prove a law of the iterated logarithm for the number of non-empty (occupied) intervals as the size of the uniform sample becomes large."},"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":"1609.09238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-29T07:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"bb36a6f8e043d0bd1b554b19810890c7af1c2ba5502fae0ffe9e15fce071cc36","abstract_canon_sha256":"718e5bdfad699e83ca895c8e0958b1e1f58ee2cd7f9a17d53510669b119d910a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:38.405408Z","signature_b64":"neqO9x/5ir74Z5PNpMd1bfzes/NWiNaqcx/hQN3nJAm96LLmov2gyLzSqtdiYGWuUy05dPMKCr0uZkqzUb3VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97ab0b0bb2d15806689efe738a43975eb91c929c101a85dd17a9989a00b05c9","last_reissued_at":"2026-05-18T01:03:38.404919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:38.404919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A law of the iterated logarithm for the number of occupied boxes in the Bernoulli sieve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Iksanov, Fethi Bouzeffour, Wissem Jedidi","submitted_at":"2016-09-29T07:45:05Z","abstract_excerpt":"The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the uniform sample. We prove a law of the iterated logarithm for the number of non-empty (occupied) intervals as the size of the uniform sample becomes large."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09238","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":"1609.09238","created_at":"2026-05-18T01:03:38.404987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09238v1","created_at":"2026-05-18T01:03:38.404987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09238","created_at":"2026-05-18T01:03:38.404987+00:00"},{"alias_kind":"pith_short_12","alias_value":"7F5LBMF3FUKY","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7F5LBMF3FUKYAZUJ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7F5LBMF3","created_at":"2026-05-18T12:30:04.600751+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/7F5LBMF3FUKYAZUJ57TTRJBZOX","json":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX.json","graph_json":"https://pith.science/api/pith-number/7F5LBMF3FUKYAZUJ57TTRJBZOX/graph.json","events_json":"https://pith.science/api/pith-number/7F5LBMF3FUKYAZUJ57TTRJBZOX/events.json","paper":"https://pith.science/paper/7F5LBMF3"},"agent_actions":{"view_html":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX","download_json":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX.json","view_paper":"https://pith.science/paper/7F5LBMF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09238&json=true","fetch_graph":"https://pith.science/api/pith-number/7F5LBMF3FUKYAZUJ57TTRJBZOX/graph.json","fetch_events":"https://pith.science/api/pith-number/7F5LBMF3FUKYAZUJ57TTRJBZOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX/action/storage_attestation","attest_author":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX/action/author_attestation","sign_citation":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX/action/citation_signature","submit_replication":"https://pith.science/pith/7F5LBMF3FUKYAZUJ57TTRJBZOX/action/replication_record"}},"created_at":"2026-05-18T01:03:38.404987+00:00","updated_at":"2026-05-18T01:03:38.404987+00:00"}