{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RIJ45RPWR2YJC4T5IOOY3OYINP","short_pith_number":"pith:RIJ45RPW","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"},"canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","source":{"kind":"arxiv","id":"1903.01321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01321","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01321v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01321","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"RIJ45RPWR2YJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIJ45RPWR2YJC4T5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIJ45RPW","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RIJ45RPWR2YJC4T5IOOY3OYINP","target":"record","payload":{"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"},"canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","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"},"source_kind":"arxiv","source_id":"1903.01321","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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zx1dmYWxZXPtLJCsemfJufo3EEy4uh5NIvVeSXw/yTNoi00bjISqe2Eg7XLIQWhxoebaabtqovVmZ1Kb3bKVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:32:38.959569Z"},"content_sha256":"33cbec7f3e9476c425453c64d930f772eec293ef9de50c2910b4cdd245e1785f","schema_version":"1.0","event_id":"sha256:33cbec7f3e9476c425453c64d930f772eec293ef9de50c2910b4cdd245e1785f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RIJ45RPWR2YJC4T5IOOY3OYINP","target":"graph","payload":{"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"},"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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ40WWOY+ipGZmSYs+SnRFtg0x6R/ROj4DkejgnRFSRsTGgiFdkyvplRJ4TgRfdqqcTMi9NCDPd3/X5wB6QLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:32:38.959934Z"},"content_sha256":"32c9aa1975481004df6d24acc2ef7f0da9fb2bdd70331e60d37a2ecbf9fb8695","schema_version":"1.0","event_id":"sha256:32c9aa1975481004df6d24acc2ef7f0da9fb2bdd70331e60d37a2ecbf9fb8695"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/bundle.json","state_url":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/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-26T04:32:38Z","links":{"resolver":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP","bundle":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/bundle.json","state":"https://pith.science/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIJ45RPWR2YJC4T5IOOY3OYINP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RIJ45RPWR2YJC4T5IOOY3OYINP","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":"d5beb4eb9c52f07a7d6ccf4b39f55349f141a49b61c4db8b54e23c663096596e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-04T16:06:46Z","title_canon_sha256":"4ddb0b37a2bf4a7f522b3891e3d2073ddc4dcfc9ec99b1fa298caf304377b80b"},"schema_version":"1.0","source":{"id":"1903.01321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01321","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01321v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01321","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"RIJ45RPWR2YJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIJ45RPWR2YJC4T5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIJ45RPW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:32c9aa1975481004df6d24acc2ef7f0da9fb2bdd70331e60d37a2ecbf9fb8695","target":"graph","created_at":"2026-05-17T23:52:09Z","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":"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","authors_text":"Francesco Romani, Grazia Lotti, Ornella Menchi, Paola Favati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-04T16:06:46Z","title":"Adaptive computation of the Symmetric Nonnegative Matrix Factorization (NMF)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01321","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:33cbec7f3e9476c425453c64d930f772eec293ef9de50c2910b4cdd245e1785f","target":"record","created_at":"2026-05-17T23:52:09Z","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":"d5beb4eb9c52f07a7d6ccf4b39f55349f141a49b61c4db8b54e23c663096596e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-04T16:06:46Z","title_canon_sha256":"4ddb0b37a2bf4a7f522b3891e3d2073ddc4dcfc9ec99b1fa298caf304377b80b"},"schema_version":"1.0","source":{"id":"1903.01321","kind":"arxiv","version":1}},"canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a13cec5f68eb091727d439d8dbb086bdbbb90dd89960587eb82aa0e5ff3c6fd","first_computed_at":"2026-05-17T23:52:09.087755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:09.087755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVBHAgTJEA0MbBrsl6nA7xg0tCXDlZvQ1lF/3t+xT4nlLN5r4n0x6BvdRpAqDXNkaMhxVVAud10/INh0AwciDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:09.088217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33cbec7f3e9476c425453c64d930f772eec293ef9de50c2910b4cdd245e1785f","sha256:32c9aa1975481004df6d24acc2ef7f0da9fb2bdd70331e60d37a2ecbf9fb8695"],"state_sha256":"2b2e3634751496dcf6b176e49381ac6f96984694926d158a9c20d53c92310848"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRqvObVSab34XyteiM0GLcS8uHx3naZueZinIOuM7uvK+82BB2b48E7uPdBTCS2FhZuHhvokntlcpTz5BdJmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:32:38.962187Z","bundle_sha256":"97201b6d67604bfd52508f75ef25da7a7d7ab849853a397159bd50928a25dc5d"}}