{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FR6SB7OFM3V3RWCLA7PTAESKE2","short_pith_number":"pith:FR6SB7OF","schema_version":"1.0","canonical_sha256":"2c7d20fdc566ebb8d84b07df30124a26992049e55032ca6b2dcbdee8125e340c","source":{"kind":"arxiv","id":"1509.02088","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.02088","created_at":"2026-05-18T01:33:49.758949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02088v1","created_at":"2026-05-18T01:33:49.758949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02088","created_at":"2026-05-18T01:33:49.758949+00:00"},{"alias_kind":"pith_short_12","alias_value":"FR6SB7OFM3V3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FR6SB7OFM3V3RWCL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FR6SB7OF","created_at":"2026-05-18T12:29:22.688609+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/FR6SB7OFM3V3RWCLA7PTAESKE2","json":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2.json","graph_json":"https://pith.science/api/pith-number/FR6SB7OFM3V3RWCLA7PTAESKE2/graph.json","events_json":"https://pith.science/api/pith-number/FR6SB7OFM3V3RWCLA7PTAESKE2/events.json","paper":"https://pith.science/paper/FR6SB7OF"},"agent_actions":{"view_html":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2","download_json":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2.json","view_paper":"https://pith.science/paper/FR6SB7OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02088&json=true","fetch_graph":"https://pith.science/api/pith-number/FR6SB7OFM3V3RWCLA7PTAESKE2/graph.json","fetch_events":"https://pith.science/api/pith-number/FR6SB7OFM3V3RWCLA7PTAESKE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/action/storage_attestation","attest_author":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/action/author_attestation","sign_citation":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/action/citation_signature","submit_replication":"https://pith.science/pith/FR6SB7OFM3V3RWCLA7PTAESKE2/action/replication_record"}},"created_at":"2026-05-18T01:33:49.758949+00:00","updated_at":"2026-05-18T01:33:49.758949+00:00"}