{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L2DQAF2YKREPVLA4H4JYUS43HE","short_pith_number":"pith:L2DQAF2Y","canonical_record":{"source":{"id":"1608.05175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-18T05:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"f7445cd3b77c3c84ac414c81064598a64bdfe9798a5180174cf25a44a7e52b55","abstract_canon_sha256":"7d2c9737535abf31951050fdd83898aa0575fc0dac72a20d00de7a1b24e1a311"},"schema_version":"1.0"},"canonical_sha256":"5e870017585448faac1c3f138a4b9b39289e3b4ef9dd97d0b385635609a00036","source":{"kind":"arxiv","id":"1608.05175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05175","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05175v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05175","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"L2DQAF2YKREP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2DQAF2YKREPVLA4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2DQAF2Y","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L2DQAF2YKREPVLA4H4JYUS43HE","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-18T05:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"f7445cd3b77c3c84ac414c81064598a64bdfe9798a5180174cf25a44a7e52b55","abstract_canon_sha256":"7d2c9737535abf31951050fdd83898aa0575fc0dac72a20d00de7a1b24e1a311"},"schema_version":"1.0"},"canonical_sha256":"5e870017585448faac1c3f138a4b9b39289e3b4ef9dd97d0b385635609a00036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:31.724892Z","signature_b64":"FQX8jWMFIyAM0TAAuz2eDg5nK5tlYoS553TqXh2I6Bzoj+vlwvoA7QC9QVk7tT9/C8bnVi1emhj3jjWPN0v1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e870017585448faac1c3f138a4b9b39289e3b4ef9dd97d0b385635609a00036","last_reissued_at":"2026-05-18T01:08:31.724354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:31.724354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05175","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPEU3Sh77T5ZIVxs+A0QAN0y1gF6gdavtYW04VLbMr2RdX9IRacaTF1h9g92vi+GcyGRn/UXFhrDJJm6L0zgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:27.706188Z"},"content_sha256":"93d04f3d6c9abc6b477f84285553ed1a270759c5284068ee70511016b777b84a","schema_version":"1.0","event_id":"sha256:93d04f3d6c9abc6b477f84285553ed1a270759c5284068ee70511016b777b84a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L2DQAF2YKREPVLA4H4JYUS43HE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large excursions and conditioned laws for recursive sequences generated by random matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jeffrey F. Collamore, Sebastian Mentemeier","submitted_at":"2016-08-18T05:01:26Z","abstract_excerpt":"We determine the large exceedance probabilities and large exceedance paths for the matrix recursive sequence $V_n = M_n V_{n-1} + Q_n, \\: n=1,2,\\ldots,$ where $\\{M_n\\}$ is an i.i.d. sequence of $d \\times d$ random matrices and $\\{ Q_n\\}$ is an i.i.d. sequence of random vectors, both with nonnegative entries. Early work on this problem dates to Kesten's (1973) seminal paper, motivated by an application to multi-type branching processes. Other applications arise in financial time series modeling (connected to the study of the GARCH($p,q$) processes) and in physics, and this recursive sequence ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05175","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guTviFygydnhRVCBMz+L3OzPFngmi/SzxYcXkbvxdrbEx+6UEuHpbrt+2f33SxR7cQtzqzcm5ubl+vdb1piqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:27.706902Z"},"content_sha256":"2d260d79e3b87237755a494852376d193a2ec48e1d1b87202e8902325ef6514d","schema_version":"1.0","event_id":"sha256:2d260d79e3b87237755a494852376d193a2ec48e1d1b87202e8902325ef6514d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2DQAF2YKREPVLA4H4JYUS43HE/bundle.json","state_url":"https://pith.science/pith/L2DQAF2YKREPVLA4H4JYUS43HE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2DQAF2YKREPVLA4H4JYUS43HE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T17:22:27Z","links":{"resolver":"https://pith.science/pith/L2DQAF2YKREPVLA4H4JYUS43HE","bundle":"https://pith.science/pith/L2DQAF2YKREPVLA4H4JYUS43HE/bundle.json","state":"https://pith.science/pith/L2DQAF2YKREPVLA4H4JYUS43HE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2DQAF2YKREPVLA4H4JYUS43HE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L2DQAF2YKREPVLA4H4JYUS43HE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d2c9737535abf31951050fdd83898aa0575fc0dac72a20d00de7a1b24e1a311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-18T05:01:26Z","title_canon_sha256":"f7445cd3b77c3c84ac414c81064598a64bdfe9798a5180174cf25a44a7e52b55"},"schema_version":"1.0","source":{"id":"1608.05175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05175","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05175v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05175","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"L2DQAF2YKREP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2DQAF2YKREPVLA4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2DQAF2Y","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:2d260d79e3b87237755a494852376d193a2ec48e1d1b87202e8902325ef6514d","target":"graph","created_at":"2026-05-18T01:08:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We determine the large exceedance probabilities and large exceedance paths for the matrix recursive sequence $V_n = M_n V_{n-1} + Q_n, \\: n=1,2,\\ldots,$ where $\\{M_n\\}$ is an i.i.d. sequence of $d \\times d$ random matrices and $\\{ Q_n\\}$ is an i.i.d. sequence of random vectors, both with nonnegative entries. Early work on this problem dates to Kesten's (1973) seminal paper, motivated by an application to multi-type branching processes. Other applications arise in financial time series modeling (connected to the study of the GARCH($p,q$) processes) and in physics, and this recursive sequence ha","authors_text":"Jeffrey F. Collamore, Sebastian Mentemeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-18T05:01:26Z","title":"Large excursions and conditioned laws for recursive sequences generated by random matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05175","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:93d04f3d6c9abc6b477f84285553ed1a270759c5284068ee70511016b777b84a","target":"record","created_at":"2026-05-18T01:08:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d2c9737535abf31951050fdd83898aa0575fc0dac72a20d00de7a1b24e1a311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-18T05:01:26Z","title_canon_sha256":"f7445cd3b77c3c84ac414c81064598a64bdfe9798a5180174cf25a44a7e52b55"},"schema_version":"1.0","source":{"id":"1608.05175","kind":"arxiv","version":1}},"canonical_sha256":"5e870017585448faac1c3f138a4b9b39289e3b4ef9dd97d0b385635609a00036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e870017585448faac1c3f138a4b9b39289e3b4ef9dd97d0b385635609a00036","first_computed_at":"2026-05-18T01:08:31.724354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:31.724354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FQX8jWMFIyAM0TAAuz2eDg5nK5tlYoS553TqXh2I6Bzoj+vlwvoA7QC9QVk7tT9/C8bnVi1emhj3jjWPN0v1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:31.724892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93d04f3d6c9abc6b477f84285553ed1a270759c5284068ee70511016b777b84a","sha256:2d260d79e3b87237755a494852376d193a2ec48e1d1b87202e8902325ef6514d"],"state_sha256":"605793a55df83af57a909f40345e291a55e1395c6fd3faefda4fcec9621cb224"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLSjDQ1NcjLsfGoWMcBKjAfO6wtK/Oius2NKJoGG+KzCaJ5VO+rW9Z/MPMp8zm7lcdFAmbUSAEUGXF3EDUYOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:22:27.710531Z","bundle_sha256":"d857044e565762e1d10082bb5ec6b3182e84eacf2b6414957f83d376196e943e"}}