{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A2KU7UOLYQBFC7QTPPAIP2HCRB","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":"ec721fd7af05e8af92eb9488f07031d14697f85f5b6a443b7c1018b894f2a824","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T08:26:16Z","title_canon_sha256":"e7ef9ebe34fb159ea8dbafa1670f405edf292d35f3cd0c156c3838c964371736"},"schema_version":"1.0","source":{"id":"1308.2293","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2293","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2293v3","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2293","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"A2KU7UOLYQBF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A2KU7UOLYQBFC7QT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A2KU7UOL","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:4497385c36bbc4f6ca20588d6c3b25c497a30e4f1d2229d6e8288527c712e99b","target":"graph","created_at":"2026-05-18T00:59:03Z","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":"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 ","authors_text":"Arash Amini, Christian Jutten, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T08:26:16Z","title":"Recovery of Low-Rank Matrices under Affine Constraints via a Smoothed Rank Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2293","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:80a06774dab42c0dd0395ee4b8485885bab1b4dfeb36bac95fe4e144ec9b2782","target":"record","created_at":"2026-05-18T00:59:03Z","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":"ec721fd7af05e8af92eb9488f07031d14697f85f5b6a443b7c1018b894f2a824","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T08:26:16Z","title_canon_sha256":"e7ef9ebe34fb159ea8dbafa1670f405edf292d35f3cd0c156c3838c964371736"},"schema_version":"1.0","source":{"id":"1308.2293","kind":"arxiv","version":3}},"canonical_sha256":"06954fd1cbc402517e137bc087e8e2886cf478c4124106dddb2cd30b94a6b7e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06954fd1cbc402517e137bc087e8e2886cf478c4124106dddb2cd30b94a6b7e7","first_computed_at":"2026-05-18T00:59:03.847389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.847389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APgCKnfc1Zo4Cdpg2nLaKl+qbMXnh4WxIJSROpOwHcFR5mnk7c/nLZBTS/M3HAycEAz88PontkX1mtmoeU4oBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.847879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2293","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80a06774dab42c0dd0395ee4b8485885bab1b4dfeb36bac95fe4e144ec9b2782","sha256:4497385c36bbc4f6ca20588d6c3b25c497a30e4f1d2229d6e8288527c712e99b"],"state_sha256":"1e0ecf0751c533b7018499863e18d88c43a9c0b5dae95c371f5e96c942287f8a"}