{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L6OJR3OTJW24URFS4RTSKKXI6A","short_pith_number":"pith:L6OJR3OT","canonical_record":{"source":{"id":"1611.00965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-03T12:06:23Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"6c7e7a0405e41287f7922796bf2fcd5942f9b158e5ec135e3cdd274011dc97ab","abstract_canon_sha256":"e42affcbc161eed5c0c58df1870f4b204df34d3d452ceb5ff4e179e04b362b64"},"schema_version":"1.0"},"canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","source":{"kind":"arxiv","id":"1611.00965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00965","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00965v1","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00965","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"pith_short_12","alias_value":"L6OJR3OTJW24","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6OJR3OTJW24URFS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6OJR3OT","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L6OJR3OTJW24URFS4RTSKKXI6A","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-03T12:06:23Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"6c7e7a0405e41287f7922796bf2fcd5942f9b158e5ec135e3cdd274011dc97ab","abstract_canon_sha256":"e42affcbc161eed5c0c58df1870f4b204df34d3d452ceb5ff4e179e04b362b64"},"schema_version":"1.0"},"canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:18.070530Z","signature_b64":"ShMUP+DIDhwrx8C7Fhbn9YILN1FohlyNOZySHU4LKx7XT1gHIvbEAeXSfyJiJJQxcX5MsEnAVkp65RtrvxVqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","last_reissued_at":"2026-05-18T01:00:18.069772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:18.069772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00965","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:00:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAgJfs3XfdqTeXCAilxhsiNVIxmoV4sW8S1yr678OAG6ygJn0r30ryPIzpVkU5b4ZwM/0psc+m40ULmPfsAYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:17:19.040437Z"},"content_sha256":"d5107e2bf9edf2b611d45a0397e7bf449c3570c58f66ea04734a148632d564de","schema_version":"1.0","event_id":"sha256:d5107e2bf9edf2b611d45a0397e7bf449c3570c58f66ea04734a148632d564de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L6OJR3OTJW24URFS4RTSKKXI6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster ARMA maximum likelihood estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"A. Ian McLeod, Ying Zhang","submitted_at":"2016-11-03T12:06:23Z","abstract_excerpt":"A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require $O(n)$ flops per function evaluation. Using our new approximation, an algorithm is developed which requires only $O(1)$ flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level Quantitative Programming Environments (QPEs) such as {\\it Mathematica\\/}, MatLab and R. In order to obtain reasonab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00965","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:00:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENLgTqeujtxGTGw8XgNiG6pcGCH/H3prpgkmo4vldmLHjW9i0T2y745+eW7y1p+5+Y8X8unJcdIlxQtuvblTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:17:19.040783Z"},"content_sha256":"cc2d7e497cda430d81eb9c675a298c4712f4c98cf27eb498e15dcbcd669d2a71","schema_version":"1.0","event_id":"sha256:cc2d7e497cda430d81eb9c675a298c4712f4c98cf27eb498e15dcbcd669d2a71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/bundle.json","state_url":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6OJR3OTJW24URFS4RTSKKXI6A/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-02T07:17:19Z","links":{"resolver":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A","bundle":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/bundle.json","state":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6OJR3OTJW24URFS4RTSKKXI6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L6OJR3OTJW24URFS4RTSKKXI6A","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":"e42affcbc161eed5c0c58df1870f4b204df34d3d452ceb5ff4e179e04b362b64","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-03T12:06:23Z","title_canon_sha256":"6c7e7a0405e41287f7922796bf2fcd5942f9b158e5ec135e3cdd274011dc97ab"},"schema_version":"1.0","source":{"id":"1611.00965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00965","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00965v1","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00965","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"pith_short_12","alias_value":"L6OJR3OTJW24","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6OJR3OTJW24URFS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6OJR3OT","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:cc2d7e497cda430d81eb9c675a298c4712f4c98cf27eb498e15dcbcd669d2a71","target":"graph","created_at":"2026-05-18T01:00:18Z","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":"A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require $O(n)$ flops per function evaluation. Using our new approximation, an algorithm is developed which requires only $O(1)$ flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level Quantitative Programming Environments (QPEs) such as {\\it Mathematica\\/}, MatLab and R. In order to obtain reasonab","authors_text":"A. Ian McLeod, Ying Zhang","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-03T12:06:23Z","title":"Faster ARMA maximum likelihood estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00965","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:d5107e2bf9edf2b611d45a0397e7bf449c3570c58f66ea04734a148632d564de","target":"record","created_at":"2026-05-18T01:00:18Z","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":"e42affcbc161eed5c0c58df1870f4b204df34d3d452ceb5ff4e179e04b362b64","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-03T12:06:23Z","title_canon_sha256":"6c7e7a0405e41287f7922796bf2fcd5942f9b158e5ec135e3cdd274011dc97ab"},"schema_version":"1.0","source":{"id":"1611.00965","kind":"arxiv","version":1}},"canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","first_computed_at":"2026-05-18T01:00:18.069772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:18.069772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ShMUP+DIDhwrx8C7Fhbn9YILN1FohlyNOZySHU4LKx7XT1gHIvbEAeXSfyJiJJQxcX5MsEnAVkp65RtrvxVqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:18.070530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5107e2bf9edf2b611d45a0397e7bf449c3570c58f66ea04734a148632d564de","sha256:cc2d7e497cda430d81eb9c675a298c4712f4c98cf27eb498e15dcbcd669d2a71"],"state_sha256":"77e852b27990660e0b05b141029b7244795c1e4c2af41c0735b246e594803bb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3qLGdyUG+lAN6eOEI7pBsQzc35hWGv051nIuI1Yk8ZGQUCQN4WEdQ0y2wCVV5yj3e7sEkX08ETkfIFwA90oCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:17:19.042873Z","bundle_sha256":"8e1192ea436fc08a9f694d467d66e023ec3d45d83dcff8003e4b0730cef1e9b1"}}