{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:AR7YLKBJMBPV6TUT3QKWWQOLUF","short_pith_number":"pith:AR7YLKBJ","schema_version":"1.0","canonical_sha256":"047f85a829605f5f4e93dc156b41cba1672eac435a488b1405a9bbc6eb9adb24","source":{"kind":"arxiv","id":"math/0508461","version":1},"attestation_state":"computed","paper":{"title":"The probability of exceeding a high boundary on a random time interval for a heavy-tailed random walk","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sergey Foss, Stan Zachary, Zbigniew Palmowski","submitted_at":"2005-08-24T13:34:15Z","abstract_excerpt":"We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely general stopping times, uniformity of convergence over all stopping times and a wide class of nonlinear boundaries. We also give some examples and counterexamples."},"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/0508461","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-08-24T13:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"8dcd64f63097a7de66cad5f1a69511d946870f542b312009276091493a9775c6","abstract_canon_sha256":"da9513093737d61c4278dbd5f4fd643b7421532040dbf27a3953f65bef603531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.987730Z","signature_b64":"0IQpKXoJqf9xZLDCchMmm3aEvO0S0BgxQdI5lGpBud31N30i//Y+u17ONiYrLaM//ASKJggySA0tOoQ9jaJBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047f85a829605f5f4e93dc156b41cba1672eac435a488b1405a9bbc6eb9adb24","last_reissued_at":"2026-05-18T00:29:21.987063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.987063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The probability of exceeding a high boundary on a random time interval for a heavy-tailed random walk","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sergey Foss, Stan Zachary, Zbigniew Palmowski","submitted_at":"2005-08-24T13:34:15Z","abstract_excerpt":"We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely general stopping times, uniformity of convergence over all stopping times and a wide class of nonlinear boundaries. We also give some examples and counterexamples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508461","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/0508461","created_at":"2026-05-18T00:29:21.987171+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0508461v1","created_at":"2026-05-18T00:29:21.987171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508461","created_at":"2026-05-18T00:29:21.987171+00:00"},{"alias_kind":"pith_short_12","alias_value":"AR7YLKBJMBPV","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"AR7YLKBJMBPV6TUT","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"AR7YLKBJ","created_at":"2026-05-18T12:25:53.335082+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/AR7YLKBJMBPV6TUT3QKWWQOLUF","json":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF.json","graph_json":"https://pith.science/api/pith-number/AR7YLKBJMBPV6TUT3QKWWQOLUF/graph.json","events_json":"https://pith.science/api/pith-number/AR7YLKBJMBPV6TUT3QKWWQOLUF/events.json","paper":"https://pith.science/paper/AR7YLKBJ"},"agent_actions":{"view_html":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF","download_json":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF.json","view_paper":"https://pith.science/paper/AR7YLKBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0508461&json=true","fetch_graph":"https://pith.science/api/pith-number/AR7YLKBJMBPV6TUT3QKWWQOLUF/graph.json","fetch_events":"https://pith.science/api/pith-number/AR7YLKBJMBPV6TUT3QKWWQOLUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF/action/storage_attestation","attest_author":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF/action/author_attestation","sign_citation":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF/action/citation_signature","submit_replication":"https://pith.science/pith/AR7YLKBJMBPV6TUT3QKWWQOLUF/action/replication_record"}},"created_at":"2026-05-18T00:29:21.987171+00:00","updated_at":"2026-05-18T00:29:21.987171+00:00"}