{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LQZXIIGWU2PNSXX4TEARBVW5BB","short_pith_number":"pith:LQZXIIGW","schema_version":"1.0","canonical_sha256":"5c337420d6a69ed95efc990110d6dd08661d872876f7121b87b3253822c0bfe2","source":{"kind":"arxiv","id":"1304.0332","version":1},"attestation_state":"computed","paper":{"title":"Limit theorems for reflected Ornstein-Uhlenbeck processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gang Huang, Michel Mandjes, Peter Spreij","submitted_at":"2013-04-01T11:19:37Z","abstract_excerpt":"This paper studies one-dimensional Ornstein-Uhlenbeck processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (put at levels 0 and d>0). In the literature they are referred to as reflected OU (ROU) and doubly-reflected OU (DROU) respectively. For both cases, we explicitly determine the decay rates of the (transient) probability to reach a given extreme level. The methodology relies on sample-path large deviations, so that we also identify the associated most likely paths. For DROU, we also consider the `idleness process' $L_t$ "},"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":"1304.0332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-01T11:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"8c8fa720d4788721adff51c42b85ebaa01067aca2d3b218efeab71321e33f6d0","abstract_canon_sha256":"61ff0bf6521189ad51d3af27cd572d3f4d8d487c8c87ff60a5847e7aa902acb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.413859Z","signature_b64":"SHnF2tjBOF3ea2WYdc/aVeB+JhcX2bFp5vmik3IWuyK1iG69UuN0SACmhbl5GoNLZAqefLmMjfd7zNa/Yhg4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c337420d6a69ed95efc990110d6dd08661d872876f7121b87b3253822c0bfe2","last_reissued_at":"2026-05-18T02:48:27.413377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.413377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit theorems for reflected Ornstein-Uhlenbeck processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gang Huang, Michel Mandjes, Peter Spreij","submitted_at":"2013-04-01T11:19:37Z","abstract_excerpt":"This paper studies one-dimensional Ornstein-Uhlenbeck processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (put at levels 0 and d>0). In the literature they are referred to as reflected OU (ROU) and doubly-reflected OU (DROU) respectively. For both cases, we explicitly determine the decay rates of the (transient) probability to reach a given extreme level. The methodology relies on sample-path large deviations, so that we also identify the associated most likely paths. For DROU, we also consider the `idleness process' $L_t$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0332","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":"1304.0332","created_at":"2026-05-18T02:48:27.413433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0332v1","created_at":"2026-05-18T02:48:27.413433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0332","created_at":"2026-05-18T02:48:27.413433+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQZXIIGWU2PN","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQZXIIGWU2PNSXX4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQZXIIGW","created_at":"2026-05-18T12:27:51.066281+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/LQZXIIGWU2PNSXX4TEARBVW5BB","json":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB.json","graph_json":"https://pith.science/api/pith-number/LQZXIIGWU2PNSXX4TEARBVW5BB/graph.json","events_json":"https://pith.science/api/pith-number/LQZXIIGWU2PNSXX4TEARBVW5BB/events.json","paper":"https://pith.science/paper/LQZXIIGW"},"agent_actions":{"view_html":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB","download_json":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB.json","view_paper":"https://pith.science/paper/LQZXIIGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0332&json=true","fetch_graph":"https://pith.science/api/pith-number/LQZXIIGWU2PNSXX4TEARBVW5BB/graph.json","fetch_events":"https://pith.science/api/pith-number/LQZXIIGWU2PNSXX4TEARBVW5BB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB/action/storage_attestation","attest_author":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB/action/author_attestation","sign_citation":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB/action/citation_signature","submit_replication":"https://pith.science/pith/LQZXIIGWU2PNSXX4TEARBVW5BB/action/replication_record"}},"created_at":"2026-05-18T02:48:27.413433+00:00","updated_at":"2026-05-18T02:48:27.413433+00:00"}