{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VNI4XRYYDHK3AMNWXRYTUE4J7D","short_pith_number":"pith:VNI4XRYY","schema_version":"1.0","canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","source":{"kind":"arxiv","id":"1712.08734","version":1},"attestation_state":"computed","paper":{"title":"Online Forecasting Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"John Paisley, San Gultekin","submitted_at":"2017-12-23T08:22:44Z","abstract_excerpt":"In this paper the problem of forecasting high dimensional time series is considered. Such time series can be modeled as matrices where each column denotes a measurement. In addition, when missing values are present, low rank matrix factorization approaches are suitable for predicting future values. This paper formally defines and analyzes the forecasting problem in the online setting, i.e. where the data arrives as a stream and only a single pass is allowed. We present and analyze novel matrix factorization techniques which can learn low-dimensional embeddings effectively in an online manner. "},"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":"1712.08734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-23T08:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"15c5c91bab73bfd31c0960bc16f4a0442fcaedec1277149a8e303f6432901e38","abstract_canon_sha256":"9fe3b078b339a953d1a96e0cb6cf037c30e5ec4e2936bf73e4041ad0c4170d35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:16.929965Z","signature_b64":"FGDVneHVQtBQ8LmmJgp2TI34pE+cYznR0+TDZZGwYkJv5bq5o8NQGr3kc6Q6UqQzae0RL62njRd3X6qEeB+wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","last_reissued_at":"2026-05-18T00:27:16.929334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:16.929334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Forecasting Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"John Paisley, San Gultekin","submitted_at":"2017-12-23T08:22:44Z","abstract_excerpt":"In this paper the problem of forecasting high dimensional time series is considered. Such time series can be modeled as matrices where each column denotes a measurement. In addition, when missing values are present, low rank matrix factorization approaches are suitable for predicting future values. This paper formally defines and analyzes the forecasting problem in the online setting, i.e. where the data arrives as a stream and only a single pass is allowed. We present and analyze novel matrix factorization techniques which can learn low-dimensional embeddings effectively in an online manner. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08734","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":"1712.08734","created_at":"2026-05-18T00:27:16.929422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08734v1","created_at":"2026-05-18T00:27:16.929422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08734","created_at":"2026-05-18T00:27:16.929422+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNI4XRYYDHK3","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNI4XRYYDHK3AMNW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNI4XRYY","created_at":"2026-05-18T12:31:49.984773+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/VNI4XRYYDHK3AMNWXRYTUE4J7D","json":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D.json","graph_json":"https://pith.science/api/pith-number/VNI4XRYYDHK3AMNWXRYTUE4J7D/graph.json","events_json":"https://pith.science/api/pith-number/VNI4XRYYDHK3AMNWXRYTUE4J7D/events.json","paper":"https://pith.science/paper/VNI4XRYY"},"agent_actions":{"view_html":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D","download_json":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D.json","view_paper":"https://pith.science/paper/VNI4XRYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08734&json=true","fetch_graph":"https://pith.science/api/pith-number/VNI4XRYYDHK3AMNWXRYTUE4J7D/graph.json","fetch_events":"https://pith.science/api/pith-number/VNI4XRYYDHK3AMNWXRYTUE4J7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/action/storage_attestation","attest_author":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/action/author_attestation","sign_citation":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/action/citation_signature","submit_replication":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/action/replication_record"}},"created_at":"2026-05-18T00:27:16.929422+00:00","updated_at":"2026-05-18T00:27:16.929422+00:00"}