{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FR6SB7OFM3V3RWCLA7PTAESKE2","short_pith_number":"pith:FR6SB7OF","canonical_record":{"source":{"id":"1509.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-07T15:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"b6449408a3cdcea8d9a7cca3bd930cf486bf138f4264710cfa30c2ee2c56eec6","abstract_canon_sha256":"b9ebc73ab986ff31711e7ca542af302d63ed695457566dd3465124fa382c8f1d"},"schema_version":"1.0"},"canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","source":{"kind":"arxiv","id":"1509.02088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02088","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02088v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02088","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"FR6SB7OFM3V3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FR6SB7OFM3V3RWCL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FR6SB7OF","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FR6SB7OFM3V3RWCLA7PTAESKE2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-07T15:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"b6449408a3cdcea8d9a7cca3bd930cf486bf138f4264710cfa30c2ee2c56eec6","abstract_canon_sha256":"b9ebc73ab986ff31711e7ca542af302d63ed695457566dd3465124fa382c8f1d"},"schema_version":"1.0"},"canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:49.759532Z","signature_b64":"5gJ7aXEeVqHfxjMIUIele3sAPrurGMJ4a6r8B6IcLzFFCISGiV4WngWQBT0EuiywkUtc5T7lhkZquBlHcARWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","last_reissued_at":"2026-05-18T01:33:49.758862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:49.758862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02088","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ae98Ktw+kfW2yYT8uavh+Xw4zgfQ6zbWTQInTNDewfZKpBJ58/+FH9rDjJ3xe3gcPC+kN3WzwkyHUzi0SPGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:24.793763Z"},"content_sha256":"14bc543661e137c24639930b1e0abfa76ac37e9fd5ba1d7dc96a7c3b3cdbc7ee","schema_version":"1.0","event_id":"sha256:14bc543661e137c24639930b1e0abfa76ac37e9fd5ba1d7dc96a7c3b3cdbc7ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FR6SB7OFM3V3RWCLA7PTAESKE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Factorisation with Linear Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"\\\"Omer Deniz Aky{\\i}ld{\\i}z","submitted_at":"2015-09-07T15:47:39Z","abstract_excerpt":"This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation algorithm. Using the probabilistic model, we derive a matrix factorisation algorithm as a recursive linear filter. More precisely, we derive a matrix-variate recursive linear filter in order to perform efficient inference in high dimensions. We also show that it is possible to interpret our algorithm as a nontrivial stochastic gradient algorithm. Demonstrations a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02088","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/bfGf+deGg5dBUSDfQWtUf0EuXZ4LP9Fwy/b0CQHHQ2XAD63RrpyXK6x+mTwBolrTM3GYhIgwK3i8KZ2oCHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:24.794478Z"},"content_sha256":"1cef064642120c5980400d7fbbc7b49b46139071f8bb82363e30a6ca44bd7851","schema_version":"1.0","event_id":"sha256:1cef064642120c5980400d7fbbc7b49b46139071f8bb82363e30a6ca44bd7851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/bundle.json","state_url":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/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-26T15:19:24Z","links":{"resolver":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2","bundle":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/bundle.json","state":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FR6SB7OFM3V3RWCLA7PTAESKE2","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":"b9ebc73ab986ff31711e7ca542af302d63ed695457566dd3465124fa382c8f1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-07T15:47:39Z","title_canon_sha256":"b6449408a3cdcea8d9a7cca3bd930cf486bf138f4264710cfa30c2ee2c56eec6"},"schema_version":"1.0","source":{"id":"1509.02088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02088","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02088v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02088","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"FR6SB7OFM3V3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FR6SB7OFM3V3RWCL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FR6SB7OF","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:1cef064642120c5980400d7fbbc7b49b46139071f8bb82363e30a6ca44bd7851","target":"graph","created_at":"2026-05-18T01:33:49Z","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":"This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation algorithm. Using the probabilistic model, we derive a matrix factorisation algorithm as a recursive linear filter. More precisely, we derive a matrix-variate recursive linear filter in order to perform efficient inference in high dimensions. We also show that it is possible to interpret our algorithm as a nontrivial stochastic gradient algorithm. Demonstrations a","authors_text":"\\\"Omer Deniz Aky{\\i}ld{\\i}z","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-07T15:47:39Z","title":"Matrix Factorisation with Linear Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02088","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:14bc543661e137c24639930b1e0abfa76ac37e9fd5ba1d7dc96a7c3b3cdbc7ee","target":"record","created_at":"2026-05-18T01:33:49Z","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":"b9ebc73ab986ff31711e7ca542af302d63ed695457566dd3465124fa382c8f1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-07T15:47:39Z","title_canon_sha256":"b6449408a3cdcea8d9a7cca3bd930cf486bf138f4264710cfa30c2ee2c56eec6"},"schema_version":"1.0","source":{"id":"1509.02088","kind":"arxiv","version":1}},"canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","first_computed_at":"2026-05-18T01:33:49.758862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:49.758862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5gJ7aXEeVqHfxjMIUIele3sAPrurGMJ4a6r8B6IcLzFFCISGiV4WngWQBT0EuiywkUtc5T7lhkZquBlHcARWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:49.759532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14bc543661e137c24639930b1e0abfa76ac37e9fd5ba1d7dc96a7c3b3cdbc7ee","sha256:1cef064642120c5980400d7fbbc7b49b46139071f8bb82363e30a6ca44bd7851"],"state_sha256":"23b0ae9470f1b84318651f011bf27ab7c05a87a6e60e131745fe518db01378c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOFAub6xvbJYXXY7dPN9P+bZUlrXQR8dN/UL9SXooxMQwCmPHB6AZipLU4fL/cJvENd0KyjnnDmFI8yhXtBoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:19:24.797948Z","bundle_sha256":"ffb52e42a35f18f9c0f1de4641119e3ed42e453a5a92cfd6f004a55f93b89c55"}}