{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TEEM7XSVYQQ2X2T2QWVMTNZ4XD","short_pith_number":"pith:TEEM7XSV","schema_version":"1.0","canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","source":{"kind":"arxiv","id":"1707.00573","version":3},"attestation_state":"computed","paper":{"title":"Generalized singular value thresholding operator to affine matrix rank minimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Junxiong Jia","submitted_at":"2017-07-03T14:38:23Z","abstract_excerpt":"It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to the combinational nature of the rank function. In this paper, a generalized singular value thresholding operator is generated to solve the affine matrix rank minimization problem. Numerical experiments show that our algorithm performs effectively in finding a low-rank matrix compared with some state-of-art methods."},"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":"1707.00573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","cross_cats_sorted":[],"title_canon_sha256":"48a12f69d912879db255137b0824f8b0d563cb6b6218109ce2e28382bfdf0a81","abstract_canon_sha256":"1ce3c160a299ff0860e08dd4cc5d82712731ff313a6e65334387a58b9e413069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:54.674335Z","signature_b64":"2TUHqDUlzw35hfbdNwlsbfQwOIp6H+LrtffdzezRGFG1wLxYEkk9h3NsuYDtQ+qS4GJ6tfRSsTlQNN0S8zXbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","last_reissued_at":"2026-05-18T00:17:54.673630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:54.673630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized singular value thresholding operator to affine matrix rank minimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Junxiong Jia","submitted_at":"2017-07-03T14:38:23Z","abstract_excerpt":"It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to the combinational nature of the rank function. In this paper, a generalized singular value thresholding operator is generated to solve the affine matrix rank minimization problem. Numerical experiments show that our algorithm performs effectively in finding a low-rank matrix compared with some state-of-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00573","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":"1707.00573","created_at":"2026-05-18T00:17:54.673728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00573v3","created_at":"2026-05-18T00:17:54.673728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00573","created_at":"2026-05-18T00:17:54.673728+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEEM7XSVYQQ2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEEM7XSVYQQ2X2T2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEEM7XSV","created_at":"2026-05-18T12:31:46.661854+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/TEEM7XSVYQQ2X2T2QWVMTNZ4XD","json":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD.json","graph_json":"https://pith.science/api/pith-number/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/graph.json","events_json":"https://pith.science/api/pith-number/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/events.json","paper":"https://pith.science/paper/TEEM7XSV"},"agent_actions":{"view_html":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD","download_json":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD.json","view_paper":"https://pith.science/paper/TEEM7XSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00573&json=true","fetch_graph":"https://pith.science/api/pith-number/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/graph.json","fetch_events":"https://pith.science/api/pith-number/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/action/storage_attestation","attest_author":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/action/author_attestation","sign_citation":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/action/citation_signature","submit_replication":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/action/replication_record"}},"created_at":"2026-05-18T00:17:54.673728+00:00","updated_at":"2026-05-18T00:17:54.673728+00:00"}