{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7RHSIHPWBPT5NH25RFBRTNIU7G","short_pith_number":"pith:7RHSIHPW","schema_version":"1.0","canonical_sha256":"fc4f241df60be7d69f5d894319b514f98f38b48a9154324785c2a1d0daaa2a0e","source":{"kind":"arxiv","id":"1103.1168","version":2},"attestation_state":"computed","paper":{"title":"An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Wotao Yin, Yangyang Xu, Yin Zhang, Zaiwen Wen","submitted_at":"2011-03-06T22:27:52Z","abstract_excerpt":"This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just us"},"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":"1103.1168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-06T22:27:52Z","cross_cats_sorted":["cs.NA","math.IT","math.NA"],"title_canon_sha256":"a6ab4c63f417669f3b26fac93a960c94021eeb83cad982b1c1afeb3bce3e565c","abstract_canon_sha256":"b039f8e60535ffa2557a6a5fadf4874d5e867edf9132841e356c73087e669979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:25.806706Z","signature_b64":"Wiren98MEKfgRC/4ZY4Nr1sLmhVX9MMsVH/TY6WMCyOYmU6PGTNGpYqFhBtIsqbLVAssVr1muSCklSzaHjwKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4f241df60be7d69f5d894319b514f98f38b48a9154324785c2a1d0daaa2a0e","last_reissued_at":"2026-05-18T01:26:25.806279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:25.806279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Wotao Yin, Yangyang Xu, Yin Zhang, Zaiwen Wen","submitted_at":"2011-03-06T22:27:52Z","abstract_excerpt":"This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1168","kind":"arxiv","version":2},"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":"1103.1168","created_at":"2026-05-18T01:26:25.806348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1168v2","created_at":"2026-05-18T01:26:25.806348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1168","created_at":"2026-05-18T01:26:25.806348+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RHSIHPWBPT5","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RHSIHPWBPT5NH25","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RHSIHPW","created_at":"2026-05-18T12:26:22.705136+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/7RHSIHPWBPT5NH25RFBRTNIU7G","json":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G.json","graph_json":"https://pith.science/api/pith-number/7RHSIHPWBPT5NH25RFBRTNIU7G/graph.json","events_json":"https://pith.science/api/pith-number/7RHSIHPWBPT5NH25RFBRTNIU7G/events.json","paper":"https://pith.science/paper/7RHSIHPW"},"agent_actions":{"view_html":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G","download_json":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G.json","view_paper":"https://pith.science/paper/7RHSIHPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1168&json=true","fetch_graph":"https://pith.science/api/pith-number/7RHSIHPWBPT5NH25RFBRTNIU7G/graph.json","fetch_events":"https://pith.science/api/pith-number/7RHSIHPWBPT5NH25RFBRTNIU7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G/action/storage_attestation","attest_author":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G/action/author_attestation","sign_citation":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G/action/citation_signature","submit_replication":"https://pith.science/pith/7RHSIHPWBPT5NH25RFBRTNIU7G/action/replication_record"}},"created_at":"2026-05-18T01:26:25.806348+00:00","updated_at":"2026-05-18T01:26:25.806348+00:00"}