{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7ROSGWFX4ZFT7HNHWJBR5HXZDH","short_pith_number":"pith:7ROSGWFX","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"},"canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","source":{"kind":"arxiv","id":"1711.03638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03638","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03638v2","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03638","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"7ROSGWFX4ZFT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ROSGWFX4ZFT7HNH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ROSGWFX","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7ROSGWFX4ZFT7HNHWJBR5HXZDH","target":"record","payload":{"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"},"canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","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"},"source_kind":"arxiv","source_id":"1711.03638","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEqDq/vSt4ZuMPKOyXxmw+vxCBfTI37GC/pUITWCIe6HHwzdVkJgezsmYR0bWyq8ysLsh8hgbSwD7M2/LV/3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:12.055465Z"},"content_sha256":"2aeac2a57f503adc966ba6971f0f13c74b9ed33fc43a314d7e3e3ce60de994d8","schema_version":"1.0","event_id":"sha256:2aeac2a57f503adc966ba6971f0f13c74b9ed33fc43a314d7e3e3ce60de994d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7ROSGWFX4ZFT7HNHWJBR5HXZDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QH5uDnMTR6i1tVnG0TSe8ae1wROTmA9ogcKGF+IeQdCYKBn2Ddj3Q+KklYA+HrcfvkHgzLhUYbswfnu0EWXNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:12.055814Z"},"content_sha256":"835b4f63c2ea00c6313cf3159d90b625732ca6232818e5c20f98808840716a79","schema_version":"1.0","event_id":"sha256:835b4f63c2ea00c6313cf3159d90b625732ca6232818e5c20f98808840716a79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/bundle.json","state_url":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T14:06:12Z","links":{"resolver":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH","bundle":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/bundle.json","state":"https://pith.science/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ROSGWFX4ZFT7HNHWJBR5HXZDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7ROSGWFX4ZFT7HNHWJBR5HXZDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"01694b446305ae0cdc1fdf671504705cae81bd1d3d46276e9bdb7e15910df7a3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-09T23:06:15Z","title_canon_sha256":"87b279661b83f8c5459182d98a9147327b9ec6c0d50a0cc079465b5bf92f0dd9"},"schema_version":"1.0","source":{"id":"1711.03638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03638","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03638v2","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03638","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"7ROSGWFX4ZFT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ROSGWFX4ZFT7HNH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ROSGWFX","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:835b4f63c2ea00c6313cf3159d90b625732ca6232818e5c20f98808840716a79","target":"graph","created_at":"2026-05-18T00:28:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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,","authors_text":"Chinmay Hegde, Raymond K. W. Wong, Thanh V. Nguyen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-09T23:06:15Z","title":"Provably Accurate Double-Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03638","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2aeac2a57f503adc966ba6971f0f13c74b9ed33fc43a314d7e3e3ce60de994d8","target":"record","created_at":"2026-05-18T00:28:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"01694b446305ae0cdc1fdf671504705cae81bd1d3d46276e9bdb7e15910df7a3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-09T23:06:15Z","title_canon_sha256":"87b279661b83f8c5459182d98a9147327b9ec6c0d50a0cc079465b5bf92f0dd9"},"schema_version":"1.0","source":{"id":"1711.03638","kind":"arxiv","version":2}},"canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc5d2358b7e64b3f9da7b2431e9ef919f131ee18532a5fa930130bf08ff682e4","first_computed_at":"2026-05-18T00:28:07.877831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:07.877831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jRM719o+9rMkk8AWyeFhXi+Uc/ICG7PCOWy11nI2Z+7dix3ycvLgFgJzwdvLFQ37QPVWzIPQbXb/PVqOassSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:07.878509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aeac2a57f503adc966ba6971f0f13c74b9ed33fc43a314d7e3e3ce60de994d8","sha256:835b4f63c2ea00c6313cf3159d90b625732ca6232818e5c20f98808840716a79"],"state_sha256":"1c5e54e232ea3a8c35f0e7ff084fb7058b0f2376996f28ddb858f5e7ec73fd58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADhN8l1Kx0NXs6ge1jyUdAGw9ZV31XzXmJDFs/WhdXxTyHlB1OnwNm5x0Wss+PzML4dqVQ5aShrheARhtDDeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:06:12.057979Z","bundle_sha256":"86f525c6dede22de5065ae644cb43d367d8458573d1a182fce1de4eaeacacf20"}}