{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F4M7FZCKUD2A65GIJY554W6ZWR","short_pith_number":"pith:F4M7FZCK","schema_version":"1.0","canonical_sha256":"2f19f2e44aa0f40f74c84e3bde5bd9b472cb67fdc0168b598c14e2115294af60","source":{"kind":"arxiv","id":"1507.01673","version":2},"attestation_state":"computed","paper":{"title":"SLRMA: Sparse Low-Rank Matrix Approximation for Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Junhui Hou, Lap-Pui Chau, Nadia Magnenat-Thalmann, Ying He","submitted_at":"2015-07-07T04:36:19Z","abstract_excerpt":"Low-rank matrix approximation (LRMA) is a powerful technique for signal processing and pattern analysis. However, its potential for data compression has not yet been fully investigated in the literature. In this paper, we propose sparse low-rank matrix approximation (SLRMA), an effective computational tool for data compression. SLRMA extends the conventional LRMA by exploring both the intra- and inter-coherence of data samples simultaneously. With the aid of prescribed orthogonal transforms (e.g., discrete cosine/wavelet transform and graph transform), SLRMA decomposes a matrix into a product "},"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":"1507.01673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2015-07-07T04:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"84a12704eb215ac44a6af0c4313e96c23648c7bbf820202ae1aee6ac74800226","abstract_canon_sha256":"f797151121e00b2ae5d3b4b441cf6471d8837d6ab6e53f1302e30416893a259f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:22.215367Z","signature_b64":"615oMs8MjRrqNHe9J9sDo8mnsDdFDfzS6WHf71sNb4d1UbE/syBfv0TxGYsjG6UxW5HH8u8n2jz1yO+AtQF9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f19f2e44aa0f40f74c84e3bde5bd9b472cb67fdc0168b598c14e2115294af60","last_reissued_at":"2026-05-18T01:20:22.214769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:22.214769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLRMA: Sparse Low-Rank Matrix Approximation for Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Junhui Hou, Lap-Pui Chau, Nadia Magnenat-Thalmann, Ying He","submitted_at":"2015-07-07T04:36:19Z","abstract_excerpt":"Low-rank matrix approximation (LRMA) is a powerful technique for signal processing and pattern analysis. However, its potential for data compression has not yet been fully investigated in the literature. In this paper, we propose sparse low-rank matrix approximation (SLRMA), an effective computational tool for data compression. SLRMA extends the conventional LRMA by exploring both the intra- and inter-coherence of data samples simultaneously. With the aid of prescribed orthogonal transforms (e.g., discrete cosine/wavelet transform and graph transform), SLRMA decomposes a matrix into a product "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01673","kind":"arxiv","version":2},"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":"1507.01673","created_at":"2026-05-18T01:20:22.214845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01673v2","created_at":"2026-05-18T01:20:22.214845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01673","created_at":"2026-05-18T01:20:22.214845+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4M7FZCKUD2A","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4M7FZCKUD2A65GI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4M7FZCK","created_at":"2026-05-18T12:29:19.899920+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/F4M7FZCKUD2A65GIJY554W6ZWR","json":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR.json","graph_json":"https://pith.science/api/pith-number/F4M7FZCKUD2A65GIJY554W6ZWR/graph.json","events_json":"https://pith.science/api/pith-number/F4M7FZCKUD2A65GIJY554W6ZWR/events.json","paper":"https://pith.science/paper/F4M7FZCK"},"agent_actions":{"view_html":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR","download_json":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR.json","view_paper":"https://pith.science/paper/F4M7FZCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01673&json=true","fetch_graph":"https://pith.science/api/pith-number/F4M7FZCKUD2A65GIJY554W6ZWR/graph.json","fetch_events":"https://pith.science/api/pith-number/F4M7FZCKUD2A65GIJY554W6ZWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR/action/storage_attestation","attest_author":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR/action/author_attestation","sign_citation":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR/action/citation_signature","submit_replication":"https://pith.science/pith/F4M7FZCKUD2A65GIJY554W6ZWR/action/replication_record"}},"created_at":"2026-05-18T01:20:22.214845+00:00","updated_at":"2026-05-18T01:20:22.214845+00:00"}