{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SG5CXRCG3BLPL7FDONHWBP5UYA","short_pith_number":"pith:SG5CXRCG","schema_version":"1.0","canonical_sha256":"91ba2bc446d856f5fca3734f60bfb4c007962fe1e0c38fa4112d30562c8ddc6b","source":{"kind":"arxiv","id":"1210.2314","version":2},"attestation_state":"computed","paper":{"title":"Clustering of Markov chain exceedances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"David Zeber, Sidney I. Resnick","submitted_at":"2012-10-08T15:43:19Z","abstract_excerpt":"The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes $\\{N_n,n\\geq1\\}$, consisting of normalized observations plotted against scaled time points. Under fairly general conditions on extremal behaviour, $\\{N_n\\}$ converges to a cluster Poisson process. Our technique decomposes the sample path of the chain into i.i.d. regenerative cycles rather than using blocking argument typically employed in the context of stationarity with mixing."},"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":"1210.2314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-10-08T15:43:19Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"98477c85af80f0b618d9a540cb963357534b80354261920c00294c6f89780ba4","abstract_canon_sha256":"17537f54d10babf8cb911157a7e8c931860757f71dfc79ff98a15923cc1702e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:57.972632Z","signature_b64":"hgyJXQk+TkVFv2nd/ix5KK6KKrMUHh5SkYiKIX29eH6nYZVnBgfNvme09C77bxSj14S28Jnjl8pL+gPHpHQSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ba2bc446d856f5fca3734f60bfb4c007962fe1e0c38fa4112d30562c8ddc6b","last_reissued_at":"2026-05-18T03:11:57.971998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:57.971998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering of Markov chain exceedances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"David Zeber, Sidney I. Resnick","submitted_at":"2012-10-08T15:43:19Z","abstract_excerpt":"The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes $\\{N_n,n\\geq1\\}$, consisting of normalized observations plotted against scaled time points. Under fairly general conditions on extremal behaviour, $\\{N_n\\}$ converges to a cluster Poisson process. Our technique decomposes the sample path of the chain into i.i.d. regenerative cycles rather than using blocking argument typically employed in the context of stationarity with mixing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2314","kind":"arxiv","version":2},"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":"1210.2314","created_at":"2026-05-18T03:11:57.972104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2314v2","created_at":"2026-05-18T03:11:57.972104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2314","created_at":"2026-05-18T03:11:57.972104+00:00"},{"alias_kind":"pith_short_12","alias_value":"SG5CXRCG3BLP","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SG5CXRCG3BLPL7FD","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SG5CXRCG","created_at":"2026-05-18T12:27:20.899486+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/SG5CXRCG3BLPL7FDONHWBP5UYA","json":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA.json","graph_json":"https://pith.science/api/pith-number/SG5CXRCG3BLPL7FDONHWBP5UYA/graph.json","events_json":"https://pith.science/api/pith-number/SG5CXRCG3BLPL7FDONHWBP5UYA/events.json","paper":"https://pith.science/paper/SG5CXRCG"},"agent_actions":{"view_html":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA","download_json":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA.json","view_paper":"https://pith.science/paper/SG5CXRCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2314&json=true","fetch_graph":"https://pith.science/api/pith-number/SG5CXRCG3BLPL7FDONHWBP5UYA/graph.json","fetch_events":"https://pith.science/api/pith-number/SG5CXRCG3BLPL7FDONHWBP5UYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA/action/storage_attestation","attest_author":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA/action/author_attestation","sign_citation":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA/action/citation_signature","submit_replication":"https://pith.science/pith/SG5CXRCG3BLPL7FDONHWBP5UYA/action/replication_record"}},"created_at":"2026-05-18T03:11:57.972104+00:00","updated_at":"2026-05-18T03:11:57.972104+00:00"}