{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q5O6VSTHGBRNWBNSQIWESBPYNX","short_pith_number":"pith:Q5O6VSTH","schema_version":"1.0","canonical_sha256":"875deaca673062db05b2822c4905f86dd202d8ffde39c6a8f7a09c7751247f57","source":{"kind":"arxiv","id":"2504.02649","version":1},"attestation_state":"computed","paper":{"title":"The Markov approximation of the periodic multivariate Poisson autoregression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Almut E. D. Veraart, Edward A. K. Cohen, Mahmoud Khabou","submitted_at":"2025-04-03T14:48:11Z","abstract_excerpt":"This paper introduces a periodic multivariate Poisson autoregression with potentially infinite memory, with a special focus on the network setting. Using contraction techniques, we study the stability of such a process and provide upper bounds on how fast it reaches the periodically stationary regime. We then propose a computationally efficient Markov approximation using the properties of the exponential function and a density result. Furthermore, we prove the strong consistency of the maximum likelihood estimator for the Markov approximation and empirically test its robustness in the case of "},"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":"2504.02649","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-04-03T14:48:11Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"2e6b901f3fdec1582c0747999da1b587685bb6c87c66c8d6803ee0a695375520","abstract_canon_sha256":"b9e21441d28bb433c4f182c5cd9ed56a964f0d2d3c774a91cd422b8a9aba28bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:00.307155Z","signature_b64":"VfOYFcWnlu/cVv9JKGpwMBwnLpLDBEeaSZROJtUgbYbJ3eXFUzNBYCIACUd/yU5TL80rWZVqdVbHy/vzjxgNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"875deaca673062db05b2822c4905f86dd202d8ffde39c6a8f7a09c7751247f57","last_reissued_at":"2026-07-05T10:44:00.306764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:00.306764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Markov approximation of the periodic multivariate Poisson autoregression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Almut E. D. Veraart, Edward A. K. Cohen, Mahmoud Khabou","submitted_at":"2025-04-03T14:48:11Z","abstract_excerpt":"This paper introduces a periodic multivariate Poisson autoregression with potentially infinite memory, with a special focus on the network setting. Using contraction techniques, we study the stability of such a process and provide upper bounds on how fast it reaches the periodically stationary regime. We then propose a computationally efficient Markov approximation using the properties of the exponential function and a density result. Furthermore, we prove the strong consistency of the maximum likelihood estimator for the Markov approximation and empirically test its robustness in the case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02649","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.02649/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.02649","created_at":"2026-07-05T10:44:00.306821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.02649v1","created_at":"2026-07-05T10:44:00.306821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02649","created_at":"2026-07-05T10:44:00.306821+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5O6VSTHGBRN","created_at":"2026-07-05T10:44:00.306821+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5O6VSTHGBRNWBNS","created_at":"2026-07-05T10:44:00.306821+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5O6VSTH","created_at":"2026-07-05T10:44:00.306821+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16966","citing_title":"Autoregressive Hypergraph","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX","json":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX.json","graph_json":"https://pith.science/api/pith-number/Q5O6VSTHGBRNWBNSQIWESBPYNX/graph.json","events_json":"https://pith.science/api/pith-number/Q5O6VSTHGBRNWBNSQIWESBPYNX/events.json","paper":"https://pith.science/paper/Q5O6VSTH"},"agent_actions":{"view_html":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX","download_json":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX.json","view_paper":"https://pith.science/paper/Q5O6VSTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.02649&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5O6VSTHGBRNWBNSQIWESBPYNX/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5O6VSTHGBRNWBNSQIWESBPYNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX/action/storage_attestation","attest_author":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX/action/author_attestation","sign_citation":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX/action/citation_signature","submit_replication":"https://pith.science/pith/Q5O6VSTHGBRNWBNSQIWESBPYNX/action/replication_record"}},"created_at":"2026-07-05T10:44:00.306821+00:00","updated_at":"2026-07-05T10:44:00.306821+00:00"}