{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YNCWNRUFRUA7LRG62MJKIPAWTL","short_pith_number":"pith:YNCWNRUF","schema_version":"1.0","canonical_sha256":"c34566c6858d01f5c4ded312a43c169ae51e4b4d3bde4043b1a8289f386938f2","source":{"kind":"arxiv","id":"1406.2504","version":3},"attestation_state":"computed","paper":{"title":"Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Xin, David Wipf","submitted_at":"2014-06-10T10:53:20Z","abstract_excerpt":"Many applications require recovering a matrix of minimal rank within an affine constraint set, with matrix completion a notable special case. Because the problem is NP-hard in general, it is common to replace the matrix rank with the nuclear norm, which acts as a convenient convex surrogate. While elegant theoretical conditions elucidate when this replacement is likely to be successful, they are highly restrictive and convex algorithms fail when the ambient rank is too high or when the constraint set is poorly structured. Non-convex alternatives fare somewhat better when carefully tuned; howev"},"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":"1406.2504","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-10T10:53:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dcf29da2edd7651bb2954588af8e6cb9cdce0fda7108ec1533565d15287ab989","abstract_canon_sha256":"86f88259a0be112ffa8877ef9b67ae81d584b3de83c9aa0b4d273dcc85363397"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:16.186928Z","signature_b64":"L9O12bYpYz46vR/7IbSikXO1M8/0TvUAc7y1P926+ik9YiDqlomGEFIjofmfVjEO2R3NHoWID6NxU0diPeN6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34566c6858d01f5c4ded312a43c169ae51e4b4d3bde4043b1a8289f386938f2","last_reissued_at":"2026-05-18T01:37:16.186226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:16.186226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Xin, David Wipf","submitted_at":"2014-06-10T10:53:20Z","abstract_excerpt":"Many applications require recovering a matrix of minimal rank within an affine constraint set, with matrix completion a notable special case. Because the problem is NP-hard in general, it is common to replace the matrix rank with the nuclear norm, which acts as a convenient convex surrogate. While elegant theoretical conditions elucidate when this replacement is likely to be successful, they are highly restrictive and convex algorithms fail when the ambient rank is too high or when the constraint set is poorly structured. Non-convex alternatives fare somewhat better when carefully tuned; howev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2504","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":"1406.2504","created_at":"2026-05-18T01:37:16.186348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2504v3","created_at":"2026-05-18T01:37:16.186348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2504","created_at":"2026-05-18T01:37:16.186348+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNCWNRUFRUA7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNCWNRUFRUA7LRG6","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNCWNRUF","created_at":"2026-05-18T12:28:57.508820+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/YNCWNRUFRUA7LRG62MJKIPAWTL","json":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL.json","graph_json":"https://pith.science/api/pith-number/YNCWNRUFRUA7LRG62MJKIPAWTL/graph.json","events_json":"https://pith.science/api/pith-number/YNCWNRUFRUA7LRG62MJKIPAWTL/events.json","paper":"https://pith.science/paper/YNCWNRUF"},"agent_actions":{"view_html":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL","download_json":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL.json","view_paper":"https://pith.science/paper/YNCWNRUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2504&json=true","fetch_graph":"https://pith.science/api/pith-number/YNCWNRUFRUA7LRG62MJKIPAWTL/graph.json","fetch_events":"https://pith.science/api/pith-number/YNCWNRUFRUA7LRG62MJKIPAWTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL/action/storage_attestation","attest_author":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL/action/author_attestation","sign_citation":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL/action/citation_signature","submit_replication":"https://pith.science/pith/YNCWNRUFRUA7LRG62MJKIPAWTL/action/replication_record"}},"created_at":"2026-05-18T01:37:16.186348+00:00","updated_at":"2026-05-18T01:37:16.186348+00:00"}