{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VNI4XRYYDHK3AMNWXRYTUE4J7D","short_pith_number":"pith:VNI4XRYY","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"},"canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","source":{"kind":"arxiv","id":"1712.08734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08734","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08734v1","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08734","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"VNI4XRYYDHK3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VNI4XRYYDHK3AMNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VNI4XRYY","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VNI4XRYYDHK3AMNWXRYTUE4J7D","target":"record","payload":{"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"},"canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","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"},"source_kind":"arxiv","source_id":"1712.08734","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-18T00:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNIGgmoXPypxSDkKCrLPO2BVOFj/ZVneLvHLK00uNJQmlxnNcqjrFmHl85zlib9bU4sr69OfF0M1XYdGuCkuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:59:26.768437Z"},"content_sha256":"cb522ecfd5c0f070bc4e91b1d3c43702b3006647cedc2e57b4f330c9dc36218b","schema_version":"1.0","event_id":"sha256:cb522ecfd5c0f070bc4e91b1d3c43702b3006647cedc2e57b4f330c9dc36218b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VNI4XRYYDHK3AMNWXRYTUE4J7D","target":"graph","payload":{"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"},"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-18T00:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lF1daYru2/al3rzanOqyrcPCS/eIZNtTyJBMivex96Wlo8BOolsFhtp6noAXwpM5SkxpARCDIg3lq240qwsOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:59:26.769115Z"},"content_sha256":"be5a6cff6656aa2a9a90fe7c867387738a18f9b2ef22d4c821d7dcf5e2e5df87","schema_version":"1.0","event_id":"sha256:be5a6cff6656aa2a9a90fe7c867387738a18f9b2ef22d4c821d7dcf5e2e5df87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/bundle.json","state_url":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/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-05-31T12:59:26Z","links":{"resolver":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D","bundle":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/bundle.json","state":"https://pith.science/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNI4XRYYDHK3AMNWXRYTUE4J7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VNI4XRYYDHK3AMNWXRYTUE4J7D","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":"9fe3b078b339a953d1a96e0cb6cf037c30e5ec4e2936bf73e4041ad0c4170d35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-23T08:22:44Z","title_canon_sha256":"15c5c91bab73bfd31c0960bc16f4a0442fcaedec1277149a8e303f6432901e38"},"schema_version":"1.0","source":{"id":"1712.08734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08734","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08734v1","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08734","created_at":"2026-05-18T00:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"VNI4XRYYDHK3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VNI4XRYYDHK3AMNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VNI4XRYY","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:be5a6cff6656aa2a9a90fe7c867387738a18f9b2ef22d4c821d7dcf5e2e5df87","target":"graph","created_at":"2026-05-18T00:27:16Z","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":"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. ","authors_text":"John Paisley, San Gultekin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-23T08:22:44Z","title":"Online Forecasting Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08734","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:cb522ecfd5c0f070bc4e91b1d3c43702b3006647cedc2e57b4f330c9dc36218b","target":"record","created_at":"2026-05-18T00:27:16Z","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":"9fe3b078b339a953d1a96e0cb6cf037c30e5ec4e2936bf73e4041ad0c4170d35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-23T08:22:44Z","title_canon_sha256":"15c5c91bab73bfd31c0960bc16f4a0442fcaedec1277149a8e303f6432901e38"},"schema_version":"1.0","source":{"id":"1712.08734","kind":"arxiv","version":1}},"canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab51cbc71819d5b031b6bc713a1389f8d5c329e055ee1cdc9e92e46059c6dbd1","first_computed_at":"2026-05-18T00:27:16.929334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:16.929334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FGDVneHVQtBQ8LmmJgp2TI34pE+cYznR0+TDZZGwYkJv5bq5o8NQGr3kc6Q6UqQzae0RL62njRd3X6qEeB+wAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:16.929965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb522ecfd5c0f070bc4e91b1d3c43702b3006647cedc2e57b4f330c9dc36218b","sha256:be5a6cff6656aa2a9a90fe7c867387738a18f9b2ef22d4c821d7dcf5e2e5df87"],"state_sha256":"b64e372c1434f42896b4770020f075177c84f111e70a2ccf024a39fb9447a252"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qq0tvbaaNvS9Cewbn4jYStNXayCjgWviuR0aZqeUoT+ICgEhBTJJO6m6YB/MflYDUQh90kMqeRXmWRPSQJkRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:59:26.772871Z","bundle_sha256":"2f8e99af1c6dde32447368d3e1ee267b762ad6a87d9776aa52aa0886a3fd6f3c"}}