{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PRLTD3LQKA4K7XOOAUEOHWCOKJ","short_pith_number":"pith:PRLTD3LQ","schema_version":"1.0","canonical_sha256":"7c5731ed705038afddce0508e3d84e526375dd044420c825c65ed09f55feebe6","source":{"kind":"arxiv","id":"1010.0851","version":1},"attestation_state":"computed","paper":{"title":"Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Yun-Bin Zhao","submitted_at":"2010-10-05T12:05:17Z","abstract_excerpt":"Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In this paper, we aim at providing an approximation theory for the rank minimization problem, and prove that a rank minimization problem can be approximated to any level of accuracy via continuous optimization (especially, linear and nonlinear semidefinite programming) problems. One of the main results in this paper shows that if the feasible set of the problem ha"},"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":"1010.0851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-05T12:05:17Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"e6fd8ee3caa347a3c3f4445c2d860a51bb9abf2ce85b65789bd2fa6ea5bbedb1","abstract_canon_sha256":"ea3aeab54be33aa1412bd742f2a8e3370c5efb6fe06aa4cf4e2705f557dee7ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.763017Z","signature_b64":"F4g1P6ae2gVE1plxuEXm2ygc+R7QFGCYBp1Hf7iPW+kbg7gjalocO2GQ9xCVkVFNlNLhgMT9cJPkPgir+yx9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c5731ed705038afddce0508e3d84e526375dd044420c825c65ed09f55feebe6","last_reissued_at":"2026-05-18T04:39:50.762554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.762554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Yun-Bin Zhao","submitted_at":"2010-10-05T12:05:17Z","abstract_excerpt":"Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In this paper, we aim at providing an approximation theory for the rank minimization problem, and prove that a rank minimization problem can be approximated to any level of accuracy via continuous optimization (especially, linear and nonlinear semidefinite programming) problems. One of the main results in this paper shows that if the feasible set of the problem ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0851","kind":"arxiv","version":1},"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":"1010.0851","created_at":"2026-05-18T04:39:50.762627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0851v1","created_at":"2026-05-18T04:39:50.762627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0851","created_at":"2026-05-18T04:39:50.762627+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRLTD3LQKA4K","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRLTD3LQKA4K7XOO","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRLTD3LQ","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.24548","citing_title":"Deep ZakaiJ: Structured Filtering for Jump-Diffusion Time Series Forecasting","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ","json":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ.json","graph_json":"https://pith.science/api/pith-number/PRLTD3LQKA4K7XOOAUEOHWCOKJ/graph.json","events_json":"https://pith.science/api/pith-number/PRLTD3LQKA4K7XOOAUEOHWCOKJ/events.json","paper":"https://pith.science/paper/PRLTD3LQ"},"agent_actions":{"view_html":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ","download_json":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ.json","view_paper":"https://pith.science/paper/PRLTD3LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0851&json=true","fetch_graph":"https://pith.science/api/pith-number/PRLTD3LQKA4K7XOOAUEOHWCOKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PRLTD3LQKA4K7XOOAUEOHWCOKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ/action/storage_attestation","attest_author":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ/action/author_attestation","sign_citation":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ/action/citation_signature","submit_replication":"https://pith.science/pith/PRLTD3LQKA4K7XOOAUEOHWCOKJ/action/replication_record"}},"created_at":"2026-05-18T04:39:50.762627+00:00","updated_at":"2026-05-18T04:39:50.762627+00:00"}