{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:PKGD7LL5PRFVX345HHJH5LCGWI","short_pith_number":"pith:PKGD7LL5","schema_version":"1.0","canonical_sha256":"7a8c3fad7d7c4b5bef9d39d27eac46b2352b613019d78fa7872bc6f63d11a944","source":{"kind":"arxiv","id":"0704.0398","version":1},"attestation_state":"computed","paper":{"title":"Renewals for exponentially increasing lifetimes, with an application to digital search trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Florian Dennert, Rudolf Gr\\\"ubel","submitted_at":"2007-04-03T13:57:00Z","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."},"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":"0704.0398","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2007-04-03T13:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"63eac81a916b7e3ac1858aae32f8d11d5a2bc56363eedd55206b0472cc321c03","abstract_canon_sha256":"5789040fd4ab40e780855dc4dbd92b6998e81f8c0ae248dc791e279b070b1874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:24.961226Z","signature_b64":"vk3u4zqt8WFULxphSW07GYyVlSpzOZmAwk0VTEIb2HvwIg/femd2DSO5W+JWXVnWY8fBdDGsvbE7Fz6fjwnHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a8c3fad7d7c4b5bef9d39d27eac46b2352b613019d78fa7872bc6f63d11a944","last_reissued_at":"2026-05-18T01:09:24.960503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:24.960503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Renewals for exponentially increasing lifetimes, with an application to digital search trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Florian Dennert, Rudolf Gr\\\"ubel","submitted_at":"2007-04-03T13:57:00Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.0398","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":"0704.0398","created_at":"2026-05-18T01:09:24.960615+00:00"},{"alias_kind":"arxiv_version","alias_value":"0704.0398v1","created_at":"2026-05-18T01:09:24.960615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.0398","created_at":"2026-05-18T01:09:24.960615+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKGD7LL5PRFV","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKGD7LL5PRFVX345","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKGD7LL5","created_at":"2026-05-18T12:25:55.427421+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/PKGD7LL5PRFVX345HHJH5LCGWI","json":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI.json","graph_json":"https://pith.science/api/pith-number/PKGD7LL5PRFVX345HHJH5LCGWI/graph.json","events_json":"https://pith.science/api/pith-number/PKGD7LL5PRFVX345HHJH5LCGWI/events.json","paper":"https://pith.science/paper/PKGD7LL5"},"agent_actions":{"view_html":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI","download_json":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI.json","view_paper":"https://pith.science/paper/PKGD7LL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0704.0398&json=true","fetch_graph":"https://pith.science/api/pith-number/PKGD7LL5PRFVX345HHJH5LCGWI/graph.json","fetch_events":"https://pith.science/api/pith-number/PKGD7LL5PRFVX345HHJH5LCGWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI/action/storage_attestation","attest_author":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI/action/author_attestation","sign_citation":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI/action/citation_signature","submit_replication":"https://pith.science/pith/PKGD7LL5PRFVX345HHJH5LCGWI/action/replication_record"}},"created_at":"2026-05-18T01:09:24.960615+00:00","updated_at":"2026-05-18T01:09:24.960615+00:00"}