{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:PKGD7LL5PRFVX345HHJH5LCGWI","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":"5789040fd4ab40e780855dc4dbd92b6998e81f8c0ae248dc791e279b070b1874","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2007-04-03T13:57:00Z","title_canon_sha256":"63eac81a916b7e3ac1858aae32f8d11d5a2bc56363eedd55206b0472cc321c03"},"schema_version":"1.0","source":{"id":"0704.0398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.0398","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"0704.0398v1","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.0398","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"PKGD7LL5PRFV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PKGD7LL5PRFVX345","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PKGD7LL5","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:7b349278eddce80e86901c46051d1edc6432e2c98f30837fc5fa960f2635f6e4","target":"graph","created_at":"2026-05-18T01:09:24Z","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 show that the number of renewals up to time $t$ exhibits distributional fluctuations as $t\\to\\infty$ if the underlying lifetimes increase at an exponential rate in a distributional sense. This provides a probabilistic explanation for the asymptotics of insertion depth in random trees generated by a bit-comparison strategy from uniform input; we also obtain a representation for the resulting family of limit laws along subsequences. Our approach can also be used to obtain rates of convergence.","authors_text":"Florian Dennert, Rudolf Gr\\\"ubel","cross_cats":[],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2007-04-03T13:57:00Z","title":"Renewals for exponentially increasing lifetimes, with an application to digital search trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.0398","kind":"arxiv","version":1},"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:bf5eac8e7d8cde9ba9a9a51bc48a850088e1171e3e58a962ec26942571ef9c1a","target":"record","created_at":"2026-05-18T01:09:24Z","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":"5789040fd4ab40e780855dc4dbd92b6998e81f8c0ae248dc791e279b070b1874","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2007-04-03T13:57:00Z","title_canon_sha256":"63eac81a916b7e3ac1858aae32f8d11d5a2bc56363eedd55206b0472cc321c03"},"schema_version":"1.0","source":{"id":"0704.0398","kind":"arxiv","version":1}},"canonical_sha256":"7a8c3fad7d7c4b5bef9d39d27eac46b2352b613019d78fa7872bc6f63d11a944","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a8c3fad7d7c4b5bef9d39d27eac46b2352b613019d78fa7872bc6f63d11a944","first_computed_at":"2026-05-18T01:09:24.960503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:24.960503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vk3u4zqt8WFULxphSW07GYyVlSpzOZmAwk0VTEIb2HvwIg/femd2DSO5W+JWXVnWY8fBdDGsvbE7Fz6fjwnHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:24.961226Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.0398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf5eac8e7d8cde9ba9a9a51bc48a850088e1171e3e58a962ec26942571ef9c1a","sha256:7b349278eddce80e86901c46051d1edc6432e2c98f30837fc5fa960f2635f6e4"],"state_sha256":"7b67aa3846bd837f9b86f645f1ac4a62b73cc70357cbd022f896ca0bce69940e"}