{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WSWQZOQBVMRZA3JEJV4WAQQZCI","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":"935db0cb58a6a950440811c4009cfd5408046581b1bc30ed1c181bf1f5200f0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-31T12:50:19Z","title_canon_sha256":"16efc7a98caa6cb525e300b8a840dbc9f601902013f3413289ca58a85af39e65"},"schema_version":"1.0","source":{"id":"2308.16690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.16690","created_at":"2026-07-05T08:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"2308.16690v2","created_at":"2026-07-05T08:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16690","created_at":"2026-07-05T08:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"WSWQZOQBVMRZ","created_at":"2026-07-05T08:20:50Z"},{"alias_kind":"pith_short_16","alias_value":"WSWQZOQBVMRZA3JE","created_at":"2026-07-05T08:20:50Z"},{"alias_kind":"pith_short_8","alias_value":"WSWQZOQB","created_at":"2026-07-05T08:20:50Z"}],"graph_snapshots":[{"event_id":"sha256:0897c8d2cbef6931a1a7c3e2067345e3732096d31edd3e327ebc15d31dff080c","target":"graph","created_at":"2026-07-05T08:20: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.16690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rank regularized minimization problem is an ideal model for the low-rank matrix completion/recovery problem. The matrix factorization approach can transform the high-dimensional rank regularized problem to a low-dimensional factorized column-sparse regularized problem. The latter can greatly facilitate fast computations in applicable algorithms, but needs to overcome the simultaneous non-convexity of the loss and regularization functions. In this paper, we consider the factorized column-sparse regularized model. Firstly, we optimize this model with bound constraints, and establish a certain eq","authors_text":"Kim-Chuan Toh, Wei Bian, Wenjing Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-31T12:50:19Z","title":"On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16690","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:dc5d4b0d51bd2e6b42665531343e9a5ef668fdbf8227154af792c95ab20a0d8b","target":"record","created_at":"2026-07-05T08:20: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":"935db0cb58a6a950440811c4009cfd5408046581b1bc30ed1c181bf1f5200f0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-31T12:50:19Z","title_canon_sha256":"16efc7a98caa6cb525e300b8a840dbc9f601902013f3413289ca58a85af39e65"},"schema_version":"1.0","source":{"id":"2308.16690","kind":"arxiv","version":2}},"canonical_sha256":"b4ad0cba01ab23906d244d7960421912215a0706964550435e075d2863945648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4ad0cba01ab23906d244d7960421912215a0706964550435e075d2863945648","first_computed_at":"2026-07-05T08:20:50.874866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:50.874866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TafEtEvD+6SKUO/J1bm3gP4VdhlAKPbaH2S7jpGWrr6G42bXl9OIzSC2Iz8pu0V/yKK5jhO5aAG+X3OWSc0FDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:50.875394Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.16690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5d4b0d51bd2e6b42665531343e9a5ef668fdbf8227154af792c95ab20a0d8b","sha256:0897c8d2cbef6931a1a7c3e2067345e3732096d31edd3e327ebc15d31dff080c"],"state_sha256":"ad64b7f1b719609ec99481bcaea42087d587dbd9826993fe8612f573913712eb"}