{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L6OJR3OTJW24URFS4RTSKKXI6A","short_pith_number":"pith:L6OJR3OT","schema_version":"1.0","canonical_sha256":"5f9c98edd34db5ca44b2e467252ae8f0248a24dd1658f4d0a481322b30b108ea","source":{"kind":"arxiv","id":"1611.00965","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.00965","created_at":"2026-05-18T01:00:18.069888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00965v1","created_at":"2026-05-18T01:00:18.069888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00965","created_at":"2026-05-18T01:00:18.069888+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6OJR3OTJW24","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6OJR3OTJW24URFS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6OJR3OT","created_at":"2026-05-18T12:30:29.479603+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/L6OJR3OTJW24URFS4RTSKKXI6A","json":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A.json","graph_json":"https://pith.science/api/pith-number/L6OJR3OTJW24URFS4RTSKKXI6A/graph.json","events_json":"https://pith.science/api/pith-number/L6OJR3OTJW24URFS4RTSKKXI6A/events.json","paper":"https://pith.science/paper/L6OJR3OT"},"agent_actions":{"view_html":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A","download_json":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A.json","view_paper":"https://pith.science/paper/L6OJR3OT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00965&json=true","fetch_graph":"https://pith.science/api/pith-number/L6OJR3OTJW24URFS4RTSKKXI6A/graph.json","fetch_events":"https://pith.science/api/pith-number/L6OJR3OTJW24URFS4RTSKKXI6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/action/storage_attestation","attest_author":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/action/author_attestation","sign_citation":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/action/citation_signature","submit_replication":"https://pith.science/pith/L6OJR3OTJW24URFS4RTSKKXI6A/action/replication_record"}},"created_at":"2026-05-18T01:00:18.069888+00:00","updated_at":"2026-05-18T01:00:18.069888+00:00"}