{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VNJ44R2BDOP3F2L5E65Z7G4CZS","short_pith_number":"pith:VNJ44R2B","schema_version":"1.0","canonical_sha256":"ab53ce47411b9fb2e97d27bb9f9b82cc8840c1b9f220cec2433651419baf5653","source":{"kind":"arxiv","id":"1508.04467","version":1},"attestation_state":"computed","paper":{"title":"Robust Subspace Clustering via Smoothed Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NA","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","submitted_at":"2015-08-18T21:54:03Z","abstract_excerpt":"Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some restricted and theoretically interesting conditions. However, for many real-world applications, nuclear norm approximation to the rank function can only produce a result far from the optimum. To seek a solution of higher accuracy than the nuclear norm, in this paper, we propose a rank approximation based on Logarithm-Determinant. We consider using this rank ap"},"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":"1508.04467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-18T21:54:03Z","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","math.IT","stat.ML"],"title_canon_sha256":"1e400f00986ab94b8f421154ec2f623bfdfaf270d71035f8dcc56f2aa84e16c0","abstract_canon_sha256":"e6d7ba66f0c55f5d7ebf2fd6a0704487edc1e7c92c4ad2e263ba1a83604814be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:02.717523Z","signature_b64":"CEAXLlkdpt/K4ZR5+Vsjt9kye222TctjArzlJM/WgqKyMyU9a5pwQr1uFN7vOldcRDKTKz8+zu890ai6FwY4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab53ce47411b9fb2e97d27bb9f9b82cc8840c1b9f220cec2433651419baf5653","last_reissued_at":"2026-05-18T01:35:02.717011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:02.717011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Subspace Clustering via Smoothed Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NA","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","submitted_at":"2015-08-18T21:54:03Z","abstract_excerpt":"Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some restricted and theoretically interesting conditions. However, for many real-world applications, nuclear norm approximation to the rank function can only produce a result far from the optimum. To seek a solution of higher accuracy than the nuclear norm, in this paper, we propose a rank approximation based on Logarithm-Determinant. We consider using this rank ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04467","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":"1508.04467","created_at":"2026-05-18T01:35:02.717088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04467v1","created_at":"2026-05-18T01:35:02.717088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04467","created_at":"2026-05-18T01:35:02.717088+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNJ44R2BDOP3","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNJ44R2BDOP3F2L5","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNJ44R2B","created_at":"2026-05-18T12:29:47.479230+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/VNJ44R2BDOP3F2L5E65Z7G4CZS","json":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS.json","graph_json":"https://pith.science/api/pith-number/VNJ44R2BDOP3F2L5E65Z7G4CZS/graph.json","events_json":"https://pith.science/api/pith-number/VNJ44R2BDOP3F2L5E65Z7G4CZS/events.json","paper":"https://pith.science/paper/VNJ44R2B"},"agent_actions":{"view_html":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS","download_json":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS.json","view_paper":"https://pith.science/paper/VNJ44R2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04467&json=true","fetch_graph":"https://pith.science/api/pith-number/VNJ44R2BDOP3F2L5E65Z7G4CZS/graph.json","fetch_events":"https://pith.science/api/pith-number/VNJ44R2BDOP3F2L5E65Z7G4CZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS/action/storage_attestation","attest_author":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS/action/author_attestation","sign_citation":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS/action/citation_signature","submit_replication":"https://pith.science/pith/VNJ44R2BDOP3F2L5E65Z7G4CZS/action/replication_record"}},"created_at":"2026-05-18T01:35:02.717088+00:00","updated_at":"2026-05-18T01:35:02.717088+00:00"}