{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3AUD4ICEAJD3UDZDP4HCN7IB55","short_pith_number":"pith:3AUD4ICE","schema_version":"1.0","canonical_sha256":"d8283e20440247ba0f237f0e26fd01ef7b68c89f185b5318d0ba1925fb8494e6","source":{"kind":"arxiv","id":"1606.01245","version":1},"attestation_state":"computed","paper":{"title":"Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.NA","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2016-06-04T03:28:41Z","abstract_excerpt":"The Schatten-p quasi-norm $(0<p<1)$ is usually used to replace the standard nuclear norm in order to approximate the rank function more accurately. However, existing Schatten-p quasi-norm minimization algorithms involve singular value decomposition (SVD) or eigenvalue decomposition (EVD) in each iteration, and thus may become very slow and impractical for large-scale problems. In this paper, we first define two tractable Schatten quasi-norms, i.e., the Frobenius/nuclear hybrid and bi-nuclear quasi-norms, and then prove that they are in essence the Schatten-2/3 and 1/2 quasi-norms, respectively"},"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":"1606.01245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-06-04T03:28:41Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"7feebb1d6d188187081e0d75efb562fab071bd9448801692cfbdec0043ffaf3d","abstract_canon_sha256":"af7c0b8c05ae1c4e413a341f50aa1ad6f8f42e3171899b038eff8dcc2a5f8302"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.495754Z","signature_b64":"nxvfPvEdnB59Bgmyl5+leCBUlkgVj79jgNO16ydX9rAa6WnqdwmV8nCLDd9Q/ZgCGUUDXyUgjSxeOmtrvOt+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8283e20440247ba0f237f0e26fd01ef7b68c89f185b5318d0ba1925fb8494e6","last_reissued_at":"2026-05-18T01:12:54.495409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.495409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.NA","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2016-06-04T03:28:41Z","abstract_excerpt":"The Schatten-p quasi-norm $(0<p<1)$ is usually used to replace the standard nuclear norm in order to approximate the rank function more accurately. However, existing Schatten-p quasi-norm minimization algorithms involve singular value decomposition (SVD) or eigenvalue decomposition (EVD) in each iteration, and thus may become very slow and impractical for large-scale problems. In this paper, we first define two tractable Schatten quasi-norms, i.e., the Frobenius/nuclear hybrid and bi-nuclear quasi-norms, and then prove that they are in essence the Schatten-2/3 and 1/2 quasi-norms, respectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01245","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":"1606.01245","created_at":"2026-05-18T01:12:54.495472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01245v1","created_at":"2026-05-18T01:12:54.495472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01245","created_at":"2026-05-18T01:12:54.495472+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AUD4ICEAJD3","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AUD4ICEAJD3UDZD","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AUD4ICE","created_at":"2026-05-18T12:29:55.572404+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/3AUD4ICEAJD3UDZDP4HCN7IB55","json":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55.json","graph_json":"https://pith.science/api/pith-number/3AUD4ICEAJD3UDZDP4HCN7IB55/graph.json","events_json":"https://pith.science/api/pith-number/3AUD4ICEAJD3UDZDP4HCN7IB55/events.json","paper":"https://pith.science/paper/3AUD4ICE"},"agent_actions":{"view_html":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55","download_json":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55.json","view_paper":"https://pith.science/paper/3AUD4ICE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01245&json=true","fetch_graph":"https://pith.science/api/pith-number/3AUD4ICEAJD3UDZDP4HCN7IB55/graph.json","fetch_events":"https://pith.science/api/pith-number/3AUD4ICEAJD3UDZDP4HCN7IB55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55/action/storage_attestation","attest_author":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55/action/author_attestation","sign_citation":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55/action/citation_signature","submit_replication":"https://pith.science/pith/3AUD4ICEAJD3UDZDP4HCN7IB55/action/replication_record"}},"created_at":"2026-05-18T01:12:54.495472+00:00","updated_at":"2026-05-18T01:12:54.495472+00:00"}