{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MK63GV5ZVIUUYJANCFH44QHEOD","short_pith_number":"pith:MK63GV5Z","canonical_record":{"source":{"id":"1905.04529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T14:13:31Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"2f1cf18363e66f519e4deb7f38fe0c1a2eb4b33767bc9be59ca127c3aaf6cd38","abstract_canon_sha256":"41689fc08e36e4dac554afbed212d8d539534fb9a4f158493cb11defc2847351"},"schema_version":"1.0"},"canonical_sha256":"62bdb357b9aa294c240d114fce40e470dc19b7db5d73f8158f711465c7c370c6","source":{"kind":"arxiv","id":"1905.04529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04529","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04529v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04529","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"MK63GV5ZVIUU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK63GV5ZVIUUYJAN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK63GV5Z","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MK63GV5ZVIUUYJANCFH44QHEOD","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T14:13:31Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"2f1cf18363e66f519e4deb7f38fe0c1a2eb4b33767bc9be59ca127c3aaf6cd38","abstract_canon_sha256":"41689fc08e36e4dac554afbed212d8d539534fb9a4f158493cb11defc2847351"},"schema_version":"1.0"},"canonical_sha256":"62bdb357b9aa294c240d114fce40e470dc19b7db5d73f8158f711465c7c370c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.540917Z","signature_b64":"QtPcHaSCoowDtX+GWgrMhA1akgihbDpIkppJBXTjvBCuDInBbCpHqD/yGHHHZ0cZs+FGApRlwp3U9VEipX0qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62bdb357b9aa294c240d114fce40e470dc19b7db5d73f8158f711465c7c370c6","last_reissued_at":"2026-05-17T23:46:24.540235Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.540235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04529","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXcKRgndlYH32FsrtWH7d6iEJ7+Rm5DQpdbBJIDRLlhXGIlM/itzjU71ibn7MHs0InsrCvf6H9QwCYeRPHmwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:54:33.160269Z"},"content_sha256":"73e08e4f73543feb008e3acea6af29ede9f3fbb7efc70543bbbc2ccef5497a4e","schema_version":"1.0","event_id":"sha256:73e08e4f73543feb008e3acea6af29ede9f3fbb7efc70543bbbc2ccef5497a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MK63GV5ZVIUUYJANCFH44QHEOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Algorithms based on Majorization Minimization for Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"P. Babu, R. Bahl, R. Jyothi","submitted_at":"2019-05-11T14:13:31Z","abstract_excerpt":"Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a nonnegative matrix into a product of two nonnegative matrices which gives some meaningful interpretation of the data. Thus, nonnegative matrix factorization has an edge over the other decomposition techniques. In this paper, we propose two novel iterative algorithms based on Majorization Minimization (MM)-in which we formulate a novel upper bound and minimize it to ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04529","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QvtIZ3i40yKZAigmknsmW+rPUk4gINsIYP/WgyML9hyw81GOZgtR5J77MHjfom99z1QbJZtUvphnFQKu4+wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:54:33.160665Z"},"content_sha256":"020ef540aeb1501291ac7bfb5596d486e2c8be778f0e4dbad8c77dcdac067587","schema_version":"1.0","event_id":"sha256:020ef540aeb1501291ac7bfb5596d486e2c8be778f0e4dbad8c77dcdac067587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MK63GV5ZVIUUYJANCFH44QHEOD/bundle.json","state_url":"https://pith.science/pith/MK63GV5ZVIUUYJANCFH44QHEOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MK63GV5ZVIUUYJANCFH44QHEOD/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-06-12T06:54:33Z","links":{"resolver":"https://pith.science/pith/MK63GV5ZVIUUYJANCFH44QHEOD","bundle":"https://pith.science/pith/MK63GV5ZVIUUYJANCFH44QHEOD/bundle.json","state":"https://pith.science/pith/MK63GV5ZVIUUYJANCFH44QHEOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MK63GV5ZVIUUYJANCFH44QHEOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MK63GV5ZVIUUYJANCFH44QHEOD","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":"41689fc08e36e4dac554afbed212d8d539534fb9a4f158493cb11defc2847351","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T14:13:31Z","title_canon_sha256":"2f1cf18363e66f519e4deb7f38fe0c1a2eb4b33767bc9be59ca127c3aaf6cd38"},"schema_version":"1.0","source":{"id":"1905.04529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04529","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04529v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04529","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"MK63GV5ZVIUU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK63GV5ZVIUUYJAN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK63GV5Z","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:020ef540aeb1501291ac7bfb5596d486e2c8be778f0e4dbad8c77dcdac067587","target":"graph","created_at":"2026-05-17T23:46:24Z","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":"Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a nonnegative matrix into a product of two nonnegative matrices which gives some meaningful interpretation of the data. Thus, nonnegative matrix factorization has an edge over the other decomposition techniques. In this paper, we propose two novel iterative algorithms based on Majorization Minimization (MM)-in which we formulate a novel upper bound and minimize it to ge","authors_text":"P. Babu, R. Bahl, R. Jyothi","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T14:13:31Z","title":"Novel Algorithms based on Majorization Minimization for Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04529","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:73e08e4f73543feb008e3acea6af29ede9f3fbb7efc70543bbbc2ccef5497a4e","target":"record","created_at":"2026-05-17T23:46:24Z","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":"41689fc08e36e4dac554afbed212d8d539534fb9a4f158493cb11defc2847351","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T14:13:31Z","title_canon_sha256":"2f1cf18363e66f519e4deb7f38fe0c1a2eb4b33767bc9be59ca127c3aaf6cd38"},"schema_version":"1.0","source":{"id":"1905.04529","kind":"arxiv","version":1}},"canonical_sha256":"62bdb357b9aa294c240d114fce40e470dc19b7db5d73f8158f711465c7c370c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62bdb357b9aa294c240d114fce40e470dc19b7db5d73f8158f711465c7c370c6","first_computed_at":"2026-05-17T23:46:24.540235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.540235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QtPcHaSCoowDtX+GWgrMhA1akgihbDpIkppJBXTjvBCuDInBbCpHqD/yGHHHZ0cZs+FGApRlwp3U9VEipX0qCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.540917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73e08e4f73543feb008e3acea6af29ede9f3fbb7efc70543bbbc2ccef5497a4e","sha256:020ef540aeb1501291ac7bfb5596d486e2c8be778f0e4dbad8c77dcdac067587"],"state_sha256":"6972bbcb34d306433a33234575b484cbc2b1ffa79a673d1800c26c1140a535e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nT284zmJIEaJe3po0WYFp5VzbXnXuQ8abhR568G0NQUwSPPwZIYguuBD8gKhQlcfd7r8CYpfcA4Z5lrTHCLjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:54:33.163092Z","bundle_sha256":"6615dcc0726ea3fc7194ef120f757d17bf02ddab2dd4e9ca081c48f0a93fa5af"}}