{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WSWQZOQBVMRZA3JEJV4WAQQZCI","short_pith_number":"pith:WSWQZOQB","schema_version":"1.0","canonical_sha256":"b4ad0cba01ab23906d244d7960421912215a0706964550435e075d2863945648","source":{"kind":"arxiv","id":"2308.16690","version":2},"attestation_state":"computed","paper":{"title":"On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Wei Bian, Wenjing Li","submitted_at":"2023-08-31T12:50:19Z","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"},"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":"2308.16690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-31T12:50:19Z","cross_cats_sorted":[],"title_canon_sha256":"16efc7a98caa6cb525e300b8a840dbc9f601902013f3413289ca58a85af39e65","abstract_canon_sha256":"935db0cb58a6a950440811c4009cfd5408046581b1bc30ed1c181bf1f5200f0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:50.875394Z","signature_b64":"TafEtEvD+6SKUO/J1bm3gP4VdhlAKPbaH2S7jpGWrr6G42bXl9OIzSC2Iz8pu0V/yKK5jhO5aAG+X3OWSc0FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ad0cba01ab23906d244d7960421912215a0706964550435e075d2863945648","last_reissued_at":"2026-07-05T08:20:50.874866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:50.874866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Wei Bian, Wenjing Li","submitted_at":"2023-08-31T12:50:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16690","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.16690/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.16690","created_at":"2026-07-05T08:20:50.874938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16690v2","created_at":"2026-07-05T08:20:50.874938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16690","created_at":"2026-07-05T08:20:50.874938+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSWQZOQBVMRZ","created_at":"2026-07-05T08:20:50.874938+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSWQZOQBVMRZA3JE","created_at":"2026-07-05T08:20:50.874938+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSWQZOQB","created_at":"2026-07-05T08:20:50.874938+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/WSWQZOQBVMRZA3JEJV4WAQQZCI","json":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI.json","graph_json":"https://pith.science/api/pith-number/WSWQZOQBVMRZA3JEJV4WAQQZCI/graph.json","events_json":"https://pith.science/api/pith-number/WSWQZOQBVMRZA3JEJV4WAQQZCI/events.json","paper":"https://pith.science/paper/WSWQZOQB"},"agent_actions":{"view_html":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI","download_json":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI.json","view_paper":"https://pith.science/paper/WSWQZOQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16690&json=true","fetch_graph":"https://pith.science/api/pith-number/WSWQZOQBVMRZA3JEJV4WAQQZCI/graph.json","fetch_events":"https://pith.science/api/pith-number/WSWQZOQBVMRZA3JEJV4WAQQZCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI/action/storage_attestation","attest_author":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI/action/author_attestation","sign_citation":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI/action/citation_signature","submit_replication":"https://pith.science/pith/WSWQZOQBVMRZA3JEJV4WAQQZCI/action/replication_record"}},"created_at":"2026-07-05T08:20:50.874938+00:00","updated_at":"2026-07-05T08:20:50.874938+00:00"}