{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:TUUQKMUCKMKVNJFPGV5NBZ3W54","short_pith_number":"pith:TUUQKMUC","canonical_record":{"source":{"id":"math/0009204","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-09-22T12:01:32Z","cross_cats_sorted":["math-ph","math.MP","math.ST","stat.TH"],"title_canon_sha256":"a3df6e73d0475acf619607c52b001ddd5db9cee991dbd733130efce7f377b0af","abstract_canon_sha256":"483cc52aa8dd07e7d032b113100f78f50d3a1745ab30b078cc5af1c462dd8f18"},"schema_version":"1.0"},"canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","source":{"kind":"arxiv","id":"math/0009204","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0009204","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0009204v3","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0009204","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"TUUQKMUCKMKV","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"TUUQKMUCKMKVNJFP","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"TUUQKMUC","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:TUUQKMUCKMKVNJFPGV5NBZ3W54","target":"record","payload":{"canonical_record":{"source":{"id":"math/0009204","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-09-22T12:01:32Z","cross_cats_sorted":["math-ph","math.MP","math.ST","stat.TH"],"title_canon_sha256":"a3df6e73d0475acf619607c52b001ddd5db9cee991dbd733130efce7f377b0af","abstract_canon_sha256":"483cc52aa8dd07e7d032b113100f78f50d3a1745ab30b078cc5af1c462dd8f18"},"schema_version":"1.0"},"canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:43.254373Z","signature_b64":"mfxt9r9s6dBJcZzygeqXAdj5C5o+MwHCLq3DrAy42DvqyCMSUgB2znqtkRFtorMZLjGBCwLlSVO5D2nfJhLDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","last_reissued_at":"2026-05-18T04:08:43.253919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:43.253919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0009204","source_version":3,"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-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTEJrfObi6aarfwX52U3Oc+uwoBCcaNjdTjbdzGVMbYg5V0HZzVb08SZNTZ5Iqcw+3/EY1abzHUHjj83VU/gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:39.598207Z"},"content_sha256":"de1f6b7e9e97598ebf90e4be7da15b805a77f403551d6a40bda75da1b4779b68","schema_version":"1.0","event_id":"sha256:de1f6b7e9e97598ebf90e4be7da15b805a77f403551d6a40bda75da1b4779b68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:TUUQKMUCKMKVNJFPGV5NBZ3W54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Processes with Long Memory: Regenerative Construction and Perfect Simulation","license":"","headline":"","cross_cats":["math-ph","math.MP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Francis Comets, Pablo A. Ferrari, Roberto Fernandez","submitted_at":"2000-09-22T12:01:32Z","abstract_excerpt":"We present a perfect simulation algorithm for stationary processes indexed by Z, with summable memory decay. Depending on the decay, we construct the process on finite or semi-infinite intervals, explicitly from an i.i.d. uniform sequence. Even though the process has infinite memory, its value at time 0 depends only on a finite, but random, number of these uniform variables. The algorithm is based on a recent regenerative construction of these measures by Ferrari, Maass, Mart{\\'\\i}nez and Ney. As applications, we discuss the perfect simulation of binary autoregressions and Markov chains on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0009204","kind":"arxiv","version":3},"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-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YqTyLpJWj83UR3Vod7JFh8fo8ilvwvvFEjfnFbdynY7RQSbSwjeGNhQtjsqkeNvYgqEM4+L02rLmD6/IhAyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:39.598865Z"},"content_sha256":"141ebe01a3225730fdafc350b6497b798286e83c7991898f11a46a72d1e6f523","schema_version":"1.0","event_id":"sha256:141ebe01a3225730fdafc350b6497b798286e83c7991898f11a46a72d1e6f523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/bundle.json","state_url":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/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-05-27T09:26:39Z","links":{"resolver":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54","bundle":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/bundle.json","state":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:TUUQKMUCKMKVNJFPGV5NBZ3W54","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":"483cc52aa8dd07e7d032b113100f78f50d3a1745ab30b078cc5af1c462dd8f18","cross_cats_sorted":["math-ph","math.MP","math.ST","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2000-09-22T12:01:32Z","title_canon_sha256":"a3df6e73d0475acf619607c52b001ddd5db9cee991dbd733130efce7f377b0af"},"schema_version":"1.0","source":{"id":"math/0009204","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0009204","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0009204v3","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0009204","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"TUUQKMUCKMKV","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"TUUQKMUCKMKVNJFP","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"TUUQKMUC","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:141ebe01a3225730fdafc350b6497b798286e83c7991898f11a46a72d1e6f523","target":"graph","created_at":"2026-05-18T04:08:43Z","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 present a perfect simulation algorithm for stationary processes indexed by Z, with summable memory decay. Depending on the decay, we construct the process on finite or semi-infinite intervals, explicitly from an i.i.d. uniform sequence. Even though the process has infinite memory, its value at time 0 depends only on a finite, but random, number of these uniform variables. The algorithm is based on a recent regenerative construction of these measures by Ferrari, Maass, Mart{\\'\\i}nez and Ney. As applications, we discuss the perfect simulation of binary autoregressions and Markov chains on the","authors_text":"Francis Comets, Pablo A. Ferrari, Roberto Fernandez","cross_cats":["math-ph","math.MP","math.ST","stat.TH"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2000-09-22T12:01:32Z","title":"Processes with Long Memory: Regenerative Construction and Perfect Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0009204","kind":"arxiv","version":3},"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:de1f6b7e9e97598ebf90e4be7da15b805a77f403551d6a40bda75da1b4779b68","target":"record","created_at":"2026-05-18T04:08:43Z","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":"483cc52aa8dd07e7d032b113100f78f50d3a1745ab30b078cc5af1c462dd8f18","cross_cats_sorted":["math-ph","math.MP","math.ST","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2000-09-22T12:01:32Z","title_canon_sha256":"a3df6e73d0475acf619607c52b001ddd5db9cee991dbd733130efce7f377b0af"},"schema_version":"1.0","source":{"id":"math/0009204","kind":"arxiv","version":3}},"canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","first_computed_at":"2026-05-18T04:08:43.253919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:43.253919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mfxt9r9s6dBJcZzygeqXAdj5C5o+MwHCLq3DrAy42DvqyCMSUgB2znqtkRFtorMZLjGBCwLlSVO5D2nfJhLDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:43.254373Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0009204","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de1f6b7e9e97598ebf90e4be7da15b805a77f403551d6a40bda75da1b4779b68","sha256:141ebe01a3225730fdafc350b6497b798286e83c7991898f11a46a72d1e6f523"],"state_sha256":"cc806bb9cc40a94a41acccb29c2818d83981d59c3978aeb35e1dc8aebf4a77bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzM2526OnBdvnAAjmm38DTZbeUnSYQe7f2proeLN6mz8J9ySTzrvWgTK5lJJcqZ2faML5yOLxGFQDpYQJJylBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:26:39.601787Z","bundle_sha256":"d6ed8998afc34f5925095ebe7e0aac8cb1e577de159bc9bd456d2899888921a2"}}