{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RIJ45RPWR2YJC4T5IOOY3OYINP","short_pith_number":"pith:RIJ45RPW","schema_version":"1.0","canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","source":{"kind":"arxiv","id":"1903.01321","version":1},"attestation_state":"computed","paper":{"title":"Adaptive computation of the Symmetric Nonnegative Matrix Factorization (NMF)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Francesco Romani, Grazia Lotti, Ornella Menchi, Paola Favati","submitted_at":"2019-03-04T16:06:46Z","abstract_excerpt":"Nonnegative Matrix Factorization (NMF), first proposed in 1994 for data analysis, has received successively much attention in a great variety of contexts such as data mining, text clustering, computer vision, bioinformatics, etc. In this paper the case of a symmetric matrix is considered and the symmetric nonnegative matrix factorization (SymNMF) is obtained by using a penalized nonsymmetric minimization problem. Instead of letting the penalizing parameter increase according to an a priori fixed rule, as suggested in literature, we propose a heuristic approach based on an adaptive technique. E"},"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":"1903.01321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-04T16:06:46Z","cross_cats_sorted":[],"title_canon_sha256":"4ddb0b37a2bf4a7f522b3891e3d2073ddc4dcfc9ec99b1fa298caf304377b80b","abstract_canon_sha256":"d5beb4eb9c52f07a7d6ccf4b39f55349f141a49b61c4db8b54e23c663096596e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:09.088217Z","signature_b64":"jVBHAgTJEA0MbBrsl6nA7xg0tCXDlZvQ1lF/3t+xT4nlLN5r4n0x6BvdRpAqDXNkaMhxVVAud10/INh0AwciDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","last_reissued_at":"2026-05-17T23:52:09.087755Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:09.087755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive computation of the Symmetric Nonnegative Matrix Factorization (NMF)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Francesco Romani, Grazia Lotti, Ornella Menchi, Paola Favati","submitted_at":"2019-03-04T16:06:46Z","abstract_excerpt":"Nonnegative Matrix Factorization (NMF), first proposed in 1994 for data analysis, has received successively much attention in a great variety of contexts such as data mining, text clustering, computer vision, bioinformatics, etc. In this paper the case of a symmetric matrix is considered and the symmetric nonnegative matrix factorization (SymNMF) is obtained by using a penalized nonsymmetric minimization problem. Instead of letting the penalizing parameter increase according to an a priori fixed rule, as suggested in literature, we propose a heuristic approach based on an adaptive technique. E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01321","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":"1903.01321","created_at":"2026-05-17T23:52:09.087823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01321v1","created_at":"2026-05-17T23:52:09.087823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01321","created_at":"2026-05-17T23:52:09.087823+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIJ45RPWR2YJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIJ45RPWR2YJC4T5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIJ45RPW","created_at":"2026-05-18T12:33:27.125529+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/RIJ45RPWR2YJC4T5IOOY3OYINP","json":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP.json","graph_json":"https://pith.science/api/pith-number/RIJ45RPWR2YJC4T5IOOY3OYINP/graph.json","events_json":"https://pith.science/api/pith-number/RIJ45RPWR2YJC4T5IOOY3OYINP/events.json","paper":"https://pith.science/paper/RIJ45RPW"},"agent_actions":{"view_html":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP","download_json":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP.json","view_paper":"https://pith.science/paper/RIJ45RPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01321&json=true","fetch_graph":"https://pith.science/api/pith-number/RIJ45RPWR2YJC4T5IOOY3OYINP/graph.json","fetch_events":"https://pith.science/api/pith-number/RIJ45RPWR2YJC4T5IOOY3OYINP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/action/storage_attestation","attest_author":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/action/author_attestation","sign_citation":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/action/citation_signature","submit_replication":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/action/replication_record"}},"created_at":"2026-05-17T23:52:09.087823+00:00","updated_at":"2026-05-17T23:52:09.087823+00:00"}