{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AH27KXSNIS3QKWU2YGFVX6XKLG","short_pith_number":"pith:AH27KXSN","schema_version":"1.0","canonical_sha256":"01f5f55e4d44b7055a9ac18b5bfaea599868f21135f93370305c995a554d9e46","source":{"kind":"arxiv","id":"2404.08136","version":2},"attestation_state":"computed","paper":{"title":"Exponentially Weighted Moving Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.OC","q-fin.CP","stat.ML"],"primary_cat":"stat.CO","authors_text":"Eric Luxenberg, Stephen Boyd","submitted_at":"2024-04-11T21:45:39Z","abstract_excerpt":"An exponentially weighted moving model (EWMM) for a vector time series fits a new data model each time period, based on an exponentially fading loss function on past observed data. The well known and widely used exponentially weighted moving average (EWMA) is a special case that estimates the mean using a square loss function. For quadratic loss functions EWMMs can be fit using a simple recursion that updates the parameters of a quadratic function. For other loss functions, the entire past history must be stored, and the fitting problem grows in size as time increases. We propose a general met"},"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":"2404.08136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-04-11T21:45:39Z","cross_cats_sorted":["eess.SP","math.OC","q-fin.CP","stat.ML"],"title_canon_sha256":"bc2ff64c524dd9524ce05c9bb0d56563326ff1efb7abad255c1d3ec6426e3aff","abstract_canon_sha256":"0a18fa46a1395067d5071990ff016016e98afba0f96bc00f310cef9c8a6b1f89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:43.789620Z","signature_b64":"U/IaKMbt1uD+WO5yO3DTMh97sQUzhwNN2QSa4zDqTbnZTsb/U3TnGec/8VK0QE9BQlcVynTVFAqgsglakmCXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f5f55e4d44b7055a9ac18b5bfaea599868f21135f93370305c995a554d9e46","last_reissued_at":"2026-07-05T08:11:43.789160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:43.789160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponentially Weighted Moving Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.OC","q-fin.CP","stat.ML"],"primary_cat":"stat.CO","authors_text":"Eric Luxenberg, Stephen Boyd","submitted_at":"2024-04-11T21:45:39Z","abstract_excerpt":"An exponentially weighted moving model (EWMM) for a vector time series fits a new data model each time period, based on an exponentially fading loss function on past observed data. The well known and widely used exponentially weighted moving average (EWMA) is a special case that estimates the mean using a square loss function. For quadratic loss functions EWMMs can be fit using a simple recursion that updates the parameters of a quadratic function. For other loss functions, the entire past history must be stored, and the fitting problem grows in size as time increases. We propose a general met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08136","kind":"arxiv","version":2},"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/2404.08136/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":"2404.08136","created_at":"2026-07-05T08:11:43.789212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08136v2","created_at":"2026-07-05T08:11:43.789212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08136","created_at":"2026-07-05T08:11:43.789212+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH27KXSNIS3Q","created_at":"2026-07-05T08:11:43.789212+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH27KXSNIS3QKWU2","created_at":"2026-07-05T08:11:43.789212+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH27KXSN","created_at":"2026-07-05T08:11:43.789212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.15423","citing_title":"GaiaFlow: Semantic-Guided Diffusion Tuning for Carbon-Frugal Search","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG","json":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG.json","graph_json":"https://pith.science/api/pith-number/AH27KXSNIS3QKWU2YGFVX6XKLG/graph.json","events_json":"https://pith.science/api/pith-number/AH27KXSNIS3QKWU2YGFVX6XKLG/events.json","paper":"https://pith.science/paper/AH27KXSN"},"agent_actions":{"view_html":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG","download_json":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG.json","view_paper":"https://pith.science/paper/AH27KXSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08136&json=true","fetch_graph":"https://pith.science/api/pith-number/AH27KXSNIS3QKWU2YGFVX6XKLG/graph.json","fetch_events":"https://pith.science/api/pith-number/AH27KXSNIS3QKWU2YGFVX6XKLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG/action/storage_attestation","attest_author":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG/action/author_attestation","sign_citation":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG/action/citation_signature","submit_replication":"https://pith.science/pith/AH27KXSNIS3QKWU2YGFVX6XKLG/action/replication_record"}},"created_at":"2026-07-05T08:11:43.789212+00:00","updated_at":"2026-07-05T08:11:43.789212+00:00"}