{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7ROSGWFX4ZFT7HNHWJBR5HXZDH","short_pith_number":"pith:7ROSGWFX","schema_version":"1.0","canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","source":{"kind":"arxiv","id":"1711.03638","version":2},"attestation_state":"computed","paper":{"title":"Provably Accurate Double-Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chinmay Hegde, Raymond K. W. Wong, Thanh V. Nguyen","submitted_at":"2017-11-09T23:06:15Z","abstract_excerpt":"Sparse coding is a crucial subroutine in algorithms for various signal processing, deep learning, and other machine learning applications. The central goal is to learn an overcomplete dictionary that can sparsely represent a given input dataset. However, a key challenge is that storage, transmission, and processing of the learned dictionary can be untenably high if the data dimension is high. In this paper, we consider the double-sparsity model introduced by Rubinstein et al. (2010b) where the dictionary itself is the product of a fixed, known basis and a data-adaptive sparse component. First,"},"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":"1711.03638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-09T23:06:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"87b279661b83f8c5459182d98a9147327b9ec6c0d50a0cc079465b5bf92f0dd9","abstract_canon_sha256":"01694b446305ae0cdc1fdf671504705cae81bd1d3d46276e9bdb7e15910df7a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.878509Z","signature_b64":"jRM719o+9rMkk8AWyeFhXi+Uc/ICG7PCOWy11nI2Z+7dix3ycvLgFgJzwdvLFQ37QPVWzIPQbXb/PVqOassSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","last_reissued_at":"2026-05-18T00:28:07.877831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.877831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Accurate Double-Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chinmay Hegde, Raymond K. W. Wong, Thanh V. Nguyen","submitted_at":"2017-11-09T23:06:15Z","abstract_excerpt":"Sparse coding is a crucial subroutine in algorithms for various signal processing, deep learning, and other machine learning applications. The central goal is to learn an overcomplete dictionary that can sparsely represent a given input dataset. However, a key challenge is that storage, transmission, and processing of the learned dictionary can be untenably high if the data dimension is high. In this paper, we consider the double-sparsity model introduced by Rubinstein et al. (2010b) where the dictionary itself is the product of a fixed, known basis and a data-adaptive sparse component. First,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03638","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":"1711.03638","created_at":"2026-05-18T00:28:07.877941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03638v2","created_at":"2026-05-18T00:28:07.877941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03638","created_at":"2026-05-18T00:28:07.877941+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ROSGWFX4ZFT","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ROSGWFX4ZFT7HNH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ROSGWFX","created_at":"2026-05-18T12:31:05.417338+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/7ROSGWFX4ZFT7HNHWJBR5HXZDH","json":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH.json","graph_json":"https://pith.science/api/pith-number/7ROSGWFX4ZFT7HNHWJBR5HXZDH/graph.json","events_json":"https://pith.science/api/pith-number/7ROSGWFX4ZFT7HNHWJBR5HXZDH/events.json","paper":"https://pith.science/paper/7ROSGWFX"},"agent_actions":{"view_html":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH","download_json":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH.json","view_paper":"https://pith.science/paper/7ROSGWFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03638&json=true","fetch_graph":"https://pith.science/api/pith-number/7ROSGWFX4ZFT7HNHWJBR5HXZDH/graph.json","fetch_events":"https://pith.science/api/pith-number/7ROSGWFX4ZFT7HNHWJBR5HXZDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/action/storage_attestation","attest_author":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/action/author_attestation","sign_citation":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/action/citation_signature","submit_replication":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/action/replication_record"}},"created_at":"2026-05-18T00:28:07.877941+00:00","updated_at":"2026-05-18T00:28:07.877941+00:00"}