{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LCZUHU3SUSW6FEU2MWEAGQLAM3","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":"8e57211be715a736cd8cf337e2138855669f5d63d266d1eef1ecb255546288dc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-06T15:46:08Z","title_canon_sha256":"e99a7f36a4421b3721c69602f9b822b62d4ba0c012cd1dcc2c775f8abc96f22b"},"schema_version":"1.0","source":{"id":"1606.01793","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01793","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01793v3","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01793","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"LCZUHU3SUSW6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LCZUHU3SUSW6FEU2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LCZUHU3S","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:5f1dfe0daa622e2b483784de60c95183bf518b45006f8aefb31e8537a29908ab","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"The problem of low-rank approximation with convex constraints, which appears in data analysis, system identification, model order reduction, low-order controller design and low-complexity modelling is considered. Given a matrix, the objective is to find a low-rank approximation that meets rank and convex constraints, while minimizing the distance to the matrix in the squared Frobenius norm. In many situations, this non-convex problem is convexified by nuclear norm regularization. However, we will see that the approximations obtained by this method may be far from optimal. In this paper, we pro","authors_text":"Anders Rantzer, Christian Grussler, Pontus Giselsson","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-06T15:46:08Z","title":"Low-rank Optimization with Convex Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01793","kind":"arxiv","version":3},"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:eeb43300ba84aea3c794f4beb9eb5a7580dde96a5640986e9c677d230238b7e0","target":"record","created_at":"2026-05-18T00:01:15Z","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":"8e57211be715a736cd8cf337e2138855669f5d63d266d1eef1ecb255546288dc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-06T15:46:08Z","title_canon_sha256":"e99a7f36a4421b3721c69602f9b822b62d4ba0c012cd1dcc2c775f8abc96f22b"},"schema_version":"1.0","source":{"id":"1606.01793","kind":"arxiv","version":3}},"canonical_sha256":"58b343d372a4ade2929a658803416066fdec8d0f75d71ed853e57b5b0d4635b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58b343d372a4ade2929a658803416066fdec8d0f75d71ed853e57b5b0d4635b1","first_computed_at":"2026-05-18T00:01:15.552907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.552907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nm1S3nvBQlT5gQDoVJRHczCgZVHhKlJkozp7XfP805Bt+0+TcrixbWmevLzYQxHz66M1EJfwW6WgBU6HTVxrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.553343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01793","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeb43300ba84aea3c794f4beb9eb5a7580dde96a5640986e9c677d230238b7e0","sha256:5f1dfe0daa622e2b483784de60c95183bf518b45006f8aefb31e8537a29908ab"],"state_sha256":"a1f87a8a8667964b7ea5c6e48a4ebe783df5191ccf20f95fb70cfb3f999c0b9a"}