{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A2KU7UOLYQBFC7QTPPAIP2HCRB","short_pith_number":"pith:A2KU7UOL","schema_version":"1.0","canonical_sha256":"06954fd1cbc402517e137bc087e8e2886cf478c4124106dddb2cd30b94a6b7e7","source":{"kind":"arxiv","id":"1308.2293","version":3},"attestation_state":"computed","paper":{"title":"Recovery of Low-Rank Matrices under Affine Constraints via a Smoothed Rank Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Amini, Christian Jutten, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","submitted_at":"2013-08-10T08:26:16Z","abstract_excerpt":"In this paper, the problem of matrix rank minimization under affine constraints is addressed. The state-of-the-art algorithms can recover matrices with a rank much less than what is sufficient for the uniqueness of the solution of this optimization problem. We propose an algorithm based on a smooth approximation of the rank function, which practically improves recovery limits on the rank of the solution. This approximation leads to a non-convex program; thus, to avoid getting trapped in local solutions, we use the following scheme. Initially, a rough approximation of the rank function subject "},"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":"1308.2293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T08:26:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7ef9ebe34fb159ea8dbafa1670f405edf292d35f3cd0c156c3838c964371736","abstract_canon_sha256":"ec721fd7af05e8af92eb9488f07031d14697f85f5b6a443b7c1018b894f2a824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.847879Z","signature_b64":"APgCKnfc1Zo4Cdpg2nLaKl+qbMXnh4WxIJSROpOwHcFR5mnk7c/nLZBTS/M3HAycEAz88PontkX1mtmoeU4oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06954fd1cbc402517e137bc087e8e2886cf478c4124106dddb2cd30b94a6b7e7","last_reissued_at":"2026-05-18T00:59:03.847389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.847389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery of Low-Rank Matrices under Affine Constraints via a Smoothed Rank Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Amini, Christian Jutten, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","submitted_at":"2013-08-10T08:26:16Z","abstract_excerpt":"In this paper, the problem of matrix rank minimization under affine constraints is addressed. The state-of-the-art algorithms can recover matrices with a rank much less than what is sufficient for the uniqueness of the solution of this optimization problem. We propose an algorithm based on a smooth approximation of the rank function, which practically improves recovery limits on the rank of the solution. This approximation leads to a non-convex program; thus, to avoid getting trapped in local solutions, we use the following scheme. Initially, a rough approximation of the rank function subject "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2293","kind":"arxiv","version":3},"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":"1308.2293","created_at":"2026-05-18T00:59:03.847456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2293v3","created_at":"2026-05-18T00:59:03.847456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2293","created_at":"2026-05-18T00:59:03.847456+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2KU7UOLYQBF","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2KU7UOLYQBFC7QT","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2KU7UOL","created_at":"2026-05-18T12:27:38.830355+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/A2KU7UOLYQBFC7QTPPAIP2HCRB","json":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB.json","graph_json":"https://pith.science/api/pith-number/A2KU7UOLYQBFC7QTPPAIP2HCRB/graph.json","events_json":"https://pith.science/api/pith-number/A2KU7UOLYQBFC7QTPPAIP2HCRB/events.json","paper":"https://pith.science/paper/A2KU7UOL"},"agent_actions":{"view_html":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB","download_json":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB.json","view_paper":"https://pith.science/paper/A2KU7UOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2293&json=true","fetch_graph":"https://pith.science/api/pith-number/A2KU7UOLYQBFC7QTPPAIP2HCRB/graph.json","fetch_events":"https://pith.science/api/pith-number/A2KU7UOLYQBFC7QTPPAIP2HCRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB/action/storage_attestation","attest_author":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB/action/author_attestation","sign_citation":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB/action/citation_signature","submit_replication":"https://pith.science/pith/A2KU7UOLYQBFC7QTPPAIP2HCRB/action/replication_record"}},"created_at":"2026-05-18T00:59:03.847456+00:00","updated_at":"2026-05-18T00:59:03.847456+00:00"}