{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GKBPAZL7CCK4UBOTQQ7G5TATUT","short_pith_number":"pith:GKBPAZL7","schema_version":"1.0","canonical_sha256":"3282f0657f1095ca05d3843e6ecc13a4c0bf246212ff753a6f3794ad241cf79e","source":{"kind":"arxiv","id":"1310.1737","version":4},"attestation_state":"computed","paper":{"title":"Markov chain approximations to scale functions of L\\'evy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aleksandar Mijatovi\\'c, Matija Vidmar, Saul Jacka","submitted_at":"2013-10-07T11:43:50Z","abstract_excerpt":"We introduce a general algorithm for the computation of the scale functions of a spectrally negative L\\'evy process $X$, based on a natural weak approximation of $X$ via upwards skip-free continuous-time Markov chains with stationary independent increments. The algorithm consists of evaluating a finite linear recursion with its (nonnegative) coefficients given explicitly in terms of the L\\'evy triplet of $X$. Thus it is easy to implement and numerically stable. Our main result establishes sharp rates of convergence of this algorithm providing an explicit link between the semimartingale charact"},"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":"1310.1737","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-07T11:43:50Z","cross_cats_sorted":[],"title_canon_sha256":"ee97022f6b1b5294216e81a7a0d77a241e0193c2974286c05db3cba5b78548ae","abstract_canon_sha256":"9bd0d48b121892e1bcafe0dfaba37199d5baafef5ec91d1ec6d4a51b526b3801"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.962794Z","signature_b64":"19x4z6kyvgC9OPq4G5iyL+LDTkDfs+Rk1fO77z8dy2M1tqZliNxLf4yPg9mKC5WnBr2bTuIN3XeBhi+8k+uTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3282f0657f1095ca05d3843e6ecc13a4c0bf246212ff753a6f3794ad241cf79e","last_reissued_at":"2026-05-18T02:18:23.961922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.961922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov chain approximations to scale functions of L\\'evy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aleksandar Mijatovi\\'c, Matija Vidmar, Saul Jacka","submitted_at":"2013-10-07T11:43:50Z","abstract_excerpt":"We introduce a general algorithm for the computation of the scale functions of a spectrally negative L\\'evy process $X$, based on a natural weak approximation of $X$ via upwards skip-free continuous-time Markov chains with stationary independent increments. The algorithm consists of evaluating a finite linear recursion with its (nonnegative) coefficients given explicitly in terms of the L\\'evy triplet of $X$. Thus it is easy to implement and numerically stable. Our main result establishes sharp rates of convergence of this algorithm providing an explicit link between the semimartingale charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1737","kind":"arxiv","version":4},"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":"1310.1737","created_at":"2026-05-18T02:18:23.962078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1737v4","created_at":"2026-05-18T02:18:23.962078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1737","created_at":"2026-05-18T02:18:23.962078+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKBPAZL7CCK4","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKBPAZL7CCK4UBOT","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKBPAZL7","created_at":"2026-05-18T12:27:45.050594+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/GKBPAZL7CCK4UBOTQQ7G5TATUT","json":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT.json","graph_json":"https://pith.science/api/pith-number/GKBPAZL7CCK4UBOTQQ7G5TATUT/graph.json","events_json":"https://pith.science/api/pith-number/GKBPAZL7CCK4UBOTQQ7G5TATUT/events.json","paper":"https://pith.science/paper/GKBPAZL7"},"agent_actions":{"view_html":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT","download_json":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT.json","view_paper":"https://pith.science/paper/GKBPAZL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1737&json=true","fetch_graph":"https://pith.science/api/pith-number/GKBPAZL7CCK4UBOTQQ7G5TATUT/graph.json","fetch_events":"https://pith.science/api/pith-number/GKBPAZL7CCK4UBOTQQ7G5TATUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT/action/storage_attestation","attest_author":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT/action/author_attestation","sign_citation":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT/action/citation_signature","submit_replication":"https://pith.science/pith/GKBPAZL7CCK4UBOTQQ7G5TATUT/action/replication_record"}},"created_at":"2026-05-18T02:18:23.962078+00:00","updated_at":"2026-05-18T02:18:23.962078+00:00"}