{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WCIWYJGLXKYBOXYOBYV273ZNRT","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":"39fad8ba74ed952ae46639bda242b6a301951060463fcfc56318423369dc41e7","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-08T20:30:38Z","title_canon_sha256":"4c4a9cb985195f1c25cafe2485c3ff399a83550a4fff024a18cddbbe2720c936"},"schema_version":"1.0","source":{"id":"1310.2273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2273","created_at":"2026-05-18T02:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2273v2","created_at":"2026-05-18T02:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2273","created_at":"2026-05-18T02:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"WCIWYJGLXKYB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WCIWYJGLXKYBOXYO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WCIWYJGL","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:00d0f15e806f8f4ba729072c22fe9fb4105a95c01c6de2126ca54f261f216622","target":"graph","created_at":"2026-05-18T02:19:50Z","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) 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","authors_text":"Nicolas Gillis, Stephen A. Vavasis","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-08T20:30:38Z","title":"Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2273","kind":"arxiv","version":2},"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:999b5a63c84d75e665ff31760ceb01dbb7d8b4714604cb66f82ed883e4e900a7","target":"record","created_at":"2026-05-18T02:19:50Z","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":"39fad8ba74ed952ae46639bda242b6a301951060463fcfc56318423369dc41e7","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-08T20:30:38Z","title_canon_sha256":"4c4a9cb985195f1c25cafe2485c3ff399a83550a4fff024a18cddbbe2720c936"},"schema_version":"1.0","source":{"id":"1310.2273","kind":"arxiv","version":2}},"canonical_sha256":"b0916c24cbbab0175f0e0e2bafef2d8cf801ea75ddec949fd86fb17434c8f3f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0916c24cbbab0175f0e0e2bafef2d8cf801ea75ddec949fd86fb17434c8f3f9","first_computed_at":"2026-05-18T02:19:50.840979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:50.840979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dSEuJzCdfK3bhLhaQhAtB8euYEbk641V4iG+OnVlPXaU2B/74RhMkj9Fyu4FxSw2TBk8+xSqLeg7pkT6dgeTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:50.841697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:999b5a63c84d75e665ff31760ceb01dbb7d8b4714604cb66f82ed883e4e900a7","sha256:00d0f15e806f8f4ba729072c22fe9fb4105a95c01c6de2126ca54f261f216622"],"state_sha256":"12f69fc8b227935de51f991910728251a568376284ab4293fd4833ab926019ef"}