{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H2Q5CUFAS2CCLE52ZILVSLROFJ","short_pith_number":"pith:H2Q5CUFA","schema_version":"1.0","canonical_sha256":"3ea1d150a096842593baca17592e2e2a4fb8f4d8964261c5fd83f3e9d57340c8","source":{"kind":"arxiv","id":"1803.00420","version":1},"attestation_state":"computed","paper":{"title":"Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2018-02-28T03:29:33Z","abstract_excerpt":"The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the trace norm and its bilinear spectral penalty, we define two tractable Schatten norms, i.e.\\ the bi-trace and tri-trace norms, and prove that they are in essence the Schatten-$1/2$ and $1/3$ quasi-norms, respectively. By applying the two defined Schatten quasi-norms to various rank minimization problems such as MC and RPCA, we only need to solve much smaller fac"},"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":"1803.00420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-28T03:29:33Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"9009c9114a47ee23a0f804ab55b4a4265d5080ae28c8cd8f8d3611bd5c361c3e","abstract_canon_sha256":"7711741d8ea294ba77061aeb7b158dffd7efadfcd5e89d519122d17b3a79db0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.211192Z","signature_b64":"BTFvAfoYzNtp4TqTJG0ZTrghJtycm6qdVFOFqGMGRY1zJ2aXBpGklQuPIT5+X3w2xu1ZJCascDHs8ok06oV4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea1d150a096842593baca17592e2e2a4fb8f4d8964261c5fd83f3e9d57340c8","last_reissued_at":"2026-05-18T00:22:12.210522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.210522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2018-02-28T03:29:33Z","abstract_excerpt":"The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the trace norm and its bilinear spectral penalty, we define two tractable Schatten norms, i.e.\\ the bi-trace and tri-trace norms, and prove that they are in essence the Schatten-$1/2$ and $1/3$ quasi-norms, respectively. By applying the two defined Schatten quasi-norms to various rank minimization problems such as MC and RPCA, we only need to solve much smaller fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00420","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":"1803.00420","created_at":"2026-05-18T00:22:12.210616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00420v1","created_at":"2026-05-18T00:22:12.210616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00420","created_at":"2026-05-18T00:22:12.210616+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2Q5CUFAS2CC","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2Q5CUFAS2CCLE52","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2Q5CUFA","created_at":"2026-05-18T12:32:28.185984+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/H2Q5CUFAS2CCLE52ZILVSLROFJ","json":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ.json","graph_json":"https://pith.science/api/pith-number/H2Q5CUFAS2CCLE52ZILVSLROFJ/graph.json","events_json":"https://pith.science/api/pith-number/H2Q5CUFAS2CCLE52ZILVSLROFJ/events.json","paper":"https://pith.science/paper/H2Q5CUFA"},"agent_actions":{"view_html":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ","download_json":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ.json","view_paper":"https://pith.science/paper/H2Q5CUFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00420&json=true","fetch_graph":"https://pith.science/api/pith-number/H2Q5CUFAS2CCLE52ZILVSLROFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/H2Q5CUFAS2CCLE52ZILVSLROFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ/action/storage_attestation","attest_author":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ/action/author_attestation","sign_citation":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ/action/citation_signature","submit_replication":"https://pith.science/pith/H2Q5CUFAS2CCLE52ZILVSLROFJ/action/replication_record"}},"created_at":"2026-05-18T00:22:12.210616+00:00","updated_at":"2026-05-18T00:22:12.210616+00:00"}