{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5X2QFSOSS7TYGWA6LYDU5VR6I3","short_pith_number":"pith:5X2QFSOS","schema_version":"1.0","canonical_sha256":"edf502c9d297e783581e5e074ed63e46fa6c8d75ae8f407539b649a027fc6b3f","source":{"kind":"arxiv","id":"1401.2490","version":1},"attestation_state":"computed","paper":{"title":"An Online Expectation-Maximisation Algorithm for Nonnegative Matrix Factorisation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"A. Taylan Cemgil, Sinan Yildirim, Sumeetpal S. Singh","submitted_at":"2014-01-11T00:54:27Z","abstract_excerpt":"In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximation of our online EM algorithm. We show the performance of the proposed method with two numerical examples."},"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":"1401.2490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-11T00:54:27Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"7a3620d6577e5a3f0ce1ee8ca3ecfe2f5afe3ce80dfdd1237be43cc952532b42","abstract_canon_sha256":"476ea2467ebf988377c9fbae0e052b155afcdd454b7978ea41295aa6d2b97475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:33.407198Z","signature_b64":"j0UkME5b7Ifme2LJfrRyu6CTv1AGOiQK6jaCUO3oD+NH/+AvMzFS7uV8FXduUDeLNbRIE0CNdbrogoRCjgZWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edf502c9d297e783581e5e074ed63e46fa6c8d75ae8f407539b649a027fc6b3f","last_reissued_at":"2026-05-18T03:02:33.406366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:33.406366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Online Expectation-Maximisation Algorithm for Nonnegative Matrix Factorisation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"A. Taylan Cemgil, Sinan Yildirim, Sumeetpal S. Singh","submitted_at":"2014-01-11T00:54:27Z","abstract_excerpt":"In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximation of our online EM algorithm. We show the performance of the proposed method with two numerical examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2490","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":"1401.2490","created_at":"2026-05-18T03:02:33.406502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2490v1","created_at":"2026-05-18T03:02:33.406502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2490","created_at":"2026-05-18T03:02:33.406502+00:00"},{"alias_kind":"pith_short_12","alias_value":"5X2QFSOSS7TY","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5X2QFSOSS7TYGWA6","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5X2QFSOS","created_at":"2026-05-18T12:28:16.859392+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/5X2QFSOSS7TYGWA6LYDU5VR6I3","json":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3.json","graph_json":"https://pith.science/api/pith-number/5X2QFSOSS7TYGWA6LYDU5VR6I3/graph.json","events_json":"https://pith.science/api/pith-number/5X2QFSOSS7TYGWA6LYDU5VR6I3/events.json","paper":"https://pith.science/paper/5X2QFSOS"},"agent_actions":{"view_html":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3","download_json":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3.json","view_paper":"https://pith.science/paper/5X2QFSOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2490&json=true","fetch_graph":"https://pith.science/api/pith-number/5X2QFSOSS7TYGWA6LYDU5VR6I3/graph.json","fetch_events":"https://pith.science/api/pith-number/5X2QFSOSS7TYGWA6LYDU5VR6I3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3/action/storage_attestation","attest_author":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3/action/author_attestation","sign_citation":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3/action/citation_signature","submit_replication":"https://pith.science/pith/5X2QFSOSS7TYGWA6LYDU5VR6I3/action/replication_record"}},"created_at":"2026-05-18T03:02:33.406502+00:00","updated_at":"2026-05-18T03:02:33.406502+00:00"}