{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:TUUQKMUCKMKVNJFPGV5NBZ3W54","short_pith_number":"pith:TUUQKMUC","schema_version":"1.0","canonical_sha256":"9d29053282531556a4af357ad0e776ef0c79f6b7eda77b86157ca95b78dc942c","source":{"kind":"arxiv","id":"math/0009204","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0009204","created_at":"2026-05-18T04:08:43.253976+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0009204v3","created_at":"2026-05-18T04:08:43.253976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0009204","created_at":"2026-05-18T04:08:43.253976+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUUQKMUCKMKV","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUUQKMUCKMKVNJFP","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUUQKMUC","created_at":"2026-05-18T12:25:50.254431+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/TUUQKMUCKMKVNJFPGV5NBZ3W54","json":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54.json","graph_json":"https://pith.science/api/pith-number/TUUQKMUCKMKVNJFPGV5NBZ3W54/graph.json","events_json":"https://pith.science/api/pith-number/TUUQKMUCKMKVNJFPGV5NBZ3W54/events.json","paper":"https://pith.science/paper/TUUQKMUC"},"agent_actions":{"view_html":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54","download_json":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54.json","view_paper":"https://pith.science/paper/TUUQKMUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0009204&json=true","fetch_graph":"https://pith.science/api/pith-number/TUUQKMUCKMKVNJFPGV5NBZ3W54/graph.json","fetch_events":"https://pith.science/api/pith-number/TUUQKMUCKMKVNJFPGV5NBZ3W54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/action/storage_attestation","attest_author":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/action/author_attestation","sign_citation":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/action/citation_signature","submit_replication":"https://pith.science/pith/TUUQKMUCKMKVNJFPGV5NBZ3W54/action/replication_record"}},"created_at":"2026-05-18T04:08:43.253976+00:00","updated_at":"2026-05-18T04:08:43.253976+00:00"}