{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WCIWYJGLXKYBOXYOBYV273ZNRT","short_pith_number":"pith:WCIWYJGL","schema_version":"1.0","canonical_sha256":"b0916c24cbbab0175f0e0e2bafef2d8cf801ea75ddec949fd86fb17434c8f3f9","source":{"kind":"arxiv","id":"1310.2273","version":2},"attestation_state":"computed","paper":{"title":"Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Gillis, Stephen A. Vavasis","submitted_at":"2013-10-08T20:30:38Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing. This problem is referred to as near-separable NMF and requires that there exists a cone spanned by a small subset of the columns of the input nonnegative matrix approximately containing all columns. In this paper, we propose a preconditioning based on semidefinite programming making the input matrix well-conditioned. This in turn can improve significantly t"},"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":"1310.2273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-08T20:30:38Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"4c4a9cb985195f1c25cafe2485c3ff399a83550a4fff024a18cddbbe2720c936","abstract_canon_sha256":"39fad8ba74ed952ae46639bda242b6a301951060463fcfc56318423369dc41e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:50.841697Z","signature_b64":"dSEuJzCdfK3bhLhaQhAtB8euYEbk641V4iG+OnVlPXaU2B/74RhMkj9Fyu4FxSw2TBk8+xSqLeg7pkT6dgeTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0916c24cbbab0175f0e0e2bafef2d8cf801ea75ddec949fd86fb17434c8f3f9","last_reissued_at":"2026-05-18T02:19:50.840979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:50.840979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Gillis, Stephen A. Vavasis","submitted_at":"2013-10-08T20:30:38Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing. This problem is referred to as near-separable NMF and requires that there exists a cone spanned by a small subset of the columns of the input nonnegative matrix approximately containing all columns. In this paper, we propose a preconditioning based on semidefinite programming making the input matrix well-conditioned. This in turn can improve significantly t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2273","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":"1310.2273","created_at":"2026-05-18T02:19:50.841089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2273v2","created_at":"2026-05-18T02:19:50.841089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2273","created_at":"2026-05-18T02:19:50.841089+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCIWYJGLXKYB","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCIWYJGLXKYBOXYO","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCIWYJGL","created_at":"2026-05-18T12:28:04.890932+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/WCIWYJGLXKYBOXYOBYV273ZNRT","json":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT.json","graph_json":"https://pith.science/api/pith-number/WCIWYJGLXKYBOXYOBYV273ZNRT/graph.json","events_json":"https://pith.science/api/pith-number/WCIWYJGLXKYBOXYOBYV273ZNRT/events.json","paper":"https://pith.science/paper/WCIWYJGL"},"agent_actions":{"view_html":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT","download_json":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT.json","view_paper":"https://pith.science/paper/WCIWYJGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2273&json=true","fetch_graph":"https://pith.science/api/pith-number/WCIWYJGLXKYBOXYOBYV273ZNRT/graph.json","fetch_events":"https://pith.science/api/pith-number/WCIWYJGLXKYBOXYOBYV273ZNRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT/action/storage_attestation","attest_author":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT/action/author_attestation","sign_citation":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT/action/citation_signature","submit_replication":"https://pith.science/pith/WCIWYJGLXKYBOXYOBYV273ZNRT/action/replication_record"}},"created_at":"2026-05-18T02:19:50.841089+00:00","updated_at":"2026-05-18T02:19:50.841089+00:00"}