{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OHKUVHCBPHCRG6V6YBGRODSSUV","short_pith_number":"pith:OHKUVHCB","schema_version":"1.0","canonical_sha256":"71d54a9c4179c5137abec04d170e52a556fb786d6a1c114bd107ad9620943546","source":{"kind":"arxiv","id":"1610.08127","version":1},"attestation_state":"computed","paper":{"title":"Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jes Frellsen, Pietro Lio', Thomas Brouwer","submitted_at":"2016-10-26T00:10:44Z","abstract_excerpt":"We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional samples to estimate the posterior. We show that in particular for matrix tri-factorisation convergence is difficult, but our variational Bayesian approach offers a fast solution, allowing the tri-factorisation approach to be used more effectively."},"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":"1610.08127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-26T00:10:44Z","cross_cats_sorted":["cs.AI","cs.NA","stat.ML"],"title_canon_sha256":"3eeee9f17b1f4f3a3b09fdad145b04af0d8b95bb53600b0579c8a9e7082d662c","abstract_canon_sha256":"ec236384a8b7d45e86ae373dfcc464b732b4e00d5c2c483e8340efa020c0a82d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:07.996763Z","signature_b64":"FXhEkOaU2wZjamqwXHjEH9vvajG0zJ9dvYhU4VgSj3VQZWFJwq+MEoj/SsW0r1ZSTzo2VO0cw5fWksTX9CE6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d54a9c4179c5137abec04d170e52a556fb786d6a1c114bd107ad9620943546","last_reissued_at":"2026-05-18T01:01:07.996171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:07.996171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jes Frellsen, Pietro Lio', Thomas Brouwer","submitted_at":"2016-10-26T00:10:44Z","abstract_excerpt":"We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional samples to estimate the posterior. We show that in particular for matrix tri-factorisation convergence is difficult, but our variational Bayesian approach offers a fast solution, allowing the tri-factorisation approach to be used more effectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08127","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":"1610.08127","created_at":"2026-05-18T01:01:07.996267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08127v1","created_at":"2026-05-18T01:01:07.996267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08127","created_at":"2026-05-18T01:01:07.996267+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHKUVHCBPHCR","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHKUVHCBPHCRG6V6","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHKUVHCB","created_at":"2026-05-18T12:30:36.002864+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/OHKUVHCBPHCRG6V6YBGRODSSUV","json":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV.json","graph_json":"https://pith.science/api/pith-number/OHKUVHCBPHCRG6V6YBGRODSSUV/graph.json","events_json":"https://pith.science/api/pith-number/OHKUVHCBPHCRG6V6YBGRODSSUV/events.json","paper":"https://pith.science/paper/OHKUVHCB"},"agent_actions":{"view_html":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV","download_json":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV.json","view_paper":"https://pith.science/paper/OHKUVHCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08127&json=true","fetch_graph":"https://pith.science/api/pith-number/OHKUVHCBPHCRG6V6YBGRODSSUV/graph.json","fetch_events":"https://pith.science/api/pith-number/OHKUVHCBPHCRG6V6YBGRODSSUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV/action/storage_attestation","attest_author":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV/action/author_attestation","sign_citation":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV/action/citation_signature","submit_replication":"https://pith.science/pith/OHKUVHCBPHCRG6V6YBGRODSSUV/action/replication_record"}},"created_at":"2026-05-18T01:01:07.996267+00:00","updated_at":"2026-05-18T01:01:07.996267+00:00"}